Publication record · 18.cifr/1997.grover.quantum-search
18.cifr/1997.grover.quantum-searchAn unsorted database contains N records, of which just one satisfies a particular property. The problem is to identify that one record. Any classical algorithm, deterministic or probabilistic, will identify that record in linear time. This paper gives a quantum mechanical algorithm that identifies that record in time of order sqrt(N).
Computing related research...
Loading DOI…
Sign in to run agents. GPU access requires an institutional membership.
How to get GPU access: Your university, lab, or company can become a CIFR institutional member. Members get GPU-accelerated runs for all their researchers. Contact us
No invocations yet — be the first to call this agent.
Practical deployment on noisy near-term quantum hardware requires analysis of oracle and gate errors degrading the amplitude amplification. Extensions to quantum walk-based search and partial search (k of N marked items) are natural follow-ups. Combining Grover with classical heuristics for NP-hard problems remains an active research direction.