Gates as Rotations
Every single-qubit quantum gate is a rotation on the Bloch sphere. The Pauli matrices X, Y, Z generate rotations around their respective axes, and any unitary can be decomposed into a sequence of such rotations. This geometric picture makes it possible to design gate sequences intuitively: want to flip a qubit? Rotate 180° around X. Want to create superposition? Apply a Hadamard, which is a 180° rotation around the diagonal (X+Z)/√2 axis.
The Standard Gate Library
Quantum computers implement a small set of native gates from which all others are composed. The Clifford gates (H, S, CNOT) are efficiently simulable classically, but adding the T gate makes the set universal. Each physical platform (superconducting, trapped ion, photonic) implements these logical gates differently, but the abstract circuit model remains the same. Gate fidelity — how closely the physical operation matches the ideal unitary — is the key quality metric.
Gate Composition and Circuits
Quantum circuits are read left to right: each wire represents a qubit, and gates are applied in sequence. Unlike classical circuits, quantum circuits cannot have fan-out (no-cloning theorem) and every gate must be reversible. A circuit of depth d applies d sequential layers of gates. Minimizing circuit depth is crucial because each gate introduces a small error, and decoherence limits the total computation time available.
Toward Fault Tolerance
Real quantum gates have error rates around 0.1–1%. For useful computation, these errors must be corrected faster than they accumulate. Fault-tolerant protocols encode logical qubits into many physical qubits and use only transversal gates that don't spread errors. The T gate requires a special technique called magic state distillation, making it the bottleneck of fault-tolerant quantum computing.