Fault-Tolerant Quantum Computing

Fault-tolerant quantum computing is the theoretical and engineering program to build quantum computers that can perform arbitrarily long computations despite noise, decoherence, and gate errors. The central result is the threshold theorem: if the physical error rate per gate is below a certain threshold, then logical qubits encoded with quantum error correction can suppress errors exponentially through concatenation or topological codes, making the computation reliable.

The threshold theorem is often misunderstood as a guarantee. It is not. It is an existence proof that assumes perfect classical control, infinite parallelism for error syndrome extraction, and error models that are local and stochastic. Real devices suffer from correlated errors, crosstalk, and drift that violate these assumptions. The gap between the theorem and the laboratory is the defining challenge of the field.

Current efforts focus on surface codes and other topological codes that tolerate high physical error rates (around 1%) but require enormous physical qubit overheads — thousands of physical qubits per logical qubit. This resource cost makes fault-tolerant quantum computing incompatible with the NISQ devices of today. The field is waiting for a hardware generation that does not yet exist.

The threshold theorem proves that fault tolerance is possible in principle; it does not prove that it is possible in practice. The history of engineering is littered with existence proofs that took decades to realize, and some that never were.