Curriculum / Noise & Error Correction / LDPC Quantum Codes
LDPC Quantum Codes
Introduction to low-density parity-check codes and their quantum extensions.
LDPC Codes: Sparse Parity Checks for Quantum Error Correction
Low-Density Parity Check (LDPC) codes are a class of error correcting codes where each parity check involves only a small (constant) number of qubits, and each qubit participates in only a small number of parity checks. This sparsity enables efficient decoding and potentially better asymptotic performance than surface codes.
Why LDPC matters for quantum computing:
Surface codes have excellent thresholds but poor encoding rate: only 1 logical qubit per O(d²) physical qubits. LDPC codes can achieve constant encoding rate (k/n → constant as n → ∞) while still having good distance. This is critical for the long-term overhead of quantum computing.
| Code family | Encoding rate k/n | Distance | Qubit overhead per logical |
|---|---|---|---|
| Surface code | O(1/n) | O(√n) | O(d²) per logical |
| Classical LDPC | O(1) | O(n) | O(1) per logical |
| Quantum LDPC | O(1) | O(n^α) | O(1) per logical (recent breakthroughs) |
Classical LDPC basics:
A classical LDPC code is defined by a sparse bipartite graph (Tanner graph):
- •Variable nodes = code bits (left)
- •Check nodes = parity constraints (right)
- •Edges = which bits participate in which checks
A codeword satisfies all parity constraints. The code is "low-density" because each check involves only bits (check degree), and each bit participates in checks (variable degree). This sparsity enables efficient belief propagation (message passing) decoding.
Classical LDPC codes achieve both constant rate and linear distance simultaneously. For decades, quantum LDPC codes were stuck at sublinear distance. In 2020-2023, a series of breakthroughs (Leverrier-Zémor, Panteleev-Kalachev, Dinur et al.) constructed quantum LDPC codes with constant rate AND linear distance: the quantum analogue of the best classical codes. These 'good quantum LDPC codes' could dramatically reduce the overhead for fault-tolerant quantum computing compared to surface codes.
This is the opening of the lesson. The full walkthrough, the interactive circuit, and the graded challenge continue inside myqubit.
How this lesson works
A guided reading lesson with interactive knowledge checks. Concepts are explained step by step with circuit diagrams and runnable examples, and you confirm understanding before moving on.
Part of: Noise & Error Correction
Understand quantum noise and build error correction codes to protect quantum information.
This lesson is part of Pro
Unlock Noise & Error Correction and all 10 tracks with Pro: $12.99/month, $79/year, or $97 lifetime. Start with the free track first if you are new.