Gates & Circuits
Pauli Gates (X, Y, Z)
A set of three fundamental single-qubit gates — X (bit flip), Y, and Z (phase flip) — named after physicist Wolfgang Pauli.
Definition
The Pauli gates are three of the most basic single-qubit quantum gates. The X gate acts like a classical NOT gate, flipping |0⟩ and |1⟩. The Z gate flips the sign of the |1⟩ amplitude without changing measurement probabilities directly. The Y gate combines aspects of both.
In depth
The Pauli gates are three of the simplest and most useful single-qubit operations: X, Y, and Z. The X gate is the quantum NOT, swapping 0 and 1. The Z gate leaves 0 alone and puts a minus sign on 1, a phase flip. The Y gate does both, up to a factor of i. On the Bloch sphere, each is a half turn about the corresponding axis. Together with the identity they form the Pauli group, and any single-qubit operator can be written as a combination of them.
Their algebra is what makes them powerful. They square to the identity, and they anticommute: applying X then Z gives the opposite sign to Z then X. Because of that, they do not share eigenstates, and a qubit cannot have definite values for X, Y, and Z at once, which is the uncertainty principle for qubits. Each Pauli has eigenvalues plus and minus 1, so measuring in the X, Y, or Z basis is the standard set of qubit measurements.
Paulis dominate quantum computing in three roles. Hamiltonians for chemistry and optimization are written as sums of products of Paulis, called Pauli strings, and measuring such a Hamiltonian means measuring each string. Errors are modeled as Paulis: a bit flip is X, a phase flip is Z, and a combined flip is Y, and error-correcting codes are defined by Pauli stabilizers. And Pauli gates are cheap and exact: they are Clifford gates, and in many codes they can be tracked in software instead of being applied, a technique called Pauli frame tracking.
Technical Definition
Represented as 2×2 matrices, X = [[0,1],[1,0]], Z = [[1,0],[0,-1]], and Y = [[0,-i],[i,0]]. Together with the identity matrix, these four matrices form a basis that can describe any single-qubit operation and are foundational to describing quantum error types (bit-flip and phase-flip errors).
Visual Explanation: An Analogy
Think of the X gate like flipping a coin from heads to tails, while the Z gate is more subtle — like marking the 'tails' side with an invisible minus sign that doesn't change what you see when you look at the coin, but does change how it interacts in further calculations.
Key facts
| Item | Detail |
|---|---|
| Matrices | X is the bit flip, Z the phase flip, and Y equals i times X times Z |
| Eigenvalues | Plus and minus 1 for each |
| Algebra | Square to identity and anticommute with each other |
| Pauli strings | Products of Paulis on many qubits, the building blocks of Hamiltonians and stabilizers |
| Named after | Wolfgang Pauli, who introduced the matrices for electron spin in 1927 |
Where the idea comes from
Wolfgang Pauli introduced the matrices in 1927 to describe electron spin. They became the standard basis for qubit operators, and Gottesman's stabilizer formalism of the 1990s made them the foundation of error correction.
Real-World Use Cases
- X gates and Z gates describe the two fundamental error types in quantum error correction (bit-flip and phase-flip errors)
- Used throughout quantum circuit constructions as basic building blocks
- The Mini Quantum Circuit Builder tool on this site lets you experiment with X and Z gates directly
How it differs from related ideas
- Pauli gates are rotations by exactly 180 degrees, while rotation gates allow any angle.
- A Pauli error is the simplest noise model, where a qubit suffers a bit flip, a phase flip, or both.
- The Pauli group is a subset of the Clifford group.
Frequently asked questions
What are the Pauli gates?
The X, Y, and Z gates: the bit flip, the combined flip, and the phase flip, each a half turn of the Bloch sphere about one axis.
Why are they important?
They describe common errors, form the basis for writing Hamiltonians and stabilizers, and are cheap to apply on error-corrected machines.
Do Pauli gates commute?
No. Different Paulis anticommute, which is the root of the uncertainty relations for qubits.
Related Terms
Keep exploring
- Algorithm: Variational Quantum Eigensolver (VQE)
- Algorithm: Quantum Error-Correcting Codes (Shor Code, Surface Code)
- Hardware: IBM Heron (r1, r2, and r3)