Tag
#quantum search
1 article
- Grover's Algorithm: The Quantum Speedup That Doesn't Break Everything — But Still Matters
Grover's algorithm searches an unstructured database of N items in O(√N) steps rather than O(N) classically — a quadratic speedup that is provably optimal for quantum computers. Unlike Shor's exponential advantage, the quadratic speedup can be countered by doubling key sizes. But understanding exactly why, and where Grover's algorithm actually applies, is essential for anyone reasoning about quantum cryptographic risk.
