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.
42 pages, 35 figures
References in corpus (22)
- Surface codes: Towards practical large-scale quantum computation
- 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
- High-fidelity parallel entangling gates on a neutral atom quantum computer
- Restrictions on Transversal Encoded Quantum Gate Sets
- High-threshold and low-overhead fault-tolerant quantum memory
- Topological Order with a Twist: Ising Anyons from an Abelian Model
- The Future of Quantum Computing with Superconducting Qubits
- Quantum Low-Density Parity-Check Codes
- Topological quantum computing with a very noisy network and local error rates approaching one percent
- Dynamically Generated Logical Qubits
- Balanced Product Quantum Codes
- Foliated Quantum Codes
- 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
- Floquet codes without parent subsystem codes
- Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation
- Unifying flavors of fault tolerance with the ZX calculus
- Fold-Transversal Clifford Gates for Quantum Codes