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 3,501–3,600 of 8,792
Depth-Optimized Quantum Circuits for ASCON: AEAD and HASH
Oh, Y., Jang, K., Baksi, A., et al. (2024) · Mathematics · doi:10.3390/math12091337 · Cited by 7
BCQQ: Batch-Constraint Quantum Q-Learning with Cyclic Data Re-uploading
Periyasamy, M., Hölle, M., Wiedmann, M., Scherer, D. D., Plinge, A., & Mutschler, C. (2024) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn60899.2024.10651268 · Cited by 7
Determining probability density functions with adiabatic quantum computing
Robbiati, M., Cruz-Martinez, J. M., & Carrazza, S. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00228-2 · Cited by 8
Quantum Computing in Civil Engineering: Potentials and Limitations
Ploennigs, J., Berger, M., Mevissen, M., & Smarsly, K. (2025) · Lecture Notes in Civil Engineering · doi:10.1007/978-3-031-87364-5_2 · Cited by 7
Exciton-mediated quantum search on a star graph
Pouthier, V. (2015) · Quantum Information Processing · doi:10.1007/s11128-015-1043-8 · Cited by 7
An Edge-Based Matching Kernel Through Discrete-Time Quantum Walks
Bai, L., Zhang, Z., Ren, P., et al. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-23231-7_3 · Cited by 7
TOWARDS A NOVEL ENVIRONMENT FOR SIMULATION OF QUANTUM COMPUTING
Patrzyk, J., Patrzyk, B., Rycerz, K., & Bubak, M. (2015) · Computer Science · doi:10.7494/csci.2015.16.1.103 · Cited by 8
On Quantum Versions of the Yao Principle
de Graaf, M., & de Wolf, R. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45841-7_28 · Cited by 9
Quantum-inspired genetic algorithms for flow shop scheduling
Wang, L., & Li, B. (2008) · Studies in computational intelligence · doi:10.1007/978-3-540-78532-3_2 · Cited by 7
Quantum Approach to Classical Thermodynamics and Optimization
Somma, R. D., & Ortíz, G. (2010) · Lecture notes in physics · doi:10.1007/978-3-642-11470-0_1 · Cited by 7
Graph Edit Distance without Correspondence from Continuous-Time Quantum Walks
Emms, D., Wilson, R. C., & Hancock, E. R. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-89689-0_5 · Cited by 7
Quest for a quantum search algorithm for testing stuck-at faults in digital circuits
Venkatasubramanian, M., Agrawal, V. D., & Janaher, J. J. (2015) · Proceedings · doi:10.1109/dft.2015.7315149 · Cited by 7
An R || C max Quantum Scheduling Algorithm
Lu, F., & Marinescu, D. C. (2006) · Quantum Information Processing · doi:10.1007/s11128-006-0048-8 · Cited by 7
Span Programs are Equivalent to Quantum Query Algorithms
Reichardt, B. W. (2014) · SIAM Journal on Computing · doi:10.1137/100792640 · Cited by 11
Intricacies of quantum computational paths
Tarrataca, L. D. T. J., & Wichert, A. (2012) · Quantum Information Processing · doi:10.1007/s11128-012-0475-7 · Cited by 5
Quantum-Inspired Electromagnetism-Like Mechanism for Solving 0/1 Knapsack Problem
Chang, C.-C., Chen, C., Fan, C., Chao, H., & Chou, Y. (2010) · doi:10.1109/itcs.2010.5581278 · Cited by 7
Simulated quantum computation of global minima
Zhu, J., Huang, Z., & Kais, S. (2009) · Molecular Physics · doi:10.1080/00268970903117126 · Cited by 6
A New Test Vector Search Algorithm for a Single Stuck-at Fault Using Probabilistic Correlation
Venkatasubramanian, M., & Agrawal, V. D. (2014) · IEEE North Atlantic Test Workshop (NATW) · doi:10.1109/natw.2014.20 · Cited by 7
BUILDING PARTIALLY ENTANGLED STATES WITH GROVER'S AMPLITUDE AMPLIFICATION PROCESS
Azuma, H. (2000) · International Journal of Modern Physics C · doi:10.1142/s0129183100000407 · Cited by 8
The role of super-fast transforms in speeding up quantum computations
Zilic, Z., & Radecka, K. (2003) · Proceedings/Proceedings - International Symposium on Multiple-Valued Logic · doi:10.1109/ismvl.2002.1011080 · Cited by 7
An Extended XQDD Representation for Multiple-Valued Quantum Logic
Lu, C.-Y., Wang, S.-A., & Kuo, S. (2011) · IEEE Transactions on Computers · doi:10.1109/tc.2011.114 · Cited by 7
Quantum computation patent mapping - a strategic view for the information technique of tomorrow
Chang, M. (2005) · International Conference on Service Systems and Service Management · doi:10.1109/icsssm.2005.1500183 · Cited by 7
QISA: Incorporating quantum computation into Simulated Annealing for optimization problems
Chen, Z., & Luo, P. (2011) · doi:10.1109/cec.2011.5949925 · Cited by 7
Self-Routing Quantum Sparse Crossbar Packet Concentrators
Ratan, R., & Oruç, A. Y. (2010) · IEEE Transactions on Computers · doi:10.1109/tc.2010.145 · Cited by 7
A Hybrid Architecture Approach for Quantum Algorithms
Aghaei, M. R. S., Zukarnain, Z. A., Mamat, A., et al. (2009) · Journal of Computer Science · doi:10.3844/jcssp.2009.725.731 · Cited by 7
On the Universality of Quantum Logical Neural Networks
da Silva, A. J., Ludermir, T. B., & de Oliveira, W. R. (2012) · Brazilian Symposium on Neural Networks (SBRN) · doi:10.1109/sbrn.2012.44 · Cited by 7
Choi, B.-S., & Braunstein, S. L. (2010) · Quantum Information Processing · doi:10.1007/s11128-010-0187-9 · Cited by 7
Quantum interpolation of polynomials
Kane, D. M., & Kutin, S. (2011) · Quantum Information and Computation · doi:10.26421/qic11.1-2-7 · Cited by 7
Optimizing the number of gates in quantum search
Arunachalam, S., & de Wolf, R. (2017) · Quantum Information and Computation · doi:10.26421/qic17.3-4-4 · Cited by 13
Steady-state entanglement enhanced by a dissipative ancilla
Fischbach, J., & Freyberger, M. (2015) · Physical Review A · doi:10.1103/physreva.92.052327 · Cited by 7
On Coinduction and Quantum Lambda Calculi
Deng, Y., Feng, Y., & Lago, U. D. (2015) · HAL (Le Centre pour la Communication Scientifique Directe) · doi:10.4230/lipics.concur.2015.427 · Cited by 7
Parametric Quantum Search Algorithm as Quantum Walk: A Quantum Simulation
Ellinas, D., & Konstandakis, C. (2016) · Reports on Mathematical Physics · doi:10.1016/s0034-4877(16)30008-8 · Cited by 7
Quantum sort algorithm based on entanglement qubits {00, 11}
Odeh, A., & Abdelfattah, E. (2016) · IEEE Long Island Systems, Applications and Technology Conference (LISAT) · doi:10.1109/lisat.2016.7494107 · Cited by 7
Cour, B. R. L., & Ostrove, C. I. (2016) · Quantum Information Processing · doi:10.1007/s11128-016-1464-z · Cited by 7
Application of quantum search algorithms as a web search engine
Sihare, S. R., & Nath, V. V. (2016) · International Conference on Global Trends in Signal Processing, Information Computing and Communication · doi:10.1109/icgtspicc.2016.7955261 · Cited by 7
Instruction Set Architectures for Quantum Processing Units
Britt, K. A., & Humble, T. S. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-67630-2_8 · Cited by 7
Quantum walks for the determination of commutativity of finite dimensional algebras
Combarro, E. F., Ranilla, J., & Rúa, I. F. (2018) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2018.09.050 · Cited by 7
Classical realization of the quantum Deutsch algorithm
de Almeida, Y. V., Barros, M. R., & Hor-Meyll, M. O. (2018) · American Journal of Physics · doi:10.1119/1.5065506 · Cited by 7
Block-Anti-Circulant Unbalanced Oil and Vinegar
Szepieniec, A., & Bart Preneel, A. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-38471-5_23 · Cited by 7
Quantum interpolation of polynomilas
Kane, D. M., & Kutin, S. (2011) · doi:10.5555/2011383.2011390 · Cited by 7
On Quantum Algorithm for Binary Search and Its Computational Complexity
Iriyama, S., Ohya, M., & Volovich, I. V. (2015) · Open Systems & Information Dynamics · doi:10.1142/s1230161215500195 · Cited by 7
Forecasting Financial Risk using Quantum Neural Networks
Bouchti, A. E., Tribis, Y., Nahhal, T., & Okar, C. (2018) · International Conference on Digital Information Management · doi:10.1109/icdim.2018.8847063 · Cited by 7
A Relational Time-Symmetric Framework for Analyzing the Quantum Computational Speedup
Castagnoli, G., Cohen, E., Ekert, A. K., & Elitzur, A. C. (2019) · Foundations of Physics · doi:10.1007/s10701-019-00300-z · Cited by 6
Caligiuri, L. M., & Musha, T. (2019) · International Conference on Engineering, Science, and Industrial Applications (ICESI) · doi:10.1109/icesi.2019.8862999 · Cited by 7
Ilie, D. I., Knottenbelt, W. J., & Stewart, I. D. (2020) · Springer proceedings in business and economics · doi:10.1007/978-3-030-37110-4_9 · Cited by 7
Quantum Relay Blockchain and Its Applications in Key Service
Chen, H. (2020) · International Conference on Cryptography, Security and Privacy (CSP) · doi:10.1145/3377644.3377657 · Cited by 7
Quantum Grover search-based optimization for innovative material discovery
Borujeni, S. E., Harikrishnakumar, R., & Nannapaneni, S. (2019) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata47090.2019.9006454 · Cited by 7
Quantum Speedup for the Minimum Steiner Tree Problem
Miyamoto, M., Iwamura, M., Kise, K., et al. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-58150-3_19 · Cited by 7
Quantum machine learning and its supremacy in high energy physics
Sharma, K. K. (2020) · Modern Physics Letters A · doi:10.1142/s0217732320300244 · Cited by 7
Sublinear Classical and Quantum Algorithms for General Matrix Games
Li, T., Wang, C., Chakrabarti, S., & Wu, X. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i10.17028 · Cited by 7
Quantum case-based reasoning (qCBR)
Atchade-Adelomou, P., Casado-Faulí, D., Golobardes-Ribé, E., & Vilasis-Cardona, X. (2022) · Artificial Intelligence Review · doi:10.1007/s10462-022-10238-w · Cited by 9
Quantum Algorithm for Dyck Language with Multiple Types of Brackets
Khadiev, K. R., & Kravchenko, D. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-87993-8_5 · Cited by 7
Quantum inspired meta‐heuristic approaches for automatic clustering of colour images
Dey, A., Dey, S., Bhattacharyya, S., et al. (2021) · International Journal of Intelligent Systems · doi:10.1002/int.22494 · Cited by 7
$$\text{ W-OTS}^{+}$$ Up My Sleeve! A Hidden Secure Fallback for Cryptocurrency Wallets
Chaum, D., Larangeira, M., Yaksetig, M., et al. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-78372-3_8 · Cited by 7
A Status Update on Quantum Safe Cryptography
Strand, M. (2021) · International Conference on Military Communication and Information Systems (ICMCIS) · doi:10.1109/icmcis52405.2021.9486413 · Cited by 7
On the optimal schedule of adiabatic quantum computing
Isermann, S. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03227-5 · Cited by 7
Reproducible families of codes and cryptographic applications
Santini, P., Persichetti, E., & Baldi, M. (2021) · Journal of Mathematical Cryptology · doi:10.1515/jmc-2020-0003 · Cited by 8
Quantum Image Edge Detection Based on Multi-Directions Gray-Scale Morphology
Li, W.-X., Zhou, R., & Yu, H. J. (2021) · International Journal of Theoretical Physics · doi:10.1007/s10773-021-04966-y · Cited by 9
Test Points for Online Monitoring of Quantum Circuits
Acharya, N., Urbánek, M., de Jong, W. A., & Saeed, S. M. (2021) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/3477928 · Cited by 7
The Future of Cryptocurrency Blockchains in the Quantum Era
Alghamdi, S., & Almuhammadi, S. (2021) · IEEE International Conference on Blockchain (Blockchain) · doi:10.1109/blockchain53845.2021.00082 · Cited by 8
Mosca, M. (2011) · Springer eBooks · doi:10.1007/978-1-4614-1800-9_144 · Cited by 7
Dey, S., Bhattacharyya, S., & Maulik, U. (2013) · Advances in computational intelligence and robotics book series · doi:10.4018/978-1-4666-4936-1.ch004 · Cited by 7
Implementation of an Quantum Circuit Simulator using Classical Bits
Hong, Y., Jeon, S., Park, S., & Kim, B.-S. (2022) · IEEE International Conference on Artificial Intelligence Circuits and Systems (AICAS) · doi:10.1109/aicas54282.2022.9870019 · Cited by 7
Evaluating the Security of Merkle-Damgård Hash Functions and Combiners in Quantum Settings
Bao, Z., Guo, J., Li, S., & Pham, P. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-23020-2_39 · Cited by 9
Brun, T. A., & Krovi, H. (2007) · PhDT · Cited by 7
A complete classification of quantum public-key encryption protocols
Wu, C., & Yang, L. (2015) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.2194067 · Cited by 7
CNOT-based design and query management in quantum relational databases
Gueddana, A., Chatta, R., & Attia, M. (2014) · International Journal of Quantum Information · doi:10.1142/s0219749914500233 · Cited by 6
Sorting N elements using quantum entanglement sets
Odeh, A., Elleithy, K. M., Almasri, M. M., et al. (2013) · International Conference on Innovative Computing Technology · doi:10.1109/intech.2013.6653693 · Cited by 7
Multipartite entanglement in Grover’s search algorithm
Qu, R., Shang, B.-J., Bao, Y.-R., et al. (2015) · Natural Computing · doi:10.1007/s11047-014-9481-2 · Cited by 7
Secure Set Membership Using 3Sat
Mare, M. J. D., & Wright, R. N. (2006) · Lecture notes in computer science · doi:10.1007/11935308_32 · Cited by 7
Quantum games via search algorithms
Romanelli, A. (2007) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2007.02.029 · Cited by 7
Bioreaction Quantum Computing without Quantum Diffusion
Clark, K. B. (2012) · NeuroQuantology · doi:10.14704/nq.2012.10.4.574 · Cited by 7
A study on neuromorphic quantum computation
Sato, S., Kinjo, M., Takahashi, O., Nakamiya, Y., & Nakajima, K. (2005) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2004.1381200 · Cited by 7
Quantum Algorithms Know in Advance 50% of the Solution They Will Find in the Future
Castagnoli, G. (2009) · International Journal of Theoretical Physics · doi:10.1007/s10773-009-0143-6 · Cited by 7
A Novel Variable-Boundary-Coded Quantum Genetic Algorithm for Function Optimization
Xiong, H., Xiong, K., & Tang, Q. (2009) · IEEE Intl Conf on Dependable, Autonomic and Secure Computing, Intl Conf on Pervasive Intelligence and Computing, Intl Conf on Cloud and Big Data Computing, Intl Conf on Cyber Science and Technology Congress (DASC/PiCom/CBDCom/CyberSciTech) · doi:10.1109/dasc.2009.10 · Cited by 7
An Improved Quantum Algorithm for Searching an Ordered List
Jacokes, B. (2007) · Cited by 7
Quantum Boolean circuit approach for searching an unordered database
Tsai, I.-M., Kuo, S., & Wei, D. S. L. (2003) · IEEE Conference on Nanotechnology (IEEE NANO) · doi:10.1109/nano.2002.1032254 · Cited by 7
The power of various real-valued quantum queries
Bessen, A. J. (2003) · Journal of Complexity · doi:10.1016/j.jco.2003.07.001 · Cited by 7
Protocol and applications for sharing quantum private keys
Wang, H., Lin, T.-S., Tsai, I.-M., et al. (2005) · International Carnahan Conference on Security Technology · doi:10.1109/ccst.2005.1594855 · Cited by 7
An Extended approach for Mapping Reversible Circuits to Quantum Circuits using NCV-|v1〉library
Handique, M., & Sonkar, A. (2018) · Procedia Computer Science · doi:10.1016/j.procs.2017.12.106 · Cited by 7
Some Issues in Quantum Information Theory
Duan, R., Ji, Z., Feng, Y., & Ying, M. (2006) · Journal of Computer Science and Technology · doi:10.1007/s11390-006-0776-3 · Cited by 7
An intuitive Hamiltonian for quantum searchPreprint
Fenner, S. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0004091 · Cited by 7
Quantum basin hopping with gradient-based local optimisationPreprint
Bulger, D. W. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0507193 · Cited by 7
Novel Integrated Methods of Evolving Spiking Neural Network and Particle Swarm Optimisation
Hamed, A., & Nuzly, H. (2012) · Tuwhera (Auckland University of Technology) · Cited by 7
A Quantum Computational Learning AlgorithmPreprint
Ventura, D. A., & Martinez, T. R. (1998) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9807052 · Cited by 9
Average/Worst-Case Gap of Quantum Query Complexities by On-Set SizePreprint
Ambainis, A., Iwama, K., Nakanishi, M., Nishimura, H., Raymond, R., Tani, S., & Yamashita, S. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0908.2468 · Cited by 9
A panoply of quantum algorithms
Furrow, B. (2010) · cIRcle (University of British Columbia) · doi:10.14288/1.0085242 · Cited by 7
Conte, E., Pierri, G., Mendolicchio, L., Khrennikov, A. Y., & Zbilut, J. P. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.physics/0608236 · Cited by 7
Quantum Error Correction with Biased Noise
Brooks, P. (2013) · CaltechTHESIS (California Institute of Technology) · doi:10.7907/1tvt-j780 · Cited by 7
A Hybrid Quantum Search Engine: A Fast Quantum Algorithm for Multiple MatchesPreprint
Younes, A., Rowe, J., & Miller, J. F. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0311171 · Cited by 8
Gaining Information About a Quantum Channel Via Twirling
Magesan, E. (2008) · UWSpace (University of Waterloo) · Cited by 8
Mossayebi, S., & Schack, R. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1609.03780 · Cited by 7
Error tracing in linear and concatenated quantum circuitsPreprint
Majumdar, R., Basu, S., Mukhopadhyay, P., et al. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1612.08044 · Cited by 7
Quantum Algorithms for Graph Connectivity and Formula EvaluationPreprint
Jeffery, S., & Kimmel, S. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1704.00765 · Cited by 7
New Results on Quantum Property TestingPreprint
Chakraborty, S., Fischer, E., Matsliah, A., & de Wolf, R. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1005.0523 · Cited by 7
Quantum Algorithm for the Collision Problem
Tapp, A. (2008) · Springer eBooks · doi:10.1007/978-0-387-30162-4_304 · Cited by 9
The Quantum Complexity of Set MembershipPreprint
Radhakrishnan, J., Sen, P., & Venkatesh, S. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0007021 · Cited by 7
Optimal parallel quantum query algorithmsPreprint
Jeffery, S., Magniez, F., & de Wolf, R. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1309.6116 · Cited by 7
Lower Bounds for Function Inversion with Quantum AdvicePreprint
Chung, K.-M., Liao, T.-N., & Qian, L. (2019) · arXiv (Cornell University) · doi:10.4230/lipics.itc.2020.8 · Cited by 7
Quantum Transport Protocols for Distributed Quantum ComputingPreprint
Zhao, Y., & Qiao, C. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2105.08109 · Cited by 6
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
