Part V · Reality — 10

Error Correction

Noise is inevitable — so qubits must be protected. But the two obvious defenses are both banned: you can’t copy an unknown qubit (chapter 7a), and you can’t look at it to check (chapter 03). Quantum error correction threads that needle — spotting and fixing errors without ever reading the data.

↩ before you start · keep these handy

·From Ch. 9: noise can flip a qubit (an X error) or scramble its phase (a Z error). We tackle bit-flips here.

·From No-Cloning & Ch. 3: you may not copy an unknown qubit, and reading it collapses it.

·From Ch. 5: X flips a qubit; doing X twice returns it to where it started.

🔑 symbol decoder · every new mark, in plain words

|ψ⟩ₜthe logical qubit — one bit of meaning spread across three physical qubits. α|000⟩ + β|111⟩how it’s stored: not three copies, one entangled state where all three agree. Z₁Z₂a parity check ("stabilizer") — asks "do qubits 1 and 2 match?" without reading their value. syndromethe pair of parity answers — a 2-bit address pointing at the broken qubit. thresholdthe error rate you must beat per gate before adding qubits helps instead of hurts.

feel

Guarding a secret you can’t look at

The escape is to stop storing the information in any single qubit. Spread one logical qubit across three physical ones — not as copies (that’s forbidden), but woven together so the meaning lives in how they agree. Then you never ask “what value is qubit 2?” You ask only “do qubits 1 and 2 still match?” — a question about agreement, not content. That single clever shift is the whole idea.

🤝 everyday picture

Three friends are told a secret word and sent into separate rooms. You’re not allowed to ask any of them the word (that would let it leak). But you are allowed to ask two of them, through the wall: “does your word match your neighbour’s?” If friends 1&2 say match but 2&3 say differ, you know friend 3 mis-heard — without ever learning the word. Tell friend 3 to fix theirs and the secret is whole again.

recapStore the meaning in how qubits agree, then ask only about agreement — never about the value itself.

play

Inject a flip, catch it blind

The logical qubit α|000⟩ + β|111⟩ is stored below. Click a qubit to hit it with a bit-flip. Two parity checks — “does 1=2?” and “does 2=3?” — light up a syndrome that pinpoints the culprit without ever revealing α or β. Then correct it.

▸ 3-qubit bit-flip code|ψ⟩ₜ = α|000⟩ + β|111⟩

syndrome — parity checks
{{ c.label }}{{ c.val }}

diagnosis
{{ diag }}

recapTwo parity checks form a 2-bit syndrome that names the flipped qubit — and α, β are never measured.

math

Measure the parity, not the value

The two checks are the operators Z₁Z₂ and Z₂Z₃ — the stabilizers. They report whether neighbouring qubits agree, and crucially they commute with the logical information, so reading them disturbs nothing. The two answers form a 2-bit address of the error:

(+ , +) → no error
(− , +) → flip on qubit 1
(− , −) → flip on qubit 2
(+ , −) → flip on qubit 3

Apply the matching X and the error undoes itself. This three-qubit code only catches bit-flips; stack it with a phase-flip version and you get Shor’s nine-qubit code — and modern surface codes scale the same idea across a whole lattice.

✎ worked example · qubit 2 gets flipped

check Z₁Z₂ (do 1,2 match?): qubit 2 is wrong, so 1≠2 → − differ.
check Z₂Z₃ (do 2,3 match?): qubit 2 is wrong, so 2≠3 → − differ.
syndrome (− , −): only qubit 2 sits in both broken checks — it’s the culprit.
apply X to qubit 2 → all three agree again, α|000⟩ + β|111⟩ restored. We never learned α or β. ✓

recapStabilizers Z₁Z₂, Z₂Z₃ read parity (which commutes with the data), so they locate an error without touching the meaning.

⚠ common misconception

“No-cloning makes quantum error correction impossible.” It would — if the code copied the qubit. It doesn’t. α|000⟩+β|111⟩ is a single entangled state, not three copies of α|0⟩+β|1⟩; and the syndrome reads only parities, never α or β. Both bans stay intact.

The catch: correction only wins if your physical qubits are already good enough. Below a certain error rate per gate — the fault-tolerance threshold — adding more physical qubits drives the logical error down. Above it, you just add more things to break. That threshold is what the hardware of the final chapter is racing to beat.

✓ you can now

✓explain why error correction stores a qubit across many, in how they agree — not as copies

✓read a 2-bit syndrome and name which physical qubit flipped, then fix it

✓say why no-cloning and measurement-collapse both survive — and what the threshold means

← 09 Noise & Decoherence next · 11 Hardware →