Wondering what quantum gates actually do to a qubit? They are reversible unitary operations, the quantum counterpart of classical logic gates, and they can create superposition and entanglement.
Quantum gates are the basic operations of quantum computing, so this page walks through the most common ones in plain language.
| Item | Value |
|---|---|
| Single-qubit gate, in matrix form | 2×2 unitary matrix |
| Pauli X, Y and Z gates | 180° rotations about the x, y and z axes of the Bloch sphere |
| Hadamard (H) gate | 180° rotation about the axis halfway between X and Z |
| A Pauli gate applied twice | Identity (each is its own inverse) |
| Reversibility of quantum gates | All correspond to invertible unitary matrices |
The figures come from a guide to quantum gates on PostQuantum.com. Figures and descriptions can change, so check the source before you rely on them.
What are quantum gates?
In classical computing, every operation is built from simple binary logic gates like AND, OR and NOT. Quantum gates play the same role, but they are unitary transformations on one or more qubits. They are the elementary moves a quantum computer can make on quantum data (source).
Classical gates combine to implement arbitrary Boolean functions. In the same way, quantum gates combine to implement arbitrary unitary operations, so a long computation is a sequence of small, simple steps.
How quantum gates differ from classical gates
The comparison with AND, OR and NOT is useful, but quantum gates behave differently in three ways:
- They are reversible. Every quantum gate corresponds to an invertible unitary matrix, so no gate throws information away.
- They can create superposition and entanglement. Classical logic gates have no equivalent of either.
- There are infinitely many single-qubit gates. A qubit’s state is a continuous point on the Bloch sphere, so the possible rotations form a continuum.
That last point explains why gate tutorials focus on a handful of named gates. They are the useful landmarks in a much larger space of possible operations.
Single-qubit gates and the Bloch sphere
A single qubit’s state can be pictured as a point on the Bloch sphere. Single-qubit gates correspond to rotations of that point, changing the amplitudes and the relative phase of the basis states. In matrix form, each one is a 2×2 unitary matrix (source).
The Pauli gates: X, Y and Z
The three Pauli gates are the quantum analogues of the classical NOT and related operations. They correspond to 180° rotations about the x, y and z axes of the Bloch sphere (source). Each does a distinct job:
- X flips 0 and 1, acting just like a classical NOT on the computational basis.
- Z leaves the 0 state alone but flips the sign of the 1 component, which earns it the nickname “phase-flip” gate.
- Y combines a bit flip and a phase flip, and it is less often used directly.
All Pauli gates are their own inverses, because each one squared is the identity. They also anti-commute with each other, and these properties are central in quantum error correction and stabilizer theory.
The Hadamard gate and superposition
The Hadamard gate creates superposition and is one of the most widely used single-qubit gates. It takes a qubit with a definite value of 0 or 1 and turns it into an equal superposition of 0 and 1, up to a relative phase.

Geometrically, H is a 180° rotation about the axis halfway between X and Z on the Bloch sphere (source). It therefore swaps the roles of the X-basis and the Z-basis, and it can also take those superposition states back to the computational basis.
Gates that act on more than one qubit
Single-qubit gates cannot link qubits to each other. That job belongs to multi-qubit gates, which the guide groups under the heading “Two-Qubit Gates: Entangling Operations” (source). The gates it lists include:
- Two-qubit gates: the controlled-NOT (CNOT), controlled-Z (CZ), SWAP and iSWAP gates.
- Three-qubit gates: the Toffoli (CCNOT), Fredkin (CSWAP) and controlled-controlled-Z (CCZ) gates.
The Z gate’s phase kick is one reason it matters here, since it is useful in forming controlled-Z gates. The same guide goes on to cover Clifford gates and the universality of gate sets, which are natural next topics once the basic gates feel familiar.
Where gates fit in the bigger picture
Gates are only one layer of a quantum computer. For the hardware side, you can read an explainer on how do quantum computers work to see where these operations are carried out.
Gates also act on qubits that can be built in different ways. If you want to know what a qubit can physically be, the guide to the types of qubits is the place to continue.
Frequently asked questions
Are quantum gates reversible?
Show answer
Yes. All quantum gates correspond to invertible unitary matrices, which is a key difference from many classical logic gates.
What is the quantum version of a NOT gate?
Show answer
The Pauli X gate. It swaps the two basis states, which is why it is treated as the closest quantum counterpart of NOT.
What does the Hadamard gate do?
Show answer
It creates superposition. It maps a definite 0 or 1 to an equal superposition of the two, up to a relative phase.
How many single-qubit gates are there?
Show answer
Infinitely many. A qubit’s state is a continuous point on the Bloch sphere, so there are infinitely many possible single-qubit gates.



