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
19 No basis given · 8 Sources not found · 4 Own interpretation
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
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- 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
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
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
“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
boosted- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
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
“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
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
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 1-The matix D is unitary.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
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 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
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- 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
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
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
“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
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
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
“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
plainconditional- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
- 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
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- 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
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably 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
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It 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
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The 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 > ------------------------------------------------
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It 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.
boosteddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably 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
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably 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
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably 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
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably 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.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably 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.
hedgeddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably 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.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably 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
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 301–400 of 8,792
Review of Quantum Image Processing
Wang, Z., Xu, M., & Zhang, Y. (2021) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-021-09599-2 · Cited by 127
A Survey and Comparison of Post-Quantum and Quantum Blockchains
Yang, Z., Alfauri, H., Farkiani, B., Jain, R. K., Pietro, R. D., & Erbad, A. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3325761 · Cited by 150
Design Principles for HFEv- Based Multivariate Signature Schemes
Petzoldt, A., Chen, M.-S., Yang, B., Tao, C., & Ding, J. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-48797-6_14 · Cited by 123
Projection-based runtime assertions for testing and debugging Quantum programs
Li, G., Zhou, L., Yu, N., Ding, Y., Ying, M., & Xie, Y. (2020) · Proceedings of the ACM on Programming Languages · doi:10.1145/3428218 · Cited by 156
Quantum optimization for training support vector machines
Anguita, D., Ridella, S., Rivieccio, F., & Zunino, R. (2003) · Neural Networks · doi:10.1016/s0893-6080(03)00087-x · Cited by 119
SQR: a simple quantum representation of infrared images
Yuan, S., Mao, X., Xue, Y., Chen, L., Xiong, Q., & Compare, A. (2014) · Quantum Information Processing · doi:10.1007/s11128-014-0733-y · Cited by 117
Efficient Medical Big Data Management With Keyword-Searchable Encryption in Healthchain
Li, C., Dong, M., Li, J., Xu, G., Chen, X., Liu, W., & Ota, K. (2022) · IEEE Systems Journal · doi:10.1109/jsyst.2022.3173538 · Cited by 119
Quantum communication and complexity
de Wolf, R. (2002) · Theoretical Computer Science · doi:10.1016/s0304-3975(02)00377-8 · Cited by 114
A random walk approach to quantum algorithms
Kendon, V. M. (2006) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2006.1901 · Cited by 113
Quantum Computing: Fundamentals, Implementations and Applications
Bhat, H. A., Khanday, F. A., Kaushik, B. K., Bashir, F. I., & Shah, K. A. (2022) · IEEE Open Journal of Nanotechnology · doi:10.1109/ojnano.2022.3178545 · Cited by 131
Quantum Walks for Computer Scientists
Venegas-Andraca, S. E. (2008) · Synthesis lectures on quantum computing · doi:10.1007/978-3-031-02511-2 · Cited by 123
Security on the quantum-type Even-Mansour cipher
Kuwakado, H., & Morii, M. (2012) · International Symposium on Information Theory and its Applications · Cited by 114
Li, H.-S., Zhu, Q., Zhou, R., Li, M.-C., Song, L., & Ian, H. (2014) · Information Sciences · doi:10.1016/j.ins.2014.03.035 · Cited by 114
Quantum transfer learning for breast cancer detection
Azevedo, V., Silva, C., & Dutra, I. (2022) · Quantum Machine Intelligence · doi:10.1007/s42484-022-00062-4 · Cited by 129
Quantum Machine Learning—An Overview
Tychola, K. A., Kalampokas, Τ., & Papakostas, G. A. (2023) · Electronics · doi:10.3390/electronics12112379 · Cited by 143
Image encryption scheme by combining the hyper-chaotic system with quantum coding
Luo, Y., Tang, S., Liu, J., Cao, L., & Qiu, S. (2019) · Optics and Lasers in Engineering · doi:10.1016/j.optlaseng.2019.105836 · Cited by 115
Quantum Cryptography in 5G Networks: A Comprehensive Overview
Mehić, M., Michálek, L., Dervisevic, E., Burdiak, P., Plakalovic, M., Rozhon, J., Mahovac, N., Richter, F., Kaljić, E., Lauterbach, F., et al. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3309051 · Cited by 131
(2014) · doi:10.1145/2597917.2597939 · Cited by 152
IND-CCA-Secure Key Encapsulation Mechanism in the Quantum Random Oracle Model, Revisited
Jiang, H., Zhang, Z., Chen, L., Wang, H., & Ma, Z. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-96878-0_4 · Cited by 114
Zhou, N., Yan, X., Liang, H., Tao, X., & Li, G. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-2104-6 · Cited by 113
Trends in Hardware Security: From Basics to ASICs
Alioto, M. (2019) · IEEE Solid-State Circuits Magazine · doi:10.1109/mssc.2019.2923503 · Cited by 114
A verified optimizer for Quantum circuits
Hietala, K., Rand, R., Hung, S.-H., Wu, X., & Hicks, M. (2021) · Proceedings of the ACM on Programming Languages · doi:10.1145/3434318 · Cited by 119
Quantum Neuron: an elementary building block for machine learning on quantum computersPreprint
Cao, Y., Guerreschi, G. G., & Aspuru‐Guzik, A. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1711.11240 · Cited by 200
A Short History of Computational Complexity
Fortnow, L., & Homer, S. T. (2003) · Cited by 113
Advanced Equivalence Checking for Quantum Circuits
Burgholzer, L., & Wille, R. (2020) · Springer eBooks · doi:10.1007/978-3-032-06770-8_14 · Cited by 112
Advances in quantum entanglement purification
Yan, P., Zhou, L., Zhong, W., & Sheng, Y. (2023) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-022-2065-x · Cited by 120
Recent Advances for Quantum Neural Networks in Generative Learning
Tian, J., Sun, X., Du, Y., Zhao, S., Liu, Q., Zhang, K., Yi, W., Huang, W., Wang, C., Wu, X., et al. (2023) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2023.3272029 · Cited by 147
Quantum Computation and Quantum InformationPreprint
Wang, Y. (2016) · Cited by 128
Disentangling Hype from Practicality: On Realistically Achieving Quantum Advantage
Hoefler, T., Häner, T., & Troyer, M. (2023) · Communications of the ACM · doi:10.1145/3571725 · Cited by 119
Quantum communication for wireless wide-area networks
Cheng, S.-T., Wang, C.-Y., & Tao, M.-H. (2005) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2005.851157 · Cited by 109
Experimental realization of quantum algorithm for solving linear systems of equations
Pan, J., Cao, Y., Yao, X., Li, Z., Ju, C., Chen, H., Peng, X., Kais, S., & Du, J. (2014) · Physical Review A · doi:10.1103/physreva.89.022313 · Cited by 110
Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation
Bartschi, A., & Eidenbenz, S. (2020) · 2020 IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00020 · Cited by 122
Duong, T. Q., Ansere, J. A., Narottama, B., Sharma, V., Dobre, O. A., & Shin, H. (2022) · IEEE Open Journal of Vehicular Technology · doi:10.1109/ojvt.2022.3202876 · Cited by 106
Quantum-resistance in blockchain networks
Allende, M., León, D. L., Cerón, S., Pareja, A., Pacheco, E., Leal, A., Da Silva, M., Pardo, A., Jones, D., Worrall, D. J., et al. (2023) · Scientific Reports · doi:10.1038/s41598-023-32701-6 · Cited by 109
“Quantum computers will be able to find these nonces quadratically faster using Grover’s algorithm [69].”
MethodGrover's Quantum Algorithm Applied to Global Optimization
Baritompa, W. P., Bulger, D. W., & Wood, G. R. (2005) · SIAM Journal on Optimization · doi:10.1137/040605072 · Cited by 108
Quantum inference on Bayesian networks
Low, G. H., Yoder, T. J., & Chuang, I. L. (2014) · Physical Review A · doi:10.1103/physreva.89.062315 · Cited by 109
Automated distribution of quantum circuits via hypergraph partitioning
Andrés-Martínez, P., & Heunen, C. (2019) · Physical Review A · doi:10.1103/physreva.100.032308 · Cited by 112
A Quantum Logic Array Microarchitecture: Scalable Quantum Data Movement and Computation
Metodi, T. S., Thaker, D., & Cross, A. W. (2006) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1109/micro.2005.9 · Cited by 108
A quantum Jensen–Shannon graph kernel for unattributed graphs
Bai, L., Rossi, L., Andrea Torsello, A., & Hancock, E. R. (2014) · Pattern Recognition · doi:10.1016/j.patcog.2014.03.028 · Cited by 111
Quantum-behaved particle swarm optimization algorithm for economic load dispatch of power system
Zhisheng, Z. (2009) · Expert Systems with Applications · doi:10.1016/j.eswa.2009.07.042 · Cited by 110
Local feature point extraction for quantum images
Zhang, Y., Lü, K., Xu, K., Gao, Y., & Wilson, R. C. (2014) · Quantum Information Processing · doi:10.1007/s11128-014-0842-7 · Cited by 108
On the Security of the Winternitz One-Time Signature Scheme
Buchmann, J. A., Dahmen, E., Ereth, S., Hülsing, A., & Rückert, M. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-21969-6_23 · Cited by 107
Implementing Grover’s Algorithm on the IBM Quantum Computers
Mandviwalla, A., Ohshiro, K., & Ji, B. (2018) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata.2018.8622457 · Cited by 108
Fast Geometric Transformations on Quantum Images
Le, P. Q., Iliyasu, A. M., & Dong, F. (2010) · Cited by 106
Quantum lattice-gas model for computational fluid dynamics
Yepez, J. (2001) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.63.046702 · Cited by 111
Determining the minimal number of swap gates for multi-dimensional nearest neighbor quantum circuits
Lye, A., Wille, R., & Drechsler, R. (2015) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1109/aspdac.2015.7059001 · Cited by 104
Lin, L., & Tong, Y. (2020) · Quantum · doi:10.22331/q-2020-11-11-361 · Cited by 158
An XQDD-Based Verification Method for Quantum Circuits
Wang, S.-W., Lu, C.-Y., Tsai, I.-M., & Kuo, S. (2008) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1093/ietfec/e91-a.2.584 · Cited by 107
Quantum lower bound for the collision problem
Aaronson, S. (2002) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/509907.509999 · Cited by 117
Efficient mapping of quantum circuits to the IBM QX architectures
Zulehner, A., Paler, A., & Wille, R. (2018) · Design, Automation, and Test in Europe · doi:10.23919/date.2018.8342181 · Cited by 108
$O(N^3)$ Measurement Cost for Variational Quantum Eigensolver on Molecular Hamiltonians
Gokhale, P., Angiuli, O., Ding, Y., Gui, K., Tomesh, T., Suchara, M., Martonosi, M., & Chong, F. T. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.3035814 · Cited by 104
Nested quantum search and structured problems
Cerf, N. J., Grover, L. K., & Williams, C. P. (2000) · Physical Review A · doi:10.1103/physreva.61.032303 · Cited by 115
Self-citationThe design of Xoodoo and Xoofff
Daemen, J., Hoffert, S., Assche, G. V., et al. (2018) · IACR Transactions on Symmetric Cryptology · doi:10.46586/tosc.v2018.i4.1-38 · Cited by 103
Forging the Future: Strategic Approaches to Quantum AI Integration for Industry Transformation
How, M.-L., & Cheah, S.-M. (2024) · AI · doi:10.3390/ai5010015 · Cited by 120
Wang, L., Tang, F., & Wu, H. (2005) · Applied Mathematics and Computation · doi:10.1016/j.amc.2005.01.115 · Cited by 103
Building Secure Tame-like Multivariate Public-Key Cryptosystems: The New TTS
Yang, B., & Chen, J.-M. (2005) · Lecture notes in computer science · doi:10.1007/11506157_43 · Cited by 103
Quantum Perceptron ModelsPreprint
Wiebe, N., Kapoor, A., & Svore, K. M. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1602.04799 · Cited by 135
Yang, Y., Jia, X., Sun, S.-J., & Pan, Q.-X. (2014) · Information Sciences · doi:10.1016/j.ins.2014.02.124 · Cited by 99
E2E Fidelity Aware Routing and Purification for Throughput Maximization in Quantum Networks
Zhao, Y., Zhao, G., & Qiao, C. (2022) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom48880.2022.9796814 · Cited by 102
Quantum Complexity of Integration
Novak, E. (2001) · Journal of Complexity · doi:10.1006/jcom.2000.0566 · Cited by 102
Improvements on “multiparty quantum key agreement with single particles”
Sun, Z., Zhang, C., Wang, B.-H., Li, Q., & Long, D. (2013) · Quantum Information Processing · doi:10.1007/s11128-013-0608-7 · Cited by 101
Quantum key agreement with EPR pairs and single-particle measurements
Huang, W., Wen, Q., Liu, B., Gao, F., & Sun, Y. (2013) · Quantum Information Processing · doi:10.1007/s11128-013-0680-z · Cited by 101
Quantum query complexity and semi-definite programming
Barnum, H., Saks, M., & Szegedy, M. (2004) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.2003.1214419 · Cited by 119
Quantum SDP-Solvers: Better upper and lower bounds
van Apeldoorn, J., Gilyén, A., Gribling, S., & de Wolf, R. (2020) · Quantum · doi:10.22331/q-2020-02-14-230 · Cited by 100
Efficiently Computable Bounds for Magic State Distillation
Wang, X., Wilde, M. M., & Su, Y. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.090505 · Cited by 120
Kong, P. (2020) · IEEE Systems Journal · doi:10.1109/jsyst.2020.3024956 · Cited by 109
Chen, S., Cotler, J. S., Huang, H.-Y., & Li, J. Z. (2023) · Nature Communications · doi:10.1038/s41467-023-41217-6 · Cited by 139
Black-box Hamiltonian simulation and unitary implementation
Childs, A. M., & Berry, D. W. (2012) · Quantum Information and Computation · doi:10.26421/qic12.1-2-4 · Cited by 107
Black-box hamiltonian simulation and unitary implementationPreprint
Berry, D. W., & Childs, A. M. (2012) · doi:10.5555/2231036.2231040 · Cited by 122
Quantum computing for near-term applications in generative chemistry and drug discovery.
Pyrkov, A., Aliper, A., Bezrukov, D., Lin, Y.-C., Polykovskiy, D., Kamya, P., Ren, F., & Zhavoronkov, A. (2023) · Drug Discovery Today · doi:10.1016/j.drudis.2023.103675 · Cited by 100
Post-Quantum Era Privacy Protection for Intelligent Infrastructures
Malina, L., Dzurenda, P., Ricci, S., Hajny, J., Srivastava, G., Matulevicius, R., Affia, A.-A. O., Laurent, M., Sultan, N. H., & Tang, Q. (2021) · IEEE Access · doi:10.1109/access.2021.3062201 · Cited by 111
Dense-Coding Attack on Three-Party Quantum Key Distribution Protocols
Gao, F., Qin, S.-J., Guo, F.-Z., & Wen, Q.-Y. (2011) · IEEE Journal of Quantum Electronics · doi:10.1109/jqe.2011.2107889 · Cited by 100
Encoding patterns for quantum algorithms
Weigold, M., Barzen, J., Leymann, F., & Salm, M. (2021) · IET Quantum Communication · doi:10.1049/qtc2.12032 · Cited by 112
Quantum lower bounds for the collision and the element distinctness problems
Shi, Y. (2003) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2002.1181975 · Cited by 121
Quantum machine learning: from physics to software engineering
Melnikov, A. A., Kordzanganeh, M., Alodjants, A. P., & Lee, R. (2023) · Advances in Physics X · doi:10.1080/23746149.2023.2165452 · Cited by 125
Quantum Computing and Machine Learning in Medical Decision-Making: A Comprehensive Review
Chow, J. C. L. (2025) · Algorithms · doi:10.3390/a18030156 · Cited by 122
2006, Quantum verification of matrix products
Buhrman, H., & Špalek, R. (2004) · UvA-DARE (University of Amsterdam) · Cited by 105
Exact Reordering of Circuit Lines for Nearest Neighbor Quantum Architectures
Wille, R., Lye, A., & Drechsler, R. (2014) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2014.2356463 · Cited by 97
Zouache, D., Nouioua, F., & Moussaouı, A. (2015) · Soft Computing · doi:10.1007/s00500-015-1681-x · Cited by 99
A Post-quantum Digital Signature Scheme Based on Supersingular Isogenies
Yoo, Y., Azarderakhsh, R., Jalali, A., Jao, D., & Soukharev, V. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-70972-7_9 · Cited by 98
Quantum algorithm for the advection–diffusion equation simulated with the lattice Boltzmann method
Budinski, L. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-02996-3 · Cited by 115
Quantum computing for smart grid applications
Ullah, M. H., Eskandarpour, R., Zheng, H., & Khodaei, A. (2022) · IET Generation Transmission & Distribution · doi:10.1049/gtd2.12602 · Cited by 107
Variable time amplitude amplification and quantum algorithms for linear algebra problems
Ambainis, A. (2012) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.stacs.2012.636 · Cited by 96
Reflections for quantum query algorithms
Reichardt, B. W. (2011) · Cited by 104
A quantum-inspired gravitational search algorithm for binary encoded optimization problems
Nezamabadi–pour, H. (2015) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2015.01.002 · Cited by 96
Zhang, H., & Li, D. (2007) · IEEE International Conference on Granular Computing (GrC) · doi:10.1109/grc.2007.40 · Cited by 109
Huang, H.-L., Xu, X., Guo, C., Tian, G., Wei, S.-J., Sun, X., Bao, W., & Long, G. (2023) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-022-2057-y · Cited by 111
A comprehensive review of quantum machine learning: from NISQ to fault tolerance
Wang, Y., & Liu, J. (2024) · Reports on Progress in Physics · doi:10.1088/1361-6633/ad7f69 · Cited by 145
Basic Concepts in Quantum Computation
EKERT, A. K., Hayden, P. M., & Inamori, H. (2007) · Springer eBooks · doi:10.1007/3-540-45338-5_10 · Cited by 118
QSobel: A novel quantum image edge extraction algorithm
Zhang, Y., Lü, K., & Gao, Y. (2014) · Science China Information Sciences · doi:10.1007/s11432-014-5158-9 · Cited by 96
Duality Quantum Computing and Duality Quantum Information Processing
Long, G. L. (2010) · International Journal of Theoretical Physics · doi:10.1007/s10773-010-0603-z · Cited by 96
Rimbach-Russ, M., & Burkard, G. (2017) · Journal of Physics Condensed Matter · doi:10.1088/1361-648x/aa761f · Cited by 97
Solid‐State Single‐Photon Sources: Recent Advances for Novel Quantum Materials
Esmann, M., Wein, S. C., & Antón, C. (2024) · Advanced Functional Materials · doi:10.1002/adfm.202315936 · Cited by 111
Grover search with lackadaisical quantum walks
Wong, T. G. (2015) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/48/43/435304 · Cited by 93
Image segmentation on a quantum computer
Caraiman, S., & Manta, V. (2015) · Quantum Information Processing · doi:10.1007/s11128-015-0932-1 · Cited by 95
Span-program-based quantum algorithm for evaluating formulas
Reichardt, B. W., & Špalek, R. (2008) · doi:10.1145/1374376.1374394 · Cited by 96
Architectural implications of quantum computing technologies
Meter, R. V., & Oskin, M. (2006) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/1126257.1126259 · Cited by 93
String matching in O(n+m) quantum time
Ramesh, H., & Vinay, V (2003) · Journal of Discrete Algorithms · doi:10.1016/s1570-8667(03)00010-8 · Cited by 95
(2019) · doi:10.1145/3297858.3304018 · Cited by 118
Recent progress in quantum algorithms
Bacon, D., & van Dam, W. (2010) · Communications of the ACM · doi:10.1145/1646353.1646375 · Cited by 95
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
