Error Correction

Noise and Decoherence: What Actually Goes Wrong on Real Qubits

Every tutorial up to here pretended qubits are perfect. They aren't. This tutorial covers the four main noise processes every quantum dev should know cold — relaxation, dephasing, depolarization, and readout error — with their Kraus operator forms, their T₁/T₂ signatures, and a runnable Qiskit experiment that measures them on a real device.

intermediate · ~22 min · prereq: Gates & Circuits track

The Surface Code and Willow: What Below-Threshold Actually Means

Google's Willow chip (December 2024) was the first demonstration of a quantum error-correcting code with errors that decrease as you add qubits — the 'below threshold' result the field had chased for 30 years. This tutorial explains what the surface code is, why the threshold theorem matters, and what Willow's numbers imply for the path to fault-tolerant quantum computing.

advanced · ~25 min · prereq: Tutorial 18: Noise and Decoherence

Magic State Distillation: Where Fault-Tolerant Quantum Computers Actually Spend Their Qubits

The surface code makes Clifford gates cheap and T gates expensive — and a real fault-tolerant machine spends most of its qubits manufacturing the T gates. This tutorial builds magic state distillation from Bravyi-Kitaev 2005, walks through the 15-to-1 factory and what it actually costs in resource estimates, and dates the 2024-2026 frontier where the textbook story finally meets logical hardware.

advanced · ~22 min · prereq: Tutorial 19: The Surface Code and Willow

The Clifford Group: The Easy Half of Quantum Computing

Half of the standard quantum gate library — H, S, CNOT, and everything they generate — is in a special set called the Clifford group. Clifford circuits are universal-looking but classically simulable, transversal on stabilizer codes, and the reason fault-tolerant quantum computing splits cleanly into 'easy' and 'expensive' work. This tutorial defines the group, proves the simulation result, and shows why this asymmetry shapes every real fault-tolerant roadmap.

intermediate · ~18 min · prereq: Tutorial 5: Pauli, Phase, Rotation Gates, Tutorial 24: Magic State Distillation

The Eastin-Knill Theorem: Why No Quantum Code Can Have a Universal Transversal Gate Set

Eastin-Knill is the structural reason fault-tolerant quantum computing is hard. It proves that no error-correcting code admits a universal set of transversal gates — so every code architecture has at least one universal-gate-set member that is non-transversal and must be implemented by a fault-tolerant workaround. This tutorial states the theorem precisely, gives the dimensional-argument proof sketch, and surveys the four workarounds that fill the gap.

advanced · ~17 min · prereq: Tutorial 25: The Clifford Group

Resource Estimation: How to Compute the Qubit-Time Cost of a Fault-Tolerant Algorithm

Resource estimation is the practical discipline that turns a logical-circuit description into a concrete physical-qubit and wall-clock-time budget. This tutorial walks through the standard methodology — logical gate count, Toffoli decomposition, magic-state factory sizing, surface-code overhead — and rebuilds the canonical Gidney-Ekerå RSA-2048 estimate from first principles, with a working Python calculator you can adapt to your own algorithm.

advanced · ~20 min · prereq: Tutorial 24: Magic State Distillation, Tutorial 26: The Eastin-Knill Theorem

qLDPC Codes: The Surface Code Successor That Already Cuts Qubit Overhead by 10x

The surface code's d² qubit overhead is the dominant constant in every fault-tolerant resource estimate. Quantum low-density parity check codes — qLDPC — achieve the same logical error rates with overhead that scales like d, often translating to 10x fewer physical qubits per logical qubit at useful code sizes. This tutorial covers the 2021-2024 breakthroughs (Panteleev-Kalachev, Bravyi-Cross IBM bicycle codes), the connectivity tradeoffs, and IBM's Starling roadmap built around them.

advanced · ~19 min · prereq: Tutorial 19: The Surface Code and Willow, Tutorial 27: Resource Estimation