The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
A framework for fast quantum mechanical algorithms
Open accessAbstract
A framework is presented for the design and analysis of quantum mechanical algorithms, the 0( fi) step quantum search algorithm is an immediate consequence of this framework.It leads to several other search-type applications -an example is presented where the Walsh-Hadamard (W-H) transform of the quantum search algorithm is replaced by another transform tailored to the parameters of the problem.Also, it leads to quantum mechanical algorithms for problems not immediately connected with search -two such algorithms are presented for calculating the mean and median of statistical distributions.In order to classically estimate either the mean or median of a given distribution to a precision E , needs a(~-~) steps.The best known quantum mechanical algorithm for estimating the median takes O(E-') steps, and that for estimating the mean takes O(E -1.5 ) steps.This paper presents O(E-l) step algorithms for both problems (all bounds are upto polylogarithmic factors).Both algorithms are considerably simpler than known algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
Self-citationAlgorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
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
Self-citationBernstein, E., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300921 · Cited by 1,503
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
Bernstein, E., & Vazirani, U. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167097 · Cited by 1,284
Benioff, P. (1980) · Journal of Statistical Physics · doi:10.1007/bf01011339 · Cited by 1,244
Time/Space Trade-Offs for Reversible Computation
Bennett, C. H. (1989) · SIAM Journal on Computing · doi:10.1137/0218053 · Cited by 405
Cited by
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1999) · SIAM Review · doi:10.1137/s0036144598347011 · Cited by 3,904
Quantum lower bounds by polynomials
Beals, R., Buhrman, H., Cleve, R., Mosca, M., & de Wolf, R. (2001) · Journal of the ACM · doi:10.1145/502090.502097 · Cited by 639
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
Self-citationSynthesis of reversible logic circuits
Shende, V. V., Prasad, A. K., Markov, I. L., & Hayes, J. P. (2003) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2003.811448 · Cited by 568
An introduction to quantum computing for non-physicists
Rieffel, E., & Polak, W. (2000) · ACM Computing Surveys · doi:10.1145/367701.367709 · Cited by 407
Metadata
- Authors
- Grover, L. K.
- Venue
- Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98
- Publisher
- ACM Press
- Published
- 1998
- Pages
- 53-62
- OpenAlex
- W2146537406
- Cited by
- 240
- References
- 9
- FWCI
- 9.53
- Type
- conference paper
- Language
- en
- Open access
- gold
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: A framework for fast quantum mechanical algorithms. https://app.cochat.ai/papers/10.1145/276698.276712
- The paper
- Grover, L. K. (1998). A framework for fast quantum mechanical algorithms. Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98. https://doi.org/10.1145/276698.276712
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.