Why does quantum gates matter?

Every quantum algorithm reduces to a circuit of gates — there is nothing else. A small set of gates (like Hadamard, CNOT, and T) is provably enough to compute anything a quantum computer can. Gate fidelity — how accurately each gate is performed — is the second-biggest predictor of a machine's usefulness after qubit count. Faster, more accurate gates mean more computation before decoherence wins.

CNOT Makes Entanglement

The CNOT gate is the workhorse for creating entangled qubit pairs.

Every quantum gate has an inverse — you can always undo it.

T Gates Are Expensive

In fault-tolerant computers, T gates cost 100× more than others.

Best Gates Now: 99.9% Fidelity

Trapped-ion two-qubit gates now beat three-nines accuracy.

Concepts

Concept / Quantum Gates

Quantum Gates.

The verbs of quantum computing — how you actually manipulate a qubit.

Quantum gates are the operations that transform qubits. In a classical computer, gates are AND, OR, and NOT. In a quantum computer, gates are rotations of a qubit's state — Hadamard, Pauli-X, CNOT, T. A quantum circuit is just a sequence of gates applied to qubits.

The Hadamard Makes Superposition

Applying a Hadamard gate to |0⟩ produces a perfect 50/50 blend of 0 and 1.

In plain English.

If a qubit is a spinning arrow, a quantum gate is a hand that turns it. Left, right, up, down, sideways, entangled with the arrow next to it.

You build a program by choosing which gates to apply, in what order, to which qubits. That sequence is called a circuit.

Any quantum algorithm — from Shor's to Grover's to chemistry simulation — is ultimately a specific dance of a few kinds of gates.

Why it matters.

Every quantum algorithm reduces to a circuit of gates — there is nothing else.
A small set of gates (like Hadamard, CNOT, and T) is provably enough to compute anything a quantum computer can.
Gate fidelity — how accurately each gate is performed — is the second-biggest predictor of a machine's usefulness after qubit count.
Faster, more accurate gates mean more computation before decoherence wins.

Timeline — past and future.

What already happened, and what's next for quantum gates.

1985
Deutsch defines universal quantum gates.
1995
Barenco et al. show CNOT + single-qubit gates are universal.
2014
First superconducting two-qubit gates above 99% fidelity.
2020
Trapped-ion gates cross 99.9% fidelity.
2025
Neutral-atom two-qubit gates reach the fault-tolerance threshold.
2030Forecast
Logical (error-corrected) gate fidelities enter routine operation.

Where it shows up.

Universal computation

Just three or four gate types are enough for anything.

Building algorithms

Shor, Grover, VQE, QAOA — all are circuits of gates.

Error correction

Fault-tolerant gates are the ultimate engineering goal.

Compilation

Turning high-level intent into optimal low-level gate sequences.

Previous concept

Decoherence

Next concept