The Quantum Investor's Notebook logo The Quantum Investor's Notebook
← Back

Wednesday, June 10, 2026

Quantum Error Correction: Fixing What You Cannot Look At

Classical computers fix errors by copying the data and taking a vote. In a quantum computer you are allowed to do neither. Quantum error correctionTechniques that combine many shaky physical qubits into fewer reliable ones, so a long calculation stays correct. is the art of fixing mistakes you may not copy and may not even look at.

The paradox

Start with the problem. A qubitThe basic unit of a quantum computer. Like a 'bit' in a normal computer, but instead of being only 0 or 1 it can be 0, 1, or a blend of both at once. is fragile; the faintest contact with its surroundings corrupts it, a process called decoherenceThe loss of a qubit's quantum information as it interacts with the outside world. The main reason qubits are fragile..1 A classical machine shrugs this off by keeping spare copies and taking a majority vote when one disagrees.

You have to find and fix errors in data you are never allowed to read.

Quantum mechanics forbids exactly that. You cannot copy an unknown quantum stateThe full description of a quantum system's condition at a moment in time, such as whether a qubit is 0, 1, or a mix., so there are no spare copies to vote with. And you cannot inspect a qubit to check whether it slipped, because looking collapsesThe instant a measurement forces a qubit from a blend of possibilities into one definite classical value. it and destroys the very information you were guarding.1 You have to find and fix errors in data you are never allowed to read.

The error-correction cycle. One logical qubit is a cluster of physical qubits; when one picks up an error, a syndrome check identifies which qubit slipped without reading the protected data, the error is fixed, and the cycle repeats.
Figure 1: The error-correction cycle. A syndrome check finds which physical qubit slipped without ever reading the protected data; the error is corrected, and the loop runs again every cycle.

Spread it out, and measure the error, not the data

The escape is to stop keeping the information in any one place. You spread a single logical qubitA reliable 'qubit' built by bundling many error-prone physical qubits together with error correction. These are the units that actually matter for useful computing. across many physical qubitsAn actual piece of qubit hardware. On its own it is fragile and makes frequent errors., storing it in the correlations among them, so no one qubitThe basic unit of a quantum computer. Like a 'bit' in a normal computer, but instead of being only 0 or 1 it can be 0, 1, or a blend of both at once. holds the whole answer.2 Shor's founding 1995 scheme spread one qubit across nine, and showed that if one of the nine slipped, the original could still be rebuilt.1 The cleverness is in the checking: with a handful of extra helper qubits you run syndrome measurementsExtra measurements that reveal whether and where an error happened, without reading the protected quantum information itself. that ask only one thing, did an error happen and where, and the answer never reveals the protected value itself.3

Once the syndrome points to the fault, you reverse it, and the encoded qubit lives on. Run that loop without pause and you are doing something quietly remarkable: pumping disorder out of the machine, qubit by qubit, faster than the environment pours it in.3

The threshold, and the proof

There is a catch, and it is the whole game. The error-correcting machinery is itself made of noisy qubits, so adding more of them can introduce errors faster than it removes them. The threshold theorem draws the line: as long as the physical error rate sits below a critical value, making the code larger drives the logical error rate down exponentially; above it, more hardware only makes things worse.3 For the leading scheme, the surface codeThe leading error-correction scheme for superconducting qubits. It needs many physical qubits to protect one logical qubit., that threshold sits near 1 percent.3

Below the threshold, more qubits means fewer errors. Above it, more qubits just means more.

For decades this was theory. Recently it became real: a logical qubit on actual hardware was driven below threshold, improving as the code grew instead of decaying.4 The price is brutal, a single reliable logical qubit demanding thousands of physical ones,3 which is also why a bare qubit countThe raw number of physical qubits in a machine. A weak measure of power on its own, since quality and connectivity matter more. tells you so little. But there is no way around it. Error correctionTechniques that combine many shaky physical qubits into fewer reliable ones, so a long calculation stays correct. is the most important engineering program in the field: without it a machine is bounded by noise to short, shallow tasks; with it, and only with it, you cross into fault toleranceThe milestone where a quantum computer can run long calculations correctly despite ongoing errors. It is the field's holy grail. and a long algorithm can run to the end.

Sources

  1. Shor, P. W. “Scheme for Reducing Decoherence in Quantum Computer Memory.” Physical Review A 52, R2493–R2496 (1995). DOI: 10.1103/PhysRevA.52.R2493.
  2. Devitt, S. J., Munro, W. J. & Nemoto, K. “Quantum Error Correction for Beginners.” Reports on Progress in Physics 76, 076001 (2013). DOI: 10.1088/0034-4885/76/7/076001. Preprint: arXiv:0905.2794.
  3. Terhal, B. M. “Quantum Error Correction for Quantum Memories.” Reviews of Modern Physics 87, 307–346 (2015). DOI: 10.1103/RevModPhys.87.307.
  4. Google Quantum AI. “Quantum Error Correction Below the Surface Code Threshold.” Nature 638, 920–926 (2025). DOI: 10.1038/s41586-024-08449-y. Preprint: arXiv:2408.13687.