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 4,101–4,200 of 8,792
The Mechanism of Quantum Computation
Castagnoli, G. (2008) · International Journal of Theoretical Physics · doi:10.1007/s10773-008-9698-x · Cited by 5
A Quantum Reinforcement Learning Method for Repeated Game Theory
Chen, C., Dong, D., Dong, Y., & Shi, Q. (2006) · International Conference on Computational Intelligence and Security (CIS) · doi:10.1109/iccias.2006.294092 · Cited by 6
On the Impossibility of Interaction-Free Quantum Sensing for Small I/O Bandwidth
Reif, J. H. (2000) · Information and Computation · doi:10.1006/inco.2000.2880 · Cited by 5
Quantum Algorithms and Hard Problems
Raj, C. V., Phaneendra, H. D., & Shivakumar, M. S. (2006) · IEEE International Conference on Cognitive Informatics · doi:10.1109/coginf.2006.365589 · Cited by 5
Quantum Formulas: A Lower Bound and Simulation
Roychowdhury, V., & Vatan, F. (2001) · SIAM Journal on Computing · doi:10.1137/s0097539700370965 · Cited by 7
A hybrid method for quantum global optimization
Liu, Y., & Kœhler, G. J. (2011) · Journal of Global Optimization · doi:10.1007/s10898-011-9806-y · Cited by 5
A Numerical Simulation of Quantum Factorization Success Probability
Zawadzki, P. (2009) · Advances in intelligent and soft computing · doi:10.1007/978-3-642-05019-0_24 · Cited by 5
Das, B., & Roy, U. (2014) · International Journal of Computer Applications · doi:10.5120/17896-8732 · Cited by 5
A Hybrid Algorithm for the Shortest-Path Problem in the Graph
Aghaei, M. R. S., Zukarnain, Z. A., Mamat, A., & Zainuddin, H. (2008) · International Conference on Advanced Computer Theory and Engineering · doi:10.1109/icacte.2008.137 · Cited by 5
A Study on Learning with a Quantum Neural Network
Kinjo, M., Sato, S., & Nakajima, K. (2006) · 2022 International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2006.1716091 · Cited by 5
Superposed Quantum State Initialization Using Disjoint Prime Implicants (SQUID)
Rosenbaum, D. J., & Perkowski, M. A. (2008) · Proceedings/Proceedings - International Symposium on Multiple-Valued Logic · doi:10.1109/ismvl.2008.24 · Cited by 5
Analysis and Simulation of Grover’s Search Algorithm
Zhuang, J., Zhao, J., Xu, F., Hu, H., & Qiao, P. (2014) · International Journal of Machine Learning and Computing · doi:10.7763/ijmlc.2014.v4.380 · Cited by 5
Joshi, D., Jain, A., & Mani, A. (2016) · International Innovative Applications of Computational Intelligence on Power, Energy and Controls with their Impact on Humanity (CIPECH) · doi:10.1109/cipech.2016.7918751 · Cited by 5
Fast Discretized Gaussian Sampling and Post-quantum TLS Ciphersuite
Gao, X., Li, L., Ding, J., Liu, J., Rv, S., & Liu, Z. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-72359-4_33 · Cited by 5
Quantum simulations of classical random walks and undirected graph connectivity
Watrous, J. (2003) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.1999.766275 · Cited by 5
Structured Decomposition for Reversible Boolean Functions
Jiang, J., Sun, X., Sun, Y., et al. (2019) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2019.2928974 · Cited by 5
Transformation rules for CNOT-based quantum circuits and their applications
Iwama, K., & Yamashita, S. (2003) · New Generation Computing · doi:10.1007/bf03037305 · Cited by 5
Quantum lower bounds for the Goldreich–Levin problem
Adcock, M., Cleve, R., Iwama, K., Putra, R., & Yamashita, S. (2006) · Information Processing Letters · doi:10.1016/j.ipl.2005.01.016 · Cited by 4
Survey of computational assumptions used in cryptography broken or not by Shor's algorithm
Zhu, H. P. (2001) · eScholarship@McGill (McGill) · doi:10.82308/49952 · Cited by 5
Fault-tolerant quantum computer architectures using hierarchies of quantum error-correcting codes
Chuang, I. L., & Cross, A. W. (2008) · Cited by 7
Data Structures in Natural Computing: Databases as Weak or Strong Anticipatory Systems
Rossiter, B. N. (2004) · AIP conference proceedings · doi:10.1063/1.1787342 · Cited by 5
Synthesis of Reversible Functions Using Various Gate Libraries and Design Specifications
Alhagi, N. (2000) · doi:10.15760/etd.366 · Cited by 5
Quantum algorithms for shortest paths problems in structured instancesPreprint
Nayebi, A., & Williams, V. V. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1410.6220 · Cited by 5
Parameterized Quantum Query Complexity of Graph CollisionPreprint
Ambainis, A., Balodis, K., Iraids, J., et al. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1305.1021 · Cited by 5
An Almost-Quadratic Lower Bound for Quantum Formula SizePreprint
Roychowdhury, V., & Vatan, F. (1999) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9903042 · Cited by 5
Experimental Realization of an NMR Quantum SwitchPreprint
Tsai, I.-M., Kuo, S., Huang, S., Lin, Y. C., & Chen, T. T. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0405170 · Cited by 5
Database Manipulation on Quantum ComputersPreprint
Younes, A. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0705.4303 · Cited by 5
Genetic information and quantum gasPreprint
Altaĭsky, M. V., & Filatov, F. P. (2001) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0106123 · Cited by 5
Complexity Science for SimpletonsPreprint
Feinstein, C. A. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0507008 · Cited by 4
Distributed construction of quantum fingerprints
Ambainis, A., & Shi, Y.-Y. (2004) · Quantum Information and Computation · doi:10.26421/qic4.2-6 · Cited by 6
Local Search Methods for Quantum ComputersPreprint
Hogg, T., & Yanik, M. F. (1998) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9802043 · Cited by 5
Entangled Quantum NetworksPreprint
Shafee, F. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0203010 · Cited by 5
Quantum Smart MatterPreprint
Hogg, T., & Chase, J. G. (1996) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9611021 · Cited by 5
Coherent Processes in Rare-Earth-Ion-Doped Solids
Walther, A. (2009) · Lund University Publications (Lund University) · Cited by 5
Azuma, H. (2002) · Physical Review A · doi:10.1103/physreva.66.019903 · Cited by 6
Matrix Product Operator Simulations of Quantum Algorithms
Woolfe, K. J. (2015) · Minerva Access (University of Melbourne) · Cited by 6
Projective Simulation compared to reinforcement learning
Bjerland, Ø. F. (2015) · NORA - Norwegian Open Research Archives · Cited by 5
Design of Quantum Key Agreement Protocols with Strong Fairness PropertyPreprint
Yu, K.-F., Yang, C., Hwang, T., et al. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1510.02353 · Cited by 5
A coding and control mechanism of natural computation
Gong, T., Cai, J., & Cai, Z. (2003) · IEEE International Symposium on Intelligent Control · doi:10.1109/isic.2003.1254725 · Cited by 5
A Generalization of Bernstein-Vazirani Algorithm to Qudit SystemsPreprint
Krishna, R. N., Makwana, V., & Suresh, A. P. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1609.03185 · Cited by 5
Optimal quantum query bounds for almost all Boolean functionsPreprint
Ambainis, A., Bačkurs, A., Smotrovs, J., & de Wolf, R. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1208.1122 · Cited by 7
Quantum Computation with Bose-Einstein CondensatesPreprint
Shi, Y. (1999) · arXiv (Cornell University) · Cited by 6
An Air-Gapped 2-Factor Authentication for Smart-Contract Wallets.Preprint
Homoliak, I., Breitenbacher, D., Binder, A., et al. (2018) · arXiv (Cornell University) · Cited by 5
Quantum Lazy Sampling and Game-Playing Proofs for Quantum IndifferentiabilityPreprint
Czajkowski, J., Majenz, C., Schaffner, C., & Zur, S. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.11477 · Cited by 23
Quantum Distinguishing Attacks against Type-1 Generalized Feistel Ciphers.Preprint
Ito, G., & Iwata, T. (2019) · IACR Cryptology ePrint Archive · Cited by 5
Limitations of Quantum Coset States for Graph IsomorphismPreprint
Hallgren, S., Roetteler, M., & Sen, P. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0511148 · Cited by 5
From Monte Carlo to Quantum ComputationPreprint
Heinrich, S. (2001) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0112152 · Cited by 5
Ambainis, A. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0305179 · Cited by 33
Computational Complexity of Uniform Quantum Circuit Families and Quantum Turing MachinesPreprint
Nishimura, H., & Ozawa, M. (1999) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9906095 · Cited by 5
Comparison of Amplitude Estimation Algorithms by ImplementationPreprint
Yu, K., Lim, H., Rao, P., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.05300 · Cited by 5
Benchmarking 16-element quantum search algorithms on IBM quantum processors.Preprint
Gwinner, J., Briański, M., Burkot, W., et al. (2020) · arXiv (Cornell University) · Cited by 5
A Deductive Verification Framework for Circuit-building Quantum ProgramsPreprint
Chareton, C., Bardin, S., Bobot, F., Perrelle, V., & Valiron, B. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.05841 · Cited by 5
An Optimal Separation of Randomized and Quantum Query ComplexityPreprint
Sherstov, A. A., Storozhenko, A. A., & Wu, P. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2008.10223 · Cited by 5
SlackQ : Approaching the Qubit Mapping Problem with A Slack-aware Swap Insertion SchemePreprint
Zhang, C., Chen, Y., Jin, Y., Ahn, W., Zhang, Y., & Zhang, E. Z. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2009.02346 · Cited by 4
Application of a Quantum Search Algorithm to High- Energy Physics Data at the Large Hadron ColliderPreprint
Armenàkas, A. E., & Baker, O. K. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2010.00649 · Cited by 5
HISTORY DEPENDENT QUANTUM RANDOM WALKS AS QUANTUM LATTICE GAS AUTOMATAPreprint
Shakeel, A., Meyer, D., Peter, & Love, J. (2016) · Cited by 4
SpinQ Gemini: a desktop quantum computer for education and researchPreprint
Hou, S., Feng, G., Wu, Z., Zou, H., Shi, W., Zeng, J., Cao, C., Yü, S., Sheng, Z., Rao, X., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2101.10017 · Cited by 5
Quantum computation using geometric algebra
Matzke, D. J. (2002) · Cited by 5
On the Isogeny Problem with Torsion Point Information.Preprint
Fouotsa, T. B., Kutas, P., & Merz, S.-P. (2021) · IACR Cryptology ePrint Archive · Cited by 5
Hardware Deployment of Hybrid PQC.Preprint
Azarderakhsh, R., Khatib, R. E., Koziel, B., et al. (2021) · IACR Cryptology ePrint Archive · Cited by 5
Improved robustness of quantum supremacy for random circuit samplingPreprint
Kondo, Y., Mori, R., & Movassagh, R. (2021) · arXiv (Cornell University) · Cited by 6
A Leap among Entanglement and Neural Networks: A Quantum Survey.Preprint
Massoli, F. V., Vadicamo, L., Amato, G. M., & Falchi, F. (2021) · arXiv (Cornell University) · Cited by 5
The Problem of Dynamic Programming on a Quantum ComputerPreprint
Ronagh, P. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1906.02229 · Cited by 8
Multiple Query Optimization using a Hybrid Approach of Classical and Quantum ComputingPreprint
Fankhauser, T., Solèr, M. E., Füchslin, R. M., & Stockinger, K. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.10508 · Cited by 5
Quantum Semi-Supervised Learning with Quantum SupremacyPreprint
Shangnan, Z. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.02343 · Cited by 5
Quantum Algorithms and Lower Bounds for Linear Regression with Norm Constraints
Chen, Y., & de Wolf, R. (2021) · UvA-DARE (University of Amsterdam) · doi:10.4230/lipics.icalp.2023.38 · Cited by 21
Decoherence and quantum error correction for quantum computing and communications.
Martínez, J. E., & de Navarra, U. (2022) · Deposito Adademico Digital Universidad De Navarra (University of Navarra) · doi:10.15581/10171/63013 · Cited by 11
Quantum Information Processing
Lloyd, S. (2009) · Springer eBooks · doi:10.1007/978-0-387-30440-3_437 · Cited by 5
Security Threats and Privacy Challenges in the Quantum Blockchain: A Contemporary Survey
Sentamilselvan, K., Suresh, P., Kamalam, G. K., Muthukrishnan, H., Logeswaran, K., & Keerthika, P. (2022) · Wiley eBooks · doi:10.1002/9781119836728.ch12 · Cited by 5
Dynamic Programming in Economics on a Quantum Annealer
Fernández‐Villaverde, J., & Hull, I. (2023) · National Bureau of Economic Research · doi:10.3386/w31326 · Cited by 5
Baseri, Y., Chouhan, V., & Hafid, A. S. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4687851 · Cited by 5
Modeles formels du calcul quantique : ressources, machines abstraites et calcul par mesure
Perdrix, S. (2006) · HAL · Cited by 5
Enhancing quantum control by bootstrapping a quantum processor of 12 qubits
Lu, D., Li, K., Li, J., Katiyar, H., Park, A. J., Feng, G., Xin, T., Li, H., Long, G., Brodutch, A., et al. (2017) · npj Quantum Information · doi:10.1038/s41534-017-0045-z · Cited by 80
“Furthermore, local operations can be optimized using compiled selective pulses as the initial guess [2].”
MethodPsitrum: An open source simulator for universal quantum computers
Alghadeer, M., Aldawsari, E., Selvarajan, R., Al-Utaibi, K. A., Kais, S., & Alharbi, F. H. (2024) · IET Quantum Communication · doi:10.1049/qtc2.12101 · Cited by 6
The Throughput Bottleneck of Quantum-Secure Communication Links: Analysis and Mitigation
Guerra-Yánez, C., Mederos-Barrera, A., Marco, I. D., et al. (2024) · IEEE Transactions on Communications · doi:10.1109/tcomm.2024.3394746 · Cited by 4
Reinforcement learning with learned gadgets to tackle hard quantum problems on real hardware
Kundu, A., & Sarra, L. (2026) · Communications Physics · doi:10.1038/s42005-025-02475-6 · Cited by 15
Adapting Developing Quantum Circuit Synthesis with a Multi -objective Quantum- inspired Optimization
Chou, Y., Hua, C.-Y., Chen, H.-P., et al. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.10404 · Cited by 4
Extractable energy from quantum superposition of current states
Perciavalle, F., Rossini, D., Polo, J., & Luigi Amico, A. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/adbf45 · Cited by 4
A quantum random access memory (QRAM) using a polynomial encoding of binary strings
Mukhopadhyay, P. (2025) · Scientific Reports · doi:10.1038/s41598-025-95283-5 · Cited by 12
Dou, X., Liu, L., Wang, Z., & Li, P. (2025) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/3730585 · Cited by 8
Quantum Computing for Quantum Chemistry
Schleich, P., Calderón, L. M., Sun, C., Bagherimehrab, M., Aldossary, A., Kottmann, J. S., & Aspuru‐Guzik, A. (2025) · ACS in focus · doi:10.1021/acsinfocus.7e9012 · Cited by 6
Verifiable Quantum Homomorphic Encryption
Li, Q., Wang, Y., Chen, L., & Li, L. (2025) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2025.3568057 · Cited by 5
HornBro: Homotopy-Like Method for Automated Quantum Program Repair
Tan, S., Lu, L., Xiang, D., Chu, T., Lang, C., Chen, J., Hu, X., & Yin, J. (2025) · Proceedings of the ACM on software engineering. · doi:10.1145/3715751 · Cited by 9
SwitchQNet: Optimizing Distributed Quantum Computing for Quantum Data Centers with Switch Networks
Zhang, H., Xu, Y., Hu, H., Yin, K., Shapourian, H., Zhao, J., Kompella, R. R., Nejabati, R., & Ding, Y. (2025) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/3695053.3731046 · Cited by 4
Navigating the quantum frontier: examining government strategy to the next technological revolution
Paglieri, L., Savignon, A. B., Scalabrini, F., & Costumato, L. (2025) · Transforming Government People Process and Policy · doi:10.1108/tg-04-2025-0089 · Cited by 4
Design and implementation of a fuzzy MISO system with quantum computing analogies
Bobyr, M. V. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04937-w · Cited by 4
Shaking Up Quantum Simulators with Fuzzing and Rigour
Klimis, V., Bensoussan, A., Chachkarova, E., Even-Mendoza, K., Fortz, S., & Lenihan, C. (2025) · Proceedings of the ACM on Programming Languages · doi:10.1145/3763100 · Cited by 4
Efficient Post-Quantum Blockchain Transaction via Edge PUF-Enabled Persistent Verification in IoT
Hao, G., & Wu, J. (2025) · IEEE Internet of Things Journal · doi:10.1109/jiot.2025.3627770 · Cited by 4
Sajjad, I., Alshanbari, H. M., Almazah, M. M. A., Louati, H., & Rauf, S. (2025) · AIMS Mathematics · doi:10.3934/math.20251168 · Cited by 4
Hybrid quantum convolutional neural network for multi-channel image classification
Zhang, C., Zheng, L., & Situ, H. (2025) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2025.131152 · Cited by 4
Kaewta, C., Pitakaso, R., Khonjun, S., et al. (2025) · Artificial Intelligence in Medicine · doi:10.1016/j.artmed.2025.103322 · Cited by 4
Quantum Periodic Distinguisher Construction: Symbolization Method and Automated Tool
Liu, Q., Wang, H., Wang, J., et al. (2025) · Lecture notes in computer science · doi:10.1007/978-981-95-5125-5_8 · Cited by 4
Key Quantum Algorithms: Shor’s, Grover’s, and Applications
Upoma, K. S. H., & Bhalekar, O. A. (2026) · Springer eBooks · doi:10.1007/978-3-032-10775-6_4 · Cited by 4
QSVP: A Quantum Safe Mutual Authentication Protocol for Vehicular Platoon Communications
Parameswarath, R. P., Wang, C., & Sikdar, B. (2026) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2026.3655816 · Cited by 4
QuanBench: Benchmarking Quantum Code Generation with Large Language Models
Guo, X., Wang, M., & Zhao, J. (2025) · IEEE/ACM International Conference on Automated Software Engineering (ASE) · doi:10.1109/ase63991.2025.00218 · Cited by 4
Quantum-secured routing in drone communication for 6G-enabled smart mobility
Hafeez, S., Abro, G. E. M., Memon, S. A., et al. (2026) · Scientific Reports · doi:10.1038/s41598-026-36297-5 · Cited by 4
Quantum autopoiesis: A quantum-informational model of recursive identity and knowledge discovery
Stankovski, V. (2026) · Biosystems · doi:10.1016/j.biosystems.2026.105735 · Cited by 4
The Grover Dilemma and Three Fundamental Barriers to Oracle-Based Quantum Search Algorithms
(18461), Y. L. (2026) · Journal of Quantum Information Science · doi:10.4236/jqis.2026.161002 · Cited by 4
Cryptographic Properties of the Quantum Hashing Based on Expander Graphs
Zinnatullin, I. (2023) · Lobachevskii Journal of Mathematics · doi:10.1134/s1995080223020397 · Cited by 4
Securing Internet of Things (IoT) Ecosystems: A Quantum Cryptography Approach
Bounmy, S., & Sisavath, K. (2023) · Algorithm Asynchronous · doi:10.61963/jaa.v1i1.45 · Cited by 4
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
