Clifford Group

The Clifford group is the set of all unitary operators that map Pauli group elements to Pauli group elements under conjugation. An $n$-qubit unitary $C$ is a Clifford gate if, for every Pauli operator $P \in \{I, X, Y, Z\}^{\otimes n}$, the conjugation $C P C^\dagger$ is also a Pauli operator (up to a phase of $\pm 1$ or $\pm i$). The Clifford group is generated by three gates: the Hadamard, the phase gate $S$, and the CNOT.

Generators and elements

The single-qubit Clifford group is generated by $H$ and $S$:

$H = \frac{1}{\sqrt{2}}\begin{pmatrix} 1 & 1 \\ 1 & -1 \end{pmatrix}, \quad S = \begin{pmatrix} 1 & 0 \\ 0 & i \end{pmatrix}$

Under conjugation by $H$: $HXH = Z$, $HZH = X$, $HYH = -Y$.

Under conjugation by $S$: $SXS^\dagger = Y$, $SZS^\dagger = Z$, $SYS^\dagger = -X$.

The single-qubit Clifford group has 24 elements (the symmetry group of the octahedron inscribed in the Bloch sphere). Adding the CNOT gate generates the full multi-qubit Clifford group.

Common Clifford gates include: all Pauli gates ($I$, $X$, $Y$, $Z$), the Hadamard ($H$), the phase gate ($S$) and its inverse ($S^\dagger$), CNOT, CZ, iSWAP, and SWAP.

The T gate ($R_z(\pi/4)$) is notably not a Clifford gate: $TXT^\dagger = \frac{1}{\sqrt{2}}(X + Y)$, which is not a Pauli operator.

The Gottesman-Knill theorem

The Gottesman-Knill theorem states that any quantum circuit consisting entirely of:

1. Clifford gates
2. Preparation of computational basis states
3. Measurements in the computational basis
4. Classical feedforward of measurement results

can be efficiently simulated on a classical computer in $O(n^2)$ time per gate, where $n$ is the number of qubits. This is because a Clifford circuit maps each Pauli operator to another Pauli operator, so the entire circuit can be tracked by keeping a table of $2n$ Pauli operators (the stabilizer tableau) rather than the full $2^n$-dimensional state vector.

This result means Clifford circuits alone cannot provide quantum advantage, despite producing highly entangled states. Entanglement is necessary but not sufficient for quantum speedup.

Clifford + T universality

Adding the T gate to the Clifford group produces a universal gate set. Any $n$-qubit unitary can be approximated to precision $\epsilon$ using $O(\log(1/\epsilon))$ T gates and a polynomial number of Clifford gates. In fault-tolerant quantum computing, Clifford gates are relatively cheap (implementable transversally or via lattice surgery), while T gates are expensive (requiring magic state distillation). The “T count” of a compiled quantum algorithm is therefore a primary measure of its fault-tolerant cost.

Role in error correction

The Clifford group is intimately connected to stabilizer codes, which are defined by their stabilizer group (a subgroup of the Pauli group). Encoding and decoding circuits for stabilizer codes are Clifford circuits. The Clifford structure also underlies randomized benchmarking, where random Clifford gates are used to characterize average gate fidelity.

Why it matters for learners

The Clifford group delineates the boundary between classically simulable and genuinely quantum computation. Understanding which gates are Clifford and which are not helps you reason about when quantum advantage is possible, why T gates dominate fault-tolerant resource estimates, and why randomized benchmarking uses Clifford gates. It is one of the most structurally important concepts in quantum computing theory.

See also

• Clifford Circuit
• Pauli Group
• T Gate
• Stabilizer Code
• Magic State Distillation