Tailoring surface codes for highly biased noise

Abstract

The surface code, with a simple modification, exhibits ultra-high error correction thresholds when the noise is biased towards dephasing. Here, we identify features of the surface code responsible for these ultra-high thresholds. We provide strong evidence that the threshold error rate of the surface code tracks the hashing bound exactly for all biases, and show how to exploit these features to achieve significant improvement in logical failure rate. First, we consider the infinite bias limit, meaning pure dephasing. We prove that the error threshold of the modified surface code for pure dephasing noise is $50\%$, i.e., that all qubits are fully dephased, and this threshold can be achieved by a polynomial time decoding algorithm. We demonstrate that the sub-threshold behavior of the code depends critically on the precise shape and boundary conditions of the code. That is, for rectangular surface codes with standard rough/smooth open boundaries, it is controlled by the parameter $g=\gcd (j,k)$, where $j$ and $k$ are dimensions of the surface code lattice. We demonstrate a significant improvement in logical failure rate with pure dephasing for co-prime codes that have $g=1$, and closely-related rotated codes, which have a modified boundary. The effect is dramatic: the same logical failure rate achievable with a square surface code and $n$ physical qubits can be obtained with a co-prime or rotated surface code using only $O(\sqrt{n})$ physical qubits. Finally, we use approximate maximum likelihood decoding to demonstrate that this improvement persists for a general Pauli noise biased towards dephasing. In particular, comparing with a square surface code, we observe a significant improvement in logical failure rate against biased noise using a rotated surface code with approximately half the number of physical qubits.

18+4 pages, 24 figures; v2 includes additional coauthor (ASD) and new results on the performance of surface codes in the finite-bias regime, obtained with beveled surface codes and an improved tensor network decoder; v3 published version

References in corpus (25)

• Topological quantum memory
• Quantum Error Correction for Quantum Memories
• Topological Quantum Distillation
• Demonstration of Entanglement of Electrostatically Coupled Singlet-Triplet Qubits
• Experimental Quantum Computations on a Topologically Encoded Qubit
• Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory
• Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
• Ultrahigh Error Threshold for Surface Codes with Biased Noise
• Fault-tolerant quantum computation against biased noise
• Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study
• Asymmetric quantum error correcting codes
• Strong Resilience of Topological Codes to Depolarization
• Unfolding the color code
• The two-dimensional random-bond Ising model, free fermions and the network model
• Error Threshold for Color Codes and Random 3-Body Ising Models
• Fault-Tolerant Computing With Biased-Noise Superconducting Qubits
• Asymmetric quantum error correction via code conversion
• Fault-tolerant quantum computation with asymmetric Bacon-Shor codes
• 2-D Compass Codes
• Reducing the overhead for quantum computation when noise is biased
• Linear-time general decoding algorithm for the surface code
• Incoherent dynamics in the toric code subject to disorder
• High-threshold topological quantum error correction against biased noise
• Tailored codes for small quantum memories
• The role of entropy in topological quantum error correction

Cited by in corpus (95)

