A theory of single-shot error correction for adversarial noise
arXiv:1805.09271 · doi:10.1088/2058-9565/aafc8f
Abstract
Single-shot error correction is a technique for correcting physical errors using only a single round of noisy check measurements, such that any residual noise affects a small number of qubits. We propose a general theory of single-shot error correction and establish a sufficient condition called good soundness of the code's measurement checks. Good code soundness in topological (or LDPC) codes is shown to entail a macroscopic energy barrier for the associated Hamiltonian. Consequently, 2D topological codes with local checks can not have good soundness. In tension with this, we also show that for any code a specific choice of measurement checks does exist that provides good soundness. In other words, every code can perform single-shot error correction but the required checks may be nonlocal and act on many qubits. If we desire codes with both good soundness and simple measurement checks (the LDPC property) then careful constructions are needed. Finally, we use a double application of the homological product to construct quantum LDPC codes with single-shot error correcting capabilities. Our double homological product codes exploit redundancy in measurements checks through a process we call metachecking.
V6: Final author's accepted version. Accepted to Quantum Science & Technology journal
References in corpus (8)
- Local stabilizer codes in three dimensions without string logical operators
- Topological Quantum Distillation
- Roads towards fault-tolerant universal quantum computation
- A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes
- Universal transversal gates with color codes - a simplified approach
- Fault-Tolerance of "Bad" Quantum Low-Density Parity Check Codes
- Ability of stabilizer quantum error correction to protect itself from its own imperfection
- Numerical and analytical bounds on threshold error rates for hypergraph-product codes
Cited by in corpus (57)
- The Future of Quantum Computing with Superconducting Qubits
- Bias-preserving gates with stabilized cat qubits
- Decoding Across the Quantum LDPC Code Landscape
- Quantum LDPC Codes with Almost Linear Minimum Distance
- Decoding quantum errors with subspace expansions
- Universal quantum computing with twist-free and temporally encoded lattice surgery
- Single-shot error correction of three-dimensional homological product codes
- Parallelized quantum error correction with fracton topological codes
- Universal fault-tolerant measurement-based quantum computation
- Improved single-shot decoding of higher dimensional hypergraph product codes
- Higher-dimensional quantum hypergraph-product codes
- Bias-tailored quantum LDPC codes
- Cellular automaton decoders for topological quantum codes with noisy measurements and beyond
- Beyond single-shot fault-tolerant quantum error correction
- Low-Overhead Transversal Fault Tolerance for Universal Quantum Computation
- Quantum storage in quantum ferromagnets
- A Spin-Optical Quantum Computing Architecture
- Single-shot decoding of good quantum LDPC codes
- Generating Fault-Tolerant Cluster States from Crystal Structures
- A four-dimensional toric code with non-Clifford transversal gates
- Numerical Implementation of Just-In-Time Decoding in Novel Lattice Slices Through the Three-Dimensional Surface Code
- Fault-tolerant gates via homological product codes
- Experiments with the 4D Surface Code on a QCCD Quantum Computer
- Quantum Pin Codes
- Error correction of transversal CNOT gates for scalable surface code computation
- Quantum memory at nonzero temperature in a thermodynamically trivial system
- Low-density parity-check codes as stable phases of quantum matter
- Quantum XYZ Product Codes
- Lifting topological codes: Three-dimensional subsystem codes from two-dimensional anyon models
- CSS code surgery as a universal construction
- Extracting topological orders of generalized Pauli stabilizer codes in two dimensions
- Analog information decoding of bosonic quantum LDPC codes
- On maximum-likelihood decoding with circuit-level errors
- Fault-tolerant logical measurements via homological measurement
- Optimal quantum subsystem codes in 2-dimensions
- Minimal distances for certain quantum product codes and tensor products of chain complexes
- Partial Syndrome Measurement for Hypergraph Product Codes
- Weight Reduced Stabilizer Codes with Lower Overhead
- Phase diagram of the three-dimensional subsystem toric code
- Fault-Tolerant Preparation of Quantum Polar Codes Encoding One Logical Qubit
- Adaptive Syndrome Extraction
- Robustness-optimized quantum error correction
- Generalized quantum data-syndrome codes and belief propagation decoding for phenomenological noise
- Single-shot and measurement-based quantum error correction via fault complexes
- Improved performance of the Bacon-Shor code with Steane's syndrome extraction method
- Single-shot preparation of hypergraph product codes via dimension jump
- Decoding across transversal Clifford gates in the surface code
- Quantum Locally Testable Code with Constant Soundness
- Single-shot quantum error correction with the three-dimensional subsystem toric code
- Robust projective measurements through measuring code-inspired observables
- Fault-tolerant quantum computation with constant overhead for general noise
- QUITS: A modular Qldpc code circUIT Simulator
- Towards self-correcting quantum codes for neutral atom arrays
- Magic tricycles: Efficient magic state generation with finite block-length quantum LDPC codes
- Effective Distance of Higher Dimensional HGPs and Weight-Reduced Quantum LDPC Codes
- Between Shor and Steane: A unifying construction for measuring error syndromes
- Accelerating Fault-Tolerant Quantum Computation with Good qLDPC Codes