Lov Grover introduced a quantum algorithm for an unstructured search problem that finds a marked item among possibilities with queries. The algorithm repeatedly changes quantum phases so that the amplitude of a desired outcome grows. Its query complexity concerns access to the marking rule; the time needed to implement that rule still matters in an application.[ref]
A fast quantum mechanical algorithm for database search by Lov Grover. abstract and inversion-about-average construction
Articles by others on the same topic
Lov Grover is a computer scientist known for his work in quantum computing and algorithms. He is best known for developing Grover's algorithm, which is a quantum algorithm that provides a significant speedup for searching unsorted databases. Specifically, Grover's algorithm can search an unsorted database of \( N \) items in approximately \( \sqrt{N} \) time, compared to classical algorithms, which require \( O(N) \) time to search through the same database.