• Circuit Quantum Electrodynamics
• Building a fault-tolerant quantum computer using concatenated cat codes
• Entanglement phase transitions in measurement-only dynamics
• Fault-tolerant bosonic quantum error correction with the surface-GKP code
• Quantum information processing with bosonic qubits in circuit QED
• Towards Scalable Bosonic Quantum Error Correction
• Efficient estimation of Pauli channels
• Fault-tolerant thresholds for the surface code in excess of 5% under biased noise
• Triangular color codes on trivalent graphs with flag qubits
• Universal quantum computing with twist-free and temporally encoded lattice surgery
• Improved decoding of circuit noise and fragile boundaries of tailored surface codes
• Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics
• Erasure qubits: Overcoming the $T_1$ limit in superconducting circuits
• Floquet codes without parent subsystem codes
• Quantum coding with low-depth random circuits
• Anyon condensation and the color code
• Demonstrating a long-coherence dual-rail erasure qubit using tunable transmons
• Fault-Tolerant Weighted Union-Find Decoding on the Toric Code
• Decoding algorithms for surface codes
• Lindblad Tomography of a Superconducting Quantum Processor
• Combined Dissipative and Hamiltonian Confinement of Cat Qubits
• Enhanced noise resilience of the surface-GKP code via designed bias
• Experimental benchmarking of an automated deterministic error suppression workflow for quantum algorithms
• Fast Estimation of Sparse Quantum Noise
• Real-time calibration with spectator qubits
• Stabilizing a Bosonic Qubit using Colored Dissipation
• Tailored XZZX codes for biased noise
• A decoder for the triangular color code by matching on a Möbius strip
• General framework for constructing fast and near-optimal machine-learning-based decoder of the topological stabilizer codes
• A circuit-level protocol and analysis for twist-based lattice surgery
• Tensor-network codes
• Clifford-deformed Surface Codes
• Two-photon driven Kerr quantum oscillator with multiple spectral degeneracies
• Efficient color code decoders in $d\ge 2$ dimensions from toric code decoders
• Hyper-optimized approximate contraction of tensor networks with arbitrary geometry
• Learning correlated noise in a 39-qubit quantum processor
• Quantum computation with cat qubits
• Looped Pipelines Enabling Effective 3D Qubit Lattices in a Strictly 2D Device
• Identification of different types of high-frequency defects in superconducting qubits
• Correcting non-independent and non-identically distributed errors with surface codes
• High-Fidelity Magic-State Preparation with a Biased-Noise Architecture
• Tailoring fusion-based photonic quantum computing schemes to quantum emitters
• Generating Fault-Tolerant Cluster States from Crystal Structures
• The XYZ${}^2$ hexagonal stabilizer code
• Classical simulation of non-Gaussian fermionic circuits
• Tailoring three-dimensional topological codes for biased noise
• Performance enhancement of surface codes via recursive MWPM decoding
• Hierarchical memories: Simulating quantum LDPC codes with local gates
• Biased Gottesman-Kitaev-Preskill repetition code
• Data-driven decoding of quantum error correcting codes using graph neural networks
• A cellular automaton decoder for a noise-bias tailored color code
• Closest lattice point decoding for multimode Gottesman-Kitaev-Preskill codes
• Qubit-oscillator concatenated codes: decoding formalism & code comparison
• Fault-tolerant quantum architectures based on erasure qubits
• Correcting spanning errors with a fractal code
• Decoding quantum color codes with MaxSAT
• SPAM-Robust Multi-axis Quantum Noise Spectroscopy in Temporally Correlated Environments
• Scalable noise characterization of syndrome-extraction circuits with averaged circuit eigenvalue sampling
• Local tensor-network codes
• Asymmetric Quantum Concatenated and Tensor Product Codes with Large Z-Distances
• Fault-tolerant hyperbolic Floquet quantum error correcting codes
• Perturbative stability and error correction thresholds of quantum codes
• Ising model formulation for highly accurate topological color codes decoding
• Error-rate-agnostic decoding of topological stabilizer codes
• Near-Term Spin-Qubit Architecture Design via Multipartite Maximally-Entangled States
• Compressed gate characterization for quantum devices with time-correlated noise
• Detrimental non-Markovian errors for surface code memory
• Dynamical subset sampling of quantum error correcting protocols
• Free-Fermion Subsystem Codes
• Surface Code with Imperfect Erasure Checks
• Designing quantum error correction codes for practical spin qudit
• Dynamic compensation for pump-induced frequency shift in Kerr-cat qubit initialization
• Bit-flip errors in dissipative cat qubits: second-order perturbation theory
• Robustness-optimized quantum error correction
• The domain wall color code
• Estimating the bias of CX gates via character randomized benchmarking
• Exact results on finite size corrections for surface codes tailored to biased noise
• Augmented fidelities for single qubit gates
• Mixed-State Topological Order under Coherent Noise
• Bounds on Autonomous Quantum Error Correction
• Many-body quantum catalysts for transforming between phases of matter
• Practical quantum error correction with the XZZX code and Kerr-cat qubits
• Measurement-free quantum error correction optimized for biased noise
• Distributed Realization of Color Codes for Quantum Error Correction
• Revisiting Nishimori multicriticality through the lens of information measures
• Residual-$ZZ$-coupling suppression and fast two-qubit gate for Kerr-cat qubits based on level-degeneracy engineering
• Preservation of entanglement in local noisy channels
• Mitigating Temporal Fragility in the XY Surface Code
• Addressing requirements for crosstalk-free quantum-gate operation in many-body nanofiber cavity QED systems
• Andreev spin qubit protected by Franck-Condon blockade
• Investigation of tantalum films growth for coplanar resonators with internal quality factors above ten million
• Symmetry in Multi-Qubit Correlated Noise Errors Enhances Surface Code Thresholds
• Simulated-annealing decoder for the XZZX code with greedy-matching initialization
• Biased-Noise Thresholds of Zero-Rate Holographic Codes with Tensor-Network Decoding
• Generalized Code Distance through Rotated Logical States in Quantum Error Correction