Improved decoding of circuit noise and fragile boundaries of tailored surface codes

Abstract

Realizing the full potential of quantum computation requires quantum error correction (QEC), with most recent breakthrough demonstrations of QEC using the surface code. QEC codes use multiple noisy physical qubits to encode information in fewer logical qubits, enabling the identification of errors through a decoding process. This process increases the logical fidelity (or accuracy) making the computation more reliable. However, most fast (efficient runtime) decoders neglect important noise characteristics, thereby reducing their accuracy. In this work, we introduce decoders that are both fast and accurate, and can be used with a wide class of QEC codes including the surface code. Our decoders, named belief-matching and belief-find, exploit all noise information and thereby unlock higher accuracy demonstrations of QEC. Using the surface code threshold as a performance metric, we observe a threshold at 0.94\% error probability for our decoders, outperforming the 0.82\% threshold for a standard minimum-weight perfect matching decoder. We also tested our belief-matching decoders in a theoretical case study of codes tailored to a biased noise model. We find that the decoders led to a much higher threshold and lower qubit overhead in the tailored surface code with respect to the standard, square surface code. Surprisingly, in the well-below threshold regime, the rectangular surface code becomes more resource-efficient than the tailored surface code, due to a previously unnoticed phenomenon that we call "fragile boundaries". Our decoders outperform all other fast decoders in terms of threshold and accuracy, enabling better results in current quantum error correction experiments and opening up new areas for theoretical case studies.

20 pages, 19 figures

References in corpus (8)

• Suppressing quantum errors by scaling a surface code logical qubit
• Realizing Repeated Quantum Error Correction in a Distance-Three Surface Code
• Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
• Fault-tolerant quantum computation against biased noise
• Dynamically Generated Logical Qubits
• Fault-Tolerant Weighted Union-Find Decoding on the Toric Code
• Bias-tailored quantum LDPC codes
• Tailored XZZX codes for biased noise

Cited by in corpus (42)

• Sparse Blossom: correcting a million errors per core second with minimum-weight matching
• Learning to Decode the Surface Code with a Recurrent, Transformer-Based Neural Network
• Erasure qubits: Overcoming the $T_1$ limit in superconducting circuits
• Decoding algorithms for surface codes
• Constructions and performance of hyperbolic and semi-hyperbolic Floquet codes
• Creating entangled logical qubits in the heavy-hex lattice with topological codes
• Performance enhancement of surface codes via recursive MWPM decoding
• Optimized measurement-free and fault-tolerant quantum error correction for neutral atoms
• Error-corrected Hadamard gate simulated at the circuit level
• Data-driven decoding of quantum error correcting codes using graph neural networks
• Error correction of transversal CNOT gates for scalable surface code computation
• Neural network decoder for near-term surface-code experiments
• Fault-tolerant quantum architectures based on erasure qubits
• Actis: A Strictly Local Union-Find Decoder
• Scalable noise characterization of syndrome-extraction circuits with averaged circuit eigenvalue sampling
• Analog information decoding of bosonic quantum LDPC codes
• Optimization of decoder priors for accurate quantum error correction
• Designing fault-tolerant circuits using detector error models
• Linear-optical quantum computation with arbitrary error-correcting codes
• Improved Belief Propagation Decoding Algorithms for Surface Codes
• Low-overhead magic state distillation with color codes
• Resource Analysis of Low-Overhead Transversal Architectures for Reconfigurable Atom Arrays
• Spanning Tree Matching Decoder for Quantum Surface Codes
• Surface Code with Imperfect Erasure Checks
• Fault-Tolerant Stabilizer Measurements in Surface Codes with Three-Qubit Gates
• Low-overhead quantum error correction codes with a cyclic topology
• Quantum codes for asymmetric channels: ZZZY surface codes
• Progressive-Proximity Bit-Flipping for Decoding Surface Codes
• Qudit vs. Qubit: Simulated performance of error correction codes in higher dimensions
• Exact results on finite size corrections for surface codes tailored to biased noise
• Magic Mirror on the Wall, How to Benchmark Quantum Error Correction Codes, Overall ?
• Generalizing the matching decoder for the Chamon code
• Mitigating Temporal Fragility in the XY Surface Code
• Optimal number of stabilizer measurement rounds in an idling surface code patch
• Taming Rydberg Decay with Measurement-based Quantum Computation
• QUITS: A modular Qldpc code circUIT Simulator
• Symmetry in Multi-Qubit Correlated Noise Errors Enhances Surface Code Thresholds
• Transversal architecture for megaquop-scale quantum simulation with neutral atoms
• Neural Decoders for Universal Quantum Algorithms
• Boundary Criticality at the Nishimori Multicritical Point
• Hardness results for decoding the surface code with Pauli noise
• Decoder Dependence in Surface-Code Threshold Estimation under Digitized Hybrid Continuous-Variable and Discrete Noise