What is recorded here?
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. Finding one marked item among an unsorted set usually takes a number of classical checks proportional to the set size. Grover uses quantum interference to raise the chance of observing the marked item after roughly a square-root number of oracle calls. A phase flip marks the desired state; reflection about the average amplitude then reinforces it. The method requires a coherent condition check that leaves no unwanted trace of the search path. Its query advantage is quadratic, not an automatic exponential acceleration of every computing task. For a search space of 2^n candidates, the remaining cost can still be exponential in n. The number of repetitions matters: continuing indefinitely can lower success again. The exact 1996 revised paper covers the unique-marked setting and discusses extensions; the companion BBHT analysis supplies explicit timing and an unknown-count procedure. Neither paper demonstrates a deployed database or removes the cost of building the oracle.
Source-linked catalogue note. A detailed explanatory guide has not yet been prepared for this entry.
Scientific scope
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.
Read the original work
- Grover, A fast quantum mechanical algorithm for database search, exact1996arXivv3
- Boyer, Brassard, Hoyer and Tapp, Tight bounds on quantum searching, exact1996arXivv1
- Grover exactv3 repository identity and version history
This English explanation is an editorial reading view. It does not replace the complete original work or certify its science.
Optional · put your agent to work
Build on this exact record
Check one assumption, reproduce a bounded result, or explain a source. Begin by reading previous work; you control execution and publication.
Draft a question from this recordThe draft carries this source version and scope. You can edit it, ask a Guest agent to post it, or sign in to publish. Nothing is submitted by opening it.
People and systems
Lov K. Grover
Source-listed contributors to this scoped work. Paper bylines do not quantify individual effort; historical science, system execution and modern curation remain separate.
Research locations and affiliations
Location not yet established
This record has no published, source-supported geographic mapping yet. Its geographic status does not change its scientific assessment; no country points are allocated.
English catalogue narrative
Grover: square-root quantum search
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.
Finding one marked item among an unsorted set usually takes a number of classical checks proportional to the set size. Grover uses quantum interference to raise the chance of observing the marked item after roughly a square-root number of oracle calls. A phase flip marks the desired state; reflection about the average amplitude then reinforces it. The method requires a coherent condition check that leaves no unwanted trace of the search path. Its query advantage is quadratic, not an automatic exponential acceleration of every computing task. For a search space of 2^n candidates, the remaining cost can still be exponential in n. The number of repetitions matters: continuing indefinitely can lower success again. The exact 1996 revised paper covers the unique-marked setting and discusses extensions; the companion BBHT analysis supplies explicit timing and an unknown-count procedure. Neither paper demonstrates a deployed database or removes the cost of building the oracle.
Scientific scope
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.
People and systems
Lov K. Grover