Is quantum search practical?
Open accessThe DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
Gauging a quantum algorithm's practical significance requires weighing it against the best conventional techniques applied to useful instances of the same problem. The authors show that several commonly suggested applications of Grover's quantum search algorithm fail to offer computational improvements over the best conventional algorithms.
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
Cites
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306
Efficient Classical Simulation of Slightly Entangled Quantum Computations
Vidal, G. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.147902 · Cited by 2,368
Improved simulation of stabilizer circuits
Aaronson, S., & Gottesman, D. (2004) · Physical Review A · doi:10.1103/physreva.70.052328 · Cited by 1,515
Strengths and Weaknesses of Quantum Computing
Bennett, C. H., Bernstein, E., Brassard, G., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300933 · Cited by 1,470 · cited 1×
“have shown in [2] that quantum algorithms are unlikely to solve NP-complete problems in polynomial time, although more modest speed-ups remain possible.”
BackgroundGrover’s quantum searching algorithm is optimal
Zalka, C. (1999) · Physical Review A · doi:10.1103/physreva.60.2746 · Cited by 635
The Heisenberg Representation of Quantum Computers
Gottesman, D. (1998) · arXiv · doi:10.48550/arxiv.quant-ph/9807006 · Cited by 489
A probabilistic algorithm for k-SAT and constraint satisfaction problems
Schoning, T. (2003) · 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) · doi:10.1109/sffcs.1999.814612 · Cited by 433 · cited 4×
“2The algorithm analyzed in [13] is a simplified version of the w llknown WalkSAT program.”
BackgroundMethodInfluentialQuantum Circuits That Can Be Simulated Classically in Polynomial Time
Valiant, L. G. (2002) · SIAM Journal on Computing · doi:10.1137/s0097539700377025 · Cited by 311 · cited 1×
“Indeed, polynomial-time simulation techniques were proposed for circuits with restrict ed gate types [10, 11] and for “slightly entangled” quantum computation [12].”
Method
Cited by
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · doi:10.1093/oso/9780198782995.001.0001 · Cited by 326
Dalyac, C., Henriet, L., Jeandel, E., Lechner, W., Perdrix, S., Porcheron, M., & Veshchezerova, M. (2021) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-021-00100-3 · Cited by 46
QiBAM: approximate sub-string index search on quantum accelerators applied to DNA read alignment
Sarkar, A., Al-Ars, Z., Almudever, C. G., & Bertels, K. L. M. (2021) · Electronics · doi:10.3390/electronics10192433 · Cited by 20
“The encoding of an application [19,20] to the Oracle is not explicitly described in these papers, and Grover’s original paper assumes the execution of the Oracle in constant time, for an overall polynomial speedup.”
Metadata
- Authors
- Viamontes, G. F., Markov, I. L., & Hayes, J. P.
- Venue
- Computing in Science & Engineering
- Published
- 2005-05
- Volume
- 7
- Issue
- 3
- Pages
- 62-70
- ISSN
- 1521-9615 (ISSN-L)
- 1558-366X
- OpenAlex
- W2139435141
- Cited by
- 90
- References
- 8
- FWCI
- 2.06
- Type
- journal article
- Language
- en
- Open access
- green
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: Is quantum search practical? https://app.cochat.ai/papers/10.1109/mcse.2005.53
- The paper
- Viamontes, G. F., Markov, I. L., & Hayes, J. P. (2005). Is quantum search practical? Computing in Science & Engineering. https://doi.org/10.1109/mcse.2005.53
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.