Many-hypercube codes: High-rate quantum error-correcting codes for high-performance fault-tolerant quantum computing
arXiv:2403.16054 · doi:10.1126/sciadv.adp6388
Abstract
Standard approaches to quantum error correction for fault-tolerant quantum computing are based on encoding a single logical qubit into many physical ones, resulting in asymptotically zero encoding rates and therefore huge resource overheads. To overcome this issue, high-rate quantum codes, such as quantum low-density parity-check codes, have been studied over the past decade. In this case, however, it is difficult to perform logical gates in parallel while maintaining low overheads. Here we propose concatenated high-rate small-size quantum error-detecting codes as a new family of high-rate quantum codes. Their simple structure allows for a geometrical interpretation using hypercubes corresponding to logical qubits. We thus call them many-hypercube codes. They can realize both high rates, e.g., 30% (64 logical qubits are encoded into 216 physical ones), and parallelizability of logical gates. Developing dedicated decoder and encoders, we achieve high error thresholds even in a circuit-level noise model. Thus, the many-hypercube codes will pave the way to high-performance fault-tolerant quantum computing.
arXiv comment20 pages, 16 figures
References in corpus (42)
- Surface codes: Towards practical large-scale quantum computation
- Topological quantum memory
- 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
- A Theory of Fault-Tolerant Quantum Computation
- Fault-tolerant quantum computation with high threshold in two dimensions
- Topological Quantum Distillation
- How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
- Topological fault-tolerance in cluster state quantum computation
- Surface code quantum computing by lattice surgery
- Demonstration of multi-qubit entanglement and algorithms on a programmable neutral atom quantum computer
- High-fidelity parallel entangling gates on a neutral atom quantum computer
- High threshold universal quantum computation on the surface code
- High-threshold and low-overhead fault-tolerant quantum memory
- Stim: a fast stabilizer circuit simulator
- Sparse Graph Codes for Quantum Error-Correction
- Quantum computing with nearest neighbor interactions and error rates over 1%
- Realization of an Error-Correcting Surface Code with Superconducting Qubits
- Quantum Low-Density Parity-Check Codes
- Active stabilisation, quantum computation and quantum state synthesis
- Demonstration of fault-tolerant universal quantum gate operations
- Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
- Quantum error correction with only two extra qubits
- Decoding Across the Quantum LDPC Code Landscape
- Balanced Product Quantum Codes
- Multilevel distillation of magic states for quantum computing
- Quantum "hyperbicycle" low-density parity check codes with finite rate
- Optimal and Efficient Decoding of Concatenated Quantum Block Codes
- Low-overhead fault-tolerant quantum computing using long-range connectivity
- Quantum Expander Codes
- Constant-overhead quantum error correction with thin planar connectivity
- 2-D color code quantum computation
- Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation
- Combining hard and soft decoders for hypergraph product codes
- Demonstrating Bayesian Quantum Phase Estimation with Quantum Error Detection
- Fault-tolerant gates on hypergraph product codes
- Partitioning qubits in hypergraph product codes to implement logical gates
- Protecting Expressive Circuits with a Quantum Error Detection Code
- Fault-Tolerant One-Bit Addition with the Smallest Interesting Colour Code
- Transversal Diagonal Logical Operators for Stabiliser Codes
Cited by in corpus (8)
- Concatenate codes, save qubits
- Efficient fault-tolerant code switching via one-way transversal CNOT gates
- Adaptive Syndrome Extraction
- How to realize compact and non-compact localized states in disorder-free hypercube networks
- Logical Error Rates for the Surface Code Under a Mixed Coherent and Stochastic Circuit-Level Noise Model Inspired by Trapped Ions
- Far from Perfect: Quantum Error Correction with (Hyperinvariant) Evenbly Codes
- Coxeter codes: Extending the Reed-Muller family
- Subsystem many-hypercube codes: High-rate concatenated codes with low-weight syndrome measurements