Amplitude Geometry

Before you can understand why Grover's algorithm works, you need to see the state vector through a geometric lens. In this lesson we reduce the full $2^n$ -dimensional Hilbert space to a two-dimensional picture that makes every step of the algorithm visually obvious.

The two-subspace decomposition

Label the single marked basis state $|\omega\rangle$ and collect every other computational basis state into the equal superposition

$|\omega^\perp\rangle = \frac{1}{\sqrt{N-1}} \sum_{x \neq \omega} |x\rangle,$

where $N = 2^n$ . The set $\{|\omega\rangle,\, |\omega^\perp\rangle\}$ is an orthonormal basis for the two-dimensional plane that Grover's algorithm never leaves. Every state the algorithm visits is a linear combination of these two vectors.

The initial state as an angle

The uniform superposition produced by $H^{\otimes n}|0\rangle$ is

$|s\rangle = \frac{1}{\sqrt{N}}\sum_{x=0}^{N-1}|x\rangle.$

Decomposed into the two-subspace basis this is

$|s\rangle = \sin\theta\,|\omega\rangle + \cos\theta\,|\omega^\perp\rangle,$

where the angle $\theta$ satisfies

$\sin\theta = \langle\omega|s\rangle = \frac{1}{\sqrt{N}}.$

For $N = 4$ (two qubits) this gives $\theta = \arcsin(1/2) = 30°$ , while for $N = 1024$ it gives $\theta \approx 1.8°$ — the initial state is nearly perpendicular to the target.

Visualizing the plane

Draw a unit circle in the $|\omega^\perp\rangle$ – $|\omega\rangle$ plane (horizontal and vertical axes respectively). The initial state $|s\rangle$ sits at angle $\theta$ from the horizontal axis. The goal is to rotate the state vector to $90°$ , i.e., to $|\omega\rangle$ itself.

$\text{Goal: rotate } |s\rangle \xrightarrow{\text{Grover iterations}} |\omega\rangle.$

Each Grover iteration is a rotation by $2\theta$ in this plane:

Oracle reflection: reflect about the $|\omega^\perp\rangle$ axis (the horizontal). This moves the angle from $\alpha$ to $-\alpha$ , negating the component along $|\omega\rangle$ .
Diffuser reflection: reflect about $|s\rangle$ . Combined with step 1, the net effect is a rotation by $+2\theta$ toward $|\omega\rangle$ .

After $k$ iterations the state is at angle $(2k+1)\theta$ , so the amplitude on the marked state is

$\sin((2k+1)\theta).$

This equals 1 — perfect retrieval — when $(2k+1)\theta = \pi/2$ , giving

$k = \frac{\pi/2 - \theta}{2\theta} = \frac{\pi}{4\theta} - \frac{1}{2}.$

Using $\theta \approx 1/\sqrt{N}$ for large $N$ , the optimal number of iterations is $k \approx \tfrac{\pi}{4}\sqrt{N}$ , recovering the famous $O(\sqrt{N})$ speedup.

The two-qubit case: exact geometry

For $n = 2$ , $N = 4$ , $\theta = 30°$ . One iteration rotates by $2 \times 30° = 60°$ , bringing the state from $30°$ to $90°$ : exactly $|\omega\rangle$ . The probability of success after one step is $\sin^2(90°) = 1$ . This is why the two-qubit Grover algorithm finds the marked item with certainty in a single iteration — not just very likely, but with probability exactly 1.

Amplitudes are coordinates

In the two-dimensional picture, the state at any point in the algorithm is a unit vector

The probability of finding the marked item on measurement is $|\alpha|^2 = \sin^2((2k+1)\theta)$ . By maximizing $\alpha$ and minimizing $\beta$ over the course of $O(\sqrt{N})$ reflections, Grover transfers probability mass from the entire non-target subspace into the single target state — this process is called amplitude amplification, and the geometric picture makes it transparent.