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 1,101–1,200 of 8,792
CLASSIFICATION OF ENTANGLEMENT IN SYMMETRIC STATES
Aulbach, M. (2012) · International Journal of Quantum Information · doi:10.1142/s0219749912300045 · Cited by 36
Quantum games and quantum algorithms
Meyer, D. (2002) · Contemporary mathematics - American Mathematical Society · doi:10.1090/conm/305/05221 · Cited by 40
Fast-forwarding of Hamiltonians and exponentially precise measurements
Atia, Y., & Aharonov, D. (2017) · RePEc: Research Papers in Economics · Cited by 43
Fazilat, M., Zioui, N., & St-Arnaud, J. (2022) · Results in Engineering · doi:10.1016/j.rineng.2022.100402 · Cited by 38
Scalable Optimal Layout Synthesis for NISQ Quantum Processors
Lin, W.-H., Kimko, J., Tan, D. B., Bjørner, N., & Cong, J. (2023) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac56929.2023.10247760 · Cited by 45
A Comprehensive but not Complicated Survey on Quantum Computing
Menon, P. S., & Ritwik, M. (2014) · IERI Procedia · doi:10.1016/j.ieri.2014.09.069 · Cited by 40
Theoretically extensible quantum digital signature with starlike cluster states
Yang, Y., Liu, Z., Li, J., et al. (2016) · Quantum Information Processing · doi:10.1007/s11128-016-1458-x · Cited by 36
Coined quantum walks on weighted graphs
Wong, T. G. (2017) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/aa8c17 · Cited by 39
Exact Global Reordering for Nearest Neighbor Quantum Circuits Using A $$^{*}$$
Zulehner, A., Gasser, S., & Wille, R. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59936-6_15 · Cited by 36
Quantum Key-Recovery on Full AEZ
Bonnetain, X. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-72565-9_20 · Cited by 36
Locality-preserving logical operators in topological stabilizer codes
Webster, P., & Bartlett, S. D. (2018) · Physical Review A · doi:10.1103/physreva.97.012330 · Cited by 36
Reversible Pebbling Game for Quantum Memory Management
Meuli, G., Soeken, M., Roetteler, M., Bjørner, N., & Micheli, G. D. (2019) · Design, Automation, and Test in Europe · doi:10.23919/date.2019.8715092 · Cited by 37
Bibliometric Survey of Quantum Machine Learning
Pande, M. B., & Mulay, P. (2020) · Science & Technology Libraries · doi:10.1080/0194262x.2020.1776193 · Cited by 39
Physical security in the post-quantum era
Chowdhury, S., Covic, A., Acharya, R. Y., Dupee, S., Ganji, F., & Forte, D. J. (2021) · Journal of Cryptographic Engineering · doi:10.1007/s13389-021-00255-w · Cited by 60
Artificial Intelligence in Medicine Using Quantum Computing in the Future of Healthcare
Davids, J., Lidströmer, N., & Ashrafian, H. (2022) · Springer eBooks · doi:10.1007/978-3-030-64573-1_338 · Cited by 38
Classical and quantum-inspired Tabu search for solving 0/1 knapsack problem
Chou, Y., Yang, Y.-J., & Chiu, C.-H. (2011) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/icsmc.2011.6083848 · Cited by 37
Power of one qumode for quantum computation
Liu, N., Thompson, J. E., Weedbrook, C., Lloyd, S., Vedral, V., Gu, M., & Modi, K. K. (2016) · Physical Review A · doi:10.1103/physreva.93.052304 · Cited by 45
Obada, A. ‐. F., Hessian, H. A., Mohamed, A. A., & Homid, A. H. (2013) · Quantum Information Processing · doi:10.1007/s11128-013-0664-z · Cited by 35
Quantum Computing for High-School Students An Experience Report
Angara, P. P., Stege, U., & MacLean, A. (2020) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00047 · Cited by 36
Liu, L., & Dou, X. (2023) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/3631525 · Cited by 46
Brady, A. J., Eickbusch, A., Singh, S., Wu, J., & Zhuang, Q. (2024) · Progress in Quantum Electronics · doi:10.1016/j.pquantelec.2023.100496 · Cited by 51
Distributed Grover's algorithm
Qiu, D., Luo, L., & Xiao, L. (2024) · Theoretical Computer Science · doi:10.1016/j.tcs.2024.114461 · Cited by 47
Variational quantum algorithms: fundamental concepts, applications and challenges
Qi, H., Xiao, S., Liu, Z., Gong, C., & Gani, A. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04438-2 · Cited by 51
State preparation by shallow circuits using feed forward
Buhrman, H., Folkertsma, M., Loff, B., & Neumann, N. M. P. (2024) · Quantum · doi:10.22331/q-2024-12-09-1552 · Cited by 35
Aslam, A. M., Bhardwaj, A., & Chaudhary, R. (2025) · Vehicular Communications · doi:10.1016/j.vehcom.2025.100880 · Cited by 35
Grover’s algorithm in a four-qubit silicon processor above the fault-tolerant threshold
Thorvaldson, I., Poulos, D., Moehle, C. M., Misha, S. H., Edlbauer, H., Reiner, J.-M., Geng, H., Voisin, B., Jones, M. T., Donnelly, M. B., et al. (2025) · Nature Nanotechnology · doi:10.1038/s41565-024-01853-5 · Cited by 35
Quantum-enhanced deliberation of learning agents using trapped ions
Dunjko, V., Friis, N., & Briegel, H. J. (2015) · New Journal of Physics · doi:10.1088/1367-2630/17/2/023006 · Cited by 35
Reexamination of arbitrated quantum signature: the impossible and the possible
Zhang, K., Qin, S., Sun, Y., Song, T., & Su, Q. (2013) · Quantum Information Processing · doi:10.1007/s11128-013-0589-6 · Cited by 36
Quantum computing and communications – Introduction and challenges
Imre, S. (2013) · Computers & Electrical Engineering · doi:10.1016/j.compeleceng.2013.10.008 · Cited by 35
Distributed Arithmetic on a Quantum Multicomputer
Meter, R. V., Nemoto, K., Munro, W. J., & Itoh, K. M. (2006) · ACM SIGARCH Computer Architecture News · doi:10.1145/1150019.1136517 · Cited by 38
Quantum proofs for classical theorems
(2011) · Theory of Computing · doi:10.4086/toc.gs.2011.002 · Cited by 41
FPGA-based Key Generator for the Niederreiter Cryptosystem Using Binary Goppa Codes
Wang, W., Szefer, J. M., & Niederhagen, R. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-66787-4_13 · Cited by 36
A review and vision on authentication and privacy preservation schemes in smart grid network
Agarkar, A. A., & Agrawal, H. (2019) · Security and Privacy · doi:10.1002/spy2.62 · Cited by 35
On quantum methods for machine learning problems part II: Quantum classification algorithms
Ablayev, F. M., Ablayev, M., Huang, J. Z., Khadiev, K. R., Salikhova, N., & Wu, D. (2019) · Big Data Mining and Analytics · doi:10.26599/bdma.2019.9020018 · Cited by 35
Fast Additive Partially Homomorphic Encryption From the Approximate Common Divisor Problem
Cominetti, E. L., & Junior, M. A. S. (2020) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2020.2981239 · Cited by 35
D’Anvers, J.-P., Rossi, M., & Virdia, F. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-45727-3_1 · Cited by 35
Genetic optimization of quantum annealing
Hegde, P. R., Passarelli, G., Scocco, A., & Lucignano, P. (2022) · Physical Review A · doi:10.1103/physreva.105.012612 · Cited by 36
T-count and T-depth of any multi-qubit unitary
Gheorghiu, V., Mosca, M., & Mukhopadhyay, P. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00651-y · Cited by 41
Adaptive job and resource management for the growing quantum cloud
Ravi, G. S., Smith, K. N., Murali, P., & Chong, F. T. (2021) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce52317.2021.00047 · Cited by 46
Quantum k-means algorithm based on Manhattan distance
Wu, Z., Song, T., & Zhang, Y. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03384-7 · Cited by 36
Quantum Computers: A Review on How Quantum Computing Can Boom AI
Chauhan, V., Negi, S., Jain, D., Singh, P. R., Sagar, A. K., & Sharma, A. K. (2022) · International Conference on Advance Computing and Innovative Technologies in Engineering (ICACITE) · doi:10.1109/icacite53722.2022.9823619 · Cited by 37
Quantum Identification of Boolean Oracles
Ambainis, A., Iwama, K., Kawachi, A., Masuda, H., Putra, R. H., & Yamashita, S. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24749-4_10 · Cited by 42
GPU-aware distributed quantum simulation
Ávila, A., Maron, A., Reiser, R., et al. (2014) · ACM Symposium on Applied Computing · doi:10.1145/2554850.2554892 · Cited by 35
Weak Fourier-Schur Sampling, the Hidden Subgroup Problem, and the Quantum Collision Problem
Childs, A. M., Harrow, A. W., & Wocjan, P. (2007) · Springer eBooks · doi:10.1007/978-3-540-70918-3_51 · Cited by 52
Quantum Division Circuit Based on Restoring Division Algorithm
Khosropour, A., Aghababa, H., & Forouzandeh, B. (2011) · International Conference on Information Technology: New Generations · doi:10.1109/itng.2011.177 · Cited by 35
Nakanishi, M., Hamaguchi, K., & Kashiwabara, T. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44968-x_46 · Cited by 35
Digital switching in the quantum domain
Tsai, I.-M., & Kuo, S. (2002) · IEEE Transactions on Nanotechnology · doi:10.1109/tnano.2002.806824 · Cited by 36
Exact Quantum Algorithms for the Leader Election Problem
Tani, S., Kobayashi, H., & Matsumoto, K. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-31856-9_48 · Cited by 35
Level Reduction and the Quantum Threshold TheoremPreprint
Aliferis, P. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0703230 · Cited by 50
Bitcoin and Quantum ComputingPreprint
Wright, C. (2017) · SSRN Electronic Journal · doi:10.2139/ssrn.3152419 · Cited by 37
Bernstein, D. J. (2025) · Springer eBooks · doi:10.1007/978-3-030-71522-9_386 · Cited by 35
Quantum-inspired complex convolutional neural networks
Shi, S., Wang, Z., Cui, G., Wang, S., Shang, R., Li, W., Wei, Z., & Gu, Y. (2022) · Applied Intelligence · doi:10.1007/s10489-022-03525-0 · Cited by 34
Signature Correction Attack on Dilithium Signature Scheme
Islam, S., Mus, K., Singh, R., Schaumont, P. R., & Sunar, B. (2022) · IEEE European Symposium on Security and Privacy · doi:10.1109/eurosp53844.2022.00046 · Cited by 41
On physics-informed neural networks for quantum computers
Markidis, S. (2022) · Frontiers in Applied Mathematics and Statistics · doi:10.3389/fams.2022.1036711 · Cited by 45
Quantum computing: Impact on energy efficiency and sustainability
Sood, V., & Chauhan, R. P. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2024.124401 · Cited by 40
Liang, C., Xia, B., Yue, S., Zhang, F., Qu, L., & Wang, S. (2024) · Journal of Energy Storage · doi:10.1016/j.est.2024.113677 · Cited by 36
Convex optimization using quantum oracles
van Apeldoorn, J., Gilyén, A., Gribling, S., & de Wolf, R. (2020) · Quantum · doi:10.22331/q-2020-01-13-220 · Cited by 38
Reachability analysis of quantum Markov decision processes
Ying, S., & Ying, M. (2018) · Information and Computation · doi:10.1016/j.ic.2018.09.001 · Cited by 37
Permutation-based special linear transforms with application in quantum image encryption algorithm
Khan, M., & Rasheed, A. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2410-7 · Cited by 34
Quantum algorithms for Second-Order Cone Programming and Support Vector Machines
Kerenidis, I., Prakash, A., & Szilágyi, D. (2021) · Quantum · doi:10.22331/q-2021-04-08-427 · Cited by 52
Joy, D., Sabir, M., Behera, B. K., & Panigrahi, P. K. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2531-z · Cited by 37
Grover on Korean Block Ciphers
Jang, K., Choi, S., Kwon, H., Kim, H., Park, J., & Seo, H. (2020) · Applied Sciences · doi:10.3390/app10186407 · Cited by 34
PQFabric: A Permissioned Blockchain Secure from Both Classical and Quantum Attacks
Holcomb, A., Pereira, G. C. C. F., Das, B., & Mosca, M. (2021) · IEEE International Conference on Blockchain and Cryptocurrency (ICBC) · doi:10.1109/icbc51069.2021.9461070 · Cited by 38
CoqQ: Foundational Verification of Quantum Programs
Zhou, L., Barthe, G., Strub, P.-Y., Liu, J., & Ying, M. (2023) · Proceedings of the ACM on Programming Languages · doi:10.1145/3571222 · Cited by 35
Bio‐Inspired and Nanoscale Integrated Computing
Eshaghian‐Wilner, M. M., & service), W. I. (. (2009) · Wiley eBooks · doi:10.1002/9780470429983 · Cited by 34
Lin, C.-C., Chakrabarti, A., & Jha, N. K. (2014) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/2629430 · Cited by 34
Kasabov, N. K. (2008) · Natural Computing · doi:10.1007/s11047-008-9066-z · Cited by 35
On the Exact Evaluation of Certain Instances of the Potts Partition Function by Quantum Computers
Geraci, J., & Lidar, D. A. (2008) · Communications in Mathematical Physics · doi:10.1007/s00220-008-0438-0 · Cited by 33
Duncan, R. (2006) · OpenGrey (Institut de l'Information Scientifique et Technique) · doi:10.5287/ora-4rearmrod · Cited by 34
Grover's Algorithm: Quantum Database SearchPreprint
Lavor, C., MANSSUR, L. R. U., & Portugal, R. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0301079 · Cited by 44
Botsinis, P., Alanis, D., Ng, S. X., & Hanzo, L. (2014) · IEEE Access · doi:10.1109/access.2014.2322013 · Cited by 34
Norimoto, M., Mori, R., & Ishikawa, N. (2023) · IEEE Transactions on Communications · doi:10.1109/tcomm.2023.3244924 · Cited by 36
Advanced quantum image representation and compression using a DCT-EFRQI approach
Haque, M. E., Paul, M., Ulhaq, A., & Debnath, T. (2023) · Scientific Reports · doi:10.1038/s41598-023-30575-2 · Cited by 33
Real-Time Krylov Theory for Quantum Computing Algorithms
Shen, Y., Klymko, K., Sud, J., Williams‐Young, D. B., de Jong, W. A., & Tubman, N. M. (2023) · Quantum · doi:10.22331/q-2023-07-25-1066 · Cited by 45
Satpathy, S. K., Vibhu, V., Behera, B. K., Al-Kuwari, S. M., Mumtaz, S., & Farouk, A. (2023) · IEEE Internet of Things Journal · doi:10.1109/jiot.2023.3300577 · Cited by 40
Identification of an X-Band Clock Transition in Cp′3Pr–Enabled by a 4f25d1Configuration
Smith, P. W., Hrubý, J., Evans, W. J., Hill, S., & Minasian, S. G. (2024) · Journal of the American Chemical Society · doi:10.1021/jacs.3c12725 · Cited by 35
Study on Implementation of Shor’s Factorization Algorithm on Quantum Computer
Kumar, M., & Mondal, B. (2024) · SN Computer Science · doi:10.1007/s42979-024-02771-y · Cited by 38
A quantum algorithm for the lattice-Boltzmann method advection-diffusion equation
Wawrzyniak, D., Winter, J. M., Schmidt, S. J., Indinger, T., Janßen, C. F., Schramm, U., & Adams, N. A. (2024) · Computer Physics Communications · doi:10.1016/j.cpc.2024.109373 · Cited by 38
Gitonga, C. K. (2025) · European Journal of Information Technologies and Computer Science · doi:10.24018/compute.2025.5.1.146 · Cited by 33
Quantum Computing: Foundations, Architecture and Applications
Christopher Columbus, C., Krishnan, P. T., Elamaran, E., Arul, R., & Kumar, T. S. (2025) · Engineering Reports · doi:10.1002/eng2.70337 · Cited by 36
Automata and quantum computing
Ambainis, A., & Yakaryılmaz, A. (2021) · EMS Press eBooks · doi:10.4171/automata-2/17 · Cited by 33
Quantum kernels for unattributed graphs using discrete-time quantum walks
Bai, L., Rossi, L., Cui, L., Zhang, Z., Ren, P., Bai, X. P., & Hancock, E. R. (2016) · Pattern Recognition Letters · doi:10.1016/j.patrec.2016.08.019 · Cited by 34
Quantum Accelerators for High-Performance Computing Systems
Britt, K. A., Mohiyaddin, F. A., & Humble, T. S. (2017) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc.2017.8123664 · Cited by 42
Quantum walk search on the complete bipartite graph
Rhodes, M. L., & Wong, T. G. (2019) · Physical Review A · doi:10.1103/physreva.99.032301 · Cited by 33
Post-quantum cryptography and 5G security
Clancy, T. C., McGwier, R., & Chen, L. (2019) · ACM Conference on Security and Privacy in Wireless and Mobile Networks (WiSec) · doi:10.1145/3317549.3324882 · Cited by 33
Improved Quantum Query Algorithms for Triangle Finding and Associativity Testing
Lee, T., Magniez, F., & Sántha, M. (2013) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611973105.107 · Cited by 33
New Approach to the Implementation of Post-Quantum Digital Signature Scheme
Kuznetsov, A. A., Кіян, А., Babenko, V., Перевозова, І. В., Chepurko, I., & Smirnov, O. A. (2020) · International Conference on Dependable Systems, Services and Technologies (DESSERT) · doi:10.1109/dessert50317.2020.9125053 · Cited by 33
Quantum advantage for computations with limited space
Maslov, D., Kim, J.-S., Bravyi, S. B., Yoder, T. J., & Sheldon, S. (2021) · Nature Physics · doi:10.1038/s41567-021-01271-7 · Cited by 39
Martínez, J. E., Fuentes, P., Crespo, P. M., & Garcia‐Frias, J. (2020) · IEEE Access · doi:10.1109/access.2020.3025619 · Cited by 33
Quantum superposition inspired spiking neural network
Sun, Y., Zeng, Y., & Zhang, T. (2021) · iScience · doi:10.1016/j.isci.2021.102880 · Cited by 37
Brown, J., Sgroi, S., Giannelli, L., Paraoanu, G. S., Paladino, E., Falci, G., Paternostro, M., & Ferraro, A. (2021) · New Journal of Physics · doi:10.1088/1367-2630/ac2393 · Cited by 37
Beyond Quadratic Speedups in Quantum Attacks on Symmetric Schemes
Bonnetain, X., Schrottenloher, A., & Sibleyras, F. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-07082-2_12 · Cited by 36
Optimal qubit mapping with simultaneous gate absorption
Tan, D. B., & Cong, J. (2021) · International Conference on Computer Aided Design · doi:10.1109/iccad51958.2021.9643554 · Cited by 40
Exploring Potential Applications of Quantum Computing in Transportation Modelling
Cooper, C. (2021) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2021.3132161 · Cited by 36
Better Than Worst-Case Decoding for Quantum Error Correction
Ravi, G. S., Baker, J. M., Fayyazi, A., Lin, S. F., Javadi-Abhari, A., Pedram, M., & Chong, F. T. (2023) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3575693.3575733 · Cited by 47
Khan, M. H. A. (2008) · Journal of Systems Architecture · doi:10.1016/j.sysarc.2008.05.002 · Cited by 33
New applications of quantum algorithms to computer graphics
Caraiman, S., & Manta, V. (2009) · ACM International Conference on Computing Frontiers (CF) · doi:10.1145/1531743.1531757 · Cited by 33
Continuous-time quantum search on balanced trees
Philipp, P., Tarrataca, L. D. T. J., & Boettcher, S. (2016) · Physical Review A · doi:10.1103/physreva.93.032305 · Cited by 33
Yamakami, T., & Yao, A. C.-C. (1999) · Information Processing Letters · doi:10.1016/s0020-0190(99)00084-8 · Cited by 35
Satisfiability — Algorithms and logic
Pudlák, P. (1998) · Lecture notes in computer science · doi:10.1007/bfb0055762 · Cited by 33
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
