Low-Overhead Transversal Fault Tolerance for Universal Quantum Computation
arXiv:2406.17653 · doi:10.1038/s41586-025-09543-5
Abstract
Fast, reliable logical operations are essential for realizing useful quantum computers. By redundantly encoding logical qubits into many physical qubits and using syndrome measurements to detect and correct errors, one can achieve low logical error rates. However, for many practical quantum error correcting (QEC) codes such as the surface code, due to syndrome measurement errors, standard constructions require multiple extraction rounds -- on the order of the code distance -- for fault-tolerant computation, particularly considering fault-tolerant state preparation. Here, we show that logical operations can be performed fault-tolerantly with only a constant number of extraction rounds for a broad class of QEC codes, including the surface code with magic state inputs and feed-forward, to achieve ``transversal algorithmic fault tolerance". Through the combination of transversal operations and novel strategies for correlated decoding, despite only having access to partial syndrome information, we prove that the deviation from the ideal logical measurement distribution can be made exponentially small in the distance, even if the instantaneous quantum state cannot be made close to a logical codeword due to measurement errors. We supplement this proof with circuit-level simulations in a range of relevant settings, demonstrating the fault tolerance and competitive performance of our approach. Our work sheds new light on the theory of quantum fault tolerance and has the potential to reduce the space-time cost of practical fault-tolerant quantum computation by over an order of magnitude.
v2: Added link to circuits used in simulations, improved presentation of fault tolerance construction
References in corpus (45)
- Surface codes: Towards practical large-scale quantum computation
- Topological quantum memory
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Quantum Error Correction for Quantum Memories
- Quantum Computing with Very Noisy Devices
- Suppressing quantum errors by scaling a surface code logical qubit
- Logical quantum processor based on reconfigurable atom arrays
- How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
- Surface code quantum computing by lattice surgery
- Demonstration of the trapped-ion quantum-CCD computer architecture
- Restrictions on Transversal Encoded Quantum Gate Sets
- High-threshold and low-overhead fault-tolerant quantum memory
- A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
- Stim: a fast stabilizer circuit simulator
- Magic state distillation with low overhead
- Quantum Low-Density Parity-Check Codes
- Demonstration of fault-tolerant universal quantum gate operations
- Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}
- Halving the cost of quantum addition
- Fast Decoders for Topological Quantum Codes
- Topological Order at Non-zero Temperature
- Unfolding the color code
- Focus beyond quadratic speedups for error-corrected quantum advantage
- Quantum advantage with noisy shallow circuits in 3D
- Fault-Tolerance of "Bad" Quantum Low-Density Parity Check Codes
- Low-overhead fault-tolerant quantum computing using long-range connectivity
- High threshold error correction for the surface code
- Fault-tolerant resource estimate for quantum chemical simulations: Case study on Li-ion battery electrolyte molecules
- A theory of single-shot error correction for adversarial noise
- A magic state's fidelity can be superior to the operations that created it
- Constant-overhead quantum error correction with thin planar connectivity
- The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
- Three-dimensional surface codes: Transversal gates and fault-tolerant architectures
- Parallel window decoding enables scalable fault tolerant quantum computation
- A fault-tolerant non-Clifford gate for the surface code in two dimensions
- Quantum computation via translation-invariant operations on a chain of qubits
- Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation
- Transversal Clifford gates on folded surface codes
- Improved single-shot decoding of higher dimensional hypergraph product codes
- Partitioning qubits in hypergraph product codes to implement logical gates
- Fold-Transversal Clifford Gates for Quantum Codes
- Looped Pipelines Enabling Effective 3D Qubit Lattices in a Strictly 2D Device
- Single-shot decoding of good quantum LDPC codes
- Hierarchical memories: Simulating quantum LDPC codes with local gates
- Sparse Quantum Codes from Quantum Circuits
Cited by in corpus (17)
- Single-shot and measurement-based quantum error correction via fault complexes
- Decoding across transversal Clifford gates in the surface code
- Logical qubits with erasure conversion using metastable neutral atoms
- Single-shot preparation of hypergraph product codes via dimension jump
- Single Sr Atoms in Optical Tweezer Arrays for Quantum Simulation
- Towards self-correcting quantum codes for neutral atom arrays
- Experimental measurement and a physical interpretation of quantum shadow enumerators
- Fault-tolerant interfaces for modular quantum computing on diverse qubit platforms
- Entanglement boosting: Low-volume logical Bell pair preparation for distributed fault-tolerant quantum computation
- Taming Rydberg Decay with Measurement-based Quantum Computation
- Transversal architecture for megaquop-scale quantum simulation with neutral atoms
- Impure codes exceeding the pure bounds for quantum local recovery
- High-efficiency loading of 2,400 Ytterbium atoms in optical tweezer arrays
- Decoding Correlated Errors in Quantum LDPC Codes
- Neural Decoders for Universal Quantum Algorithms
- Towards Robust Optimal Measurements Against Noise in Quantum Metrology
- Universal quantum computation via scalable measurement-free error correction