Grover's Search: Quantum vs Classical Race

This simulator runs the actual Grover amplitude-amplification loop on a real array of N amplitudes: an oracle that flips the sign of every marked state's amplitude, followed by a diffusion operator that reflects every amplitude about the array's running mean. Both steps are computed from the live amplitude array every iteration — nothing is pre-baked — so the bar chart's rise toward near-certain measurement of the marked state, and its fall if you keep iterating past the optimal count, is the real geometric rotation Grover's algorithm performs. A side-by-side classical linear search races the same problem one query at a time, making the O(√N) versus O(N) query-count gap directly comparable.