In quantum computing, the Gottesman–Knill theorem is a theoretical result by Daniel Gottesman and Emanuel Knill that states that an important subclass of quantum circuits, called stabilizer circuits, can be efficiently simulated on a classical computer. Stabilizer circuits are circuits that only use gates from the normalizer of the qubit Pauli group; this is referred to as the Clifford group, though this has nothing to do with the Clifford algebra.
The Gottesman–Knill theorem was published in a single author paper by Gottesman in which he credits Knill with the result through private communication.
Theorem: A quantum circuit using only the following elements can be simulated efficiently on a classical computer:
- Preparation of qubits in computational basis states,
- Quantum gates from the Clifford group (Hadamard gates, controlled NOT gates, Phase Gate), and
- Measurements in the computational basis.
The Gottesman–Knill theorem shows that even some highly entangled states can be simulated efficiently. Several important types of quantum algorithms use only Clifford gates, most importantly the standard algorithms for entanglement purification and for quantum error correction. From a practical point of view, stabilizer circuits have been simulated in O(n log n) time using the graph state formalism.
- S. Anders and H. J. Briegel (2006). "Fast simulation of stabilizer circuits using a graph-state representation". Phys. Rev. A 73: 022334. arXiv:quant-ph/0504117v2. doi:10.1103/PhysRevA.73.022334.
- Quantum Computation and Quantum Information, Michael A. Nielsen, Isaac L. Chuang, Cambridge University Press, 2000