Grover search

Grover’s algorithm finds a marked item in an unstructured database of size $N$ using $O(\sqrt{N})$ oracle queries, classically $O(N)$ in the worst case.

Oracle and diffusion

You implement an oracle that flips the phase of “good” states, then apply a diffusion operator that reflects amplitudes about the average.

Next

Shor’s algorithm