Classical groups
Finite groups
Group schemes
Topological groups
Lie groups
Super-Lie groups
Higher groups
Cohomology and Extensions
Related concepts
constructive mathematics, realizability, computability
propositions as types, proofs as programs, computational trinitarianism
quantum algorithms:
This entry is about the notion in quantum information theory. For subgroups of a Clifford algebra see instead there.
In quantum information theory, by the Clifford group on -qbits (for ) one means the normalizer subgroup, inside the unitary group , of the group of fold -tensor products of linear operators from the Pauli group.
An element of the Clifford group, understood as a unitary operator on the finite-dimensional Hilbert space , is also called a Clifford quantum gate or just Clifford gate, for short.
The Gottesman-Knill theorem (Gottesman 1998, Aaronson & Gottesman 2004) states that quantum circuits which are built only from Clifford gates (“stabilizer circuits”) may be efficiently simulated on classical computers. Conversely this means that for a quantum computer to exhibit quantum advantage it must realize quantum gates which are non-Clifford gates. Such as the T-gate.
The Clifford group of quantum gates on qbits (the normalizer of the Pauli group in , generated by the Hadamard gate , the phase gate and the CNOT gate) is computationally weak: By the Gottesman-Knill theorem, Clifford quantum circuits acting on stabilizer states and followed by Pauli quantum measurements are efficiently simulable on a classical computer. But adjoining any one non-Clifford gate yields a universal gate set.
The prominent choice of that extra non-Clifford gate is the T-gate (but there are other reasonable choices, like the CCZ gate): The set Clifford+ generates, up to global phase, a dense subgroup of , so that every quantum circuit is efficiently approximated by Clifford+ circuits (by the Solovay-Kitaev theorem).
The catch is that:
The prominent topological quantum error-correcting codes like the surface code (lattice quantum simulations of topological order) protect only Clifford gates. And this is a problem of principle (Eastin & Knill 2009, Bravyi & König 2013).
Also actual topological quantum computation as long as its anyons are only of Ising type (such as expected, but not established, for the FQH states) yields exactly only the Clifford gates.
The now standard strategy to work around this problem, trades the missing gate for a resource state: -gates are enacted by gate teleportation, consuming magic states via a CNOT, a -measurement and a classically controlled -correction (which are all Clifford operations).
For more see at magic state.
The origin of the attention paid to the normalizer subgroup of the Pauli group inside the unitary group is (p 5 of):
Contrary to common claims, the term “Clifford group” for this normalizer subgroup seems to have emerged only in the following years.
Review:
Jiri Tolar: On Clifford groups in quantum computing, J. Phys.: Conf. Series 1071 (2018) 012022 [arXiv:1810.10259, doi:10.1088/1742-6596/1071/1/012022]
Kieran Mastel: The Clifford theory of the -qubit Clifford group [arXiv:2307.05810]
See also:
Wikipedia: Clifford group
Wikipedia: Gottesman-Knill theorem
Daniel Grier, Luke Schaeffer: The Classification of Clifford Gates over Qubits, Quantum 6 (2022) 734 [arXiv:1603.03999, doi:10.22331/q-2022-06-13-734]
George Biswas: Exploring Classical Simulation of Quantum Circuits of Clifford Gates through Simple Examples and Intuitive Insights [arXiv:2405.13590]
The practical issue of realizing fault-tolerant non-Clifford gates (either via quantum error correction or via topological error protection):
Marek Narożniak et al.: Quantum gates for Majoranas zero modes in topological superconductors in one-dimensional geometry, Phys. Rev. B 103 (2021) 205429 [doi:10.1103/PhysRevB.103.205429]
Ali Hamed Safwan, Raditya Weda Bomantara: Generating non-Clifford gate operations through exact mapping between Majorana fermions and parafermions [arXiv:2411.18736]
Wang Yifei et al.: Efficient fault-tolerant implementations of non-Clifford gates with reconfigurable atom arrays, npj Quantum Information 10 136 (2024) [doi:10.1038/s41534-024-00945-3]
Louis Golowich: Improved Fault-Tolerant Non-Clifford Gates (or: How to Multiply Quantumly), talk at IAS (March 03, 2025) [ias.edu, youtu.be]
Margarita Davydova et al.: Universal fault tolerant quantum computation in 2D without getting tied in knots [arXiv:2503.15751]
Microsoft Quantum: Non-Clifford operations, appendix D of: Roadmap to fault tolerant quantum computation using topological qubit arrays [arXiv:2502.12252, inSpire:2890977]
Last revised on October 10, 2026 at 09:52:59. See the history of this page for a list of all contributions to it.