The Surface Code
The surface code protects one logical qubit with a 2D grid of physical qubits linked only by local parity checks between nearest neighbours — the connectivity flat superconducting chips already have. Vendors converged on it because it tolerates physical error rates on the order of 1%, an unusually forgiving threshold, and because you scale it by simply making the patch bigger.
Why did the industry converge on the surface code?
Dozens of quantum error-correcting codes exist. One family dominates the engineering roadmaps of superconducting-qubit vendors: the surface code, descended from Alexei Kitaev's 1997 toric code. Three properties explain the convergence.
- Locality. Every parity check (see stabilizers and syndromes) involves only a qubit's immediate neighbours on a 2D grid. No long-range interactions, no crossing wires. That matches what a flat chip can actually do — see connectivity and topology.
- A forgiving threshold. Every code has a break-even physical error rate below which adding more qubits helps rather than hurts. The surface code's is on the order of 1% — published estimates fall around 0.5–1% depending on the noise model — which is orders of magnitude more tolerant than the concatenated codes of the 1990s demanded, and within reach of today's best hardware.
- Smooth scaling. Want more protection? Make the patch bigger. No redesign, just more of the same tiles.
Status, stated plainly: the theory is proved, and the code has been demonstrated at small scale on real hardware (details at the end of this chapter). Nobody yet operates the large many-logical-qubit surface-code machines the roadmaps describe.
You’ve read the opening of chapter 8 — 7 more sections follow, with worked examples and circuits you can run on the page. A free account unlocks every chapter of every course (paid plans aren’t live yet — early readers get everything free).