nLab Clifford group

Context

Group Theory

Computability

Quantum systems

quantum logic


quantum physics


quantum probability theory – observables and states


quantum information


quantum technology


quantum computing

This entry is about the notion in quantum information theory. For subgroups of a Clifford algebra see instead there.

Contents

Idea

In quantum information theory, by the Clifford group on nn-qbits (for n∈ℕ ≥1n \in \mathbb{N}_{\geq 1}) one means the normalizer subgroup, inside the unitary group U(2 n)U(2^n), of the group of nnfold ℂ\mathbb{C}-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 ℂ 2 n\mathbb{C}^{2^n}, is also called a Clifford quantum gate or just Clifford gate, for short.

Properties

Gottesman-Knill theorem

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.

Non-Clifford Magic

The Clifford group of quantum gates on nn qbits (the normalizer of the Pauli group in U(2 n)U(2^n), generated by the Hadamard gate HH, the phase gate S=diag(1,i)S = diag(1,\mathrm{i}) 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 T=diag(1,e πi/4)T = \mathrm{diag}(1, e^{\pi \mathrm{i}/4}) (but there are other reasonable choices, like the CCZ gate): The set Clifford+TT generates, up to global phase, a dense subgroup of SU ( 2 n ) SU(2^n) , so that every quantum circuit is efficiently approximated by Clifford+TT circuits (by the Solovay-Kitaev theorem).

The catch is that:

The now standard strategy to work around this problem, trades the missing gate for a resource state: TT-gates are enacted by gate teleportation, consuming magic states |A⟩=T|+⟩\vert A \rangle = T \vert + \rangle via a CNOT, a Z Z -measurement and a classically controlled SS-correction (which are all Clifford operations).

For more see at magic state.

References

General

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:

See also:

Realizing protected non-Clifford gates

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 ℤ 4\mathbb{Z}_4 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.