WRSWorld Research StateContribute
WORLD RESEARCH STATE

BBHT: how to stop quantum search without knowing the solution count

Contribution grade

Quantum search and query complexity · Quantum search and query complexity

Reference score50,000Provisional editorial estimate of this exact contribution; its grade is assessed separately.

What changed

Boyer, Brassard, Hoyer and Tapp analyze quantum-search success after a specified number of iterations and give a randomized procedure with order sqrt(N/t) expected query cost when the positive number t of marked items is unknown.

Scientific scope

Boyer, Brassard, Hoyer and Tapp analyze quantum-search success after a specified number of iterations and give a randomized procedure with order sqrt(N/t) expected query cost when the positive number t of marked items is unknown. The target is the May 1996 preprint. The unknown-count procedure randomizes iteration counts, grows their range and checks observed candidates in the coherent unit-query oracle model. For a positive number t of marked items, its expected cost is O(sqrt(N/t)), not a deterministic deadline for every run. A zero-solution timeout is a bounded-error decision, not an unconditional absence proof. The counting section is a sketch rather than the complete later amplitude-estimation theory. Grover’s underlying iteration and earlier lower-bound work retain separate credit.

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

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