CoChat

Tight Bounds on Quantum Searching

Boyer, Michel, Brassard, Gilles, Høyer, Peter, Tappa, Alain · 1999 · Quantum Computing
Cited by 132

The DOI matches its Crossref record.

Abstract

This chapter contains sections titled: Abstract 1 Introduction 2 Overview of Grover's Algorithm 3 Finding a Unique Solution 4 The Case of Multiple Solutions 5 The Case t = N/4 6 Unknown Number of Solutions 7 An Improved Lower Bound 8 Conclusions and Future Directions Acknowledgements References

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1002/3527603093.ch10

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 132

Metadata

Authors
Boyer, M., Brassard, G., Høyer, P., & Tappa, A.
Venue
Quantum Computing
Publisher
Wiley
Published
1999-10-12
Pages
187-199
OpenAlex
W4245982273
Cited by
132
References
0
Type
other
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Tight Bounds on Quantum Searching. https://app.cochat.ai/papers/10.1002/3527603093.ch10
The paper
Boyer, M., Brassard, G., Høyer, P., & Tappa, A. (1999). Tight Bounds on Quantum Searching. Quantum Computing. https://doi.org/10.1002/3527603093.ch10

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.