Single-shot fault-tolerant quantum error correction

Abstract

Conventional quantum error correcting codes require multiple rounds of measurements to detect errors with enough confidence in fault-tolerant scenarios. Here I show that for suitable topological codes a single round of local measurements is enough. This feature is generic and is related to self-correction and confinement phenomena in the corresponding quantum Hamiltonian model. 3D gauge color codes exhibit this single-shot feature, which applies also to initialization and gauge-fixing. Assuming the time for efficient classical computations negligible, this yields a topological fault-tolerant quantum computing scheme where all elementary logical operations can be performed in constant time.

Typos corrected after publication in journal, 26 pages, 4 figures

References in corpus (12)

• State preservation by repetitive error detection in a superconducting quantum circuit
• Topological Quantum Distillation
• Topological fault-tolerance in cluster state quantum computation
• Restrictions on Transversal Encoded Quantum Gate Sets
• Topological Order with a Twist: Ising Anyons from an Abelian Model
• Quantum memories at finite temperature
• Topological Computation without Braiding
• Exact Topological Quantum Order in D=3 and Beyond: Branyons and Brane-Net Condensates
• Universal transversal gates with color codes - a simplified approach
• Fault-tolerant logical gates in quantum error-correcting codes
• Protected gates for topological quantum field theories
• Quantum computing by color-code lattice surgery

Cited by in corpus (108)

