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 6,501–6,600 of 8,792
Quantum BCH Codes Based on Spectral Techniques
Ying, G., & Gui-Hua, Z. (2006) · Communications in Theoretical Physics · doi:10.1088/0253-6102/45/2/019 · Cited by 1
de Falco, D., Pertoso, E., & Tamascelli, D. (2010) · doi:10.1142/9789814295437_0020 · Cited by 1
Complexity analysis and semantics for quantum computation
Kashefi, E. (2003) · Spiral (Imperial College London) · Cited by 1
Two-sided Quantum Amplitude Amplification and Exact-Error AlgorithmsPreprint
Bera, D. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.01828 · Cited by 1
Towards optical quantum information processing using Rydberg dark-state polaritons
Paredes-Barato, D. (2014) · Durham e-Theses (Durham University) · Cited by 1
Universal Test for Quantum One-Way Permutations
Kawachi, A., Kobayashi, H., Koshiba, T., & Putra, R. H. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-28629-5_66 · Cited by 1
Optimization and Approximation
Moore, C., & Mertens, S. (2011) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199233212.003.0009 · Cited by 1
Extended Learning Graphs for Triangle FindingPreprint
Carette, T., Laurière, M., & Magniez, F. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1609.07786 · Cited by 3
St-Jules, M. (2016) · uO Research (University of Ottawa) · doi:10.20381/ruor-329 · Cited by 1
An upper bound on the rate of information transfer by Grover's oracle
Arıkan, E. (2005) · Electronic Notes in Discrete Mathematics · doi:10.1016/j.endm.2005.07.031 · Cited by 1
Quantum reinforcement learning for dynamic spectrum access in cognitive radio networks
Nuuman, S. (2016) · Cited by 1
Building a Completely Reversible ComputerPreprint
Lukáč, M., Dueck, G. W., Kameyama, M., et al. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1702.08715 · Cited by 1
The Absent-Minded Driver Problem ReduxPreprint
Kak, S. C. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1702.05778 · Cited by 1
Quantum Privacy-Preserving Data AnalyticsPreprint
Ying, S., Ying, M., & Feng, Y. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1702.04420 · Cited by 1
Analysis of Reversible Simulation of Irreversible Computation by Pebble GamesPreprint
Li, M., Tromp, J., & Vitanyi, P. M. B. (1997) · arXiv (Cornell University) · Cited by 1
Early days following Grover's quantum search algorithmPreprint
Song, F. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1709.01236 · Cited by 4
Complexity of Searching Maximum of a Function on Quantum ComputerPreprint
Goćwin, M. (2005) · arXiv (Cornell University) · Cited by 1
Periodicity of Grover walks on generalized Bethe treesPreprint
Kubota, S., Segawa, E., Taniguchi, T., et al. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1712.06354 · Cited by 1
Quantum Probes Reduce Measurements: Application to Distributed Grover AlgorithmPreprint
Exman, I., & Levy, E. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1208.3905 · Cited by 1
A note on state preparation for quantum machine learningPreprint
Zhao, Z., Dunjko, V., Fitzsimons, J., Rebentrost, P., & Fitzsimons, J. F. (2018) · arXiv (Cornell University) · Cited by 1
Post-selected Classical Query ComplexityPreprint
Cade, C. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1804.10010 · Cited by 1
PDQP/qpoly = ALLPreprint
Aaronson, S. (2018) · arXiv (Cornell University) · Cited by 1
Optically Driven Spin Based Quantum Dots for Quantum Computing
Steel, D. G., & Sham, L. J. (2008) · Defense Technical Information Center (DTIC) · doi:10.21236/ada519735 · Cited by 1
Quantum walk on two-dimensional torus and grid
Komeili, M. (2018) · Libraries and Cultural Resources (University of Calgary) · doi:10.11575/prism/31963 · Cited by 1
Quantum Arnoldi and conjugate gradient iteration algorithmPreprint
Shao, C. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1807.07820 · Cited by 1
Supersymmetric quantum walks with chiral symmetryPreprint
Suzuki, A. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.00371 · Cited by 1
Computational Problems Related to Open Quantum Systems
Wang, C. (2018) · UWSpace (University of Waterloo) · Cited by 1
Engineering Multi-electron Interactions for Quantum Logic in Silicon
Tankasala, A. (2017) · Purdue e-Pubs (Purdue University System) · Cited by 1
Beyond z=0. The Deutsch-Jozsa decided monochromatic languagesPreprint
Marinho, E. P. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1812.07844 · Cited by 1
Hecht, P. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1812.05454 · Cited by 1
Quantum Miss-in-the-Middle AttackPreprint
Xie, H., & Yang, L. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1812.08499 · Cited by 4
Reverse engineering pairwise entanglement.Preprint
Thompson, N. L., Nguyen, N. H., Behrman, E., & Steck, J. E. (2019) · arXiv (Cornell University) · Cited by 1
Quantum Property TestingPreprint
Buhrman, H., Fortnow, L., Newman, I., et al. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0201117 · Cited by 1
Khadiev, K. R., & Safina, L. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1804.09950 · Cited by 1
Computability and Complexity of Unconventional Computing DevicesPreprint
Broersma, H. J., Stepney, S., & Wendin, G. P. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1702.02980 · Cited by 4
Spatial search using the discrete time quantum walkPreprint
Lovett, N. B., Everitt, M., Trevers, M., Mosby, D., Stockton, D., & Kendon, V. M. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1010.4705 · Cited by 1
Quantum loop programsPreprint
Ying, M., & Feng, Y. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0605218 · Cited by 1
Exact simulation of coined quantum walks with the continuous-time modelPreprint
Philipp, P., & Portugal, R. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1606.04030 · Cited by 1
On the Power of Non-Adaptive Learning GraphsPreprint
Belovs, A., & Rosmanis, A. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1210.3279 · Cited by 1
Analysis of Deutsch-Jozsa Quantum Algorithm.Preprint
Cao, Z., Uhlmann, J. K., & Liu, L. (2018) · IACR Cryptology ePrint Archive · Cited by 1
Correcting for Potential Barriers in Quantum Walk SearchPreprint
Ambainis, A., & Wong, T. G. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1505.02035 · Cited by 1
Efficient quantum algorithm to construct arbitrary Dicke statesPreprint
Chakraborty, K., Choi, B.-S., Maitra, A., & Maitra, S. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1209.5932 · Cited by 1
On the uselessness of quantum queriesPreprint
MEYER, D. A., & Pommersheim, J. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1004.1434 · Cited by 1
On a Problem in Quantum SummationPreprint
Heinrich, S., & Novak, E. (2001) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0109038 · Cited by 1
An information-theoretic analysis of Grover's algorithmPreprint
Arıkan, E. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0210068 · Cited by 1
Query complexity in expectationPreprint
Kaniewski, J., Lee, T., & de Wolf, R. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1411.7280 · Cited by 5
Noisy Grover's search algorithmPreprint
Ellinas, D., & Konstadakis, C. (2001) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0110010 · Cited by 1
Exponential Separation between Quantum Communication and Logarithm of Approximate RankPreprint
Sinha, M., & de Wolf, R. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1811.10090 · Cited by 1
Quantum Computation and Lattice ProblemsPreprint
Regev, O. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0304005 · Cited by 1
Integrated programmable waveguide circuits for classical and quantum photonic processing
Taballione, C. (2019) · doi:10.3990/1.9789036548038 · Cited by 1
Implications of Quantum Computing for Artificial Intelligence alignment researchPreprint
Sevilla, J., & Moreno, P. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1908.07613 · Cited by 1
An Evolutionary Approach to Optimizing Communication Cost in Distributed Quantum ComputationPreprint
Houshmand, M., Mohammadi, Z., Moghadam, M. Z., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1910.07877 · Cited by 1
The Potential of Quantum Annealing for Rapid Solution Structure Identification [Slides]
Coffrin, C., & (NNSA), U. N. N. S. A. (2020) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/1599019 · Cited by 1
Quantum transfer component analysis for domain adaptationPreprint
He, X., Lyu, C., Hsieh, M.-H., & Wang, X. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1912.09113 · Cited by 3
Groenland, K., Witteveen, F., Schoutens, K., & Gerritsma, R. (2020) · arXiv (Cornell University) · Cited by 1
An extended quantum process algebra (eQPAlg) approach for distributed quantum systemsPreprint
Haider, S., & Kazmi, S. A. R. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2001.04249 · Cited by 1
Quantum algorithms for computational geometry problemsPreprint
Ambainis, A., & Larka, N. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2004.08949 · Cited by 1
A Gentle Introduction to Quantum Computing Algorithms with Applications to Universal PredictionPreprint
Catt, E., & Hütter, M. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.03137 · Cited by 7
An Economic Model for Quantum Key-Recovery Attacks against Ideal CiphersPreprint
Harsha, B., & Blocki, J. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.05911 · Cited by 1
Quantum string comparison methodPreprint
Menon, V., & Chattopadhyay, A. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.08950 · Cited by 1
Tight Quantum Time-Space Tradeoffs for Function InversionPreprint
Chung, K.-M., Guo, S., Liu, Q., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.05650 · Cited by 1
Optimizing Quantum Search with a Binomial Version of Grover's AlgorithmPreprint
Gilliam, A., Pistoia, M., & Gonciulea, C. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2007.10894 · Cited by 3
Enhanced Quantum Key Distribution using Hybrid Channels and Natural Random NumbersPreprint
Rana, H., & Verma, N. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2007.14298 · Cited by 1
Konar, D., Bhattacharyya, S., & Panigrahi, B. K. (2020) · doi:10.36227/techrxiv.12909872.v1 · Cited by 1
Quantum Superposition Spiking Neural Network.Preprint
Sun, Y., Zeng, Y., & Zhang, T. (2020) · arXiv (Cornell University) · Cited by 1
Multiple Network Alignment on Quantum ComputersPreprint
Daskin, A., Grama, A. Y., & Kais, S. (2016) · Cited by 2
Laplacian Eigenmaps with variational circuits: a quantum embedding of graph dataPreprint
Thabet, S., & Hullo, J.-F. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2011.05128 · Cited by 1
Grover's search algorithm for $n$ qubits with optimal number of iterationsPreprint
Sadana, S. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2011.04051 · Cited by 1
Error Correcting Codes in Post-Quantum Cryptography
Desmarais, J.-M. (2020) · doi:10.22215/etd/2020-14317 · Cited by 1
Ventosa, A. B. (2020) · UPCommons institutional repository (Universitat Politècnica de Catalunya) · Cited by 1
Interactive Proofs for Quantum Black-Box Computations.Preprint
Zhang, J., Yu, Y., Feng, D., Fan, S., Zhang, Z., & Yang, K. (2020) · IACR Cryptology ePrint Archive · Cited by 1
Approximate Phase Search and Eigen Estimation using Modified Grover's AlgorithmPreprint
Pramanik, S., Chandra, M. G., Sarkar, S., & Nambiar, M. K. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2012.11497 · Cited by 1
Quantum Conference Key Agreement with Photon LossPreprint
Singkanipa, P., & Kok, P. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2101.01483 · Cited by 1
Quantum Theory from Principles, Quantum Software from DiagramsPreprint
van de Wetering, J. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2101.03608 · Cited by 4
Post-Quantum Key Exchange Protocols
Li, X., Leung, L., Kwan, A. C. T., Zhang, X., Kahanda, D., & Anshel, M. (2006) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1
Do Robots powered by a Quantum Processor have the Freedom to swerve?Preprint
Neven, H., Read, P. L., & Rees, T. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2104.11591 · Cited by 3
Quantum Perceptron Revisited: Computational-Statistical TradeoffsPreprint
Roget, M., Molfetta, G. D., & Kadri, H. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.02496 · Cited by 2
Adiabatic Quantum Graph Matching with Permutation Matrix ConstraintsPreprint
Benkner, M. S., Golyanik, V., Theobalt, C., & Moeller, M. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.04032 · Cited by 1
Reasoning about Recursive Quantum ProgramsPreprint
Xu, Z., Ying, M., & Valiron, B. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.11679 · Cited by 1
Quantum computations (course of lectures)Preprint
Ozhigov, Y. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.08047 · Cited by 1
Quantum Alphatron.Preprint
Rebentrost, P., Sántha, M., & Yang, S. (2021) · arXiv (Cornell University) · Cited by 1
Long-term privacy in electronic voting systems
Miranda, N. C. (2021) · doi:10.5821/dissertation-2117-348913 · Cited by 1
Machine learning for quantum physics and quantum physics for machine learning
Huembeli, P. (2021) · UPCommons institutional repository (Universitat Politècnica de Catalunya) · doi:10.5821/dissertation-2117-348901 · Cited by 1
Fundamental Machine Learning Routines as Quantum Algorithms on a Superconducting Quantum ComputerPreprint
Sangskriti, S., Nag, P., & Haque, S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2109.09522 · Cited by 1
Near-Optimal Quantum Algorithms for String ProblemsPreprint
Akmal, S., & Jin, C. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.09696 · Cited by 1
On Certified Randomness from Quantum Advantage Experiments.Preprint
Bassirian, R., Bouland, A., Fefferman, B., et al. (2021) · arXiv (Cornell University) · Cited by 1
Eigenvalues of two-phase three-state quantum walks with one defectPreprint
Kiumi, C. (2021) · arXiv (Cornell University) · Cited by 1
Matsuzawa, Y., Tanaka, Y., & Wada, K. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.12652 · Cited by 1
Quantum Speedup and Limitations on Matroid Properties.Preprint
Huang, X., Luo, J., & Li, L. (2021) · arXiv (Cornell University) · Cited by 1
On the Design and Simulation of Electromagnetic Traps and Guides for Ultra-Cold Matter
SAND, K. J. (2010) · BIBSYS Brage (BIBSYS (Norway)) · Cited by 1
Exploiting the Difference in Probability Calculation between Quantum and Probabilistic Computations
Amano, M., Iwama, K., & Putra, R. R. H. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45833-6_9 · Cited by 1
Quantum Field Theories, Topological Materials, and Topological Quantum Computing
Ilyas, M. (2021) · doi:10.15760/etd.7712 · Cited by 1
Harel, D., & Feldman, Y. (2008) · Unitext · doi:10.1007/978-88-470-0580-8_18 · Cited by 1
Quantum computation of Groebner basis through F4 and F5 algorithmsPreprint
Kikuchi, I., & Kikuchi, A. (2022) · doi:10.31219/osf.io/3b5qr · Cited by 1
Psitrum: An Open Source Simulator for Universal Quantum ComputersPreprint
Alghadeer, M., Aldawsari, E., Selvarajan, R., Al-Utaibi, K. A., Kais, S., & Alharbi, F. H. (2022) · Research Square · doi:10.21203/rs.3.rs-1483765/v1 · Cited by 1
Characterization and implementation of robust quantum information processing
Fernandez, D. (2020) · Cronfa (Swansea University) · doi:10.23889/suthesis.56913 · Cited by 1
Breaking the Unbreakable: Exploiting Loopholes in Bell’s Theorem to Hack Quantum Cryptography
Jogenfors, J. (2017) · doi:10.3384/diss.diva-142056 · Cited by 1
Burgdörfer, J., & Rotter, S. (2009) · Wiley eBooks · doi:10.1002/3527600434.eap367.pub2 · Cited by 1
Kendon, V. M. (2015) · Springer eBooks · doi:10.1007/978-3-642-27737-5_429-3 · Cited by 1
Retrodictive Quantum ComputingPreprint
Ortíz, G., Carette, J., & Sabry, A. (2022) · Research Square · doi:10.21203/rs.3.rs-1626827/v1 · Cited by 1
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
