Fault Tolerance Thresholds
A single stray cosmic ray, a tiny fluctuation in temperature, or even a rogue electron can flip a qubit's state and corrupt a quantum calculation. Classical computers deal with errors too, but quantum errors are stranger and harder to catch โ which is why quantum computing has a specific, calculated number called the fault tolerance threshold that determines whether a quantum computer can ever be trusted to run a long, useful program.
What You'll Learn
- Why quantum bits (qubits) are especially fragile - What the fault tolerance threshold theorem actually claims - How quantum error correction uses extra qubits to protect information - Why current quantum computers are still working toward the practical threshold
Why Qubits Break So Easily
A classical bit is either 0 or 1, and mostly stays put unless deliberately flipped. A qubit exists in superposition, a combination of 0 and 1 states, and that fragile combination can be disturbed by heat, electromagnetic noise, or interactions with nearby atoms โ a process called decoherence. Today's best qubits maintain their state for only fractions of a second before errors creep in.
The Threshold Theorem
In the late 1990s, researchers including Peter Shor, Dorit Aharonov, and John Preskill proved something remarkable: the Threshold Theorem. It states that if the error rate per quantum gate operation can be pushed below a certain percentage โ the fault tolerance threshold โ then quantum error correction can, in principle, suppress errors indefinitely, no matter how long or complex the computation. Estimates for this threshold typically range between roughly 0.1% and 1% error per operation, depending on the error-correcting code used.
Think of it like static on a phone call: below a certain noise level, you can still understand every word even on a long call. Above that level, the call becomes unintelligible no matter how hard you focus. The threshold is the noise level where usable communication becomes possible.
How Error Correction Works
Quantum error correction doesn't copy a qubit's exact state (that's actually forbidden by the no-cloning theorem). Instead, it spreads one 'logical' qubit's information across many physical qubits, so that if one physical qubit fails, the rest can vote to detect and fix the error without ever directly measuring the fragile quantum state itself. The surface code, one popular error-correction scheme, can require anywhere from dozens to over a thousand physical qubits to reliably protect a single logical qubit.
Where the Industry Stands Today
As of the mid-2020s, leading quantum computers from companies like IBM, Google, and IonQ have physical gate error rates hovering close to, but often still above, practical fault tolerance thresholds for the most efficient codes. Google's 2023 and 2024 experiments demonstrated that adding more physical qubits per logical qubit could reduce logical error rates, an important sign that crossing the threshold at scale is achievable, though building a fully fault-tolerant, useful quantum computer still requires thousands of high-quality physical qubits per logical qubit.
What does the fault tolerance threshold theorem claim?
Why can't quantum error correction simply copy a qubit's state the way classical computers copy bits?
Model a Simple Error-Correcting Code
Using 3 coins to represent 3 physical qubits standing in for one logical qubit, set all three to the same side (all heads = logical 0). Have a partner secretly flip exactly one coin without telling you which. Use a 'majority vote' (whichever side shows on 2 or more coins) to detect and correct the error. Repeat 5 times, recording whether majority vote successfully identified the flipped coin each time, and write a paragraph explaining how this models real quantum error correction.
Want to keep learning?
Sign up for free to access the full curriculum โ all subjects, all ages.
Start Learning Free