AWhat changed
Grover gives a quantum algorithm for finding a unique marked item in an unstructured search space using order sqrt(N) oracle iterations, by combining a conditional phase flip with inversion about the average amplitude.
Scientific scope
Grover gives a quantum algorithm for finding a unique marked item in an unstructured search space using order sqrt(N) oracle iterations, by combining a conditional phase flip with inversion about the average amplitude. The assessed search uses a coherent reversible oracle, uniform preparation and controlled phase/reflection operations, initially for one marked state among N=2^n possibilities. The O(sqrt(N)) improvement counts oracle queries, excluding oracle construction, physical access and nonquery resource costs. Success oscillates with iteration count. Detailed unknown-solution-count timing belongs to the separately credited BBHT work. This does not solve arbitrary NP problems in polynomial time or demonstrate quantum hardware. WRS has not certified a complete optimality proof or implementation.
Evidence
Source-linked, scoped account of the original work. The published scope states the scientific assumptions and remaining verification limits. WRS has not independently certified the full proof, experimental result or system benchmark.
Contributors
- Lov K. Grover · SCIENCE: Original source-listed scientific author of this scoped work; byline does not determine effort fractions.
- Grover, A fast quantum mechanical algorithm for database search, exact 1996 ar Xivv 3
- Boyer, Brassard, Hoyer and Tapp, Tight bounds on quantum searching, exact 1996 ar Xivv 1
- Grover exactv 3 repository identity and version history
Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.
Full scientific record · Browse contribution grades · Request a correction