Fault-Tolerance Thresholds

Understand the threshold theorem and what it means for scalable quantum computing.

Fault-Tolerant Quantum Computing

Fault-tolerant quantum computing (FTQC) is the paradigm in which quantum algorithms run reliably despite noisy physical hardware. It combines error correcting codes, careful circuit design, and a fundamental threshold theorem to guarantee that sufficiently low error rates enable arbitrarily long computations.

The threshold theorem:

If the physical error rate p_phys < p_threshold, then:

•Quantum computations of arbitrary length can be performed
•Logical error rate can be reduced to any target ε by using larger codes
•The overhead is poly-logarithmic in 1/ε and circuit size

This is a qualitative phase transition: below threshold, fault-tolerant quantum computing is possible; above threshold, errors cascade faster than correction can catch.

Hardware	Typical $p_{phys}$	$p_{threshold}$	Status
Superconducting	0.1-0.5%	~1% (surface)	Below threshold
Ion trap	0.01-0.1%	~1% (surface)	Well below threshold
Photonic	0.1-1%	~5% (some codes)	Near threshold

The magic threshold: why 1% matters

The ~1% threshold for surface codes comes from a detailed analysis of syndrome measurement errors, gate errors, and decoder performance. At $p_{phys} = 0.5%$ , one doubling of code distance roughly squares the logical error rate. At $p_{phys} = 0.1%$ , each additional code level reduces errors much faster. This is why Google's recent quantum error correction experiments show 'below threshold' behavior: $p_{L}$ decreases as d increases, not increases. Achieving this crossing is a milestone for practical fault-tolerant computing.

Error propagation and fault tolerance:

Not all circuit designs are fault-tolerant. The danger: errors can propagate through gates and multiply:

•A single-qubit error before a CNOT can produce a 2-qubit correlated error
•A 2-qubit error may exceed the code's correction capacity
•One bad gate can cascade to logical failure

Fault-tolerant circuit design rules:

1.Transversal gates: apply the same gate independently to each qubit position — errors don't spread between qubits
2.Ancilla verification: measure ancilla states before use to catch preparation errors
3.Syndrome measurement repetition: repeat syndrome measurements to detect measurement errors
4.Magic state injection: for non-Clifford gates (like T), use verified "magic states" rather than direct gate application

This is the opening of the lesson. The full walkthrough, the interactive circuit, and the graded challenge continue inside myqubit.

How this lesson works

A guided reading lesson with interactive knowledge checks. Concepts are explained step by step with circuit diagrams and runnable examples, and you confirm understanding before moving on.

Part of: Noise & Error Correction

Understand quantum noise and build error correction codes to protect quantum information.

Previous lessonSurface Codes Next lessonMagic State Distillation

This lesson is part of Pro

Unlock Noise & Error Correction and all 10 tracks with Pro: $12.99/month, $79/year, or $97 lifetime. Start with the free track first if you are new.

Create account Try the Playground