Qubit ZooQuantum low-density parity-check (qLDPC) codes are a family of quantum error-correcting codes where each stabilizer check acts on a bounded number of qubits and each qubit participates in a bounded number of checks, regardless of code size. This sparsity enables asymptotically constant encoding overhead — potentially requiring only physical qubits per logical qubit — a dramatic improvement over the overhead of the surface code.
Figure
Description
Classical LDPC codes revolutionized telecommunications (5G, Wi-Fi, DVB-S2). Their quantum analogues face additional constraints: stabilizer checks must commute, which makes constructing good qLDPC codes far harder. The breakthrough came in 2021–2022 with several families achieving constant-rate, growing-distance codes:
- Hypergraph product codes (Tillich-Zémor 2014): [n,k,d] with and .
- Lifted product / balanced product codes (Breuckmann-Eberhardt 2021): Improved constructions with better distance scaling.
- Asymptotically good codes (Panteleev-Kalachev 2022): First codes with and — the qLDPC holy grail.
- Fiber bundle codes (Hastings, Haah, O’Donnell 2021): .
The key practical challenge is that qLDPC codes require non-local connectivity: each physical qubit must interact with a constant number of other qubits that may be far apart in any 2D layout. This conflicts with the local connectivity of superconducting and neutral-atom hardware, requiring either long-range couplers, atom shuttling, or modular architectures.
Stabilizer Formalism
A qLDPC code [n,k,d] is defined by a pair of sparse parity-check matrices and satisfying:
with column and row weights bounded by constants and independent of . The code parameters are:
- = number of physical qubits
- = number of logical qubits
- = minimum weight of a non-trivial logical operator
For asymptotically good codes: , , giving constant encoding rate .
Performance Metrics
| Metric | Value | Notes | Fidelity reference |
|---|---|---|---|
| Encoding rate | Constant rate (vs. for surface code) | panteleev-2022-asymptotically-good | |
| Distance | Linear distance for best constructions | panteleev-2022-asymptotically-good | |
| Check weight | 10–20 | Constant, independent of code size | — |
| Threshold (simulated) | ~1–5% | Depends on decoder and specific code family | — |
| Physical-to-logical overhead | vs. for surface code | — |
Scaling Considerations
- Connectivity: Non-local stabilizer checks are the main implementation barrier. Neutral atom shuttling and modular superconducting architectures are promising paths.
- Decoding: Belief-propagation + OSD decoders show good performance but latency is higher than surface-code decoders.
- Practical crossover: At small code sizes, surface codes still win due to local connectivity. qLDPC becomes advantageous at large where the rate savings dominate.