Quantum LDPC Codes for Modular Architectures
arXiv:2209.14329 · doi:10.1103/PRXQuantum.4.020321
Abstract
In efforts to scale the size of quantum computers, modularity plays a central role across most quantum computing technologies. In the light of fault tolerance, this necessitates designing quantum error-correcting codes that are compatible with the connectivity arising from the architectural layouts. In this paper, we aim to bridge this gap by giving a novel way to view and construct quantum LDPC codes tailored for modular architectures. We demonstrate that if the intra- and inter-modular qubit connectivity can be viewed as corresponding to some classical or quantum LDPC codes, then their hypergraph product code fully respects the architectural connectivity constraints. Finally, we show that relaxed connectivity constraints that allow twists of connections between modules pave a way to construct codes with better parameters.
arXiv comment13 pages, 10 figures
References in corpus (29)
- Fault-tolerant quantum computation by anyons
- Topological quantum memory
- Quantum Error Correction for Quantum Memories
- Quantum computing with trapped ions
- Large Scale Modular Quantum Computer Architecture with Atomic Memory and Photonic Interconnects
- Realizing Repeated Quantum Error Correction in a Distance-Three Surface Code
- Roads towards fault-tolerant universal quantum computation
- Exponential suppression of bit or phase flip errors with repetitive error correction
- Repeated Quantum Error Detection in a Surface Code
- Quantum Low-Density Parity-Check Codes
- Modular Entanglement of Atomic Qubits using both Photons and Phonons
- High-rate, high-fidelity entanglement of qubits across an elementary quantum network
- Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}
- Degenerate Quantum LDPC Codes With Good Finite Length Performance
- Topological quantum computing with a very noisy network and local error rates approaching one percent
- Quantum LDPC Codes with Almost Linear Minimum Distance
- Logical-qubit operations in an error-detecting surface code
- Balanced Product Quantum Codes
- Low-loss interconnects for modular superconducting quantum processors
- Two-qubit entangling gates within arbitrarily long chains of trapped ions
- Constant-overhead quantum error correction with thin planar connectivity
- Long-range multi-body interactions and three-body anti-blockade in a trapped Rydberg ion chain
- Higher-dimensional quantum hypergraph-product codes
- Topological Quantum Error Correction with Optimal Encoding Rate
- Network architecture for a topological quantum computer in silicon
- Quantifying nonlocality: how outperforming local quantum codes is expensive
- Distributed quantum information processing with minimal local resources
- Connectivity constrains quantum codes
- QDistRnd: A GAP package for computing the distance of quantum error-correcting codes
Cited by in corpus (12)
- The MQT Handbook: A Summary of Design Automation Tools and Software for Quantum Computing
- High-threshold quantum computing by fusing one-dimensional cluster states
- Computational Capabilities and Compiler Development for Neutral Atom Quantum Processors: Connecting Tool Developers and Hardware Experts
- Distance-preserving stabilizer measurements in hypergraph product codes
- Analog information decoding of bosonic quantum LDPC codes
- Tantalum airbridges for scalable superconducting quantum processors
- Fault-tolerant logical measurements via homological measurement
- Lift-Connected Surface Codes
- Adaptive Syndrome Extraction
- Demonstration of two-dimensional connectivity for a scalable error-corrected ion-trap quantum processor architecture
- Scalable Low-overhead Superconducting Non-local Coupler with Exponentially Enhanced Connectivity
- Fault-tolerant Quantum Error Correction Using a Linear Array of Emitters