Quantum Gates & Circuits

The Building Blocks of Quantum Computation

Just as classical computers use logic gates (AND, OR, NOT) to manipulate bits, quantum computers use quantum gates to manipulate qubits. Quantum gates are the fundamental operations that create superposition, entanglement, and interference. the three pillars of quantum computing.

Every quantum gate is a unitary transformation. a reversible operation represented by a unitary matrix. This reversibility is a fundamental constraint: unlike classical computing, quantum computing cannot destructively overwrite information (until measurement).

Single-Qubit Gates

The Hadamard Gate (H)

The Hadamard gate is arguably the most important single-qubit gate. It creates superposition from a definite state:

• H|0⟩ = (|0⟩ + |1⟩) / √2. equal superposition
• H|1⟩ = (|0⟩ - |1⟩) / √2. superposition with a relative phase

The Hadamard gate is the gateway to quantum parallelism. Applied to n qubits all initialized to |0⟩, it creates an equal superposition of all 2ⁿ possible states. the starting point for many quantum algorithms.

The Pauli Gates (X, Y, Z)

• X gate (NOT gate). Flips |0⟩ to |1⟩ and vice versa. The quantum equivalent of a classical NOT.
• Z gate. Leaves |0⟩ unchanged, multiplies |1⟩ by -1. Introduces a phase flip without changing measurement probabilities.
• Y gate. Combines X and Z effects with an imaginary phase factor.

Phase and Rotation Gates

The S gate (π/4 phase), T gate (π/8 phase), and general rotation gates (R_x, R_y, R_z) provide fine-grained control over qubit states. The T gate, in particular, is critical for achieving universal quantum computation and is often the most expensive gate to implement with error correction.

Multi-Qubit Gates

The CNOT Gate (Controlled-NOT)

The CNOT gate operates on two qubits: a control and a target. If the control qubit is |1⟩, it flips the target qubit. If the control is |0⟩, the target is unchanged.

The CNOT gate is the primary tool for creating entanglement. Apply a Hadamard to the first qubit, then a CNOT with the first as control. you've created a Bell state, the simplest entangled state:

H(q0) → CNOT(q0, q1) → (|00⟩ + |11⟩) / √2

The Toffoli Gate (CCNOT)

The Toffoli gate has two control qubits and one target. The target flips only when both controls are |1⟩. This gate is universal for classical computation and important in quantum error correction and reversible computing.

Quantum Circuits

A quantum circuit is a sequence of quantum gates applied to qubits, read left to right. Each horizontal line represents a qubit, and gates are applied in time order. At the end, measurement collapses qubits to classical bits.

From Gates to Algorithms

Quantum algorithms are designed by composing gates into circuits that exploit superposition and interference. The art of quantum algorithm design is choosing gate sequences that:

1. Create superposition over the relevant search space
2. Encode the problem into phase differences between states
3. Amplify correct answers through constructive interference
4. Suppress wrong answers through destructive interference

In the next chapter, we'll see how these principles come together in landmark quantum algorithms like Shor's and Grover's.