QUITS: A modular Qldpc code circUIT Simulator
arXiv:2504.02673 · doi:10.22331/q-2025-12-05-1931
Abstract
To achieve quantum fault tolerance with lower overhead, quantum low-density parity-check (QLDPC) codes have emerged as a promising alternative to topological codes such as the surface code, offering higher code rates. To support their study, an end-to-end framework for simulating QLDPC codes at the circuit level is needed. In this work, we present QUITS, a modular and flexible circuit-level simulator for QLDPC codes. Its design allows users to freely combine LDPC code constructions, syndrome extraction circuits, decoding algorithms, and noise models, enabling comprehensive and customizable studies of the performance of QLDPC codes under circuit-level noise. QUITS supports several leading QLDPC families, including hypergraph product codes, lifted product codes, and balanced product codes. As part of the framework, we introduce a syndrome extraction circuit improved from Tremblay, Delfosse, and Beverland [Phys. Rev. Lett. 129, 050504 (2022)] that applies to all three code families. In particular, for a small hypergraph product code, our circuit achieves lower depth than the conventional method, resulting in improved logical performance. Using QUITS, we evaluate the performance of state-of-the-art QLDPC codes and decoders under various settings, revealing trade-offs between the decoding runtime and the logical failure rate. The source code of QUITS is available online.
19 pages, 6 figures. v2) Logical failure rate data updated
References in corpus (34)
- Surface codes: Towards practical large-scale quantum computation
- Topological quantum memory
- Logical quantum processor based on reconfigurable atom arrays
- Fault-tolerant quantum computation with high threshold in two dimensions
- Quantum error correction below the surface code threshold
- High threshold universal quantum computation on the surface code
- High-threshold and low-overhead fault-tolerant quantum memory
- Stim: a fast stabilizer circuit simulator
- Quantum Low-Density Parity-Check Codes
- Low-distance Surface Codes under Realistic Quantum Noise
- Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}
- Tradeoffs for reliable quantum information storage in 2D systems
- Decoding Across the Quantum LDPC Code Landscape
- Balanced Product Quantum Codes
- Sparse Blossom: correcting a million errors per core second with minimum-weight matching
- A theory of single-shot error correction for adversarial noise
- Constant-overhead quantum error correction with thin planar connectivity
- The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
- Improved decoding of circuit noise and fragile boundaries of tailored surface codes
- Parallel window decoding enables scalable fault tolerant quantum computation
- Combining hard and soft decoders for hypergraph product codes
- Demonstration of logical qubits and repeated error correction with better-than-physical error rates
- Finite Rate QLDPC-GKP Coding Scheme that Surpasses the CSS Hamming Bound
- Localized statistics decoding for quantum low-density parity-check codes
- Error correction of transversal CNOT gates for scalable surface code computation
- Distance-preserving stabilizer measurements in hypergraph product codes
- Analog information decoding of bosonic quantum LDPC codes
- Demonstration of quantum computation and error correction with a tesseract code
- Concatenated Steane code with single-flag syndrome checks
- Toward Low-latency Iterative Decoding of QLDPC Codes Under Circuit-Level Noise
- High-threshold, low-overhead and single-shot decodable fault-tolerant quantum memory
- Improved QLDPC Surgery: Logical Measurements and Bridging Codes
- Efficient Mitigation of Error Floors in Quantum Error Correction using Non-Binary Low-Density Parity-Check Codes
- Single-shot and two-shot decoding with generalized bicycle codes