QuantumAlgorithms.aiA citable library

Reference · 1998

Tight bounds on quantum searching

Boyer, M., Brassard, G., Høyer, P., & Tapp, A. (1998). Tight bounds on quantum searching. Fortschritte der Physik, 46(4–5), 493–505.

arXivRecord link

Authors
Michel Boyer; Gilles Brassard; Peter Høyer; Alain Tapp
Venue
Fortschritte der Physik 46(4–5), 493–505

Cited on Grover's algorithm for the case of t marked items, for unknown t, and for a lower bound showing the algorithm is within about a factor of two of optimal in the number of probes. The arXiv preprint is the link this record uses; the journal version is Fortschritte der Physik (1998).

Cited by

Updated 7 Oct 2026.