• Roads towards fault-tolerant universal quantum computation
• The Future of Quantum Computing with Superconducting Qubits
• Quantum Low-Density Parity-Check Codes
• Quantum memories at finite temperature
• Decoding Across the Quantum LDPC Code Landscape
• Standard Model Physics and the Digital Quantum Revolution: Thoughts about the Interface
• Quantum advantage with noisy shallow circuits in 3D
• Quantum error mitigation as a universal error-minimization technique: applications from NISQ to FTQC eras
• Poking holes and cutting corners to achieve Clifford gates with the surface code
• Constant overhead quantum fault-tolerance with quantum expander codes
• Factoring 2048-bit RSA Integers in 177 Days with 13436 Qubits and a Multimode Memory
• Low-overhead fault-tolerant quantum computing using long-range connectivity
• Fault-tolerant error correction with the gauge color code
• A theory of single-shot error correction for adversarial noise
• 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
• Three-dimensional surface codes: Transversal gates and fault-tolerant architectures
• Symmetry protected topological order at nonzero temperature
• Cellular-automaton decoders with provable thresholds for topological codes
• Single-shot error correction of three-dimensional homological product codes
• Parallelized quantum error correction with fracton topological codes
• Analysing correlated noise on the surface code using adaptive decoding algorithms
• Three-dimensional color code thresholds via statistical-mechanical mapping
• Decoding algorithms for surface codes
• Scalable Neural Network Decoders for Higher Dimensional Quantum Codes
• Scalable in-situ qubit calibration during repetitive error detection
• Topological Order, Quantum Codes and Quantum Computation on Fractal Geometries
• Universal fault-tolerant measurement-based quantum computation
• Stacked codes: universal fault-tolerant quantum computation in a two-dimensional layout
• Fault-Tolerant Quantum Gates with Defects in Topological Stabiliser Codes
• Improved single-shot decoding of higher dimensional hypergraph product codes
• Characterization of solvable spin models via graph invariants
• Bias-tailored quantum LDPC codes
• Symmetry-protected self-correcting quantum memories
• Cellular automaton decoders of topological quantum memories in the fault tolerant setting
• Universal logical gates with constant overhead: instantaneous Dehn twists for hyperbolic quantum codes
• Cellular automaton decoders for topological quantum codes with noisy measurements and beyond
• Beyond single-shot fault-tolerant quantum error correction
• Gauge color codes in two dimensions
• A decoder for the triangular color code by matching on a Möbius strip
• Renormalization group decoder for a four-dimensional toric code
• A proposal for self-correcting stabilizer quantum memories in 3 dimensions (or slightly less)
• Single-shot decoding of good quantum LDPC codes
• Generating Fault-Tolerant Cluster States from Crystal Structures
• Fault-tolerant measurement-free quantum error correction with multi-qubit gates
• Numerical Implementation of Just-In-Time Decoding in Novel Lattice Slices Through the Three-Dimensional Surface Code
• Tailoring three-dimensional topological codes for biased noise
• Designing open quantum systems with known steady states: Davies generators and beyond
• Resilience to time-correlated noise in quantum computation
• Optimized measurement-free and fault-tolerant quantum error correction for neutral atoms
• Achieving fault tolerance on capped color codes with few ancillas
• Fault-tolerant gates via homological product codes
• Projecting 3D color codes onto 3D toric codes
• Decoding of Quantum Data-Syndrome Codes via Belief Propagation
• Symmetry protected self correcting quantum memory in three space dimensions
• Quantum error correction with fractal topological codes
• Long-range-enhanced surface codes
• Error correction of transversal CNOT gates for scalable surface code computation
• Experiments with the 4D Surface Code on a QCCD Quantum Computer
• Automated Synthesis of Fault-Tolerant State Preparation Circuits for Quantum Error Correction Codes
• Quantum memory at nonzero temperature in a thermodynamically trivial system
• Quantum Pin Codes
• Lifting topological codes: Three-dimensional subsystem codes from two-dimensional anyon models
• Correcting spanning errors with a fractal code
• Analog information decoding of bosonic quantum LDPC codes
• Integrated Analysis of Performance and Resource of Large-Scale Quantum Computing
• Fault-tolerant logical measurements via homological measurement
• On maximum-likelihood decoding with circuit-level errors
• Stabilizer Entanglement Distillation and Efficient Fault-Tolerant Encoders
• Quantum convolutional data-syndrome codes
• Perturbative stability and error correction thresholds of quantum codes
• Partial Syndrome Measurement for Hypergraph Product Codes
• Robust sparse IQP sampling in constant depth
• XYZ ruby code: Making a case for a three-colored graphical calculus for quantum error correction in spacetime
• Virtual quantum error detection
• Comparison of memory thresholds for planar qudit geometries
• Stabilizer Formalism for Operator Algebra Quantum Error Correction
• Detrimental non-Markovian errors for surface code memory
• Fault-tolerant compiling of classically hard IQP circuits on hypercubes
• Time-Efficient Logical Operations on Quantum Low-Density Parity Check Codes
• Single-Shot Quantum Error Correction in Intertwined Toric Codes
• Single-Shot Decoding of Linear Rate LDPC Quantum Codes with High Performance
• Phase diagram of the three-dimensional subsystem toric code
• Fault-Tolerant Preparation of Quantum Polar Codes Encoding One Logical Qubit
• Local Probabilistic Decoding of a Quantum Code
• Adaptive Syndrome Extraction
• High-Threshold Low-Overhead Fault-Tolerant Classical Computation and the Replacement of Measurements with Unitary Quantum Gates
• Plane-selective manipulations of nuclear spin qubits in a three-dimensional optical tweezer array
• Error correcting power of small topological codes
• Generalized quantum data-syndrome codes and belief propagation decoding for phenomenological noise
• Braiding defects in topological stabiliser codes of any dimension cannot be universal
• Single-shot and measurement-based quantum error correction via fault complexes
• A little bit of self-correction
• Improved performance of the Bacon-Shor code with Steane's syndrome extraction method
• Single-shot preparation of hypergraph product codes via dimension jump
• Enhancing Quantum Memory Lifetime with Measurement-Free Local Error Correction and Reinforcement Learning
• Non-Abelian Self-Correcting Quantum Memory and Transversal Non-Clifford Gate beyond the $n^{1/3}$ Distance Barrier
• Fault-tolerant quantum computation with constant overhead for general noise
• A simple formulation of no-cloning and no-hiding that admits efficient and robust verification
• Towards self-correcting quantum codes for neutral atom arrays
• Magic tricycles: Efficient magic state generation with finite block-length quantum LDPC codes
• Spectra of Gauge Code Hamiltonians
• Universal fault tolerant quantum computation in 2D without getting tied in knots
• Global estimates of errors in quantum computation by the Feynman-Vernon formalism
• Planar fault-tolerant circuits for non-Clifford gates on the 2D color code
• Between Shor and Steane: A unifying construction for measuring error syndromes
• Fracton models from product codes
• Fault Tolerant Quantum Simulation via Symplectic Transvections