Beyond the Surface Code: qLDPC Codes
Higher rates with long-range connectivity.
A distance- surface code spends about physical qubits on a single logical qubit, and with local checks in 2D that inefficiency is unavoidable. Allow some long-range checks and the picture changes: quantum LDPC codes protect many logical qubits at once, and in 2021 codes with linear rate and linear distance were finally shown to exist.
What you’ll learn
- Define quantum LDPC codes and state the Bravyi–Poulin–Terhal bound that limits 2D-local codes.
- Construct hypergraph product codes, prove , and derive with the Künneth formula.
- Explain what "good" qLDPC codes are and how they were obtained.
- Describe bivariate bicycle codes, the gross code, and their decoding and connectivity requirements.
The price of locality
A quantum LDPC (qLDPC) code family is a family of stabilizer codes in which every check acts on at most qubits and every qubit lies in at most checks, with as . Bounded weight keeps syndrome circuits shallow and stops errors from spreading. The surface code is qLDPC, but its rate vanishes as the distance grows.
So in 2D any code with has , and protecting logical qubits at distance costs qubits: among local codes, the surface code is essentially optimal. Beating it requires checks that reach across the chip.
| Family | Parameters | Check weight | Geometry |
|---|---|---|---|
| Rotated surface code | 4 | 2D nearest-neighbor | |
| Hypergraph product of good classical LDPC codes | non-local | ||
| Good qLDPC codes (2021–22) | non-local (expander graphs) | ||
| Bivariate bicycle "gross" code | 6 | degree 6, two planar layers |
What does the Bravyi–Poulin–Terhal bound imply for a family of 2D-local codes with ?
- can grow linearly with
- cannot exceed
- stays bounded by a constant
- Such codes cannot exist
Show the answer
C. stays bounded by a constant
with forces . The surface code sits at this extreme: , .
Hypergraph product codes
How do you build a CSS code, which needs , from classical codes that satisfy no orthogonality condition at all? Tillich and Zémor's answer is a product. Take parity-check matrices and of classical codes , and let , be the dimension and distance of the transposed code (with if ).
Multiply block by block: has blocks (top) and (bottom).
Mixed-product rule . The two terms are equal, so over they cancel.
View a parity-check matrix as a two-term chain complex . Its homology is (dimension ) and (dimension ).
Let be the transposed complex of , with (dimension ) and (dimension ).
The tensor-product complex is exactly the CSS code: -checks, qubits and -checks in degrees 2, 1 and 0. Logical qubits are its degree-1 homology, .
Over a field, the homology of a tensor product is the tensor product of homologies (Künneth formula).
Feed in good classical LDPC codes (rate and distance both linear in , as random sparse or expander codes provide) and you get : constant rate, but the distance is stuck at , because the product has logical operators supported on a single row or column of the qubit grid.
Good codes and bivariate bicycle codes
For two decades it was open whether qLDPC codes could have both and , like good classical LDPC codes. Around 2020–21 a burst of constructions (fiber bundle, lifted product and balanced product codes) broke the distance barrier, and then:
Asymptotic goodness does not by itself make a practical code. The bivariate bicycle (BB) codes of Bravyi, Cross, Gambetta, Maslov, Rall and Yoder (2024) target small and realistic noise. Let be the cyclic shift matrix and set , : commuting matrices with . Choose and , each term a power of or of , and define
For comparison: how many physical qubits would 12 separate rotated surface-code patches of the same distance, , use at qubits each?
Show the answer
3444 qubits
, versus 288 for the gross code: about fewer at equal distance. (Bravyi et al. compare at equal logical error rate instead, and quote nearly 3000.)
The catch is connectivity. Each qubit talks to six others: four of these links can be laid out like a torus, but the other two reach across the lattice. The Tanner graph splits into two edge-disjoint planar layers, so a superconducting implementation needs long-range couplers in a second wiring layer, while neutral atoms (by moving atoms) and trapped ions (by shuttling) supply non-local interactions more naturally. Baspin and Krishna (2022) showed quantitatively that beating 2D-local code parameters requires many long-range interactions.
Decoding, logic and the frontier
Matching works only when each error flips at most two checks; qLDPC codes break that. Classical belief propagation (BP) also stumbles, because degeneracy creates many equally likely errors and short cycles confuse message passing. The workhorse is BP+OSD, belief propagation followed by ordered-statistics post-processing (Panteleev & Kalachev; Roffe et al.), which is accurate but costly, since OSD involves Gaussian elimination. Expander-based codes admit linear-time small-set-flip decoders with provable guarantees (Leverrier, Tillich & Zémor, 2015).
Computation is harder still: qLDPC codes rarely have useful transversal gates. Current proposals use code automorphisms, measurements of logical Paulis through auxiliary systems (generalizing lattice surgery; Cohen et al., 2022), and teleportation into surface-code or other ancilla blocks for non-Clifford gates. On the theory side, Gottesman (2014) showed that qLDPC codes of constant rate enable fault tolerance with constant space overhead.
Key takeaways
- In 2D with local checks (Bravyi–Poulin–Terhal): the surface code's qubits per logical qubit are essentially forced by locality.
- Hypergraph products turn any two classical codes into a CSS code with (Künneth) and ; the surface code is the product of two repetition codes.
- Good qLDPC codes with exist (Panteleev–Kalachev 2021; quantum Tanner codes).
- Bivariate bicycle codes such as promise roughly an order of magnitude fewer qubits than the surface code, at the price of degree-6, partly long-range connectivity and harder decoding and logic.
Check yourself
In the interactive lesson these are scored with your confidence, and what you miss comes back for review.
The Hamming code has a full-rank parity-check matrix . What are the parameters of the hypergraph product of with itself?
Show the answer
A.
. Full rank means , so , and .
What does it mean for a qLDPC code family to be good?
- It has a threshold above
- It can be laid out in 2D with local checks
- and , while check weights and qubit degrees stay bounded
- It has a transversal gate
Show the answer
C. and , while check weights and qubit degrees stay bounded
"Good" is the coding-theory notion: constant rate and linear distance. Bravyi–Poulin–Terhal shows such codes cannot be 2D-local.
Why do and define a valid CSS code for bivariate bicycle codes?
- Because and are symmetric matrices
- Because
- Because every check has even weight
- Because and are polynomials in the commuting shifts , , so mod 2
Show the answer
D. Because and are polynomials in the commuting shifts , , so mod 2
. Commuting and make the two terms equal, and they cancel over .
What is the main hardware cost of the gross code compared with the surface code?
- It needs a physical error rate of about
- Each qubit couples to six others, including long-range links that do not fit a single planar nearest-neighbor layout
- It needs no ancilla qubits, so readout must be much faster
- It requires qudits instead of qubits
Show the answer
B. Each qubit couples to six others, including long-range links that do not fit a single planar nearest-neighbor layout
The degree-6 Tanner graph has thickness 2: two planar layers, one of which contains long-range edges. Its threshold (about ) is comparable to the surface code's.
Further reading
- J.-P. Tillich & G. Zémor, "Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength", IEEE Trans. Inf. Theory (2014); arXiv preprint (2009).
- S. Bravyi, D. Poulin & B. Terhal, "Tradeoffs for reliable quantum information storage in 2D systems", Phys. Rev. Lett. 104, 050503 (2010).
- P. Panteleev & G. Kalachev, "Asymptotically good quantum and locally testable classical LDPC codes", Proc. STOC (2022); arXiv:2111.03654.
- S. Bravyi, A. W. Cross, J. M. Gambetta, D. Maslov, P. Rall & T. J. Yoder, "High-threshold and low-overhead fault-tolerant quantum memory", Nature 627, 778 (2024).
- N. P. Breuckmann & J. N. Eberhardt, "Quantum low-density parity-check codes", PRX Quantum 2, 040101 (2021).