The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index; none of the 8 sources its claims cite is checked for support yet.
A fast quantum mechanical algorithm for database search
Open accessAbstract
An unsorted database contains N records, of which just one satisfies a particular property.The problem is to identify that one record.Any classical algorithm, deterministic or probabilistic, will clearly take O (N) steps since on the average it will have to examine a large fraction of the N records.Quantum mechanical systems can do several operations simultaneously due to their wave like properties.This paper gives an O ( JN) step quantum mechanical algorithm for identifying that record.It is within a constant factor of the fastest possible quantum mechanical algorithm.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
19 No basis given · 8 Sources not found · 4 Own interpretation
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This paper gives an O ( JN) step quantum mechanical algorithm for identifying that record.”
§ A fast quantum mechanical algorithm for database search > Abstract
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- The authors state this as an assumption: There is a unique state that satisfies the condition C(S)=1.
- The authors state this as an assumption: For any state S, the condition C(S) can be evaluated in unit time.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Corollary 3.1-Let the state vector be as followsfor any one state the amplitude is k, for each of the remaining (N-1) states the amplitude is 1.Let k and 1 be real numbers (in general the amplitudes can be complex).Let k be negative and 1 be positive such that ~< ~N.Then after applying the diffusion transform both k and 1are positive numbers.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“First, it is proved that the system is a valid quantum mechanical system (theorems 1 & 2)”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
boosted- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“As mentioned in the introduction, the algorithm of this paper does not use any Imowledge about the problem.”
§ A fast quantum mechanical algorithm for database search > 114
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Theorem 1-The matix D is unitary.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The following sections prove that the system discussed in section 3 is indeed a valid quantum mechanical system and that it converges to the desired state with a probability O(l).”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- The authors state this as an assumption: There is a unique state that satisfies the condition C(S)=1.
- The authors state this as an assumption: For any state S, the condition C(S) can be evaluated in unit time.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Theorem 2 -D can be expressed as D = FRF, where F, the Fourier Transform Matrix and R, the rotation matrix are defined as follows”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Since the proba-& bility of the system being found in any particular state is proportional to the square of the amplitude, it follows that the probability of the system being in tlhe desired state when k is ~, 1 J2 is k2 = ~.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In case there is a unique state SV such that C(SV) = 1, the final state is SV with a probability of at least ~. 2”
§ A fast quantum mechanical algorithm for database search > T. Acknowledgments
plainconditional- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
- The authors state this as an assumption: There is a unique state that satisfies the condition C(S)=1.
- The authors state this as an assumption: For any state S, the condition C(S) can be evaluated in unit time.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“It can be easily modified to take care of the case when there are multiple states satisfying the condition C(S) = 1 and it is required to return one of these.”
§ A fast quantum mechanical algorithm for database search > 114
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Probably not a substantial claim. 8
- It may state two separate claims as one. 4
- The quote only partly states this claim. 1
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Theorem 5-Let the probability of a particular outcome in an experiment be &.Then if the experiment be repeated ~times, the probability that the outcome does not happen even once is less than or equal to e-K.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The change in k ( Ak) after steps (a) and (b) of the algorithm is lower bounded by Ak>~.Also after steps (a) and (b), 1>0.2fi”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Using this it immediately follows that there exists a number M less than EN, such that in M repetitions of the loop in step (ii), k wifl become ~.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The quote only partly states this claim.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The most efficient classical algorithm for this is to examine the items in the database one by one.”
§ A fast quantum mechanical algorithm for database search > ------------------------------------------------
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“Very recent results [Shor95] have shown the existence of quantum mechanical error corr~ting cod~which enable transmission of data even in the presence of noise”
§ A fast quantum mechanical algorithm for database search > 114
What the sources say
- Not matchedcites [Shor95]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
boosteddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This algorithm, by cleverly making use of some features of the structure of the problem, is the only known algorithm that solves the problem in O (logIV) steps.”
§ A fast quantum mechanical algorithm for database search > 114
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The phase does not have an analog in classical probabilistic algorithms.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This illustrates the point that, in quantum mechanics, the complete description of the system requires the amplitudes over all states, just the probabilities is not enough.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
In the paper
“For example Shor's primality testing algorithm [Shor94] for a number N can be viewed as a search of the (N-l) numbers smaller than N to see if any of them is a factor of N.”
§ A fast quantum mechanical algorithm for database search > 114
What the sources say
- Not matchedcites [Shor94]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
In the paper
“There is also a scheme discussed in [VV86] by which it is possible to modify any algorithm that solves an NPsearch problem with a unique solution and use it to solve an NP-search problem in general.”
§ A fast quantum mechanical algorithm for database search > 114
What the sources say
- Not matchedcites [VV86]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
hedgeddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
In the paper
“This operation is one of the things that makes quantum mechanical algorithms more powerful than classical algorithms and forms the basis for most significant quantum mechanical algorithms.”
§ A fast quantum mechanical algorithm for database search > T. Acknowledgments
What the sources say
- Not matchedcites [DJ92]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
- Not matched
The authors state this as an assumption.
There is a unique state that satisfies the condition C(S)=1.
“Let there be a unique state, say Sv, that satisfies the condition C(SV) = 1, whereas for all other states S, C(S) = 0”
“The algorithm as discussed here assumes a unique state that satisfies the desired condition.”
The authors state this as an assumption.
For any state S, the condition C(S) can be evaluated in unit time.
“(assume that for any state S, the condition C(S) can be evaluated in unit time)”
The paper relies on this without support.
There does not exist any sorting on the database that would aid selection of the desired item.
“However, there does not exist any sorting on the database that would aid its selection.”
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Symmetric cryptography remains comparatively resilient, yet Grover's algorithm offers a quadratic speed-up for brute-force key search, effectively halving the security margin of symmetric ciphers [13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Similarly, for hash functions, Grover's algorithm [185] can facilitate quantum birthday attack to find collision, thereby necessitating an output of larger size.”
From Zero Trust Architecture (ZTA): A Comprehensive Survey (2022) · cites this paper as [185]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Similarly, Grover’s algorithm concedes a quadratic advantage for mining blocks in certain consensus protocols such as proof of work.”
From Quantum-resistance in blockchain networks (2023) · cites this paper as [71]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Quantum computers will be able to find these nonces quadratically faster using Grover’s algorithm71.”
From Quantum-resistance in blockchain networks (2023) · cites this paper as [71]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“This model is realistic given the falling cost of storage, the rise of large-scale surveillance infrastructures, and the expected disruption of quantum algorithms such as Shor's and Grover's [1,2,13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measured
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Grover's algorithm provides only a quadratic speedup, effectively halving brute-force resistance. Comparable security margins can be restored by doubling key sizes (for example, AES-128 to AES-256) [13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“This explains why AES-256 maintains post-quantum security margins, whereas AES-128 requires upgrading to maintain equivalent protection levels [13,14].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“At the same time, Grover's algorithm shows that symmetric cryptography, though more resilient, also demands doubled key sizes to maintain equivalent margins [13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“In this sense, Grover-based optimization algorithms [184] such as Grover Adaptive Search [161] have been proposed.”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [184]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The former bound is tight since recent work of Grover [13] shows how to accept the class NP relative to any oracle on a quantum computer in time O (2 n/ 2 ).”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“In view of Grover's algorithm [13], we know that the constant '1 / 2' in the statement of Theorem 3.5 cannot be improved.”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The former bound is tight since recent work of Grover [13] shows how to accept the class NP relative to any oracle on a quantum computer in time O (2 n/ 2 ).”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“Grover’s algorithm [54] is a quantum algorithm for searching in a database, ofering quadratic speedup over classical searching methods.”
From QASMBench: A Low-Level Quantum Benchmark Suite for NISQ Evaluation and Simulation (2023) · cites this paper as [54]
The cited source says what the claim attributes to it.
In the citing paper
“However, quantum machines can recognize this language quadratically faster, in time O ( √ 2 n ), using Grover's algorithm [13].”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
The cited source says what the claim attributes to it.
In the citing paper
“That this was a real possibility is clear from Grover's [13] result, which gives a black-box approach to solving NP -complete problems in square-root as much time as is required classically.”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
The cited source says what the claim attributes to it.
In the citing paper
“Various strategies can be imagined, but a good one (called 'inversion about the average' by Grover [13]) is to perform an oracle-independent unitary transformation so as to change the phase difference into an amplitude difference, leaving the y term with the same sign as all the other terms but a magnitude approximately threefold larger.”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“The HNDL adversary departs from conventional cryptanalysis in its temporal asymmetry. Instead of attempting immediate decryption, the attacker passively collects encrypted traffic or stored archives and defers decryption until sufficient computational resources become available.”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredIn the citing paper
“This algorithm uses a single function evaluation to label the single state which satisfies the function, followed by a series of gates which drive the system into this particular state.”
From Implementation of a quantum search algorithm on a quantum computer (1998) · cites this paper as [9]
In the citing paper
“Here we show how such a computer can be used to implement a fast quantum search algorithm initially developed by Grover. 9, 10”
From Implementation of a quantum search algorithm on a quantum computer (1998) · cites this paper as [9]
In the citing paper
“Among other applications Grover's algorithms enable an extremely rapid search over the domain of a binary function to find elements for which this function is satisfied (that is, the function has the value 1).”
From Implementation of a quantum search algorithm on a quantum computer (1998) · cites this paper as [9]
In the citing paper
“the ability to efficiently perform Hamiltonian simulation is used in conjunction with another technique known as the quantum phase estimation algorithm (QPEA) 42 for efficiently obtaining the eigen-energies and eigenstates of a quantum system 38 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
In the citing paper
“The Quantum Phase Estimation (QPE) algorithm 38,99 is the natural translation of the FCI procedure to quantum computers 45 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
In the citing paper
“Abrams and Lloyd 38 focused on state preparation in more detail and described concrete initialization procedures.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
In the citing paper
“They pointed out that state preparation is conceptually easier in second quantization, where a Fock state is represented by a simple product state of qubits in {| 0 〉 , | 1 〉} states.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
Citations
Cites
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Scheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
Rapid solution of problems by quantum computation
Deutsch, D., & Jozsa, R. (1992) · Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences · doi:10.1098/rspa.1992.0167 · Cited by 2,700
The Emperor's New Mind: Concerning Computers, Minds, and The Laws of Physics
Penrose, R., & Gardner, M. (1989) · doi:10.1093/oso/9780198519737.001.0001 · Cited by 2,007
Strengths and Weaknesses of Quantum Computing
Bennett, C. H., Bernstein, E., Brassard, G., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300933 · Cited by 1,470
On the Power of Quantum Computation
Simon, D. R. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796298637 · Cited by 1,295
Bernstein, E., & Vazirani, U. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167097 · Cited by 1,284
Benioff, P. (1980) · Journal of Statistical Physics · doi:10.1007/bf01011339 · Cited by 1,244
The Emperor's New Mind: Concerning Computers, Minds, and the Laws of Physics
Penrose, R., & Landauer, R. (1990) · Physics Today · doi:10.1063/1.2810599 · Cited by 1,110
Research works printed but not linked: 2
- [9]9. R. Penrose, Shadows of the mind,. Oxford University Press, 1994, pp. 348- 388.
- [14]14. Yao93J A. Yao, Quantum circuit complexip, Proceedings 34th Annual Symposium on Foundations of Computer Science (FOCS), 1993, pp. 352-361.
Cited by
Sorted by citations
Items 5,701–5,800 of 8,792
(2014) · Elsevier eBooks · doi:10.1016/b978-0-12-800953-6.00020-7 · Cited by 2
Pitchai, A. (2022) · doi:10.1002/9781119813439.ch3 · Cited by 2
Bitcoin Revisited: Formalization, Benchmarking, and Open Security IssuesPreprint
Baniata, H., & Kertész, A. (2022) · doi:10.36227/techrxiv.20496492 · Cited by 2
Variational Quantum Algorithms for Computational Fluid DynamicsPreprint
Jaksch, D., Givi, P., Daley, A. J., & Rung, T. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2209.04915 · Cited by 2
Quantum Computing in Operations ResearchPreprint
Creemers, S., & Armas, L. F. P. (2022) · SSRN Electronic Journal · doi:10.2139/ssrn.4198077 · Cited by 2
Tripartite entanglement and matrix inversion quantum algorithmPreprint
Hwang, M.-R., Kim, M., Jung, E., Woo, C.-Y., & Park, D. (2022) · Research Square · doi:10.21203/rs.3.rs-2287755/v1 · Cited by 2
Kumar, A., Kwatra, P., & Garhwal, S. (2022) · Research Square · doi:10.21203/rs.3.rs-2250025/v1 · Cited by 2
An introduction to variational quantum algorithms for combinatorial optimization problemsPreprint
Grange, C., Poss, M., & Bourreau, E. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2212.11734 · Cited by 2
Towards provably efficient quantum algorithms for large-scale machine-learning modelsPreprint
Liu, J., Liu, M., Liu, J.-P., Ye, Z., Wang, Y., Alexeev, Y., Eisert, J., & Jiang, L. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2303.03428 · Cited by 2
A Primer to Underwater Quantum Key DistributionPreprint
Paglierani, P., Raouf, A. H. F., Pelekanakis, K., Petroccia, R., Alves, J., & Uysal, M. (2023) · doi:10.36227/techrxiv.22299160 · Cited by 2
Quantum Control Machine: The Limits of Control Flow in Quantum ProgrammingPreprint
Yuan, C., Villanyi, A., & Carbin, M. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2304.15000 · Cited by 2
Fauzia, S. (2023) · doi:10.1002/9781119905172.ch14 · Cited by 2
Quantum Computing: A Bubble Ready to Burst or a Looming Breakthrough?Preprint
Bruno, G. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4462929 · Cited by 2
A Primer to Underwater Quantum Key DistributionPreprint
Paglierani, P., Raouf, A. H. F., Pelekanakis, K., et al. (2023) · doi:10.36227/techrxiv.22299160.v2 · Cited by 2
Quantum implementaion of SM4 block cipher with less qubitsPreprint
Luo, Q.-B., Li, Q., Li, X., Yang, G., Shen, J., & Zheng, M. (2023) · Research Square · doi:10.21203/rs.3.rs-3105531/v1 · Cited by 2
Quantum Algorithm for Estimating Largest EigenvaluesPreprint
Vu, N. A. N. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4499001 · Cited by 2
Quantum IPMs for Linear Optimization
Mohammadisiahroudi, M., & Tamás Terlaky, B. (2023) · Encyclopedia of Optimization · doi:10.1007/978-3-030-54621-2_851-1 · Cited by 2
Post‐Quantum Symmetric Cryptography
Naya‐Plasencia, M. (2023) · doi:10.1002/9781394256327.ch17 · Cited by 2
Li, C., & Bart Preneel, A. (2023) · doi:10.1002/9781394256358.ch2 · Cited by 2
Insights into Quantum Support Vector MachinePreprint
Jammalamadaka, S., & Cherukuri, A. K. (2024) · Research Square · doi:10.21203/rs.3.rs-4465421/v1 · Cited by 2
Quantum-Enhanced Blockchain and Digital Twin Integration for Enhanced Healthcare Data SecurityPreprint
Bose, R., Sutradhar, S., & Roy, S. (2024) · Research Square · doi:10.21203/rs.3.rs-4707183/v1 · Cited by 2
Advancements in Quantum Algorithms for Solving Complex Optimization ProblemsPreprint
Adediran, E., Fatoki, I., & Ogunyinka, T. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.5015789 · Cited by 2
de Sousa, U. G. (2025) · Preprints.org · doi:10.20944/preprints202504.1523.v1 · Cited by 1
Pineda, V. G., Valencia-Arías, A., Giraldo, F. E. L., & Ochoa, E. A. Z. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5227456 · Cited by 2
Layout-Aware Quantum Circuitry and Algorithmic Extensions to Grover's Algorithm
Al-Bayaty, A. (2025) · doi:10.15760/etd.3924 · Cited by 2
Quantum Blockchain Survey: Foundations, Trends, and GapsPreprint
Ghosh, S. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5380355 · Cited by 5
Collision Finding with Many Classical or Quantum Processors
Jeffery, S. (2011) · Data Archiving and Networked Services (DANS) · Cited by 2
Post-quantum XML and SAML Single Sign-On
Müller, J., & Oupický, J. (2024) · Proceedings on Privacy Enhancing Technologies · doi:10.56553/popets-2024-0128 · Cited by 2
Constructing a ball of separable and absolutely separable states for $$2\otimes d$$ quantum system
Adhikari, S. (2021) · The European Physical Journal D · doi:10.1140/epjd/s10053-021-00103-w · Cited by 1
Efficient Construction of Functional Representations for Quantum Algorithms
Burgholzer, L., Raymond, R., Sengupta, I., et al. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-79837-6_14 · Cited by 1
Weakly measured while loops: peeking at quantum states
Andrés-Martínez, P., & Heunen, C. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac47f1 · Cited by 1
Improving Quantum Annealing Performance on Embedded Problems
(2020) · Supercomputing Frontiers and Innovations · doi:10.14529/jsfi200403 · Cited by 6
Mukhopadhyay, P. (2021) · Journal of Physics Communications · doi:10.1088/2399-6528/ac3a43 · Cited by 6
Albouy, O. (2009) · HAL (Le Centre pour la Communication Scientifique Directe) · doi:10.70675/abf9b50cz0b4ez4a40za271z6c0bcb789507 · Cited by 1
Apte, S. (2016) · International Journal of Pharmaceutical Excipients · doi:10.66617/001c.939 · Cited by 1
TIGHT QUANTUM BOUNDS FOR COMPUTATIONAL GEOMETRY PROBLEMS
VOLPATO, N., & MOURA, A. (2009) · International Journal of Quantum Information · doi:10.1142/s0219749909005572 · Cited by 1
Quantum Information Technology and Quantum Sensory Systems Development
Kervalishvili, P. J. (2015) · Journal of Internet Technology and Secured Transaction · doi:10.20533/jitst.2046.3723.2015.0055 · Cited by 1
Grover’s Algorithm for Unstructured Search
Marquezino, F. D. L., Portugal, R., & Lavor, C. (2019) · SpringerBriefs in computer science · doi:10.1007/978-3-030-19066-8_3 · Cited by 1
A Quantum Cellular Automata Type Architecture with Quantum Teleportation for Quantum Computing
Ntalaperas, D., Giannakis, K., & Konofaos, N. (2019) · Entropy · doi:10.3390/e21121235 · Cited by 1
How does adiabatic quantum computation fit into quantum automata theory?
Yamakami, T. (2021) · Information and Computation · doi:10.1016/j.ic.2021.104694 · Cited by 1
ASM Specification and Refinement of a Quantum Algorithm
Ferrarotti, F. A., & González, S. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-76020-5_8 · Cited by 1
DeCSIDH: Delegating Isogeny Computations in the CSIDH Setting
Pedersen, R. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92518-5_16 · Cited by 1
Post-Quantum Cryptographic Hardware and Embedded Systems
Koziel, B., Kermani, M. M., & Azarderakhsh, R. (2020) · Springer eBooks · doi:10.1007/978-3-030-64448-2_9 · Cited by 1
On Relaxation of Simon's Algorithm
Khosravi, A., & Eghlidos, T. (2021) · International ISC Conference on Information Security and Cryptology (ISCISC) · doi:10.1109/iscisc53448.2021.9720441 · Cited by 1
Comparison Experimental Analysis of Different Cryptocurrencies
Fu, D., Hu, H., Xu, Y., & Zheng, K. (2022) · International Conference on Big Data, Information and Computer Network (BDICN) · doi:10.1109/bdicn55575.2022.00070 · Cited by 1
Size-efficient sparse population for strictly structured quantum genetic algorithm
Kim, J. S., & Ahn, C. W. (2022) · Future Generation Computer Systems · doi:10.1016/j.future.2022.04.030 · Cited by 1
Classifying Mechanical Vibrations using Artificial Neural Networks and Quantum Angle Encoding
Simion, M. N. B., Selișteanu, D., & Șendrescu, D. (2022) · International Carpathian Control Conference · doi:10.1109/iccc54292.2022.9805920 · Cited by 1
Whitaker, T. (2022) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3520304.3533961 · Cited by 3
Compact Genetic Algorithm with Quantum-Assisted Feasibility Enforcement
Suksen, K., Benchasattabuse, N., & Chongstitvatana, P. (2022) · ECTI Transactions on Computer and Information Technology (ECTI-CIT) · doi:10.37936/ecti-cit.2022164.247821 · Cited by 1
Reducing Iterations of Grover Search Algorithm for N-Queen Problem U sing Quantum Permutation States
Ha, J., & Heo, J. (2022) · International Conference on Information and Communication Technology Convergence (ICTC) · doi:10.1109/ictc55196.2022.9952402 · Cited by 1
Quantum advantage in deciding NP-complete problems
Nagy, M., & Nagy, N. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03889-3 · Cited by 1
Quantum Image Information Hiding Based on Genetic Algorithm
Peng, P., Gu, W., Min, J., et al. (2022) · International Conference on Applied Machine Learning (ICAML) · doi:10.1109/icaml57167.2022.00011 · Cited by 1
A Practical Approach to Quantum Resilient Cloud Usage Obtaining Data Privacy
Töbke, L., Grote, O., & Ahrens, A. (2023) · International Interdisciplinary PhD Workshop (IIPhDW) · doi:10.1109/iiphdw54739.2023.10124397 · Cited by 1
Robust quantum circuit for clique problem with intermediate qudits
Sanyal, A., Saha, A., Saha, B., & Chakrabarti, A. (2023) · Nano Communication Networks · doi:10.1016/j.nancom.2023.100466 · Cited by 1
Möller, M. (2023) · Computational methods in applied sciences · doi:10.1007/978-3-031-29082-4_21 · Cited by 1
Synthesis of Hidden Subgroup Quantum Algorithms and Quantum Chemical Dynamics
Iyengar, S. S., Kumar, A., Saha, D., & Sabry, A. (2023) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.3c00404 · Cited by 1
XOR Chain and Perfect Secrecy at the Dawn of the Quantum Era
Lizama-Pérez, L. A. (2023) · Cryptography · doi:10.3390/cryptography7040050 · Cited by 4
Searching for an Efficient System of Equations Defining the AES Sbox for the QUBO Problem
Burek, E., Mańk, K., & Wroński, M. (2023) · Journal of Telecommunications and Information Technology · doi:10.26636/jtit.2023.4.1340 · Cited by 1
García, D. P., Cruz-Benito, J., & García‐Peñalvo, F. J. (2024) · Communications in computer and information science · doi:10.1007/978-3-031-48981-5_19 · Cited by 1
Wang, X., Liu, G., & Zhang, L. (2023) · IEEE International Conference on Bioinformatics and Biomedicine (BIBM) · doi:10.1109/bibm58861.2023.10385997 · Cited by 1
Variational learning algorithms for quantum query complexity
Wu, Z., Hou, S., Zhang, C., Li, L., & Zeng, B. (2024) · New Journal of Physics · doi:10.1088/1367-2630/ad309c · Cited by 4
Efficient Quantum-Safe Distributed PRF and Applications: Playing DiSE in a Quantum World
Sinha, S., Patranabis, S., & Mukhopadhyay, D. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-54773-7_3 · Cited by 1
Hull, I., Sattath, O., Diamanti, E., & Wendin, G. P. (2024) · Contributions to economics · doi:10.1007/978-3-031-50780-9_3 · Cited by 1
Ivchenko, E., Chernov, A., Khmelev, A. V., et al. (2023) · Russian Microelectronics · doi:10.1134/s1063739723600164 · Cited by 1
A New Hybrid Algorithm for Multivariate Polynomial System Solving
Roy, D. (2024) · SN Computer Science · doi:10.1007/s42979-024-02645-3 · Cited by 1
Utilizing quantum processor for the analysis of strongly correlated materials
Li, H., Yang, Y., Lv, P., Qu, J., Wang, ., Sun, J. P., & Ying, S. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad770b · Cited by 1
Stengl, M. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04347-4 · Cited by 1
Cybersecurity in the Context of Fail-Operational Systems
Schmidt, K., Dannebaum, U., Schneider, R., et al. (2024) · SAE technical papers on CD-ROM/SAE technical paper series · doi:10.4271/2024-01-2808 · Cited by 1
Robust Quantum Algorithms for Early Fault-Tolerant Quantum Computing
Kshirsagar, R. (2024) · IntechOpen eBooks · doi:10.5772/intechopen.1004416 · Cited by 3
Quantum Matching Algorithm for Biometric Fingerprints
Mogos, G. (2024) · International Conference on Machine Learning and Soft Computing (ICMLSC) · doi:10.1145/3647750.3647780 · Cited by 1
Optimized General Uniform Quantum State Preparation
Levin, M. A. (2024) · Journal of quantum computing · doi:10.32604/jqc.2024.047423 · Cited by 1
Range‐separated density functional theory using multiresolution analysis and quantum computing
Poirier, N. A., Kottmann, J. S., Aspuru‐Guzik, A., Mongeau, L., & Najafi-Yazdi, A. (2024) · Journal of Computational Chemistry · doi:10.1002/jcc.27384 · Cited by 1
Liu, Y. (2024) · American Journal of Computational Mathematics · doi:10.4236/ajcm.2024.142005 · Cited by 1
Evaluación de la mantenibilidad de los sistemas híbridos (clásico-cuánticos)
Muñoz, A. D., Rodríguez, M., Cruz-Lemus, J. A., et al. (2024) · doi:10.5753/cibse.2024.28461 · Cited by 1
Assessment of Cryptographic Approaches for Quantum-Resistant Galileo OSNMA
Junquera-Sánchez, J., Hernando, C., Gamallo-Palomares, Ó., et al. (2024) · NAVIGATION Journal of the Institute of Navigation · doi:10.33012/navi.648 · Cited by 1
Quantum computing in anthropological research: An interdisciplinary approach
Throapologius, A. (2024) · Information System and Smart City · doi:10.59400/issc.v4i1.1383 · Cited by 1
A Case for Elastic Quantum Error Correction Decoders
Maurya, S., Molavi, A., Albarghouthi, A., & Tannu, S. (2026) · European Conference on Computer Systems · doi:10.1145/3767295.3803584 · Cited by 1
Quantum Algorithms for the Multiplication of Circulant Matrices and Vectors
Hou, L., Huang, Z., & Lv, C. (2024) · Information · doi:10.3390/info15080453 · Cited by 1
Self-protected quantum simulation and quantum-phase estimation in the presence of classical noise
Wu, L.-A. (2024) · Academia quantum. · doi:10.20935/acadquant7312 · Cited by 1
Quantum Implementation and Analysis of ARIA
Oh, Y., Jang, K., Yang, Y., & Seo, H. (2024) · Silicon Valley Cybersecurity Conference · doi:10.1109/svcc61185.2024.10637311 · Cited by 1
Quantum Many-Body Problems: Quantum Machine Learning Applications
Medisetty, P., Vulavalapudi, V. M. S., Evuru, P. C., Mahmud, M., & Prakash, K. B. (2024) · Lecture notes in networks and systems · doi:10.1007/978-3-031-61929-8_12 · Cited by 1
Two-dimensional quantum central limit theorem by quantum walks
Asahara, K., Funakawa, D., Seki, M., & Suzuki, A. (2026) · Physical Review A · doi:10.1103/fs8d-h2z8 · Cited by 1
Quantum Tensor DBMS and Quantum Gantt Charts: Towards Exponentially Faster Earth Data Engineering
Zalipynis, R. A. R. (2024) · Earth · doi:10.3390/earth5030027 · Cited by 1
Phase Coordinate Uncomputation in Quantum Recursive Fourier Sampling
Hindlycke, C., Johansson, N., & Larsson, J.-Å. (2025) · Entropy · doi:10.3390/e27060596 · Cited by 1
Classification and transformations of quantum circuit decompositions for permutation operations
Khandelwal, A., Kurniawan, H., Aangiras, S., Salehi, Ö., & Glos, A. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04508-5 · Cited by 1
Introducing UNIQuE: The Unconventional Noiseless Intermediate Quantum Emulator
Robertson, R., & Ventura, D. A. (2025) · IEEE International Conference on Collaborative Advances in Software and Computing (CASCON) · doi:10.1109/cascon66301.2025.00086 · Cited by 1
Cyber-Security of IoT in Post-Quantum World
Acharya, K. V., Gandhi, S., & Dalal, P. D. (2024) · Advances in information security, privacy, and ethics book series · doi:10.4018/979-8-3693-5961-7.ch013 · Cited by 2
Analysis and contributions to an open source Kyber library in Rust
Medina, F., Molteni, M. C., Scala, A. J. D., et al. (2024) · Proceedings - IEEE Symposium on Computers and Communications/IEEE Symposium on Computers and Communications · doi:10.1109/iscc61673.2024.10733712 · Cited by 1
Quantum linear system algorithm with optimal queries to initial state preparation
Low, G. H., & Su, Y. (2026) · Quantum · doi:10.22331/q-2026-03-23-2041 · Cited by 37
Quantum computing for partial differential equations in practice
Neumann, N. M. P., Verbree, J., & Hoek, C. R. (2024) · SPIE Quantum Technologies for Defence and Security · doi:10.1117/12.3033212 · Cited by 1
CONVERGENCE RATE OF ALGORITHM FOR SOLVING LINEAR EQUATIONS BY QUANTUM ANNEALING
Tikhomirov, S. B., & Shalgin, V. S. (2024) · Журнал вычислительной математики и математической физики · doi:10.31857/s0044466924050061 · Cited by 1
Quantum Key Distribution in Securing Next-Generation Cyber-Physical Systems
Babu, B. S., Sandhya, S., & Subramanya, K. (2024) · Advances in information security, privacy, and ethics book series · doi:10.4018/979-8-3693-9220-1.ch008 · Cited by 1
Quantum Guard: Pioneering Quantum-Based Malware Defense for IoT Devices
Khan, M. A., Aman, M. N., & Sikdar, B. (2024) · IEEE Conference on Dependable and Secure Computing (DSC) · doi:10.1109/dsc63325.2024.00032 · Cited by 1
Bakharev, A. O. (2024) · Journal of Applied and Industrial Mathematics · doi:10.1134/s1990478924030037 · Cited by 1
It’s Quick to be Square: Fast Quadratisation for Quantum Toolchains
Schmidbauer, L., Lobe, E., Schaefer, I., & Mauerer, W. (2026) · ACM Transactions on Quantum Computing · doi:10.1145/3800943 · Cited by 2
Quantum computing algorithms for inverse problems on graphs and an NP-complete inverse problem
Ilmavirta, J., Lassas, M. J., Lu, J., Oksanen, L., & Ylinen, L. (2024) · Inverse Problems and Imaging · doi:10.3934/ipi.2024049 · Cited by 1
Nisha, N., Sharma, V. K., Saharan, S., Joshi, S. K., & Wani, N. A. (2024) · Advances in marketing, customer relationship management, and e-services book series · doi:10.4018/979-8-3693-7673-7.ch016 · Cited by 1
Full Key Extraction of SNOW-V Using ML-Assisted Power SCA
Saurabh, H., Kundu, S., Titti, S. S., et al. (2024) · IEEE Design and Test · doi:10.1109/mdat.2024.3518455 · Cited by 1
Post Quantum Lightweight OWF Candidates
Cyprys, P., Dolev, S., & Margalit, O. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-76934-4_23 · Cited by 1
Metadata
- Authors
- Grover, L. K.
- Affiliations
- AT&T (United States) (US)
- Corresponding author
- Grover, Lov K.
- Venue
- Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96
- Publisher
- ACM Press
- Published
- 1996
- Pages
- 212-219
- OpenAlex
- W2084652510
- Semantic Scholar
- 298d799da82395a64a3bda38ef9d2a4646828ccb
- Cited by
- 8,830
- References
- 24
- Citations by year
- 2026: 664 · 2025: 1066 · 2024: 896 · 2023: 841 · 2022: 674 · 2021: 655 · 2020: 529 · 2019: 423 · 2018: 288 · 2017: 283 · 2016: 219 · 2015: 221 · 2014: 184 · 2013: 161 · 2012: 158
- FWCI
- 36.24
- Type
- conference paper
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- ACM Symposium on Theory of Computing (STOC) (publishedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- quantum search, unsorted database search, Grover's algorithm, quantum algorithms, time complexity, quantum parallelism, lower bounds
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
A language model drew the claims from the paper on 2026-10-21, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-21 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
