Adaptive Syndrome Extraction
arXiv:2502.14835 · doi:10.1103/ps3r-wf84
Abstract
Device error rates on current quantum computers have improved enough to where demonstrations of error correction below break-even are now possible. Still, the circuits required for quantum error correction introduce significant overhead and sometimes inject more errors than they correct. In this work, we introduce adaptive syndrome extraction as a scheme to improve code performance and reduce the quantum error correction cycle time by measuring only the stabilizer generators that are likely to provide useful syndrome information. We provide a concrete example of the scheme through the [[4,2,2]] code concatenated with a hypergraph product code and a syndrome extraction cycle that uses quantum error detection to modify the syndrome extraction circuits in real time. Compared to non-concatenated codes and non-adaptive syndrome extraction, we find that the adaptive scheme achieves over an order of magnitude lower logical error rates while requiring fewer CNOT gates and physical qubits. Furthermore, we show how to achieve fault-tolerant universal logical computation with [[4,2,2]]-concatenated hypergraph product codes.
26 pages, 15 figures
References in corpus (42)
- Topological quantum memory
- Quantum Computing with Very Noisy Devices
- Logical quantum processor based on reconfigurable atom arrays
- Topological Quantum Distillation
- Large Scale Modular Quantum Computer Architecture with Atomic Memory and Photonic Interconnects
- Quantum error correction below the surface code threshold
- Demonstration of the trapped-ion quantum-CCD computer architecture
- Operator Quantum Error Correcting Subsystems for Self-Correcting Quantum Memories
- High-threshold and low-overhead fault-tolerant quantum memory
- Stim: a fast stabilizer circuit simulator
- Quantum computing with nearest neighbor interactions and error rates over 1%
- Stabilizer Formalism for Operator Quantum Error Correction
- A Race Track Trapped-Ion Quantum Processor
- Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}
- A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes
- Tradeoffs for reliable quantum information storage in 2D systems
- Dynamically Generated Logical Qubits
- Single-shot fault-tolerant quantum error correction
- Fault-tolerant quantum computation with few qubits
- Quantum "hyperbicycle" low-density parity check codes with finite rate
- Optimal and Efficient Decoding of Concatenated Quantum Block Codes
- A theory of single-shot error correction for adversarial noise
- Constant-overhead quantum error correction with thin planar connectivity
- Single-shot error correction of three-dimensional homological product codes
- Fault-tolerant quantum error correction for Steane's seven-qubit color code with few or no extra qubits
- Combining hard and soft decoders for hypergraph product codes
- Quantifying nonlocality: how outperforming local quantum codes is expensive
- Partitioning qubits in hypergraph product codes to implement logical gates
- Protecting Expressive Circuits with a Quantum Error Detection Code
- Fold-Transversal Clifford Gates for Quantum Codes
- Toward a 2D Local Implementation of Quantum LDPC Codes
- Noise Thresholds for the [[4, 2, 2]]-concatenated Toric Code
- High-rate quantum LDPC codes for long-range-connected neutral atom registers
- Quantum LDPC Codes for Modular Architectures
- Numerical and analytical bounds on threshold error rates for hypergraph-product codes
- Many-hypercube codes: High-rate quantum error-correcting codes for high-performance fault-tolerant quantum computing
- QDistRnd: A GAP package for computing the distance of quantum error-correcting codes
- Hierarchical memories: Simulating quantum LDPC codes with local gates
- Long-range-enhanced surface codes
- Distance-preserving stabilizer measurements in hypergraph product codes
- Partial Syndrome Measurement for Hypergraph Product Codes
- An integrity measure to benchmark quantum error correcting memories