The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index; none of the 8 sources its claims cite is checked for support yet.
A fast quantum mechanical algorithm for database search
Open accessAbstract
An unsorted database contains N records, of which just one satisfies a particular property.The problem is to identify that one record.Any classical algorithm, deterministic or probabilistic, will clearly take O (N) steps since on the average it will have to examine a large fraction of the N records.Quantum mechanical systems can do several operations simultaneously due to their wave like properties.This paper gives an O ( JN) step quantum mechanical algorithm for identifying that record.It is within a constant factor of the fastest possible quantum mechanical algorithm.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
19 No basis given · 8 Sources not found · 4 Own interpretation
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This paper gives an O ( JN) step quantum mechanical algorithm for identifying that record.”
§ A fast quantum mechanical algorithm for database search > Abstract
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- The authors state this as an assumption: There is a unique state that satisfies the condition C(S)=1.
- The authors state this as an assumption: For any state S, the condition C(S) can be evaluated in unit time.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Corollary 3.1-Let the state vector be as followsfor any one state the amplitude is k, for each of the remaining (N-1) states the amplitude is 1.Let k and 1 be real numbers (in general the amplitudes can be complex).Let k be negative and 1 be positive such that ~< ~N.Then after applying the diffusion transform both k and 1are positive numbers.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“First, it is proved that the system is a valid quantum mechanical system (theorems 1 & 2)”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
boosted- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“As mentioned in the introduction, the algorithm of this paper does not use any Imowledge about the problem.”
§ A fast quantum mechanical algorithm for database search > 114
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Theorem 1-The matix D is unitary.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The following sections prove that the system discussed in section 3 is indeed a valid quantum mechanical system and that it converges to the desired state with a probability O(l).”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- The authors state this as an assumption: There is a unique state that satisfies the condition C(S)=1.
- The authors state this as an assumption: For any state S, the condition C(S) can be evaluated in unit time.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Theorem 2 -D can be expressed as D = FRF, where F, the Fourier Transform Matrix and R, the rotation matrix are defined as follows”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Since the proba-& bility of the system being found in any particular state is proportional to the square of the amplitude, it follows that the probability of the system being in tlhe desired state when k is ~, 1 J2 is k2 = ~.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In case there is a unique state SV such that C(SV) = 1, the final state is SV with a probability of at least ~. 2”
§ A fast quantum mechanical algorithm for database search > T. Acknowledgments
plainconditional- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
- The authors state this as an assumption: There is a unique state that satisfies the condition C(S)=1.
- The authors state this as an assumption: For any state S, the condition C(S) can be evaluated in unit time.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“It can be easily modified to take care of the case when there are multiple states satisfying the condition C(S) = 1 and it is required to return one of these.”
§ A fast quantum mechanical algorithm for database search > 114
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Probably not a substantial claim. 8
- It may state two separate claims as one. 4
- The quote only partly states this claim. 1
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Theorem 5-Let the probability of a particular outcome in an experiment be &.Then if the experiment be repeated ~times, the probability that the outcome does not happen even once is less than or equal to e-K.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The change in k ( Ak) after steps (a) and (b) of the algorithm is lower bounded by Ak>~.Also after steps (a) and (b), 1>0.2fi”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Using this it immediately follows that there exists a number M less than EN, such that in M repetitions of the loop in step (ii), k wifl become ~.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The quote only partly states this claim.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The most efficient classical algorithm for this is to examine the items in the database one by one.”
§ A fast quantum mechanical algorithm for database search > ------------------------------------------------
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“Very recent results [Shor95] have shown the existence of quantum mechanical error corr~ting cod~which enable transmission of data even in the presence of noise”
§ A fast quantum mechanical algorithm for database search > 114
What the sources say
- Not matchedcites [Shor95]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
boosteddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This algorithm, by cleverly making use of some features of the structure of the problem, is the only known algorithm that solves the problem in O (logIV) steps.”
§ A fast quantum mechanical algorithm for database search > 114
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The phase does not have an analog in classical probabilistic algorithms.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This illustrates the point that, in quantum mechanics, the complete description of the system requires the amplitudes over all states, just the probabilities is not enough.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
In the paper
“For example Shor's primality testing algorithm [Shor94] for a number N can be viewed as a search of the (N-l) numbers smaller than N to see if any of them is a factor of N.”
§ A fast quantum mechanical algorithm for database search > 114
What the sources say
- Not matchedcites [Shor94]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
In the paper
“There is also a scheme discussed in [VV86] by which it is possible to modify any algorithm that solves an NPsearch problem with a unique solution and use it to solve an NP-search problem in general.”
§ A fast quantum mechanical algorithm for database search > 114
What the sources say
- Not matchedcites [VV86]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
hedgeddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
In the paper
“This operation is one of the things that makes quantum mechanical algorithms more powerful than classical algorithms and forms the basis for most significant quantum mechanical algorithms.”
§ A fast quantum mechanical algorithm for database search > T. Acknowledgments
What the sources say
- Not matchedcites [DJ92]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
- Not matched
The authors state this as an assumption.
There is a unique state that satisfies the condition C(S)=1.
“Let there be a unique state, say Sv, that satisfies the condition C(SV) = 1, whereas for all other states S, C(S) = 0”
“The algorithm as discussed here assumes a unique state that satisfies the desired condition.”
The authors state this as an assumption.
For any state S, the condition C(S) can be evaluated in unit time.
“(assume that for any state S, the condition C(S) can be evaluated in unit time)”
The paper relies on this without support.
There does not exist any sorting on the database that would aid selection of the desired item.
“However, there does not exist any sorting on the database that would aid its selection.”
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Symmetric cryptography remains comparatively resilient, yet Grover's algorithm offers a quadratic speed-up for brute-force key search, effectively halving the security margin of symmetric ciphers [13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Similarly, for hash functions, Grover's algorithm [185] can facilitate quantum birthday attack to find collision, thereby necessitating an output of larger size.”
From Zero Trust Architecture (ZTA): A Comprehensive Survey (2022) · cites this paper as [185]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Similarly, Grover’s algorithm concedes a quadratic advantage for mining blocks in certain consensus protocols such as proof of work.”
From Quantum-resistance in blockchain networks (2023) · cites this paper as [71]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Quantum computers will be able to find these nonces quadratically faster using Grover’s algorithm71.”
From Quantum-resistance in blockchain networks (2023) · cites this paper as [71]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“This model is realistic given the falling cost of storage, the rise of large-scale surveillance infrastructures, and the expected disruption of quantum algorithms such as Shor's and Grover's [1,2,13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measured
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Grover's algorithm provides only a quadratic speedup, effectively halving brute-force resistance. Comparable security margins can be restored by doubling key sizes (for example, AES-128 to AES-256) [13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“This explains why AES-256 maintains post-quantum security margins, whereas AES-128 requires upgrading to maintain equivalent protection levels [13,14].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“At the same time, Grover's algorithm shows that symmetric cryptography, though more resilient, also demands doubled key sizes to maintain equivalent margins [13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“In this sense, Grover-based optimization algorithms [184] such as Grover Adaptive Search [161] have been proposed.”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [184]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The former bound is tight since recent work of Grover [13] shows how to accept the class NP relative to any oracle on a quantum computer in time O (2 n/ 2 ).”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“In view of Grover's algorithm [13], we know that the constant '1 / 2' in the statement of Theorem 3.5 cannot be improved.”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The former bound is tight since recent work of Grover [13] shows how to accept the class NP relative to any oracle on a quantum computer in time O (2 n/ 2 ).”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“Grover’s algorithm [54] is a quantum algorithm for searching in a database, ofering quadratic speedup over classical searching methods.”
From QASMBench: A Low-Level Quantum Benchmark Suite for NISQ Evaluation and Simulation (2023) · cites this paper as [54]
The cited source says what the claim attributes to it.
In the citing paper
“However, quantum machines can recognize this language quadratically faster, in time O ( √ 2 n ), using Grover's algorithm [13].”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
The cited source says what the claim attributes to it.
In the citing paper
“That this was a real possibility is clear from Grover's [13] result, which gives a black-box approach to solving NP -complete problems in square-root as much time as is required classically.”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
The cited source says what the claim attributes to it.
In the citing paper
“Various strategies can be imagined, but a good one (called 'inversion about the average' by Grover [13]) is to perform an oracle-independent unitary transformation so as to change the phase difference into an amplitude difference, leaving the y term with the same sign as all the other terms but a magnitude approximately threefold larger.”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“The HNDL adversary departs from conventional cryptanalysis in its temporal asymmetry. Instead of attempting immediate decryption, the attacker passively collects encrypted traffic or stored archives and defers decryption until sufficient computational resources become available.”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredIn the citing paper
“This algorithm uses a single function evaluation to label the single state which satisfies the function, followed by a series of gates which drive the system into this particular state.”
From Implementation of a quantum search algorithm on a quantum computer (1998) · cites this paper as [9]
In the citing paper
“Here we show how such a computer can be used to implement a fast quantum search algorithm initially developed by Grover. 9, 10”
From Implementation of a quantum search algorithm on a quantum computer (1998) · cites this paper as [9]
In the citing paper
“Among other applications Grover's algorithms enable an extremely rapid search over the domain of a binary function to find elements for which this function is satisfied (that is, the function has the value 1).”
From Implementation of a quantum search algorithm on a quantum computer (1998) · cites this paper as [9]
In the citing paper
“the ability to efficiently perform Hamiltonian simulation is used in conjunction with another technique known as the quantum phase estimation algorithm (QPEA) 42 for efficiently obtaining the eigen-energies and eigenstates of a quantum system 38 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
In the citing paper
“The Quantum Phase Estimation (QPE) algorithm 38,99 is the natural translation of the FCI procedure to quantum computers 45 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
In the citing paper
“Abrams and Lloyd 38 focused on state preparation in more detail and described concrete initialization procedures.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
In the citing paper
“They pointed out that state preparation is conceptually easier in second quantization, where a Fock state is represented by a simple product state of qubits in {| 0 〉 , | 1 〉} states.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
Citations
Cites
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Scheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
Rapid solution of problems by quantum computation
Deutsch, D., & Jozsa, R. (1992) · Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences · doi:10.1098/rspa.1992.0167 · Cited by 2,700
The Emperor's New Mind: Concerning Computers, Minds, and The Laws of Physics
Penrose, R., & Gardner, M. (1989) · doi:10.1093/oso/9780198519737.001.0001 · Cited by 2,007
Strengths and Weaknesses of Quantum Computing
Bennett, C. H., Bernstein, E., Brassard, G., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300933 · Cited by 1,470
On the Power of Quantum Computation
Simon, D. R. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796298637 · Cited by 1,295
Bernstein, E., & Vazirani, U. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167097 · Cited by 1,284
Benioff, P. (1980) · Journal of Statistical Physics · doi:10.1007/bf01011339 · Cited by 1,244
The Emperor's New Mind: Concerning Computers, Minds, and the Laws of Physics
Penrose, R., & Landauer, R. (1990) · Physics Today · doi:10.1063/1.2810599 · Cited by 1,110
Research works printed but not linked: 2
- [9]9. R. Penrose, Shadows of the mind,. Oxford University Press, 1994, pp. 348- 388.
- [14]14. Yao93J A. Yao, Quantum circuit complexip, Proceedings 34th Annual Symposium on Foundations of Computer Science (FOCS), 1993, pp. 352-361.
Cited by
Sorted by citations
Items 4,501–4,600 of 8,792
On zeros of exponential polynomials and quantum algorithms
Sasaki, Y. (2009) · Quantum Information Processing · doi:10.1007/s11128-009-0148-3 · Cited by 4
Extended superposed quantum-state initialization using disjoint prime implicants
Rosenbaum, D., & Perkowski, M. A. (2009) · Physical Review A · doi:10.1103/physreva.79.052310 · Cited by 4
QGA based Bandwidth Adaptation Scheme for Wireless/Mobile Networks
Xiao, W., Zhang, X., & Xin-ping, Y. (2006) · International Conference on ITS Telecommunications · doi:10.1109/itst.2006.288891 · Cited by 4
Assertoric Semantics and the Computational Power of Self-Referential Truth
Wintein, S. (2011) · Journal of Philosophical Logic · doi:10.1007/s10992-010-9162-2 · Cited by 4
Entropy generation in a model of reversible computation
de Falco, D., & Tamascelli, D. (2006) · RAIRO - Theoretical Informatics and Applications · doi:10.1051/ita:2006013 · Cited by 4
Advanced Quantum Communication Systems
Jeffrey, E. R. (2007) · Cited by 4
Quantum computation techniques for gauging reliability of interval and fuzzy data
Longpré, L., Servín, C., & Крейнович, В. (2010) · International Journal of General Systems · doi:10.1080/03081079.2010.510247 · Cited by 4
A non-qubit quantum adder as one-dimensional cellular automaton
Wu, C. H., & Cain, C. A. (2014) · Physica E Low-dimensional Systems and Nanostructures · doi:10.1016/j.physe.2014.01.021 · Cited by 4
Quantum-assisted QD-CFS signatures
Possignolo, R. T., Margi, C. B., & Barreto, P. S. L. M. (2014) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2014.10.003 · Cited by 4
Quantum Kolmogorov Complexity and Information-Disturbance Theorem
Miyadera, T. (2011) · Entropy · doi:10.3390/e13040778 · Cited by 4
Average-Case Quantum Query Complexity
Ambainis, A., & de Wolf, R. (2000) · Lecture notes in computer science · doi:10.1007/3-540-46541-3_11 · Cited by 4
Chang, B. R., Tsai, H. F., & Young, C.-P. (2009) · International Conference on Hybrid Intelligent Systems (HIS) · doi:10.1109/his.2009.8 · Cited by 4
Distributed Trust Relationship and Polynomial Key Generation for IEEE 802.16m Networks
DeCarlo, A., Porthy, J., Tyler, S. W., et al. (2009) · doi:10.1109/mws.2009.18 · Cited by 4
Meyer, D., & Pommersheim, J. (2014) · Lecture notes in computer science · doi:10.1007/978-3-642-54429-3_10 · Cited by 5
A quantum search based signal detection for MIMO-OFDM systems
Li, F., Zhou, L., Liu, L., et al. (2011) · doi:10.1109/cts.2011.5898934 · Cited by 4
Hybrid quantum inspired neural model for commodity price prediction
Mahajan, R. P. (2011) · International Conference on Advanced Communication Technology · Cited by 5
Upper Bounds on the Size of One-Way Quantum Finite Automata
Mereghetti, C., & Palano, B. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45446-2_8 · Cited by 4
Financial Prediction Applications Using Quantum-Minimized Composite Model ASVR/NGARCH
Chang, B. R., & Tsai, H. F. (2006) · 2022 International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2006.1716245 · Cited by 4
A Novel ANN Model Based on Quantum Computational MAS Theory
Meng, X., Wang, J., Pi, Y., et al. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-74769-7_4 · Cited by 4
Condensates, B.-E., Hecht, T., Dr, P., & Cirac, J. I. (2015) · Cited by 4
White Noise in Quantum Random Walk Search Algorithm
Ма, Л., Jiang-Feng, D., Li, Y., Li, H., Kwek, L. C., & H., O. C. (2006) · Chinese Physics Letters · doi:10.1088/0256-307x/23/4/005 · Cited by 4
Database Search and ATPG -- Interdisciplinary Domains and Algorithms
Venkatasubramanian, M., & Agrawal, V. D. (2016) · International Conference on VLSI Design · doi:10.1109/vlsid.2016.119 · Cited by 4
Rarity, J. (1998) · CLEO/Europe Conference on Lasers and Electro-Optics (CLEO/Europe) · doi:10.1109/cleoe.1998.719115 · Cited by 4
BASIC ELEMENTS OF QUANTUM INFORMATION TECHNOLOGY
Spiller, T. P. (1998) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789812385253_0001 · Cited by 4
Quantum key distribution without the wavefunction
Niestegge, G. (2017) · International Journal of Quantum Information · doi:10.1142/s0219749917500484 · Cited by 4
Emerging Circuit Technologies: An Overview on the Next Generation of Circuits
Wille, R., Chakrabarty, K., Drechsler, R., & Kalla, P. (2017) · Springer eBooks · doi:10.1007/978-3-319-67295-3_3 · Cited by 4
Post-quantum Cryptography and a (Qu)Bit More
Maimuţ, D., & Simion, E. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-12942-2_3 · Cited by 4
A Heuristic Qubit Placement Strategy for Nearest Neighbor Realization in 2D Architecture
Bhattacharjee, A., Bandyopadhyay, C., Biswal, L., et al. (2019) · Communications in computer and information science · doi:10.1007/978-981-13-5950-7_49 · Cited by 4
Entanglement in Higher-Radix Quantum Systems
Smith, K. N., & Thornton, M. A. (2019) · Proceedings/Proceedings - International Symposium on Multiple-Valued Logic · doi:10.1109/ismvl.2019.00028 · Cited by 4
Sized Types for Low-Level Quantum Metaprogramming
Amy, M. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-21500-2_6 · Cited by 4
Quantum Privacy-Preserving Price E-Negotiation
Liu, W., Li, C.-T., Zheng, Y., et al. (2019) · International Journal of Theoretical Physics · doi:10.1007/s10773-019-04201-9 · Cited by 4
Merkle Puzzles are Optimal — an O(n)-query attack on key exchange from a random oracle
Barak, B., & Mahmoody, M. (2009) · Cited by 4
Post-quantum Digital Signature Scheme for Personal Data Security in Communication Network Systems
Iavich, M., Iashvili, G., Bocu, R., et al. (2021) · Advances in intelligent systems and computing · doi:10.1007/978-3-030-67133-4_28 · Cited by 4
Araiza, R., Averill, M. G., Keller, G. R., et al. (2006) · scholarworks - UTEP (The University of Texas at El Paso) · Cited by 4
Principles of Secure Processor Architecture Design
Szefer, J. M. (2018) · Synthesis lectures on computer architecture · doi:10.2200/s00864ed1v01y201807cac045 · Cited by 4
A Novel Quantum Steganography Scheme Based on ASCII
Zhou, R., & Luo, J. (2019) · IntechOpen eBooks · doi:10.5772/intechopen.86413 · Cited by 4
Two Remarks on the Vectorization Problem
Castryck, W., & Meeren, N. V. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-22912-1_29 · Cited by 4
Grover’s Algorithm applied to the Molecular Distance Geometry Problem
Lavor, C., Liberti, L., & Maculan, N. (2016) · Congresso Brasileiro de Redes Neurais (CBRN) · doi:10.21528/cbrn2005-234 · Cited by 4
A quantum decoding algorithm of the simplex code
Barg, A., & Zhou, S. (2004) · Cited by 4
Quantum and Classical Query Complexities of Local Search Are Polynomially Related
Sántha, M., & Szegedy, M. (2008) · Algorithmica · doi:10.1007/s00453-008-9169-z · Cited by 4
Quantum Communication With Polarization-Encoded Qubit Using Quantum Error Correction
de Brito, D. B., do Nascimento, J. C., & Ramos, R. V. (2008) · IEEE Journal of Quantum Electronics · doi:10.1109/jqe.2007.911689 · Cited by 4
A Quantum Algorithm for Software Engineering Search
Hall, R. J. (2009) · IEEE/ACM International Conference on Automated Software Engineering (ASE) · doi:10.1109/ase.2009.51 · Cited by 4
Ballhysa, E. (2004) · Cited by 4
Testing of Code-Based Pseudorandom Number Generators for Post-Quantum Application
Kuznetsov, A. A., Кіян, А., Smirnov, O. A., et al. (2020) · IEEE International Conference on Dependable Systems, Services and Technologies (DESSERT) · doi:10.1109/dessert50317.2020.9125045 · Cited by 4
Dyson, C. (2011) · White Rose eTheses Online (University of Leeds, The University of Sheffield, University of York) · Cited by 4
An Improvement in Quantum Fourier TransformPreprint
Gyöngyösi, L., & Imre, S. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1207.4464 · Cited by 4
A Quantum Polynomial Time Algorithm in Worst Case for Simon’s Problem
Mihara, T., & Sung, S. C. (1998) · Lecture notes in computer science · doi:10.1007/3-540-49381-6_25 · Cited by 4
Proof rules for purely quantum programsPreprint
Feng, Y., Duan, R., Ji, Z., & Ying, M. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0507043 · Cited by 4
Quantum Computations: Fundamentals And AlgorithmsPreprint
Duplij, S. A., & Шаповал, И. И. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0712.1098 · Cited by 4
Comparing EQP and MOD_{p^k}P using Polynomial Degree Lower BoundsPreprint
de Graaf, M., & Valiant, P. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0211179 · Cited by 4
A tight bound for probability of error for quantum counting based multiuser detection
Imre, S., & Balázs, F. (2003) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2002.1023315 · Cited by 4
Computation in Finitary Quantum ProcessesPreprint
Wiesner, K., & Crutchfield, J. P. (2006) · arXiv (Cornell University) · Cited by 5
Simulation of finite state machines in a quantum computerPreprint
Dunlavey, M. R. (1998) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9807026 · Cited by 4
Quantum computation based on particle statisticsPreprint
Castagnoli, G., & Monti, D. (1998) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9806010 · Cited by 4
On rounds in quantum communicationPreprint
Klauck, H. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0004100 · Cited by 4
Decidability of the Equivalence of Multi-Letter Quantum Finite AutomataPreprint
Qiu, D., Zou, X., Li, L., & Mateus, P. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0812.1061 · Cited by 4
A quantum inspired competitive coevolution evolutionary algorithm
Tirumala, S. S. (2013) · Unitec Research Bank (Unitec Institute of Technology) · Cited by 4
Deutsch-Jozsa Algorithm Revisited in the Domain of Cryptographically Significant Boolean FunctionsPreprint
Maitra, S., & Mukhopadhyay, P. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0410042 · Cited by 4
The Quantum Speed up as Advanced Cognition of the Solution
Castagnoli, G. (2008) · International Journal of Theoretical Physics · doi:10.1007/s10773-008-9859-y · Cited by 4
Fast quantum verification for the formulas of predicate calculusPreprint
Ozhigov, Y. (1998) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9809015 · Cited by 4
On Randomized and Quantum Query ComplexitiesPreprint
Midrijānis, G. (2005) · arXiv (Cornell University) · doi:10.4230/lipics.mfcs.2026.61 · Cited by 13
Cyclic Mutually Unbiased Bases and Quantum Public-Key Encryption
Seyfarth, U. (2019) · TUbilio (Technical University of Darmstadt) · doi:10.48550/arxiv.1907.02726 · Cited by 8
Post-quantum Lattice-based Cryptography
Staffas, R. (2016) · KTH Publication Database DiVA (KTH Royal Institute of Technology) · Cited by 4
A Quantum Light Source for Light-matter Interaction
Xing, X. (2013) · TSpace (University of Toronto) · Cited by 4
A Quantum Walk Enhanced Grover Search Algorithm for Global OptimizationPreprint
Wang, Y. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1711.07825 · Cited by 7
Quantum impossible differential and truncated differential cryptanalysisPreprint
Xie, H., & Yang, L. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1712.06997 · Cited by 4
Big Data Quantum Support Vector Clustering.Preprint
Bishwas, A. K., Mani, A., & Palade, V. (2018) · arXiv (Cornell University) · Cited by 4
Managing approximation errors in quantum programsPreprint
Häner, T., Roetteler, M., & Svore, K. M. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1807.02336 · Cited by 4
Homological Description of the Quantum Adiabatic Evolution With a View Toward Quantum ComputationsPreprint
Dridi, R., Alghassi, H., & Tayur, S. R. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1811.00675 · Cited by 4
Defining Quantum Neural Networks via Quantum Time EvolutionPreprint
Dendukuri, A., Keeling, B., Fereidouni, A., Burbridge, J., Luu, K., & Churchill, H. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.10912 · Cited by 16
A Quantum Algorithm for Finding $k$-MinimaPreprint
Miyamoto, K., Iwamura, M., & Kise, K. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.03315 · Cited by 10
An Optimized Quantum Maximum or Minimum Searching Algorithm and its CircuitsPreprint
Chen, Y., Wei, S., Gao, X., Wang, C., Wu, J., & Guo, H. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1908.07943 · Cited by 10
Poq: Projection-based Runtime Assertions for Debugging on a Quantum ComputerPreprint
Li, G., Zhou, L., Yu, N., et al. (2019) · arXiv (Cornell University) · Cited by 4
Grover's Algorithm and Many-Valued Quantum LogicPreprint
Hunt, S., & Gadouleau, M. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2001.06316 · Cited by 3
Quantum Optimization of Maximum Independent Set using Rydberg Atom Arrays
Cain, M., Ebadi, S., Keesling, A., Wang, T. T., Levine, H., Bluvstein, D., Semeghini, G., Omran, A., Liu, J.-G., Samajdar, R., et al. (2022) · doi:10.26226/m.6275705c66d5dcf63a3115ad · Cited by 4
QSystem: bitwise representation for quantum circuit simulationsPreprint
Rosa, E. C. R., & Taketani, B. G. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2004.03560 · Cited by 4
Canonical Construction of Quantum OraclesPreprint
Gilliam, A., Pistoia, M., & Gonciulea, C. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.10656 · Cited by 4
Approximation of Various Quantum Query TypesPreprint
Bessen, A. J. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0308140 · Cited by 4
Quantum teleportation and Grover's algorithm without the wavefunctionPreprint
Niestegge, G. (2016) · PhilSci-Archive (University of Pittsburgh) · Cited by 4
Quantum speedups for convex dynamic programmingPreprint
Sutter, D., Nannicini, G., Sutter, T., & Woerner, S. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2011.11654 · Cited by 5
Sampling and the complexity of naturePreprint
Hangleiter, D. (2020) · arXiv (Cornell University) · doi:10.17169/refubium-28790 · Cited by 8
Saarinen, M.-J. O. (2016) · IACR Cryptology ePrint Archive · Cited by 4
Tight Bounds for Inverting Permutations via Compressed Oracle ArgumentsPreprint
Rosmanis, A. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.08975 · Cited by 4
On the Impossibility of General Parallel Fast-Forwarding of Hamiltonian SimulationPreprint
Chia, N.-H., Chung, K.-M., Hsieh, Y.-C., et al. (2021) · arXiv (Cornell University) · doi:10.4230/lipics.ccc.2023.33 · Cited by 4
A systematic mapping on quantum software development in the context of software engineeringPreprint
Zanni, P. E., & de Camargo, V. V. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.00926 · Cited by 7
Towards Verification of Dynamic Quantum Circuits.Preprint
Burgholzer, L., & Wille, R. (2021) · arXiv (Cornell University) · Cited by 4
Quantum Computing: Implementing Hitting Time for Coined Quantum Walks on Regular GraphsPreprint
Wanzambi, E., & Andersson, S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2108.02723 · Cited by 5
Can Noise on Qubits Be Learned in Quantum Neural Network? A Case Study on QuantumFlowPreprint
Liang, Z., Wang, Z., Yang, J., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2109.03430 · Cited by 4
Efficient Decoding of Surface Code Syndromes for Error Correction in Quantum ComputingPreprint
Bhoumik, D., Sen, P., Majumdar, R., Sur‐Kolay, S., J, L. K. K., & Iyengar, S. S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.10896 · Cited by 4
Non-Commutative Key Exchange ProtocolPreprint
Lizama-Pérez, L. A., & Romero, J. M. L. (2021) · Preprints.org · doi:10.20944/preprints202105.0174.v1 · Cited by 4
Quantum Monte Carlo for Economics: Stress Testing and Macroeconomic Deep LearningPreprint
Skavysh, V., Priazhkina, S., Guala, D., & Bromley, T. (2022) · SSRN Electronic Journal · doi:10.2139/ssrn.4207839 · Cited by 4
Revolutionizing Computing: A Comprehensive Introduction to Quantum ComputingPreprint
Jerbi, D. (2023) · doi:10.36227/techrxiv.22710361.v1 · Cited by 5
Discrete optimization: Limitations of existing quantum algorithmsPreprint
Creemers, S., & Armas, L. F. P. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4527268 · Cited by 4
Baseri, Y., Chouhan, V., Ghorbani, A. A., & Chow, A. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4750609 · Cited by 4
Lange, T. (2025) · Springer eBooks · doi:10.1007/978-3-030-71522-9_413 · Cited by 4
Chen, G., & Sun, S. (2002) · Chapman & Hall/CRC eBooks · doi:10.1201/9781420035377-8 · Cited by 4
Quantum technology for military applications
Krelina, M. (2021) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-021-00113-y · Cited by 237
Homoliak, I., Breitenbacher, D., Hujňák, O., Hartel, P., Binder, A., & Szałachowski, P. (2020) · ACM Conference on Advances in Financial Technologies (AFT) · doi:10.1145/3419614.3423257 · Cited by 14
HybridQ: A Hybrid Simulator for Quantum Circuits
Mandrà, S., Marshall, J., Rieffel, E. G., & Biswas, R. (2021) · IEEE/ACM International Workshop on Quantum Computing Software (QCS) · doi:10.1109/qcs54837.2021.00015 · Cited by 14
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
