Grover’s Search

Lov Grover, 1996

Grover’s algorithm (1996) finds a marked item in an unsorted database with O(√N) oracle calls under ideal conditions. This schematic shows three register wires: parallel Hadamard gates, a span-style oracle O, and a diffuser D = 2|ψ⟩⟨ψ|−I; animation highlights each block in sequence.