A quantum computer that can operate correctly even when its components have errors, using error correction.A fault-tolerant quantum computer is a quantum computer that can perform reliable calculations even though its physical qubits are prone to errors from decoherence, noise, and imperfect operations. Unlike classical computers, quantum errors are continuous and can affect both the value (bit flip) and the phase of a qubit. Fault tolerance is achieved by encoding logical qubits into many physical qubits using quantum error correction codes, and by designing operations that correct errors faster than they accumulate. This is essential for scaling quantum computers beyond small demonstrations to solve practical problems, as no physical qubit is perfect.
The concept of fault-tolerant quantum computation was introduced by Peter Shor in 1995, shortly after he discovered quantum error correction. The threshold theorem was proven by Dorit Aharonov and Michael Ben-Or in 1996, and later refined by others. The surface code, a leading candidate for practical fault tolerance, was developed in the early 2000s by Alexei Kitaev and others.
The core idea is redundancy: a logical qubit is encoded in a larger set of physical qubits, such as in the surface code, where information is spread across a lattice. Quantum error correction works by measuring parity checks (e.g., whether neighboring qubits are the same or different) without disturbing the encoded information. These measurements reveal errors, which are then corrected by applying appropriate operations. For fault tolerance, the error correction circuits themselves must be designed to be robust, using techniques like transversal gates and magic state distillation. The threshold theorem states that if the error rate per physical operation is below a certain threshold (typically around 1% for surface codes), then arbitrarily long computations are possible by adding more qubits.
Fault-tolerant quantum computers are the ultimate goal for running algorithms like Shor's factoring algorithm and simulating quantum systems, which require millions of error-corrected logical qubits. Current research focuses on building small demonstrations of error-corrected logical qubits, such as those by Google and IBM.
The error rate threshold for fault tolerance is so demanding that current quantum processors have error rates about 100 times too high, but recent experiments have shown that increasing the code size can reduce logical errors, a key milestone toward practical fault tolerance.














