Table of Contents

Pauli gates

Pauli gates (I, X, Y, Z) form the fundamental set of single-qubit gates that generate the Pauli group. They are Clifford gates with eigenvalues ±1 and well-defined commutation relations, making them essential for quantum error correction, measurement, and circuit decomposition. Any single-qubit unitary can be expressed as a linear combination of Paulis.

The four Pauli gates

Matrix representations

$$I = \begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix} \quad X = \begin{pmatrix} 0 & 1 \\ 1 & 0 \end{pmatrix} \quad Y = \begin{pmatrix} 0 & -i \\ i & 0 \end{pmatrix} \quad Z = \begin{pmatrix} 1 & 0 \\ 0 & -1 \end{pmatrix}$$

X and Z have eigenvalues $\pm 1$ with eigenvectors in the $x$ and $z$ bases; Y has eigenvalues $\pm 1$ with eigenvectors in the $x$-$z$ diagonal basis.

Commutation relations

The Pauli matrices satisfy:

Key properties

Special cases and relations to rotations

Pauli gates are special cases of rotation gates at $\theta = \pi$ (up to global phase):

More generally, Pauli matrices appear as generators in rotation exponentials: $R_i(\theta) = e^{-i\theta \sigma_i/2}$ where $\sigma_i$ is the corresponding Pauli.

Uses

Decomposition and completeness

Any $2 \times 2$ Hermitian matrix can be decomposed as $H = a_0 I + a_1 X + a_2 Y + a_3 Z$. For Hermitian observables, this means any single-qubit measurement decomposes into Pauli measurements:

$$\langle \psi | H | \psi \rangle = a_0 + a_1 \langle X \rangle + a_2 \langle Y \rangle + a_3 \langle Z \rangle$$

This is the basis for Pauli measurement grouping in quantum algorithms.

Implementation

Relations