Paper1996
A Fast Quantum Mechanical Algorithm for Database Search
Lov K. Grover
Gives a quantum algorithm that finds a marked item among N unsorted possibilities in roughly the square root of N steps, a quadratic speed-up proven optimal for the problem.
link checked 17 Sept 2026FreeAdvanced