Decoding across transversal Clifford gates in the surface code
arXiv:2505.13599 · doi:10.1103/sk5y-25b1
Abstract
Transversal logical gates offer the opportunity for fast and low-noise logic, particularly when interspersed by a single round of parity check measurements of the underlying code. Using such circuits for the surface code requires decoding across logical gates, complicating the decoding task. We show how one can decode across an arbitrary sequence of transversal gates for the unrotated surface code, using a fast "logical observable" minimum-weight-perfect-matching (MWPM) based decoder, and benchmark its performance in Clifford circuits under circuit-level noise. We propose windowed logical observable matching decoders to address the problem of fully efficient decoding: our basic windowed decoder is computationally efficient under the restriction of quiescent (slow) resets. Our 'advanced' two-step windowed decoder can be computationally inefficient but allows fast resets. For both windowed decoders we identify errors which scale sublinearly in - depending on the structure of the circuit - which can lead to logical failure, and we propose methods to adapt the decoding to remove such failures. Our work highlights the complexity and interest in efficient decoding of fast logic for the surface code.
Added arXiv link to co-submitted paper. 52 pages, 31 figures, comments welcome :)
References in corpus (35)
- Surface codes: Towards practical large-scale quantum computation
- Topological quantum memory
- Quantum Error Correction for Quantum Memories
- Logical quantum processor based on reconfigurable atom arrays
- Operator Spreading in Random Unitary Circuits
- Topological Quantum Distillation
- Quantum error correction below the surface code threshold
- High-fidelity parallel entangling gates on a neutral atom quantum computer
- Restrictions on Transversal Encoded Quantum Gate Sets
- Stim: a fast stabilizer circuit simulator
- Low-distance Surface Codes under Realistic Quantum Noise
- Scalable quantum circuit and control for a superconducting surface code
- Unfolding the color code
- Neutral Atom Quantum Computing Hardware: Performance and End-User Perspective
- Sparse Blossom: correcting a million errors per core second with minimum-weight matching
- Mid-circuit cavity measurement in a neutral atom array
- Matching and maximum likelihood decoding of a multi-round subsystem quantum error correction experiment
- A theory of single-shot error correction for adversarial noise
- Density-matrix simulation of small surface codes under current and projected experimental noise
- A Fault-Tolerant Honeycomb Memory
- Universal quantum computing with twist-free and temporally encoded lattice surgery
- The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
- Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics
- Mid-circuit measurements on a single species neutral alkali atom quantum processor
- Parallel window decoding enables scalable fault tolerant quantum computation
- Experimental Demonstration of Logical Magic State Distillation
- Scaling and logic in the color code on a superconducting quantum processor
- Transversal Clifford gates on folded surface codes
- Fold-Transversal Clifford Gates for Quantum Codes
- Low-Overhead Transversal Fault Tolerance for Universal Quantum Computation
- Color code decoder with improved scaling for correcting circuit-level noise
- The Classification of Clifford Gates over Qubits
- Error correction of transversal CNOT gates for scalable surface code computation
- Dynamical subset sampling of quantum error correcting protocols
- Single-shot and measurement-based quantum error correction via fault complexes