The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index; none of the 8 sources its claims cite is checked for support yet.
A fast quantum mechanical algorithm for database search
Open accessAbstract
An unsorted database contains N records, of which just one satisfies a particular property.The problem is to identify that one record.Any classical algorithm, deterministic or probabilistic, will clearly take O (N) steps since on the average it will have to examine a large fraction of the N records.Quantum mechanical systems can do several operations simultaneously due to their wave like properties.This paper gives an O ( JN) step quantum mechanical algorithm for identifying that record.It is within a constant factor of the fastest possible quantum mechanical algorithm.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
0 of 8 cited sources checked · 0 supported · 0 flagged
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This paper gives an O ( JN) step quantum mechanical algorithm for identifying that record.”
§ A fast quantum mechanical algorithm for database search > Abstract
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passes- The authors state this as an assumption: There is a unique state that satisfies the condition C(S)=1.
- The authors state this as an assumption: For any state S, the condition C(S) can be evaluated in unit time.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Corollary 3.1-Let the state vector be as followsfor any one state the amplitude is k, for each of the remaining (N-1) states the amplitude is 1.Let k and 1 be real numbers (in general the amplitudes can be complex).Let k be negative and 1 be positive such that ~< ~N.Then after applying the diffusion transform both k and 1are positive numbers.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“First, it is proved that the system is a valid quantum mechanical system (theorems 1 & 2)”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
Load-bearingStrength:boosted· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“As mentioned in the introduction, the algorithm of this paper does not use any Imowledge about the problem.”
§ A fast quantum mechanical algorithm for database search > 114
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Theorem 1-The matix D is unitary.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The following sections prove that the system discussed in section 3 is indeed a valid quantum mechanical system and that it converges to the desired state with a probability O(l).”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passes- The authors state this as an assumption: There is a unique state that satisfies the condition C(S)=1.
- The authors state this as an assumption: For any state S, the condition C(S) can be evaluated in unit time.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Theorem 2 -D can be expressed as D = FRF, where F, the Fourier Transform Matrix and R, the rotation matrix are defined as follows”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Since the proba-& bility of the system being found in any particular state is proportional to the square of the amplitude, it follows that the probability of the system being in tlhe desired state when k is ~, 1 J2 is k2 = ~.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In case there is a unique state SV such that C(SV) = 1, the final state is SV with a probability of at least ~. 2”
§ A fast quantum mechanical algorithm for database search > T. Acknowledgments
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes? Based: unclear- The authors state this as an assumption: There is a unique state that satisfies the condition C(S)=1.
- The authors state this as an assumption: For any state S, the condition C(S) can be evaluated in unit time.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“It can be easily modified to take care of the case when there are multiple states satisfying the condition C(S) = 1 and it is required to return one of these.”
§ A fast quantum mechanical algorithm for database search > 114
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passes
- Probably not a substantial claim. 8
- It may state two separate claims as one. 4
- The quote only partly states this claim. 1
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Theorem 5-Let the probability of a particular outcome in an experiment be &.Then if the experiment be repeated ~times, the probability that the outcome does not happen even once is less than or equal to e-K.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The change in k ( Ak) after steps (a) and (b) of the algorithm is lower bounded by Ak>~.Also after steps (a) and (b), 1>0.2fi”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Using this it immediately follows that there exists a number M less than EN, such that in M repetitions of the loop in step (ii), k wifl become ~.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe quote only partly states this claim.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The most efficient classical algorithm for this is to examine the items in the database one by one.”
§ A fast quantum mechanical algorithm for database search > ------------------------------------------------
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
In the paper
“Very recent results [Shor95] have shown the existence of quantum mechanical error corr~ting cod~which enable transmission of data even in the presence of noise”
§ A fast quantum mechanical algorithm for database search > 114
What the sources say
- Not matchedcites [Shor95]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
Strength:boosted· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This algorithm, by cleverly making use of some features of the structure of the problem, is the only known algorithm that solves the problem in O (logIV) steps.”
§ A fast quantum mechanical algorithm for database search > 114
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The phase does not have an analog in classical probabilistic algorithms.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This illustrates the point that, in quantum mechanics, the complete description of the system requires the amplitudes over all states, just the probabilities is not enough.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
In the paper
“For example Shor's primality testing algorithm [Shor94] for a number N can be viewed as a search of the (N-l) numbers smaller than N to see if any of them is a factor of N.”
§ A fast quantum mechanical algorithm for database search > 114
What the sources say
- Not matchedcites [Shor94]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
In the paper
“There is also a scheme discussed in [VV86] by which it is possible to modify any algorithm that solves an NPsearch problem with a unique solution and use it to solve an NP-search problem in general.”
§ A fast quantum mechanical algorithm for database search > 114
What the sources say
- Not matchedcites [VV86]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
Strength:hedged· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
In the paper
“This operation is one of the things that makes quantum mechanical algorithms more powerful than classical algorithms and forms the basis for most significant quantum mechanical algorithms.”
§ A fast quantum mechanical algorithm for database search > T. Acknowledgments
What the sources say
- Not matchedcites [DJ92]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
- Not matched
The authors state this as an assumption.
There is a unique state that satisfies the condition C(S)=1.
“Let there be a unique state, say Sv, that satisfies the condition C(SV) = 1, whereas for all other states S, C(S) = 0”
“The algorithm as discussed here assumes a unique state that satisfies the desired condition.”
The authors state this as an assumption.
For any state S, the condition C(S) can be evaluated in unit time.
“(assume that for any state S, the condition C(S) can be evaluated in unit time)”
The paper relies on this without support.
There does not exist any sorting on the database that would aid selection of the desired item.
“However, there does not exist any sorting on the database that would aid its selection.”
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Symmetric cryptography remains comparatively resilient, yet Grover's algorithm offers a quadratic speed-up for brute-force key search, effectively halving the security margin of symmetric ciphers [13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Similarly, for hash functions, Grover's algorithm [185] can facilitate quantum birthday attack to find collision, thereby necessitating an output of larger size.”
From Zero Trust Architecture (ZTA): A Comprehensive Survey (2022) · cites this paper as [185]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Similarly, Grover’s algorithm concedes a quadratic advantage for mining blocks in certain consensus protocols such as proof of work.”
From Quantum-resistance in blockchain networks (2023) · cites this paper as [71]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Quantum computers will be able to find these nonces quadratically faster using Grover’s algorithm71.”
From Quantum-resistance in blockchain networks (2023) · cites this paper as [71]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“This model is realistic given the falling cost of storage, the rise of large-scale surveillance infrastructures, and the expected disruption of quantum algorithms such as Shor's and Grover's [1,2,13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measured
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Grover's algorithm provides only a quadratic speedup, effectively halving brute-force resistance. Comparable security margins can be restored by doubling key sizes (for example, AES-128 to AES-256) [13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“This explains why AES-256 maintains post-quantum security margins, whereas AES-128 requires upgrading to maintain equivalent protection levels [13,14].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“At the same time, Grover's algorithm shows that symmetric cryptography, though more resilient, also demands doubled key sizes to maintain equivalent margins [13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“In this sense, Grover-based optimization algorithms [184] such as Grover Adaptive Search [161] have been proposed.”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [184]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The former bound is tight since recent work of Grover [13] shows how to accept the class NP relative to any oracle on a quantum computer in time O (2 n/ 2 ).”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“In view of Grover's algorithm [13], we know that the constant '1 / 2' in the statement of Theorem 3.5 cannot be improved.”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The former bound is tight since recent work of Grover [13] shows how to accept the class NP relative to any oracle on a quantum computer in time O (2 n/ 2 ).”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“Grover’s algorithm [54] is a quantum algorithm for searching in a database, ofering quadratic speedup over classical searching methods.”
From QASMBench: A Low-Level Quantum Benchmark Suite for NISQ Evaluation and Simulation (2023) · cites this paper as [54]
The cited source says what the claim attributes to it.
In the citing paper
“However, quantum machines can recognize this language quadratically faster, in time O ( √ 2 n ), using Grover's algorithm [13].”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
The cited source says what the claim attributes to it.
In the citing paper
“That this was a real possibility is clear from Grover's [13] result, which gives a black-box approach to solving NP -complete problems in square-root as much time as is required classically.”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
The cited source says what the claim attributes to it.
In the citing paper
“Various strategies can be imagined, but a good one (called 'inversion about the average' by Grover [13]) is to perform an oracle-independent unitary transformation so as to change the phase difference into an amplitude difference, leaving the y term with the same sign as all the other terms but a magnitude approximately threefold larger.”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“The HNDL adversary departs from conventional cryptanalysis in its temporal asymmetry. Instead of attempting immediate decryption, the attacker passively collects encrypted traffic or stored archives and defers decryption until sufficient computational resources become available.”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredIn the citing paper
“This algorithm uses a single function evaluation to label the single state which satisfies the function, followed by a series of gates which drive the system into this particular state.”
From Implementation of a quantum search algorithm on a quantum computer (1998) · cites this paper as [9]
In the citing paper
“Here we show how such a computer can be used to implement a fast quantum search algorithm initially developed by Grover. 9, 10”
From Implementation of a quantum search algorithm on a quantum computer (1998) · cites this paper as [9]
In the citing paper
“Among other applications Grover's algorithms enable an extremely rapid search over the domain of a binary function to find elements for which this function is satisfied (that is, the function has the value 1).”
From Implementation of a quantum search algorithm on a quantum computer (1998) · cites this paper as [9]
In the citing paper
“the ability to efficiently perform Hamiltonian simulation is used in conjunction with another technique known as the quantum phase estimation algorithm (QPEA) 42 for efficiently obtaining the eigen-energies and eigenstates of a quantum system 38 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
In the citing paper
“The Quantum Phase Estimation (QPE) algorithm 38,99 is the natural translation of the FCI procedure to quantum computers 45 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
In the citing paper
“Abrams and Lloyd 38 focused on state preparation in more detail and described concrete initialization procedures.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
In the citing paper
“They pointed out that state preparation is conceptually easier in second quantization, where a Fock state is represented by a simple product state of qubits in {| 0 〉 , | 1 〉} states.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
Citations
Cites
Algorithms 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
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Scheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
Rapid solution of problems by quantum computation
Deutsch, D., & Jozsa, R. (1992) · Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences · doi:10.1098/rspa.1992.0167 · Cited by 2,700
The Emperor's New Mind: Concerning Computers, Minds, and The Laws of Physics
Penrose, R., & Gardner, M. (1989) · doi:10.1093/oso/9780198519737.001.0001 · Cited by 2,007
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
On the Power of Quantum Computation
Simon, D. R. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796298637 · Cited by 1,295
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
The Emperor's New Mind: Concerning Computers, Minds, and the Laws of Physics
Penrose, R., & Landauer, R. (1990) · Physics Today · doi:10.1063/1.2810599 · Cited by 1,110
Flagged first, then by citations
Research works printed but not linked: 2
- [9]9. R. Penrose, Shadows of the mind,. Oxford University Press, 1994, pp. 348- 388.
- [14]14. Yao93J A. Yao, Quantum circuit complexip, Proceedings 34th Annual Symposium on Foundations of Computer Science (FOCS), 1993, pp. 352-361.
Cited by
Sorted by citations
Items 101–200 of 8,792
Quantum computation and quantum information
Nagy, M., & Akl, S. G. (2005) · International Journal of Parallel Emergent and Distributed Systems · doi:10.1080/17445760500355678 · Cited by 320
Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning
Amy, M., Maslov, D. A., & Mosca, M. (2014) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2014.2341953 · Cited by 319
Distributed quantum computing: A survey
Caleffi, M., Amoretti, M., Ferrari, D., Illiano, J., Manzalini, A., & Cacciapuoti, A. S. (2024) · Computer Networks · doi:10.1016/j.comnet.2024.110672 · Cited by 361
Hybrid quantum-classical convolutional neural networks
Liu, J., Lim, K. H., Wood, K. L., Huang, W., Guo, C., & Huang, H.-L. (2021) · Science China Physics, Mechanics & Astronomy · doi:10.1007/s11433-021-1734-3 · Cited by 289
General Quantum Interference Principle and Duality Computer
Gui-Lu, L. (2006) · Communications in Theoretical Physics · doi:10.1088/0253-6102/45/5/013 · Cited by 279
Coins Make Quantum Walks FasterPreprint
Ambainis, A., Kempe, J., & Rivosh, A. (2004) · arXiv (Cornell University) · doi:10.5555/1070432.1070590 · Cited by 325
Quantum error correction : an introductory guide
Roffe, J. (2019) · White Rose Research Online (University of Leeds, The University of Sheffield, University of York) · Cited by 256
Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives
Chase, M., Derler, D., Goldfeder, S., Orlandi, C., Ramacher, S., Rechberger, C., Slamanig, D., & Zaverucha, G. (2017) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3133956.3133997 · Cited by 273
Dawson, C. M., & Nielsen, M. A. (2005) · CERN Document Server (European Organization for Nuclear Research) · Cited by 254
Siraichi, M. Y., Santos, V. F. D., Collange, C., & Pereira, F. M. Q. (2018) · Proceedings of the 2018 International Symposium on Code Generation and Optimization · doi:10.1145/3168822 · Cited by 254
A Survey of Important Issues in Quantum Computing and Communications
Yang, Z., Zolanvari, M., & Jain, R. K. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3254481 · Cited by 273
Decoherence in quantum walks – a review
KENDON, V. (2007) · Mathematical Structures in Computer Science · doi:10.1017/s0960129507006354 · Cited by 252
Contextuality in measurement-based quantum computation
Raussendorf, R. (2013) · Physical Review A · doi:10.1103/physreva.88.022322 · Cited by 248
Quantum 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
An exact quantum polynomial-time algorithm for Simon's problem
Brassard, G., & Høyer, P. (2002) · Israel Symposium on Theory and Computing Systems (ISTCS) · doi:10.1109/istcs.1997.595153 · Cited by 255
Systematic literature review: Quantum machine learning and its applications
García, D. P., Cruz-Benito, J., & García‐Peñalvo, F. J. (2024) · Computer Science Review · doi:10.1016/j.cosrev.2024.100619 · Cited by 372
Amplitude estimation without phase estimation
Suzuki, Y., Uno, S., Raymond, R., Tanaka, T., Onodera, T., & Yamamoto, N. (2020) · Quantum Information Processing · doi:10.1007/s11128-019-2565-2 · Cited by 249
Weak nonlinearities: A new route to optical quantum computation
Munro, W. J., Nemoto, K., & Spiller, T. P. (2005) · CERN Document Server (European Organization for Nuclear Research) · Cited by 249
Distributed secure quantum machine learning
Sheng, Y.-B., & Zhou, L. (2017) · Science Bulletin · doi:10.1016/j.scib.2017.06.007 · Cited by 245
(2004) · doi:10.1109/focs.2004.53 · Cited by 599
The impact of quantum computing on present cryptography
Mavroeidis, V., Vishi, K., D., M., & Jøsang, A. (2018) · International Journal of Advanced Computer Science and Applications · doi:10.14569/ijacsa.2018.090354 · Cited by 361
A framework for fast quantum mechanical algorithms
Grover, L. K. (1998) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/276698.276712 · Cited by 236
Self-citationQuantum Algorithm Implementations for Beginners
Jayakumar, A., Adedoyin, A. A., Ambrosiano, J. J., Anisimov, P. M., Casper, W., Chennupati, G., Coffrin, C., Djidjev, H. N., Gunter, D., Karra, S., et al. (2022) · ACM Transactions on Quantum Computing · doi:10.1145/3517340 · Cited by 362
Sophisticated Quantum Search Without Entanglement
Meyer, D. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.2014 · Cited by 242
Quantum image scaling using nearest neighbor interpolation
Jiang, N., & Wang, L. (2014) · Quantum Information Processing · doi:10.1007/s11128-014-0841-8 · Cited by 239
The many facets of natural computing
Lila Kari, A., & Rozenberg, G. (2008) · Communications of the ACM · doi:10.1145/1400181.1400200 · Cited by 245
Implementing Grover Oracles for Quantum Key Search on AES and LowMC
Jaques, S., Naehrig, M., Roetteler, M., & Virdia, F. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-45724-2_10 · Cited by 234
“The only caveat thus far is a security reduction due to key search or pre-image attacks with Grover’s algorithm [22].”
BackgroundMethodHow to Construct Quantum Random Functions
Zhandry, M. (2012) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2012.37 · Cited by 237
Programming languages and compiler design for realistic quantum hardware
Chong, F. T., Franklin, D. M., & Martonosi, M. (2017) · Nature · doi:10.1038/nature23459 · Cited by 252
Quantum cryptography beyond quantum key distribution
Broadbent, A., & Schaffner, C. (2015) · Designs Codes and Cryptography · doi:10.1007/s10623-015-0157-4 · Cited by 263
Guest Column: NP-complete problems and physical reality
Aaronson, S. (2005) · ACM SIGACT News · doi:10.1145/1052796.1052804 · Cited by 351
Watermarking and authentication of quantum images based on restricted geometric transformations
Iliyasu, A. M., Le, P. Q., Dong, F., & Hirota, K. (2011) · Information Sciences · doi:10.1016/j.ins.2011.09.028 · Cited by 223
Maciejewski, F. B., Zimborás, Z., & Oszmaniec, M. (2020) · Quantum · doi:10.22331/q-2020-04-24-257 · Cited by 271
Quantum Attacks on Bitcoin, and How to Protect Against Them
Aggarwal, D., Brennen, G., Lee, T., Santha, M., & Tomamichel, M. (2018) · Ledger · doi:10.5195/ledger.2018.127 · Cited by 231
Fast parallel circuits for the quantum Fourier transform
Cleve, R., & Watrous, J. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892140 · Cited by 269
Quantum circuits for isometries
Iten, R., Colbeck, R., Kukuljan, I., Home, J., & Christandl, M. (2016) · Physical Review A · doi:10.1103/physreva.93.032318 · Cited by 218
Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity
Watrous, J. (2001) · Journal of Computer and System Sciences · doi:10.1006/jcss.2000.1732 · Cited by 212
Quantum Walk Algorithm for Element Distinctness
Ambainis, A. (2004) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2004.54 · Cited by 226
Negative weights make adversaries stronger
Høyer, P., Lee, T., & Špalek, R. (2007) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1250790.1250867 · Cited by 273
Quantum algorithms: entanglement–enhanced information processing
EKERT, A. K., & Jozsa, R. (1998) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.1998.0248 · Cited by 230
Efficient distributed quantum computing
Beals, R., BRIERLEY, S. D., Gray, O., Harrow, A. W., Kutin, S., Linden, N., Shepherd, D. J., & Stather, M. (2013) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2012.0686 · Cited by 240
Machine Learning: Quantum vs Classical
Khan, T. M., & Robles‐Kelly, A. (2020) · IEEE Access · doi:10.1109/access.2020.3041719 · Cited by 238
Quantum Walks on the Hypercube
Moore, C., & Russell, A. C. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45726-7_14 · Cited by 211
MQT Bench: Benchmarking Software and Design Automation Tools for Quantum Computing
Quetschlich, N., Burgholzer, L., & Wille, R. (2023) · Quantum · doi:10.22331/q-2023-07-20-1062 · Cited by 270
A Hybrid Quantum-Inspired Genetic Algorithm for Multiobjective Flow Shop Scheduling
Li, B., & Wang, L. (2007) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/tsmcb.2006.887946 · Cited by 209
Quantum Charging Advantage Cannot Be Extensive without Global Operations
Gyhm, J.-Y., Šafránek, D., & Rosa, D. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.140501 · Cited by 220
Mapping Quantum Circuits to IBM QX Architectures Using the Minimal Number of SWAP and H Operations
Wille, R., Burgholzer, L., & Zulehner, A. (2019) · Proceedings of the 56th Annual Design Automation Conference 2019 · doi:10.1145/3316781.3317859 · Cited by 207
QuantumNAS: Noise-Adaptive Search for Robust Quantum Circuits
Wang, H., Ding, Y., Gu, J., Lin, Y., Pan, D. Z., Chong, F. T., & Han, S. (2022) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca53966.2022.00057 · Cited by 236
Poulin, D., & Wocjan, P. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.220502 · Cited by 201
A novel quantum representation for log-polar images
Zhang, Y., Lü, K., Gao, Y., & Xu, K. (2013) · Quantum Information Processing · doi:10.1007/s11128-013-0587-8 · Cited by 204
A survey of blockchain from security perspective
Dasgupta, D., Shrein, J. M., & Gupta, K. D. (2019) · Journal of Banking and Financial Technology · doi:10.1007/s42786-018-00002-6 · Cited by 204
Distributed quantum computing across an optical network link
Main, D., Drmota, P., Nadlinger, D. P., Ainley, E. M., Agrawal, A., Nichol, B. C., Srinivas, R., Araneda, G., & Lucas, D. M. (2025) · Nature · doi:10.1038/s41586-024-08404-x · Cited by 274
Cybersecurity Threats and Their Mitigation Approaches Using Machine Learning—A Review
Ahsan, M., Nygard, K. E., Gomes, R., Chowdhury, M. M., Rifat, N., & Connolly, J. F. (2022) · Journal of Cybersecurity and Privacy · doi:10.3390/jcp2030027 · Cited by 249
Distinguishability and Accessible Information in Quantum TheoryPreprint
Fuchs, A. (1996) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9601020 · Cited by 332
A new universal and fault-tolerant quantum basis
Boykin, P. O., Mor, T., Pulver, M., Roychowdhury, V., & Vatan, F. (2000) · Information Processing Letters · doi:10.1016/s0020-0190(00)00084-3 · Cited by 194
Ambainis, A. (2004) · ACM SIGACT News · doi:10.1145/992287.992296 · Cited by 216
How Powerful is Adiabatic Quantum ComputationPreprint
van Dam, W., Mosca, M., & Vazirani, U. V. (2001) · Cited by 203
Adiabatic Quantum Simulation of Quantum Chemistry
Babbush, R., Love, P. J., & Aspuru-Guzik, A. (2014) · Scientific Reports · doi:10.1038/srep06603 · Cited by 191
Perspective on the Current State-of-the-Art of Quantum Computing for Drug Discovery Applications
Blunt, N. S., Camps, J., Crawford, O., Izsák, R., Leontica, S., Mirani, A., Moylett, A. E., Scivier, S. A., Sünderhauf, C., Schopf, P., et al. (2022) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.2c00574 · Cited by 192
Zero-Knowledge against Quantum Attacks
Watrous, J. (2009) · SIAM Journal on Computing · doi:10.1137/060670997 · Cited by 184
Near-optimal ground state preparation
Lin, L., & Tong, Y. (2020) · Quantum · doi:10.22331/q-2020-12-14-372 · Cited by 243
Floyd--hoare logic for quantum programs
Ying, M. (2011) · ACM Transactions on Programming Languages and Systems · doi:10.1145/2049706.2049708 · Cited by 187
Challenges and opportunities in quantum optimization
Abbas, A., Ambainis, A., Augustino, B., Bärtschi, A., Buhrman, H., Coffrin, C., Cortiana, G., Dunjko, V., Egger, D. J., Elmegreen, B. G., et al. (2024) · Nature Reviews Physics · doi:10.1038/s42254-024-00770-9 · Cited by 201
“Grover’s search 1 , quantum annealing, adiabatic quantum optimization 2,3 and the quantum approximate optimization algorithm (QAOA) 4 provided a promising start, but it has become clear that more is needed to realize a practical quantum advantage in optimization.”
Maciejewski, F., Zimborás, Z., & Oszmaniec, M. (2020) · Repository of the Academy's Library (Library of the Hungarian Academy of Sciences) · Cited by 184
Does quantum mechanics play a non-trivial role in life?
Davies, P. C. W. (2004) · Biosystems · doi:10.1016/j.biosystems.2004.07.001 · Cited by 187
Quantum Walk Based Search Algorithms
Sántha, M. (2008) · Springer eBooks · doi:10.1007/978-3-540-79228-4_3 · Cited by 194
Quantum Optical Technologies for Metrology, Sensing, and Imaging
Dowling, J. P., & Seshadreesan, K. P. (2014) · Journal of Lightwave Technology · doi:10.1109/jlt.2014.2386795 · Cited by 181
Semiconductor quantum computation
Zhang, X., Li, H.-O., Cao, G., Xiao, M., Guo, G.-C., & Guo, G.-P. (2018) · National Science Review · doi:10.1093/nsr/nwy153 · Cited by 191
Quantum-inspired support vector machine
Ding, C., Bao, T.-Y., & Huang, H.-L. (2022) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3084467 · Cited by 186
Limit on the Speed of Quantum Computation in Determining Parity
Farhi, E., Goldstone, J., Gutmann, S., & Sipser, M. (1998) · Physical Review Letters · doi:10.1103/physrevlett.81.5442 · Cited by 175
Quantum communication complexity of symmetric predicates
Razborov, A. A. (2003) · Izvestiya Mathematics · doi:10.1070/im2003v067n01abeh000422 · Cited by 196
Quantum Image Encryption and Decryption Algorithms Based on Quantum Image Geometric Transformations
Zhou, R., Wu, Q. H., Zhang, M., & Shen, C. (2012) · International Journal of Theoretical Physics · doi:10.1007/s10773-012-1274-8 · Cited by 180
The Evolution of Quantum Secure Direct Communication: On the Road to the Qinternet
Pan, D., Long, G., Yin, L., Sheng, Y., Ruan, D., Ng, S. X., Lü, J., & Hanzo, L. (2024) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2024.3367535 · Cited by 211
Quantum programming languages: survey and bibliography
Gay, S. J. (2006) · Mathematical Structures in Computer Science · doi:10.1017/s0960129506005378 · Cited by 173
Quantum lower bounds by polynomials
Beals, R., Buhrman, H., Cleve, R., Mosca, M., & de Wolf, R. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1998.743485 · Cited by 184
Quantum-assisted and Quantum-based Solutions in Wireless SystemsPreprint
Imre, S., & Gyöngyösi, L. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1206.5996 · Cited by 186
QASMBench: A Low-Level Quantum Benchmark Suite for NISQ Evaluation and Simulation
Li, A., Stein, S., Krishnamoorthy, S., & Ang, J. (2023) · ACM Transactions on Quantum Computing · doi:10.1145/3550488 · Cited by 183
The quantum query complexity of approximating the median and related statistics
Nayak, A., & Wu, F. (1999) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/301250.301349 · Cited by 218
Quantum Theory: Informational Foundations and Foils
(2016) · Fundamental Theories of Physics · doi:10.1007/978-94-017-7303-4 · Cited by 178
Bardin, J. C., White, T., Giustina, M., Satzinger, K. J., Arya, K., Roushan, P., Chiaro, B., Kelly, J., Chen, Z., Burkett, B., et al. (2019) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.2019.2937234 · Cited by 183
Material platforms for integrated quantum photonics
Bogdanov, S., Shalaginov, M. Y., Boltasseva, A., & Shalaev, V. M. (2017) · Optical Materials Express · doi:10.1364/ome.7.000111 · Cited by 176
NISQ computing: where are we and where do we go?
Lau, J. W. Z., Lim, K. H., Shrotriya, H., & Kwek, L. C. (2022) · AAPPS bulletin · doi:10.1007/s43673-022-00058-z · Cited by 199
How powerful is adiabatic quantum computation?
van Dam, W., Mosca, M., & Vazirani, U. (2001) · Proceedings 42nd IEEE Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959902 · Cited by 175
CutQC: using small Quantum computers for large Quantum circuit evaluations
Tang, W., Tomesh, T., Suchara, M., Larson, J. M., & Martonosi, M. (2021) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3445814.3446758 · Cited by 219
How to Record Quantum Queries, and Applications to Quantum Indifferentiability
Zhandry, M. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-26951-7_9 · Cited by 229
Quantum Security Analysis of AES
Bonnetain, X., Naya‐Plasencia, M., & Schrottenloher, A. (2019) · IACR Transactions on Symmetric Cryptology · doi:10.46586/tosc.v2019.i2.55-93 · Cited by 191
Complexity Limitations on Quantum Computation
Fortnow, L., & Rogers, J. D. (1999) · Journal of Computer and System Sciences · doi:10.1006/jcss.1999.1651 · Cited by 188
Transformation rules for designing CNOT-based quantum circuits
Iwama, K., Kambayashi, Y., & Yamashita, S. (2002) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/513918.514026 · Cited by 171
Two-way finite automata with quantum and classical states
Ambainis, A., & Watrous, J. (2002) · Theoretical Computer Science · doi:10.1016/s0304-3975(02)00138-x · Cited by 169
Multi-party quantum key agreement with bell states and bell measurements
Shi, R., & Zhong, H. (2012) · Quantum Information Processing · doi:10.1007/s11128-012-0443-2 · Cited by 166
Grover Meets Simon – Quantumly Attacking the FX-construction
Leander, G., & May, A. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-70697-9_6 · Cited by 172
Experimental evaluation of an adiabiatic quantum system for combinatorial optimization
McGeoch, C. C., & Wang, C. (2013) · ACM International Conference on Computing Frontiers (CF) · doi:10.1145/2482767.2482797 · Cited by 172
Novel quantum image encryption using one-dimensional quantum cellular automata
Yang, Y.-G., Tian, J., Lei, H., Zhou, Y.-H., & Shi, W.-M. (2016) · Information Sciences · doi:10.1016/j.ins.2016.01.078 · Cited by 163
Multiparty quantum key agreement with single particles
Liu, B., Gao, F., Huang, W., & Wen, Q. (2012) · Quantum Information Processing · doi:10.1007/s11128-012-0492-6 · Cited by 163
Quantum computing on encrypted data
Fisher, K. A. G., Broadbent, A., Shalm, L. K., Yan, Z., Lavoie, J., Prevedel, R., Jennewein, T., & Resch, K. J. (2014) · Nature Communications · doi:10.1038/ncomms4074 · Cited by 157
Quantum Lower Bounds by PolynomialsPreprint
Beals, R., Buhrman, H., Cleve, R., et al. (1998) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9802049 · Cited by 164
Quantum computing at the frontiers of biological sciences
Emani, P. S., Warrell, J., Anticevic, A., Bekiranov, S., Gandal, M., McConnell, M. J., Sapiro, G., Aspuru-Guzik, A., Baker, J. T., Bastiani, M., et al. (2021) · Nature Methods · doi:10.1038/s41592-020-01004-3 · Cited by 163
Quantum Computing and Communications
Imre, S., & Balázs, F. (2004) · Wiley eBooks · doi:10.1002/9780470869048 · Cited by 167
Simulating a perceptron on a quantum computer
Schuld, M., Sinayskiy, I., & Petruccione, F. (2014) · Physics Letters A · doi:10.1016/j.physleta.2014.11.061 · Cited by 165
Recent Developments and Applications in Quantum Neural Network: A Review
Jeswal, S. K., & Chakraverty, S. (2018) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-018-9269-0 · Cited by 162
Metadata
- Authors
- Grover, L. K.
- Affiliations
- AT&T (United States) (US)
- Corresponding author
- Grover, Lov K.
- Venue
- Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96
- Publisher
- ACM Press
- Published
- 1996
- Pages
- 212-219
- OpenAlex
- W2084652510
- Semantic Scholar
- 298d799da82395a64a3bda38ef9d2a4646828ccb
- Cited by
- 8,830
- References
- 24
- Citations by year
- 2026: 664 · 2025: 1066 · 2024: 896 · 2023: 841 · 2022: 674 · 2021: 655 · 2020: 529 · 2019: 423 · 2018: 288 · 2017: 283 · 2016: 219 · 2015: 221 · 2014: 184 · 2013: 161 · 2012: 158
- FWCI
- 36.24
- Type
- conference paper
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- ACM Symposium on Theory of Computing (STOC) (publishedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- quantum search, unsorted database search, Grover's algorithm, quantum algorithms, time complexity, quantum parallelism, lower bounds
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.
A language model drew the claims from the paper on 2026-10-21, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-21 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
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
