Quantum LDPC Codes: Overview
Low-density parity-check quantum codes keep every check and every qubit involved in only a few others, promising high rate with bounded measurement weight.
What low-density means
A quantum LDPC code is a stabilizer code whose parity-check (stabilizer) matrix is sparse: every stabilizer acts on a bounded number of qubits and every qubit participates in a bounded number of stabilizers, independent of the code size. The surface code is technically LDPC, since its checks are weight four, but the term usually refers to codes that keep this locality while achieving a constant encoding rate.
Why they are wanted
The surface code protects one logical qubit per patch, so a machine with thousands of logical qubits needs an enormous number of physical qubits. Good quantum LDPC codes aim for a constant ratio of logical to physical qubits and a distance that grows with size, which would cut the qubit overhead of fault tolerance by a large factor.
- Bounded check weight keeps syndrome-extraction circuits shallow.
- Constant rate means logical qubits scale with physical qubits, not slower.
- The challenge is connectivity: good LDPC codes need non-local qubit coupling.
- Decoding is harder than matching because the code is not planar.
The theoretical breakthrough was the construction of good quantum LDPC codes, families with both constant rate and distance proportional to the number of qubits. These are built from hypergraph products and their generalizations such as lifted and balanced products.
The practical obstacle is hardware. Unlike the surface code, these codes require each qubit to interact with partners that are not geometric neighbors, which suits architectures with reconfigurable connectivity, such as neutral atoms that can be moved, or photonic and modular systems, better than a fixed 2D superconducting grid. Bridging that gap is an active engineering frontier.