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 501–600 of 8,792
Nishi, H., Kosugi, T., & Matsushita, Y. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00409-y · Cited by 86
Decentralization Using Quantum Blockchain: A Theoretical Analysis
Yang, Z., Salman, T., Jain, R. K., & Pietro, R. D. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2022.3207111 · Cited by 85
An elementary review on basic principles and developments of qubits for quantum computing
Chae, E., Choi, J., & Kim, J. (2024) · Nano Convergence · doi:10.1186/s40580-024-00418-5 · Cited by 101
Efficiently embedding QUBO problems on adiabatic quantum computers
Date, P., Patton, R. M., Schuman, C. D., & Potok, T. E. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2236-3 · Cited by 82
Efficient Color Transformations on Quantum Images
Le, P. Q., Iliyasu, A. M., Dong, F., & Hirota, K. (2011) · Journal of Advanced Computational Intelligence and Intelligent Informatics · doi:10.20965/jaciii.2011.p0698 · Cited by 75
Implementing Pure Adaptive Search with Grover's Quantum Algorithm
Bulger, D. W., Baritompa, W. P., & Wood, G. R. (2003) · Journal of Optimization Theory and Applications · doi:10.1023/a:1023061218864 · Cited by 79
Will quantum computers be the end of public key encryption?
Buchanan, W. J., & Woodward, A. (2016) · Journal of Cyber Security Technology · doi:10.1080/23742917.2016.1226650 · Cited by 78
Saturnin: a suite of lightweight symmetric algorithms for post-quantum security
Canteaut, A., Duval, S., Leurent, G., Naya‐Plasencia, M., Perrin, L. P., Pornin, T., & Schrottenloher, A. (2020) · IACR Transactions on Symmetric Cryptology · doi:10.46586/tosc.v2020.is1.160-207 · Cited by 85
Quantum computers that can be simulated classically in polynomial time
Valiant, L. G. (2001) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/380752.380785 · Cited by 89
Efficient Quantum TransformsPreprint
Høyer, P. (1997) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9702028 · Cited by 104
Module-Lattice-Based Digital Signature Standard
(2023) · doi:10.6028/nist.fips.204.ipd · Cited by 90
RetractedExperimental realization of a delayed-choice quantum walk
Jeong, Y.-C., Di Franco, C., Lim, H.-T., Kim, M. S., & Kim, Y.-H. (2013) · Nature Communications · doi:10.1038/ncomms3471 · Cited by 76
Quantum image encryption algorithm based on 3D-BNM chaotic map
Verma, V., & Kumar, S. (2025) · Nonlinear Dynamics · doi:10.1007/s11071-024-10403-6 · Cited by 76
Quantum attacks on some feistel block ciphers
Dong, X., Dong, B., & Wang, X. (2020) · Designs Codes and Cryptography · doi:10.1007/s10623-020-00741-y · Cited by 78
Lin, L., & Tong, Y. (2020) · eScholarship (California Digital Library) · Cited by 82
A Hybrid Neqr Image Encryption Cryptosystem Using Two-Dimensional Quantum Walks and Quantum Coding
Hao, W., Zhang, T., Chen, X., & Zhou, X. (2022) · Signal Processing · doi:10.1016/j.sigpro.2022.108890 · Cited by 80
Multivariable optimization: Quantum annealing and computation
Mukherjee, S., & Chakrabarti, B. K. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02339-y · Cited by 77
Quantum walks on quotient graphs
Krovi, H., & Brun, T. A. (2007) · Physical Review A · doi:10.1103/physreva.75.062332 · Cited by 82
Flexible representation and manipulation of audio signals on quantum computers
Yan, F., Iliyasu, A. M., Guo, Y., & Yang, H. (2017) · Theoretical Computer Science · doi:10.1016/j.tcs.2017.12.025 · Cited by 75
How to Efficiently Handle Complex Values? Implementing Decision Diagrams for Quantum Computing
Zulehner, A., Hillmich, S., & Wille, R. (2019) · doi:10.1109/iccad45719.2019.8942057 · Cited by 80
Quantum computation and lattice problems
Regev, O. (2003) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2002.1181976 · Cited by 75
An Introduction to Quantum Complexity Theory
Cleve, R. (2001) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789810248185_0004 · Cited by 92
Gokhale, P., Angiuli, O., Ding, Y., Gui, K., Tomesh, T., Suchara, M., Martonosi, M., & Chong, F. T. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.13623 · Cited by 196
Multiple query optimization on the D-Wave 2X adiabatic quantum computer
Trummer, I., & Koch, C. E. (2016) · Proceedings of the VLDB Endowment · doi:10.14778/2947618.2947621 · Cited by 81
Separations in query complexity using cheat sheets
Aaronson, S., Ben-David, S., & Kothari, R. (2016) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2897518.2897644 · Cited by 116
Experimental realization of quantum cheque using a five-qubit quantum computer
Behera, B. K., Banerjee, A., & Panigrahi, P. K. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1762-0 · Cited by 74
Quantum reversible circuit of AES-128
Almazrooie, M., Samsudin, A., Abdullah, R., & Mutter, K. N. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-1864-3 · Cited by 75
Hash-based Digital Signature Schemes
Buchmann, J. A., Dahmen, E., & Szydlo, M. (2009) · Springer eBooks · doi:10.1007/978-3-540-88702-7_3 · Cited by 79
Overwater, R. W. J., Babaie, M., & Sebastiano, F. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2022.3174017 · Cited by 76
Research of Quantum Genetic Algorith and its application in blind source separation
Yang, J., Li, B., & Zhuang, Z. (2003) · Journal of Electronics (China) · doi:10.1007/s11767-003-0089-4 · Cited by 75
On quantum and probabilistic communication
Klauck, H. (2000) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/335305.335396 · Cited by 73
Reflections for quantum query algorithms
Reichardt, B. W. (2011) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611973082.44 · Cited by 101
Zhang, C., Hayes, A. B., Qiu, L., Jin, Y., Chen, Y., & Zhang, E. Z. (2021) · Proceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/3445814.3446706 · Cited by 74
From 5-Pass $$\mathcal {MQ}$$-Based Identification to $$\mathcal {MQ}$$-Based Signatures
Chen, M.-S., Hülsing, A., Rijneveld, J., et al. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-53890-6_5 · Cited by 74
The impact of quantum computing on cryptography
Aumasson, J.-P. (2017) · Computer Fraud & Security · doi:10.1016/s1361-3723(17)30051-9 · Cited by 74
Quantum cryptanalysis on some generalized Feistel schemes
Dong, X., Li, Z., & Wang, X. (2019) · Science China Information Sciences · doi:10.1007/s11432-017-9436-7 · Cited by 75
Quantum Speedups for Exponential-Time Dynamic Programming Algorithms
Ambainis, A., Balodis, K., Iraids, J., Kokainis, M., Prūsis, K., & Vihrovs, J. (2019) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611975482.107 · Cited by 75
Scalable quantum computing with qudits on a graph
Kiktenko, E. O., Nikolaeva, A. S., Xu, P., Shlyapnikov, G. V., & Fedorov, A. K. (2020) · Physical Review A · doi:10.1103/physreva.101.022304 · Cited by 71
Bugs in Quantum computing platforms: an empirical study
Paltenghi, M., & Pradel, M. (2022) · Proceedings of the ACM on Programming Languages · doi:10.1145/3527330 · Cited by 105
Review of Security Methods Based on Classical Cryptography and Quantum Cryptography
Subramani, S., Selvi, M., Kannan, A., & Santhosh Kumar, S. V. N. (2023) · Cybernetics & Systems · doi:10.1080/01969722.2023.2166261 · Cited by 85
Zero-knowledge against quantum attacks
Watrous, J. (2006) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1132516.1132560 · Cited by 75
Denchev, V. S., & Pandurangan, G. (2008) · ACM SIGACT News · doi:10.1145/1412700.1412718 · Cited by 72
Time-sliced quantum circuit partitioning for modular architectures
Baker, J. M., Duckering, C., Hoover, A., & Chong, F. T. (2020) · ACM International Conference on Computing Frontiers (CF) · doi:10.1145/3387902.3392617 · Cited by 95
Public Blockchains for Resource-Constrained IoT Devices—A State-of-the-Art Survey
Khor, J. H., Sidorov, M., & Woon, P. Y. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3069120 · Cited by 76
Quantum abstract interpretation
Yu, N., & Palsberg, J. (2021) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/3453483.3454061 · Cited by 89
Quantum technologies in the telecommunications industry
Martin, V., Brito, J. P., Escribano, C., Menchetti, M., White, C., Lord, A., Wissel, F., Gunkel, M., Gavignet, P., Genay, N., et al. (2021) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-021-00108-9 · Cited by 77
Free-Space Quantum Secure Direct Communication: Basics, Progress, and Outlook
Pan, D., Song, X., & Long, G. (2023) · Advanced Devices & Instrumentation · doi:10.34133/adi.0004 · Cited by 77
Bey, M., Kuila, P., Naik, B. B., et al. (2023) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.121270 · Cited by 73
Signal and image compression using quantum discrete cosine transform
Pang, C.-Y., Zhou, R., Hu, B.-Q., Hu, W., & El-Rafei, A. (2018) · Information Sciences · doi:10.1016/j.ins.2018.08.067 · Cited by 77
Quantum Algorithm Design: Techniques and Applications
Shao, C., Yang, L., & Li, H. (2019) · Journal of Systems Science and Complexity · doi:10.1007/s11424-019-9008-0 · Cited by 74
Quantum Reed-Solomon CodesPreprint
Grassl, M., Geiselmann, W., Beth, T., & Karlsruhe, U. (1999) · Cited by 75
Quantum Query Complexity of Some Graph Problems
Dürr, C., Heiligman, M., Høyer, P., & Mhalla, M. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-27836-8_42 · Cited by 72
Multi Model Implementation on General Medicine Prediction with Quantum Neural Networks
Kumar, S. A., Kumar, A., Dutt, V., & Agrawal, R. (2021) · International Conference on Intelligent Communication Technologies and Virtual Mobile Networks (ICICV) · doi:10.1109/icicv50876.2021.9388575 · Cited by 83
Towards a Quantum-Resilient Future: Strategies for Transitioning to Post-Quantum Cryptography
Aydeger, A., Zeydan, E., Yadav, A. K., Hemachandra, K. T., & Liyanage, M. (2024) · International Conference on the Network of the Future (NOF) · doi:10.1109/nof62948.2024.10741441 · Cited by 90
On the hitting times of quantum versus random walks
Magniez, F., Nayak, A., Richter, P. C., & Sántha, M. (2008) · HAL · Cited by 71
Quantum simulation of the Sachdev-Ye-Kitaev model by asymmetric qubitization
Babbush, R., Berry, D. W., & Neven, H. (2019) · Physical Review A · doi:10.1103/physreva.99.040301 · Cited by 80
Post-Quantum and Code-Based Cryptography—Some Prospective Research Directions
Balamurugan, C., Singh, K., Ganesan, G., & Rajarajan, M. (2021) · Cryptography · doi:10.3390/cryptography5040038 · Cited by 89
SQIsignHD: New Dimensions in Cryptography
Dartois, P., Leroux, A., Robert, D., & Wesolowski, B. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-58716-0_1 · Cited by 73
Shadows of quantum machine learning
Jerbi, S., Gyurik, C., Marshall, S. C., Molteni, R., & Dunjko, V. (2024) · Nature Communications · doi:10.1038/s41467-024-49877-8 · Cited by 102
Automata theory based on quantum logic: some characterizations
Qiu, D. (2004) · Information and Computation · doi:10.1016/j.ic.2003.11.003 · Cited by 71
Quantum Algorithms for the Subset-Sum Problem
Bernstein, D. J., Jeffery, S., Lange, T., & Meurer, A. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38616-9_2 · Cited by 83
Quantum Chosen-Ciphertext Attacks Against Feistel Ciphers
Ito, G., Hosoyamada, A., Matsumoto, R., et al. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-12612-4_20 · Cited by 71
Mitchison, G., & Jozsa, R. (2001) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2000.0714 · Cited by 75
Abbasi, M., Cardoso, F., Váz, P., Silva, J., & Martins, P. (2025) · Cryptography · doi:10.3390/cryptography9020032 · Cited by 76
“Beyond factoring-based attacks, Grover’s algorithm offers a quadratic speedup for brute-forcing symmetric cryptographic keys [8], motivating the need to increase key sizes in block ciphers and hash functions.”
Supervised learning with a quantum classifier using multi-level systems
Adhikary, S., Dangwal, S., & Bhowmik, D. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-2587-9 · Cited by 72
Variational Quantum Singular Value Decomposition
Wang, X., Song, Z., & Wang, Y. (2021) · Quantum · doi:10.22331/q-2021-06-29-483 · Cited by 80
EOSMA: An Equilibrium Optimizer Slime Mould Algorithm for Engineering Design Problems
Yin, S., Luo, Q., & Zhou, Y. (2022) · Arabian Journal for Science and Engineering · doi:10.1007/s13369-021-06513-7 · Cited by 75
Recent Advances in Post-Quantum Cryptography for Networks: A Survey
Zeydan, E., Türk, Y., Aksoy, B., & Ozturk, S. B. (2022) · International Conference on Mobile and Secure Services (MobiSecServ) · doi:10.1109/mobisecserv50855.2022.9727214 · Cited by 78
Claw finding algorithms using quantum walk
Tani, S. (2009) · Theoretical Computer Science · doi:10.1016/j.tcs.2009.08.030 · Cited by 79
Liquid-state NMR simulations of quantum many-body problems
Negrevergne, C., Somma, R. D., Ortíz, G., Knill, E., & Laflamme, R. (2005) · Physical Review A · doi:10.1103/physreva.71.032344 · Cited by 71
Geometric transformations of multidimensional color images based on NASS
Fan, P., Zhou, R., Jing, N., & Li, H.-S. (2016) · Information Sciences · doi:10.1016/j.ins.2015.12.024 · Cited by 71
Collusive attacks to “circle-type” multi-party quantum key agreement protocols
Liu, B., Xiao, D., Jia, H.-Y., & Liu, R. (2016) · Quantum Information Processing · doi:10.1007/s11128-016-1264-5 · Cited by 70
Quantum Information Set Decoding Algorithms
Kachigar, G., & Tillich, J. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59879-6_5 · Cited by 70
Quantum image encryption algorithm based on Arnold scrambling and wavelet transforms
Hu, W., Zhou, R., Luo, J., Jiang, S.-X., & Luo, G. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-2579-9 · Cited by 72
Nagaj, D., Wocjan, P., & Zhang, Y. (2009) · Quantum Information and Computation · doi:10.26421/qic9.11-12-8 · Cited by 78
Harrow, A. W. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0512255 · Cited by 183
Quantum mechanics and classical light
Konrad, T., & Forbes, A. (2019) · Contemporary Physics · doi:10.1080/00107514.2019.1580433 · Cited by 66
A Comparison of Security and its Performance for Key Agreements in Post-Quantum Cryptography
Borges, F., Reis, P. R., & Pereira, D. A. B. (2020) · IEEE Access · doi:10.1109/access.2020.3013250 · Cited by 76
Campos, J., & Souto, A. (2021) · IEEE/ACM International Workshop on Quantum Software Engineering (Q-SE) · doi:10.1109/q-se52541.2021.00013 · Cited by 74
Perceval: A Software Platform for Discrete Variable Photonic Quantum Computing
Heurtel, N., Fyrillas, A., de Gliniasty, G., Bihan, R. L., Malherbe, S., Pailhas, M., Bertasi, E., Bourdoncle, B., Emeriau, P.-E., Mezher, R., et al. (2023) · Quantum · doi:10.22331/q-2023-02-21-931 · Cited by 94
Barren plateaus in quantum tensor network optimization
Cervero-Martín, E., Plekhanov, K., & Lubasch, M. (2023) · Quantum · doi:10.22331/q-2023-04-13-974 · Cited by 83
On setting the parameters of quantum-inspired evolutionary algorithm for practical application
Han, K.-H., & Kim, J.-H. (2003) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2003.1299572 · Cited by 70
Automated generation of layout and control for quantum circuits
Whitney, M., Isailovic, N., Patel, Y., & Kubiatowicz, J. D. (2007) · ACM International Conference on Computing Frontiers (CF) · doi:10.1145/1242531.1242546 · Cited by 69
Training a Quantum Neural Network
Ricks, B., & Ventura, D. A. (2003) · Cited by 69
Quantum Algorithms and the Genetic Code
Patel, A. D. (2000) · NOT FOUND REPOSITORY (Indian Institute of Science Bangalore) · Cited by 69
Farfalle: parallel permutation-based cryptography
Bertoni, G., Daemen, J., Hoffert, S., Peeters, M., Assche, G. V., & Keer, R. V. (2017) · IACR Transactions on Symmetric Cryptology · doi:10.46586/tosc.v2017.i4.1-38 · Cited by 70
Differential Privacy in Quantum Computation
Zhou, L., & Ying, M. (2017) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csf.2017.23 · Cited by 79
Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce
Boroujeni, M., Ehsani, S., Ghodsi, M., Hajiaghayi, M., & Seddighin, S. (2018) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611975031.76 · Cited by 69
Quantum-Inspired Genetic Algorithm for Resource-Constrained Project-Scheduling
Saad, H. M. H., Chakrabortty, R. K., Elsayed, S. M., & Ryan, M. J. (2021) · IEEE Access · doi:10.1109/access.2021.3062790 · Cited by 69
The Elusive Source of Quantum Speedup
Vedral, V. (2010) · Foundations of Physics · doi:10.1007/s10701-010-9452-0 · Cited by 66
Proof rules for the correctness of quantum programs
Feng, Y., Duan, R., Ji, Z., & Ying, M. (2007) · Theoretical Computer Science · doi:10.1016/j.tcs.2007.06.011 · Cited by 66
Comparison of Genetic Algorithm and Quantum Genetic Algorithm
Laboudi, Z., & Chıkhı, S. (2012) · Cited by 68
Enhancing quantum control by bootstrapping a quantum processor of 12 qubits
Lu, D., Li, K., Li, J., Katiyar, H., Park, A., Feng, G., Xin, T., Li, H., Long, G., Brodutch, A., et al. (2017) · MPG.PuRe (Max Planck Society) · Cited by 80
Classification with Quantum Machine Learning: A Survey
Abohashima, Z., Elhosen, M., Houssein, E. H., & Mohamed, W. M. (2020) · arXiv · doi:10.48550/arxiv.2006.12270 · Cited by 68
Botsinis, P., Ng, S. X., & Hanzo, L. (2013) · IEEE Access · doi:10.1109/access.2013.2259536 · Cited by 64
A Survey on Post-Quantum Public-Key Signature Schemes for Secure Vehicular Communications
Shim, K. (2021) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2021.3131668 · Cited by 70
Machine learning for anomaly detection in particle physics
Belis, V., Odagiu, P., & Aarrestad, T. K. (2024) · Reviews in Physics · doi:10.1016/j.revip.2024.100091 · Cited by 111
Quantum Complexity of Testing Group Commutativity
Magniez, F., & Nayak, A. (2007) · Algorithmica · doi:10.1007/s00453-007-0057-8 · Cited by 93
Quantum search with certainty based on modified Grover algorithms: optimum choice of parameters
Toyama, F. M., van Dijk, W., & Nogami, Y. (2012) · Quantum Information Processing · doi:10.1007/s11128-012-0498-0 · Cited by 67
Improved Bounds on Quantum Learning Algorithms
Atıcı, A., & Servedio, R. A. (2005) · Quantum Information Processing · doi:10.1007/s11128-005-0001-2 · Cited by 75
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
