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 5,601–5,700 of 8,792
Tagging Metaheuristics with Problem-Oriented Labels for Non-Expert Users
Tian, Y., Sun, M., Yang, S., & Zhang, X. (2022) · IEEE Symposium Series on Computational Intelligence (SSCI) · doi:10.1109/ssci51031.2022.10022221 · Cited by 2
(Almost) tight bounds for randomized and quantum Local Search on hypercubes and gridsPreprint
Zhang, S. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0504085 · Cited by 2
Approximation Theory and the Design of Fast AlgorithmsPreprint
Sachdeva, S., & Vishnoi, N. K. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1309.4882 · Cited by 3
Stabilizer states and local realismPreprint
Elliott, M. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0807.2876 · Cited by 6
How Many Query Superpositions Are Needed to Learn?
Castro, J. (2006) · Lecture notes in computer science · doi:10.1007/11894841_10 · Cited by 2
Geraci, J., & Bussel, F. V. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0703129 · Cited by 2
Intelligence-Based Model to Timing Problem of Resources Exploration in the Behavior of Firm
Tsai, H. F., & Chang, B. R. (2006) · Lecture notes in computer science · doi:10.1007/11893295_53 · Cited by 2
Adiabatic Controlled-NOT Gate for Quantum Computation
Averin, D. V. (1999) · Lecture notes in computer science · doi:10.1007/3-540-49208-9_38 · Cited by 3
Information Hypothesis: On Human Information Capability Study
Krajíček, J. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04954-5_13 · Cited by 2
Integrated chips and optical cavities for trapped ion quantum information processing
Leibrandt, D. R. (2009) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 3
Historical Bibliography of Quantum Computing
Cirasella, J. (2008) · Cambridge University Press eBooks · doi:10.1017/cbo9780511813887.014 · Cited by 2
Isomorphism and Factorization – Classical and Quantum Algorithms
Dörn, S., Haase, D., Torán, J., & Wagner, F. (2009) · Wiley eBooks · doi:10.1002/9783527628025.ch16 · Cited by 2
The Structure of Promises in Quantum SpeedupsPreprint
Ben-David, S. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1409.3323 · Cited by 2
Quantum Algorithms: Database Search and its VariationsPreprint
Patel, A. D. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1102.2058 · Cited by 2
Analysis of Quantum Functions (Preliminary Version)Preprint
Yamakami, T. (1999) · Cited by 2
Quantum Algorithms for Finding Claws, Collisions and TrianglesPreprint
Buhrman, H., Dürr, C., & Hyer, P. (2000) · arXiv (Cornell University) · Cited by 2
Quantum computation, discreteness, and contextualityPreprint
Raussendorf, R. (2009) · arXiv (Cornell University) · Cited by 2
Parameter Estimation, Model Reduction and Quantum FilteringPreprint
Chase, B. A. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0908.1200 · Cited by 2
Quantum problem solving as simultaneous computationPreprint
Castagnoli, G. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0710.1744 · Cited by 2
Deleting a marked item from an unsorted database with a single queryPreprint
Liu, Y., & Long, G. L. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0710.3301 · Cited by 2
A Polynomial-Time Algorithm for the Equivalence between Quantum Sequential MachinesPreprint
Li, L., & Qiu, D. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0604085 · Cited by 2
The pre-history of quantum computation
Potgieter, P. H. (2004) · Suid-Afrikaanse Tydskrif vir Natuurwetenskap en Tegnologie · doi:10.4102/satnt.v23i1/2.186 · Cited by 2
About the quantum mechanical speeding up of classical algorithmsPreprint
Ozhigov, Y. (1997) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9706003 · Cited by 2
Entropy of quantum channel in the theory of quantum informationPreprint
Roga, W. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1108.5065 · Cited by 2
Lower Bounds on Quantum Query and Learning Graph Complexities
Rosmanis, A. (2014) · UWSpace (University of Waterloo) · Cited by 2
Theory and applications of quantum process calculus
Puthoor, I. V. (2015) · Enlighten: Theses (The University of Glasgow) · doi:10.25405/ncl.34498860 · Cited by 2
Post-quantum signatures for today
Dahmen, E. (2009) · Technischen Universität Darmstadt · doi:10.26083/tuprints-00001319 · Cited by 2
van Dam, W. K. (2002) · Cited by 2
Distributed Hybrid Quantum Computing
Louis, S. G. R. (2008) · SOKENDAI (Graduate University for Advanced Studies) · Cited by 2
A Fast fixed-point Quantum Search Algorithm by using Disentanglement and MeasurementPreprint
Mani, A., & Patvardhan, C. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1203.3178 · Cited by 2
Design and Evaluation of Communication Protocols for Quantum Repeater Networks
Aparicio, L. (2011) · Institutional Repositories DataBase (IRDB) · Cited by 2
Mureika, J. (2006) · International Journal of Theoretical Physics · doi:10.1007/s10773-006-9221-1 · Cited by 2
The Landauer resistance and band spectra for the counting quantum turing machine
Benioff, P. A. (1998) · Physica D Nonlinear Phenomena · doi:10.1016/s0167-2789(98)00041-4 · Cited by 4
Coordination of quantum internet agents
Klusch, M. (2005) · Adaptive Agents and Multi-Agents Systems · doi:10.1145/1082473.1082703 · Cited by 2
Robust Quantum Algorithms with ε-Biased Oracles
Suzuki, T., Yamashita, S., Nakanishi, M., & Watanabe, K. (2006) · Lecture notes in computer science · doi:10.1007/11809678_14 · Cited by 2
Programming and simulation of quantum search agents
Klusch, M., & Schubotz, R. (2007) · Adaptive Agents and Multi-Agents Systems · doi:10.1145/1329125.1329230 · Cited by 2
How behavior of systems with sparse spectrum can be predicted on a quantum computer
Ozhigov, Y. (2002) · Journal of Experimental and Theoretical Physics Letters · doi:10.1134/1.1545582 · Cited by 1
Quantum lower bound for sortingPreprint
Shi, Y. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0009091 · Cited by 3
Adaptive Entanglement Purification Protocols with Two-way Classical CommunicationPreprint
Leung, A. W., & Shor, P. W. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0702156 · Cited by 2
Classical Cryptosystems In A Quantum SettingPreprint
Brown, M. S. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0404061 · Cited by 3
Quantum query complexity and distributed computing
Röhrig, H. (2004) · UvA-DARE (University of Amsterdam) · Cited by 2
Quantum boolean circuits construction using tabulation method
Lu, C.-Y., Wang, S.-A., & Kuo, S. (2005) · IEEE Conference on Nanotechnology (IEEE NANO) · doi:10.1109/nano.2004.1392431 · Cited by 2
The quantum complexity of set membership
Radhakrishnan, J., Sen, P., & Venkatesh, S. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892143 · Cited by 3
Newman, I., Buhrman, H., Fortnow, L., & Röhrig, H. (2001) · UvA-DARE (University of Amsterdam) · Cited by 2
TOWARDS A HIGH QUALITY POLARIZATION-ENTANGLED MULTI-PHOTON SOURCE
Poh, H. S. (2009) · National University of Singapore · Cited by 2
Characterizing Noise in Quantum Systems
Magesan, E. (2012) · UWSpace (University of Waterloo) · Cited by 4
Quantum Computing: Linear Optics ImplementationsPreprint
Sundsøy, P., & Fjeldberg, E. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1607.03935 · Cited by 2
Efficient quantum circuits for dense and non-unitary operatorsPreprint
Zhou, S., & Wang, J. B. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1607.07149 · Cited by 2
Probabilistic Proof-carrying Code
Sharkey, M. I. (2012) · uO Research (University of Ottawa) · doi:10.20381/ruor-5595 · Cited by 2
Asynchronous Operations on Qubits in Distributed Simulation Environments using QooSimPreprint
vanBrandwijk, J. J., & Parakh, A. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1612.08609 · Cited by 2
Quantum Communication-Query TradeoffsPreprint
Hoza, W. M. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.07768 · Cited by 3
Optimizing Quantum Walk Search on a Reduced Uniform Complete Multi-Partite GraphPreprint
Chiang, C.-F., & Hsieh, C. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1706.05403 · Cited by 2
Gaussian pulse-induced imperfect rephasing in coherent transientsPreprint
Byoung Seung, H. A. M. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1701.04291 · Cited by 2
Breaking the Unbreakable: Exploiting Loopholes in Bell’s Theorem to Hack Quantum Cryptography
Jogenfors, J. (2017) · doi:10.3384/diss.diva-140912 · Cited by 3
Demonstration of Optimal Fixed-Point Quantum Search Algorithm in IBM Quantum ComputerPreprint
Gurnani, K., Behera, B. K., & Panigrahi, P. K. (2017) · arXiv (Cornell University) · Cited by 2
Quantum metamaterials: entanglement of spin and orbital angular momentum of a single photonPreprint
Stav, T., Faerman, A., Maguid, E., Oren, D., Kleiner, V., Hasman, E., & Segev, M. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1802.06374 · Cited by 2
On the Complexity of Solving Subtraction GamesPreprint
Khadiev, K. R., & Kravchenko, D. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1808.03494 · Cited by 2
A quantum related-key attack based on Bernstein-Vazirani algorithmPreprint
Xie, H., & Yang, L. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1808.03266 · Cited by 2
Using Hoare logic for quantum circuit optimization.Preprint
Häner, T., Hoefler, T., & Troyer, M. (2018) · arXiv (Cornell University) · Cited by 3
Constant Time Quantum search Algorithm Over A Datasets: An Experimental Study Using IBM Q ExperiencePreprint
Das, K., & Sadhu, A. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.03390 · Cited by 2
Quantum Conditional Random FieldPreprint
Wu, Y., Yu, C., Cai, B., Qin, S., Gao, F., & Wen, Q. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1901.01027 · Cited by 3
A quantum algorithm for solving systems of nonlinear algebraic equationsPreprint
Qian, P., Huang, W.-C., & Long, G. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.05608 · Cited by 4
Empirical determination of the simulation capacity of a near-term quantum computerPreprint
Rines, R., Obenland, K., & Chuang, I. L. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.10724 · Cited by 6
Family of PRGs based on Collections of Arithmetic Progressions.Preprint
Srikanth, C., Madhavan, C. E. V., & Swamy, H. V. K. (2017) · IACR Cryptology ePrint Archive · Cited by 2
Entanglement purification with two-way classical communicationPreprint
Leung, A. W., & Shor, P. W. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0702155 · Cited by 2
Exact Quantum Algorithms for the Leader Election ProblemPreprint
Tani, S., Kobayashi, H., & Matsumoto, K. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0712.4213 · Cited by 2
Protection of information in quantum qatabasesPreprint
Ozhigov, Y. (1997) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9712016 · Cited by 2
Random Oracles in a Quantum WorldPreprint
Boneh, D., Dagdelen, Ö., Fischlin, M., et al. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1008.0931 · Cited by 2
Superlinear advantage for exact quantum algorithmsPreprint
Ambainis, A. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1211.0721 · Cited by 2
Quantum algorithm for tree size estimation, with applications to backtracking and 2-player gamesPreprint
Ambainis, A., & Kokainis, M. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1704.06774 · Cited by 2
Classical lower bounds from quantum upper boundsPreprint
Ben-David, S., Bouland, A., Garg, A., & Kothari, R. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1807.06256 · Cited by 2
Digitally Mutating NV-FPGAs into Physically Clone-Resistant UnitsPreprint
Mars, A., & Adi, W. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1908.03898 · Cited by 2
On the Quantum Complexity of Closest Pair and Related ProblemsPreprint
Aaronson, S., Chia, N.-H., Lin, H.-H., Wang, C., & Zhang, R. (2019) · arXiv (Cornell University) · doi:10.4230/lipics.tqc.2020.9 · Cited by 3
The supersingular isogeny problem in genus 2 and beyondPreprint
Costello, C., & Smith, B. (2019) · arXiv (Cornell University) · Cited by 2
Hybrid Decision Trees: Longer Quantum Time is Strictly More PowerfulPreprint
Sun, X., & Zheng, Y. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1911.13091 · Cited by 2
Bayesian machine learning for Boltzmann machine in quantum-enhanced feature spacesPreprint
Wu, Y., Yu, C., Qin, S., Wen, Q., & Gao, F. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1912.10857 · Cited by 4
Performance Analysis of TLS for Quantum Robust Cryptography on a Constrained DevicePreprint
Barton, J., Buchanan, W. J., Pitropakis, N., Sayeed, S., & Abramson, W. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1912.12257 · Cited by 2
Context-Sensitive and Duration-Aware Qubit Mapping for Various NISQ DevicesPreprint
Zhang, Y., Deng, H., & Li, Q. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2001.06887 · Cited by 2
Remscrim, Z. (2020) · arXiv (Cornell University) · doi:10.4230/lipics.itcs.2021.39 · Cited by 7
A QUANTUM ALGORITHM TO LOCATE UNKNOWN HASHES FOR KNOWN N-GRAMS WITHIN A LARGE MALWARE CORPUSPreprint
Allgood, N. R., & Nicholas, C. (2020) · arXiv (Cornell University) · doi:10.13016/m2ol6y-96a8 · Cited by 2
The Dual Polynomial of Bipartite Perfect MatchingPreprint
Beniamini, G. (2020) · arXiv (Cornell University) · Cited by 2
Quantum Ensemble for ClassificationPreprint
Macaluso, A., Clissa, L., Lodi, S., & Sartori, C. (2022) · Research Square · doi:10.21203/rs.3.rs-1892535/v1 · Cited by 2
Novel Heat-Bath Algorithmic Cooling methods
Rodríguez-Briones, N. A. (2020) · UWSpace (University of Waterloo) · Cited by 4
The quantum locker puzzlePreprint
Avis, D. (2009) · Cited by 2
Grover on GIFT.Preprint
Jang, K., Kim, H., Eum, S., & Seo, H. (2020) · IACR Cryptology ePrint Archive · Cited by 2
CMOS Quantum Computing: Toward A Quantum Computer System-on-ChipPreprint
Nikandish, G., Blokhina, E., & Staszewski, R. B. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2012.09021 · Cited by 2
The Approximate Degree of Bipartite Perfect MatchingPreprint
Beniamini, G. (2020) · arXiv (Cornell University) · doi:10.4230/lipics.ccc.2022.1 · Cited by 5
Quantum Simulations of the Non-Unitary Time Evolution and Applications to Neutral-Kaon OscillationsPreprint
Chen, Y., Ma, Y., & Shun Zhou, C. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2105.04765 · Cited by 3
Computational Statistics and Data Science in the Twenty‐First Century
Holbrook, A. J., Nishimura, A., Ji, X., & Suchard, M. A. (2021) · Wiley eBooks · doi:10.1002/9781118445112.stat08324 · Cited by 4
EQUAL: Improving the Fidelity of Quantum Annealers by Injecting Controlled PerturbationsPreprint
Ayanzadeh, R., Das, P., Tannu, S., & Qureshi, M. K. (2022) · Research Square · doi:10.21203/rs.3.rs-1343360/v1 · Cited by 5
Quantum Algorithms in IBMQ Experience: Deutsch-Jozsa algorithmPreprint
de Oliveira, A. N., de Oliveira, E. V. B., Santos, A. C., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2109.07910 · Cited by 2
Quantum computing enhanced machine learning for physico-chemical applicationsPreprint
Sajjan, M., Li, J., Selvarajan, R., Sureshbabu, S. H., Kale, S. S., Gupta, R., & Kais, S. (2021) · arXiv (Cornell University) · Cited by 3
Kosugi, T., Nishiya, Y., Nishi, H., & Matsushita, Y. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.12471 · Cited by 2
Kempe, J. (2006) · Wiley eBooks · doi:10.1002/9783527618637.ch6 · Cited by 2
Ahlswede, R. (2006) · Lecture notes in computer science · doi:10.1007/11889342_1 · Cited by 2
Quantum computation of Groebner basisPreprint
Kikuchi, I., & Kikuchi, A. (2021) · doi:10.31219/osf.io/mq4p5 · Cited by 2
Patel, A. D., & Grover, L. K. (2016) · Springer eBooks · doi:10.1007/978-1-4939-2864-4_317 · Cited by 2
Self-citationGrover, L. K., & Reichardt, B. W. (2008) · Springer eBooks · doi:10.1007/978-0-387-30162-4_317 · Cited by 2
Self-citation
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
