Tailored XZZX codes for biased noise

Abstract

Quantum error correction (QEC) for generic errors is challenging due to the demanding threshold and resource requirements. Interestingly, when physical noise is biased, we can tailor our QEC schemes to the noise to improve performance. Here we study a family of codes having XZZX-type stabilizer generators, including a set of cyclic codes generalized from the five-qubit code and a set of topological codes that we call generalized toric codes (GTCs). We show that these XZZX codes are highly qubit efficient if tailored to biased noise. To characterize the code performance, we use the notion of effective distance, which generalizes code distance to the case of biased noise and constitutes a proxy for the logical failure rate. We find that the XZZX codes can achieve a favorable resource scaling by this metric under biased noise. We also show that the XZZX codes have remarkably high thresholds that reach what is achievable by random codes, and furthermore they can be efficiently decoded using matching decoders. Finally, by adding only one flag qubit, the XZZX codes can realize fault-tolerant QEC while preserving their large effective distance. In combination, our results show that tailored XZZX codes give a resource-efficient scheme for fault-tolerant QEC against biased noise.

References in corpus (13)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Surface codes: Towards practical large-scale quantum computation
• Strong quantum computational advantage using a superconducting quantum processor
• Realization of an Error-Correcting Surface Code with Superconducting Qubits
• Quantum Low-Density Parity-Check Codes
• Low-distance Surface Codes under Realistic Quantum Noise
• Building a fault-tolerant quantum computer using concatenated cat codes
• Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
• Quantum LDPC Codes with Almost Linear Minimum Distance
• Balanced Product Quantum Codes
• Homological Error Correction: Classical and Quantum Codes
• The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
• Entanglement purification and protection in a superconducting quantum network

Cited by in corpus (24)

• Improved decoding of circuit noise and fragile boundaries of tailored surface codes
• Quantum Error Correction with Metastable States of Trapped Ions Using Erasure Conversion
• Erasure qubits: Overcoming the $T_1$ limit in superconducting circuits
• Decoding algorithms for surface codes
• High-Coherence Kerr-cat qubit in 2D architecture
• Tensor networks for quantum computing
• Fault-tolerant quantum computation by hybrid qubits with bosonic cat-code and single photons
• Optimizing quantum error correction protocols with erasure qubits
• Fault-tolerant quantum architectures based on erasure qubits
• Noise-adapted qudit codes for amplitude-damping noise
• Dynamical subset sampling of quantum error correcting protocols
• Realizing a class of stabilizer quantum error correction codes using a single ancilla and circular connectivity
• Surface Code with Imperfect Erasure Checks
• Logical multi-qubit entanglement with dual-rail superconducting qubits
• Snakes and Ladders: Adapting the surface code to defects
• Low-overhead quantum error correction codes with a cyclic topology
• Designing quantum error correction codes for practical spin qudit
• Recovering Quantum Coherence of a Cavity Qubit Coupled to a Noisy Ancilla through Real-Time Feedback
• Tailoring Dynamical Codes for Biased Noise: The X${}^3$Z${}^3$ Floquet Code
• Universal gates for a metastable qubit in strontium-88
• Mitigating Temporal Fragility in the XY Surface Code
• Decoder Dependence in Surface-Code Threshold Estimation under Digitized Hybrid Continuous-Variable and Discrete Noise
• Flexible Fault Tolerant Gate Gadgets
• Biased-Noise Thresholds of Zero-Rate Holographic Codes with Tensor-Network Decoding