What quantum algorithm provides a quadratic speedup for searching unsorted databases?

The story behind the answer

The quantum algorithm that provides a quadratic speedup for searching an unsorted database is Grover's algorithm.

Proposed by Lov Grover in 1996, the algorithm searches an unstructured space by repeatedly amplifying the probability of a desired answer. A classical search may require checking O(N) entries in the worst case, whereas Grover's method needs about O(√N) oracle queries, giving a quadratic advantage.

Its central process combines a phase-marking oracle with a diffusion, or inversion-about-the-mean, operation. Together these steps increase the amplitude of the marked state while suppressing unmarked states. The number of iterations must be chosen carefully; too many can reduce the success probability again.

The speedup is quadratic, not exponential, and applies to unstructured search problems. Simon's algorithm targets a hidden periodic structure, Deutsch–Jozsa distinguishes certain classes of functions, and Shor's algorithm factors integers efficiently. Grover's method is also the foundation of the broader amplitude-amplification technique used in quantum algorithm design.

Source: Wikipedia · fact-checked Aug. 2026

Add question to a list

Choose a list to keep this question in: