Published May 28, 2025 | Version Published
Journal Article Open

Fault-Tolerant Compiling of Classically Hard Instantaneous Quantum Polynomial Circuits on Hypercubes

  • 1. ROR icon Joint Center for Quantum Information and Computer Science
  • 2. ROR icon Harvard University
  • 3. ROR icon University of Colorado Boulder
  • 4. ROR icon California Institute of Technology

Abstract

Realizing computationally complex quantum circuits in the presence of noise and imperfections is a challenging task. While fault-tolerant quantum computing provides a route to reducing noise, it requires a large overhead for generic algorithms. Here, we develop and analyze a hardware-efficient, fault-tolerant approach to realizing complex sampling circuits. We co-design the circuits with the appropriate quantum error-correcting codes for efficient implementation in a reconfigurable neutral atom-array architecture, constituting what we call a of the sampling algorithm. Specifically, we consider a family of ⟦2D,D,2⟧ quantum error-detecting codes whose transversal and permutation gate set can realize arbitrary degree-D instantaneous quantum polynomial (IQP) circuits. Using native operations of the code and the atom-array hardware, we compile a fault-tolerant and fast-scrambling family of such IQP circuits in a hypercube geometry, realized recently in the experiments by Bluvstein [Nature 626, 7997 (2024)]. We develop a theory of second-moment properties of degree-D IQP circuits for analyzing hardness and verification of random sampling by mapping to a statistical mechanics model. We provide strong evidence that sampling from these hypercube IQP circuits is classically hard to simulate even at relatively low depths. We analyze the linear cross-entropy benchmark (XEB) in comparison to the average fidelity and, depending on the local noise rate, find two different asymptotic regimes. To realize a fully scalable approach, we first show that Bell sampling from degree-4 IQP circuits is classically intractable and can be efficiently validated. We further devise new families of ⟦O(dD),D,d⟧ color codes of increasing distance d, permitting exponential error suppression for transversal IQP sampling. Our results highlight fault-tolerant compiling as a powerful tool in co-designing algorithms with specific error-correcting codes and realistic hardware.

Copyright and License

Published by the American Physical Society under the terms of the Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article’s title, journal citation, and DOI.

Acknowledgement

We thank Abhinav Deshpande, Bill Fefferman, Daniel Grier, Jinguo Liu, Brayden Ware, Sepehr Ebadi, Simon Evered, Alexandra Geim, Sophie Li, Tom Manovitz, and Hengyun Zhou for helpful discussions. D.H. gratefully acknowledges the hospitality of the Simons Institute for the Theory of Computing during Summer 2023 and Spring 2024 supported by DOE QSA Grant No. FP00010905, where part of this work was conducted. D.H. acknowledges funding from the US DoD through a QuICS Hartree fellowship. This research was supported in part by NSF QLCI Grant No. OMA-2120757. We acknowledge financial support from IARPA and the Army Research Office, under the Entangled Logical Qubits program (Cooperative Agreement No. W911NF-23-2-0219), the DARPA ONISQ program (Grant No. W911NF2010021), the DARPA IMPAQT program (Grant No. HR0011-23-3-0012), the Center for Ultracold Atoms (a NSF Physics Frontiers Center, PHY-1734011), the National Science Foundation (Grants No. PHY-2012023 and No. CCF-2313084), the Army Research Office MURI (Grant No. W911NF-20-1-0082), and QuEra Computing. X.G. acknowledges support from U.S. Department of Energy, Office of Science, National Quantum Information Science Research Centers, Quantum Systems Accelerator, NSF PFC Grant No. PHYS 2317149 and start-up grants from CU Boulder.

Data Availability

The raw data and software required to reproduce Figs. 4–8,10, and 13, are available in Ref. [138].

Files

PRXQuantum.6.020338.pdf

Files (2.2 MB)

Name Size Download all
md5:a2e225cb05b22acb2835e5f68dc3a811
2.2 MB Preview Download

Additional details

Additional titles

Alternative title
Fault-tolerant compiling of classically hard IQP circuits on hypercubes

Related works

Is new version of
Discussion Paper: arXiv:2404.19005 (arXiv)
Is supplemented by
Dataset: 10.5281/zenodo.15257899 (DOI)

Funding

United States Department of Energy
FP00010905
United States Department of Defense
QuICS Hartree Fellowship -
National Science Foundation
OMA-2120757
United States Army Research Office
W911NF-23-2-0219
Defense Advanced Research Projects Agency
W911NF2010021
Defense Advanced Research Projects Agency
HR0011-23-3-0012
National Science Foundation
PHY-1734011
National Science Foundation
PHY-2012023
National Science Foundation
CCF-2313084
United States Army Research Office
W911NF-20-1-0082
National Quantum Information Science Research Centers
Quantum Systems Accelerator
National Science Foundation
PHYS-2317149
University of Colorado Boulder

Dates

Accepted
2025-03-31

Caltech Custom Metadata

Caltech groups
AWS Center for Quantum Computing, Division of Physics, Mathematics and Astronomy (PMA)
Publication Status
Published