A Theory of Fault-Tolerant Quantum Computation
Daniel Gottesman
TL;DR
The work develops a general theory of fault-tolerant quantum computation for stabilizer codes by organizing encoded operations around the stabilizer $S$ and its normalizer $N(S)$, with encoded gates characterized by the quotient $N(S)/S$ and by transversal actions generated by $R$, $P$, and CNOT. It shows how transversal gates, measurements, ancillas, and teleportation can realize universal computation for any stabilizer code, including explicit constructions for CSS codes, the five-qubit code, and the 8-qubit code, and it provides concrete methods for implementing Toffoli gates via the normalizer and measurement-based protocols. The results clarify when bitwise operations preserve code spaces, establish that CSS codes support a natural set of fault-tolerant gates, and extend universal fault-tolerant strategies to distance-2 codes and beyond. Overall, the paper offers a scalable, code-agnostic framework for achieving universal fault-tolerant quantum computation across stabilizer codes, with practical implications for resource efficiency and code design.
Abstract
In order to use quantum error-correcting codes to actually improve the performance of a quantum computer, it is necessary to be able to perform operations fault-tolerantly on encoded states. I present a general theory of fault-tolerant operations based on symmetries of the code stabilizer. This allows a straightforward determination of which operations can be performed fault-tolerantly on a given code. I demonstrate that fault-tolerant universal computation is possible for any stabilizer code. I discuss a number of examples in more detail, including the five-qubit code.