Quantum error correction below the surface code threshold
read the original abstract
Quantum error correction provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit, where the logical error rate is suppressed exponentially as more qubits are added. However, this exponential suppression only occurs if the physical error rate is below a critical threshold. In this work, we present two surface code memories operating below this threshold: a distance-7 code and a distance-5 code integrated with a real-time decoder. The logical error rate of our larger quantum memory is suppressed by a factor of $\Lambda$ = 2.14 $\pm$ 0.02 when increasing the code distance by two, culminating in a 101-qubit distance-7 code with 0.143% $\pm$ 0.003% error per cycle of error correction. This logical memory is also beyond break-even, exceeding its best physical qubit's lifetime by a factor of 2.4 $\pm$ 0.3. We maintain below-threshold performance when decoding in real time, achieving an average decoder latency of 63 $\mu$s at distance-5 up to a million cycles, with a cycle time of 1.1 $\mu$s. To probe the limits of our error-correction performance, we run repetition codes up to distance-29 and find that logical performance is limited by rare correlated error events occurring approximately once every hour, or 3 $\times$ 10$^9$ cycles. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms.
This paper has not been read by Pith yet.
Forward citations
Cited by 25 Pith papers
-
Proof of a finite threshold for the union-find decoder
Union-find decoder for surface code achieves finite threshold under circuit-level stochastic errors with quasi-polylog parallel runtime bound.
-
Sdim: A Qudit Stabilizer Simulator
Sdim is the first open-source qudit stabilizer simulator supporting all dimensions, enabling circuit evaluation and sampling for qudit fault-tolerant quantum computing research.
-
The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes
Pinnacle Architecture using QLDPC codes reduces physical qubits needed to factor RSA-2048 to under 100,000 at 10^{-3} error rate.
-
State preparation with parallel-sequential circuits
Parallel-sequential circuits provide a tunable family of quantum circuit layouts that numerically outperform brickwall, sequential, and log-depth circuits for 1D ground-state preparation under realistic noise models.
-
Wire Codes
Wire codes are a construction that converts any stabilizer code into a local weight-3 subsystem code on an arbitrary graph via low-density Tanner-graph embedding, with overhead governed by the embedding quality.
-
Demonstration of logical qubits and repeated error correction with better-than-physical error rates
Logical error rates in [[7,1,3]] and [[12,2,4]] codes are suppressed 9.8-800 times below physical rates on trapped-ion hardware, with repeated correction cycles approaching the error rate of two physical CNOTs.
-
Measurement-Free Toric-Code Memory in Array Globally Controlled Rydberg Array
Proposes a measurement-free toric-code memory protocol in three-species globally controlled Rydberg arrays, with 4x4 simulations showing extended logical lifetime below pseudo-threshold p* ≈ 0.034.
-
Algebra of Bivariate-Bicycle Surface Codes
BBS code dimension equals the algebraic multiplicity of finite nonzero common roots of the defining bivariate polynomials, enabling a root-based prescription for arbitrary boundary shapes that avoids corner correction...
-
Equivalence Checking of Quantum Circuits via Path-Sum and Weighted Model Counting
A hybrid path-sum reduction plus weighted model counting method yields a complete equivalence checker for quantum circuits up to global phase.
-
Relativistic Path-Integral Origin of the Dirac Equation, Quantum Collapse, Decoherence and Non-Hermitian Phenomena
A relativistic path integral yields the Dirac equation and, via noise-activated stochastic dynamics, derives quantum collapse, decoherence, and non-Hermitian effects as consequences rather than postulates.
-
Magic State Injection on IBM Quantum Processors Above the Distillation Threshold
Experimental demonstration of logical |H_L> and |T_L> magic states with fidelities 0.8806 and 0.8665 on IBM superconducting hardware using a qubit-efficient surface code embedding, with reported error thresholds above...
-
Synchronizable hybrid subsystem codes
Synchronizable hybrid subsystem codes are built from classical cyclic codes C and D with C^perp subset C subset D via CSS construction to correct Pauli and synchronization errors, tolerate gauge errors, and carry both...
-
Feasibility of performing quantum chemistry calculations on quantum computers
New criteria reveal VQE needs fault-tolerant quantum computers due to decoherence and QPE has exponentially suppressed success probability from orthogonality catastrophe in classical input states.
-
Performance Limits of Fault-Tolerant Quantum Error Correction Schemes
Derives bounds on failure probability for Shor-style FT-QEC schemes incorporating realistic gate and measurement errors using limited structural information.
-
Block Permutation Routing on Ramanujan Hypergraphs for Fault-Tolerant Quantum Computing
Block permutation routing number on Ramanujan hypergraphs for surface code patches is Theta(d_C log N_L), with spectral analysis preserving key connectivity properties.
-
Block Permutation Routing on Ramanujan Hypergraphs for Fault-Tolerant Quantum Computing
Block routing number on Ramanujan hypergraphs for surface code patches is Θ(d_C log N_L), with spectral analysis and integration into error correction protocols.
-
Direct entanglement ansatz learning (DEAL) with ZNE on error-prone superconducting qubits
DEAL boosts success rates in quantum combinatorial optimization by up to 14% over QAOA on superconducting qubits via direct parameter-to-angle mapping, entanglement ansatz, and ZNE.
-
Soft information decoding with superconducting qubits
Soft decoding with analog measurement data raises repetition-code thresholds by 25% and reduces error rates up to 30x on superconducting qubits, with one byte per shot sufficient for near-optimal performance.
-
Quantum memory based on concatenating surface codes and quantum Hamming codes
Concatenating surface codes with quantum Hamming codes achieves high error thresholds up to the surface code limit and suppresses logical errors more effectively than surface codes with comparable overhead for interme...
-
Managing Classical Processing Requirements for Quantum Error Correction
A two-level decoder scheduling framework reduces classical processing requirements for quantum error correction by 10-40% on fault-tolerant benchmarks by managing bursty workloads as shared resources.
-
An Analysis of Speculative Window Decoders for Quantum Error Correction
Speculative decoding for QEC reduces waiting time for prior windows but yields gains only under high speculation accuracy and low decoder latency; non-speculative decoders outperform under other conditions across gate...
-
Benchmarking a machine-learning differential equations solver on a neutral-atom logical processor
Logical quantum kernels outperform physical ones when solving differential equations on a neutral-atom processor, with gains traced to noise error detection in the logical encoding.
-
Mind the gaps: The fraught road to quantum advantage
The authors identify four transitions needed to reach fault-tolerant application-scale quantum computing from current NISQ devices.
-
Mind the gaps: The fraught road to quantum advantage
The paper identifies four key hurdles in the transition from NISQ to FASQ quantum computers and argues that targeting them will accelerate progress toward useful quantum advantage.
-
Quantum simulation of out-of-equilibrium dynamics in gauge theories
The paper reviews advances in quantum simulation of out-of-equilibrium dynamics in gauge theories, covering particle production, string breaking, thermalization, and related phenomena.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.