Quantum Computation (Caltech PHYS 219)
Prof. John Preskill, Caltech
Quantum error correction is the technology that stands between today's noisy NISQ hardware and tomorrow's fault-tolerant quantum computers. This page collects courses and tutorials covering surface codes, stabilizer codes, decoherence, and the threshold theorem.
Quantum states are extraordinarily fragile. A qubit interacting with its environment through heat, vibration, electromagnetic noise, or stray radiation will lose its coherence -- the property that makes quantum computation useful. This process, called decoherence, corrupts the computation before it can finish. Classical computers handle errors by redundancy: copy bits and take a majority vote. Qubits cannot be copied (the no-cloning theorem), so an entirely different approach is needed.
Quantum error correction encodes one logical qubit into many physical qubits and uses measurements called syndrome extraction to detect errors without reading the qubit's value directly. Correcting errors this way introduces overhead: every logical qubit requires hundreds or thousands of physical qubits, and every gate operation needs to be implemented fault-tolerantly so errors do not spread.
The threshold theorem gives reason for optimism. It proves that if the error rate per physical operation falls below a certain threshold (typically around 0.1-1% depending on the code), then adding more qubits actually reduces the logical error rate. Surface codes achieve this with nearest-neighbor interactions, making them the leading candidate for fault-tolerant quantum hardware. Reaching and sustaining below-threshold error rates across thousands of physical qubits is the defining engineering challenge of the current era.
Ranked by rating. Covers surface codes, stabilizer codes, fault-tolerant gates, and error mitigation for NISQ devices.
Prof. John Preskill, Caltech
John Watrous
DAMTP, University of Cambridge
Delft University of Technology (QuTech)
Delft University of Technology (QuTech)
MIT xPRO
Austin Fowler
Prof. Isaac Chuang and Prof. Peter Shor, MIT
Perimeter Institute Faculty and Visitors
Dr. Daniel Gottesman, Perimeter Institute
IBM Quantum / Qiskit Team
IQC Faculty, University of Waterloo
Delft University of Technology (QuTech)
Delft University of Technology (QuTech)
Delft University of Technology (QuTech)
Quantum Optics and Spectroscopy Group, University of Innsbruck
JQI Faculty, University of Maryland
Microsoft Quantum
MIT Physics Department
Microsoft Quantum Team
Chicago Quantum Exchange Faculty
Delft University of Technology (QuTech)
IBM Quantum
IBM Quantum
Brilliant.org
Prof. Will Zeng, Stanford
Error correction courses build from foundational ideas to the full machinery of fault-tolerant quantum computing.
The leading practical approach to fault-tolerant quantum computing. Physical qubits are arranged in a 2D lattice and errors are detected by measuring stabilizers on neighboring pairs. Surface codes tolerate error rates up to around 1% and require only local interactions.
A broad family of error-correcting codes defined by sets of Pauli operators whose joint eigenvalue is +1 for error-free states. The stabilizer formalism -- introduced by Daniel Gottesman -- provides an efficient way to describe and analyze a wide class of quantum codes including the surface code, the Steane code, and the Shor code.
A logical qubit is a fault-tolerant qubit encoded across multiple physical qubits. Computations are performed on logical qubits using fault-tolerant gate sets. The ratio of physical to logical qubits depends on the target error rate and the code used -- current estimates for practically useful logical qubits run from hundreds to thousands of physical qubits each.
A foundational result proving that if hardware error rates fall below a code-dependent threshold, fault-tolerant computation of arbitrary length is achievable. The theorem gives the entire field of quantum error correction its theoretical foundation and motivates the engineering push toward lower error rates.
The Clifford gate set -- which includes Hadamard, CNOT, and S gates -- can be implemented fault-tolerantly without extra overhead. But universal quantum computation also requires the T gate, which is not in the Clifford group. Magic state distillation is the leading method to produce high-fidelity T gate states from many noisy copies, enabling universal fault-tolerant quantum computing at large scale.
Full error correction requires more qubits than today's hardware provides. Error mitigation techniques -- zero-noise extrapolation, probabilistic error cancellation, symmetry verification -- reduce the impact of noise on NISQ circuits without requiring the full overhead of error correction. They are a practical bridge until fault-tolerant hardware arrives.
Step-by-step walkthroughs covering error correction and mitigation techniques.