Grover's Search Algorithm: Amplitude Amplification

This simulator explores the core mechanic behind quantum computing's most famous speedup: Grover's search algorithm. Starting from an equal superposition over N basis states, it repeatedly applies an oracle that flips the sign of one marked amplitude, followed by a diffusion operator that reflects every amplitude about their mean. Each 3D bar represents one computational basis state, its height tracking the amplitude's magnitude and its color its sign, so the amplification process — probability mass draining from the unmarked states into the marked one — is directly visible rather than abstract. Live readouts track the iteration count, the theoretically optimal number of steps (π/4·√N), and the exact measurement probability sin²((2t+1)θ), letting you watch the probability rise toward its peak and, if you keep iterating past the optimum, fall back down again exactly as the underlying rotation predicts.