Tight Bounds on Quantum Searching
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.
Integrity signals
Registry
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.
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
Quantum amplitude amplification and estimation
Brassard, G., Høyer, P., Mosca, M., & Tapp, A. (2002) · Contemporary Mathematics · doi:10.1090/conm/305/05215 · Cited by 1,680
Self-citationSteane, A. (1998) · Reports on Progress in Physics · doi:10.1088/0034-4885/61/2/002 · Cited by 1,391
Steane, A. (1997) · arXiv · doi:10.48550/arxiv.quant-ph/9708022 · Cited by 1,390
Quantum algorithms: an overview
Montanaro, A. (2016) · npj Quantum Information · doi:10.1038/npjqi.2015.23 · Cited by 1,071
Quantum Computers Can Search Rapidly by Using Almost Any Transformation
Grover, L. K. (1998) · Physical Review Letters · doi:10.1103/physrevlett.80.4329 · Cited by 616
Implementation of a quantum search algorithm on a quantum computer
Jones, J. A., Mosca, M., & Hansen, R. H. (1998) · Nature · doi:10.1038/30687 · Cited by 558
Demonstration of Blind Quantum Computing
Barz, S., Kashefi, E., Broadbent, A., Fitzsimons, J. F., Zeilinger, A., & Walther, P. (2012) · Science · doi:10.1126/science.1214707 · Cited by 475
Quantum Computers Can Search Arbitrarily Large Databases by a Single Query
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.4709 · Cited by 432
Quantum vs. classical communication and computation
Buhrman, H., Cleve, R., & Wigderson, A. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276713 · Cited by 389
Brassard, G., HØyer, P., & Tapp, A. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055105 · Cited by 256
Self-citationQuantum cryptanalysis of hash and claw-free functions: Invited paper
Brassard, G., HØyer, P., & Tapp, A. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054319 · Cited by 251
Self-citationCalculating the thermal rate constant with exponential speedup on a quantum computer
Lidar, D. A., & Wang, H. (1999) · Physical Review E · doi:10.1103/physreve.59.2429 · Cited by 115
Kim, P., Han, D., & Jeong, K. C. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-2107-3 · Cited by 80
Variational learning of Grover's quantum search algorithm
Morales, M. E. S., Tlyachev, T., & Biamonte, J. (2018) · Physical Review A · doi:10.1103/physreva.98.062333 · Cited by 57
Quantum counterfeit coin problems
Iwama, K., Nishimura, H., Raymond, R., & Teruyama, J. (2012) · Theoretical Computer Science · doi:10.1016/j.tcs.2012.05.039 · Cited by 17
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
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.