Low-density parity-check representation of fault-tolerant quantum circuits
arXiv:2403.10268 · doi:10.1103/PhysRevResearch.7.013115
Abstract
In fault-tolerant quantum computing, quantum algorithms are implemented through quantum circuits capable of error correction. These circuits are typically constructed based on specific quantum error correction codes, with consideration given to the characteristics of the underlying physical platforms. Optimising these circuits within the constraints of today's quantum computing technologies, particularly in terms of error rates, qubit counts, and network topologies, holds substantial implications for the feasibility of quantum applications in the near future. This paper presents a toolkit for designing and analysing fault-tolerant quantum circuits. We introduce a framework for representing stabiliser circuits using classical low-density parity-check (LDPC) codes. Each codeword in the representation corresponds to a quantum-mechanical equation regarding the circuit, formalising the correlations utilised in parity checks and delineating logical operations within the circuit. Consequently, the LDPC code provides a means of quantifying fault tolerance and verifying logical operations. We outline the procedure for generating LDPC codes from circuits using the Tanner graph notation, alongside proposing graph-theory tools for constructing fault-tolerant quantum circuits from classical LDPC codes. These findings offer a systematic approach to applying classical error correction techniques in optimising existing fault-tolerant protocols and developing new ones. As an example, we develop a resource-efficient scheme for universal fault-tolerant quantum computing on hypergraph product codes based on the LDPC representation.
arXiv comment42 pages, 35 figures
References in corpus (50)
- Surface codes: Towards practical large-scale quantum computation
- Good Quantum Error-Correcting Codes Exist
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Quantum Error Correction for Quantum Memories
- Multiple Particle Interference and Quantum Error Correction
- Quantum Computing with Very Noisy Devices
- Suppressing quantum errors by scaling a surface code logical qubit
- Logical quantum processor based on reconfigurable atom arrays
- Topological Quantum Distillation
- Topological fault-tolerance in cluster state quantum computation
- Roads towards fault-tolerant universal quantum computation
- Surface code quantum computing by lattice surgery
- High-fidelity parallel entangling gates on a neutral atom quantum computer
- Operator Quantum Error Correcting Subsystems for Self-Correcting Quantum Memories
- High threshold universal quantum computation on the surface code
- Restrictions on Transversal Encoded Quantum Gate Sets
- High-threshold and low-overhead fault-tolerant quantum memory
- A fault-tolerant one-way quantum computer
- A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
- Topological Order with a Twist: Ising Anyons from an Abelian Model
- Quantum Error Correction: An Introductory Guide
- The Future of Quantum Computing with Superconducting Qubits
- Stabilizer Formalism for Operator Quantum Error Correction
- Quantum Low-Density Parity-Check Codes
- Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}
- Universal fault-tolerant quantum computation with only transversal gates and error correction
- Topological quantum computing with a very noisy network and local error rates approaching one percent
- Quantum error correction with only two extra qubits
- Efficient fault-tolerant quantum computing
- Dynamically Generated Logical Qubits
- Balanced Product Quantum Codes
- Poking holes and cutting corners to achieve Clifford gates with the surface code
- Quantum "hyperbicycle" low-density parity check codes with finite rate
- Foliated Quantum Codes
- Quantum Measurements and Gates by Code Deformation
- Low-overhead fault-tolerant quantum computing using long-range connectivity
- A magic state's fidelity can be superior to the operations that created it
- Homological Error Correction: Classical and Quantum Codes
- The ZX calculus is a language for surface code lattice surgery
- Clifford Gates by Code Deformation
- Floquet codes without parent subsystem codes
- Code Deformation and Lattice Surgery Are Gauge Fixing
- Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation
- Universal fault-tolerant measurement-based quantum computation
- Unifying flavors of fault tolerance with the ZX calculus
- Fault-tolerant gates on hypergraph product codes
- Universal logical gates with constant overhead: instantaneous Dehn twists for hyperbolic quantum codes
- Fold-Transversal Clifford Gates for Quantum Codes
- Graphical Structures for Design and Verification of Quantum Error Correction
- Generating Fault-Tolerant Cluster States from Crystal Structures