The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index; none of the 8 sources its claims cite is checked for support yet.
A fast quantum mechanical algorithm for database search
Open accessAbstract
An unsorted database contains N records, of which just one satisfies a particular property.The problem is to identify that one record.Any classical algorithm, deterministic or probabilistic, will clearly take O (N) steps since on the average it will have to examine a large fraction of the N records.Quantum mechanical systems can do several operations simultaneously due to their wave like properties.This paper gives an O ( JN) step quantum mechanical algorithm for identifying that record.It is within a constant factor of the fastest possible quantum mechanical algorithm.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
19 No basis given · 8 Sources not found · 4 Own interpretation
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This paper gives an O ( JN) step quantum mechanical algorithm for identifying that record.”
§ A fast quantum mechanical algorithm for database search > Abstract
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- The authors state this as an assumption: There is a unique state that satisfies the condition C(S)=1.
- The authors state this as an assumption: For any state S, the condition C(S) can be evaluated in unit time.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Corollary 3.1-Let the state vector be as followsfor any one state the amplitude is k, for each of the remaining (N-1) states the amplitude is 1.Let k and 1 be real numbers (in general the amplitudes can be complex).Let k be negative and 1 be positive such that ~< ~N.Then after applying the diffusion transform both k and 1are positive numbers.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“First, it is proved that the system is a valid quantum mechanical system (theorems 1 & 2)”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
boosted- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“As mentioned in the introduction, the algorithm of this paper does not use any Imowledge about the problem.”
§ A fast quantum mechanical algorithm for database search > 114
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Theorem 1-The matix D is unitary.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The following sections prove that the system discussed in section 3 is indeed a valid quantum mechanical system and that it converges to the desired state with a probability O(l).”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- The authors state this as an assumption: There is a unique state that satisfies the condition C(S)=1.
- The authors state this as an assumption: For any state S, the condition C(S) can be evaluated in unit time.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Theorem 2 -D can be expressed as D = FRF, where F, the Fourier Transform Matrix and R, the rotation matrix are defined as follows”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Since the proba-& bility of the system being found in any particular state is proportional to the square of the amplitude, it follows that the probability of the system being in tlhe desired state when k is ~, 1 J2 is k2 = ~.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In case there is a unique state SV such that C(SV) = 1, the final state is SV with a probability of at least ~. 2”
§ A fast quantum mechanical algorithm for database search > T. Acknowledgments
plainconditional- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
- The authors state this as an assumption: There is a unique state that satisfies the condition C(S)=1.
- The authors state this as an assumption: For any state S, the condition C(S) can be evaluated in unit time.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“It can be easily modified to take care of the case when there are multiple states satisfying the condition C(S) = 1 and it is required to return one of these.”
§ A fast quantum mechanical algorithm for database search > 114
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Probably not a substantial claim. 8
- It may state two separate claims as one. 4
- The quote only partly states this claim. 1
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Theorem 5-Let the probability of a particular outcome in an experiment be &.Then if the experiment be repeated ~times, the probability that the outcome does not happen even once is less than or equal to e-K.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The change in k ( Ak) after steps (a) and (b) of the algorithm is lower bounded by Ak>~.Also after steps (a) and (b), 1>0.2fi”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Using this it immediately follows that there exists a number M less than EN, such that in M repetitions of the loop in step (ii), k wifl become ~.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The quote only partly states this claim.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The most efficient classical algorithm for this is to examine the items in the database one by one.”
§ A fast quantum mechanical algorithm for database search > ------------------------------------------------
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“Very recent results [Shor95] have shown the existence of quantum mechanical error corr~ting cod~which enable transmission of data even in the presence of noise”
§ A fast quantum mechanical algorithm for database search > 114
What the sources say
- Not matchedcites [Shor95]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
boosteddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This algorithm, by cleverly making use of some features of the structure of the problem, is the only known algorithm that solves the problem in O (logIV) steps.”
§ A fast quantum mechanical algorithm for database search > 114
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The phase does not have an analog in classical probabilistic algorithms.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This illustrates the point that, in quantum mechanics, the complete description of the system requires the amplitudes over all states, just the probabilities is not enough.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
In the paper
“For example Shor's primality testing algorithm [Shor94] for a number N can be viewed as a search of the (N-l) numbers smaller than N to see if any of them is a factor of N.”
§ A fast quantum mechanical algorithm for database search > 114
What the sources say
- Not matchedcites [Shor94]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
In the paper
“There is also a scheme discussed in [VV86] by which it is possible to modify any algorithm that solves an NPsearch problem with a unique solution and use it to solve an NP-search problem in general.”
§ A fast quantum mechanical algorithm for database search > 114
What the sources say
- Not matchedcites [VV86]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
hedgeddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
In the paper
“This operation is one of the things that makes quantum mechanical algorithms more powerful than classical algorithms and forms the basis for most significant quantum mechanical algorithms.”
§ A fast quantum mechanical algorithm for database search > T. Acknowledgments
What the sources say
- Not matchedcites [DJ92]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
- Not matched
The authors state this as an assumption.
There is a unique state that satisfies the condition C(S)=1.
“Let there be a unique state, say Sv, that satisfies the condition C(SV) = 1, whereas for all other states S, C(S) = 0”
“The algorithm as discussed here assumes a unique state that satisfies the desired condition.”
The authors state this as an assumption.
For any state S, the condition C(S) can be evaluated in unit time.
“(assume that for any state S, the condition C(S) can be evaluated in unit time)”
The paper relies on this without support.
There does not exist any sorting on the database that would aid selection of the desired item.
“However, there does not exist any sorting on the database that would aid its selection.”
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Symmetric cryptography remains comparatively resilient, yet Grover's algorithm offers a quadratic speed-up for brute-force key search, effectively halving the security margin of symmetric ciphers [13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Similarly, for hash functions, Grover's algorithm [185] can facilitate quantum birthday attack to find collision, thereby necessitating an output of larger size.”
From Zero Trust Architecture (ZTA): A Comprehensive Survey (2022) · cites this paper as [185]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Similarly, Grover’s algorithm concedes a quadratic advantage for mining blocks in certain consensus protocols such as proof of work.”
From Quantum-resistance in blockchain networks (2023) · cites this paper as [71]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Quantum computers will be able to find these nonces quadratically faster using Grover’s algorithm71.”
From Quantum-resistance in blockchain networks (2023) · cites this paper as [71]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“This model is realistic given the falling cost of storage, the rise of large-scale surveillance infrastructures, and the expected disruption of quantum algorithms such as Shor's and Grover's [1,2,13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measured
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Grover's algorithm provides only a quadratic speedup, effectively halving brute-force resistance. Comparable security margins can be restored by doubling key sizes (for example, AES-128 to AES-256) [13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“This explains why AES-256 maintains post-quantum security margins, whereas AES-128 requires upgrading to maintain equivalent protection levels [13,14].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“At the same time, Grover's algorithm shows that symmetric cryptography, though more resilient, also demands doubled key sizes to maintain equivalent margins [13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“In this sense, Grover-based optimization algorithms [184] such as Grover Adaptive Search [161] have been proposed.”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [184]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The former bound is tight since recent work of Grover [13] shows how to accept the class NP relative to any oracle on a quantum computer in time O (2 n/ 2 ).”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“In view of Grover's algorithm [13], we know that the constant '1 / 2' in the statement of Theorem 3.5 cannot be improved.”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The former bound is tight since recent work of Grover [13] shows how to accept the class NP relative to any oracle on a quantum computer in time O (2 n/ 2 ).”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“Grover’s algorithm [54] is a quantum algorithm for searching in a database, ofering quadratic speedup over classical searching methods.”
From QASMBench: A Low-Level Quantum Benchmark Suite for NISQ Evaluation and Simulation (2023) · cites this paper as [54]
The cited source says what the claim attributes to it.
In the citing paper
“However, quantum machines can recognize this language quadratically faster, in time O ( √ 2 n ), using Grover's algorithm [13].”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
The cited source says what the claim attributes to it.
In the citing paper
“That this was a real possibility is clear from Grover's [13] result, which gives a black-box approach to solving NP -complete problems in square-root as much time as is required classically.”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
The cited source says what the claim attributes to it.
In the citing paper
“Various strategies can be imagined, but a good one (called 'inversion about the average' by Grover [13]) is to perform an oracle-independent unitary transformation so as to change the phase difference into an amplitude difference, leaving the y term with the same sign as all the other terms but a magnitude approximately threefold larger.”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“The HNDL adversary departs from conventional cryptanalysis in its temporal asymmetry. Instead of attempting immediate decryption, the attacker passively collects encrypted traffic or stored archives and defers decryption until sufficient computational resources become available.”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredIn the citing paper
“This algorithm uses a single function evaluation to label the single state which satisfies the function, followed by a series of gates which drive the system into this particular state.”
From Implementation of a quantum search algorithm on a quantum computer (1998) · cites this paper as [9]
In the citing paper
“Here we show how such a computer can be used to implement a fast quantum search algorithm initially developed by Grover. 9, 10”
From Implementation of a quantum search algorithm on a quantum computer (1998) · cites this paper as [9]
In the citing paper
“Among other applications Grover's algorithms enable an extremely rapid search over the domain of a binary function to find elements for which this function is satisfied (that is, the function has the value 1).”
From Implementation of a quantum search algorithm on a quantum computer (1998) · cites this paper as [9]
In the citing paper
“the ability to efficiently perform Hamiltonian simulation is used in conjunction with another technique known as the quantum phase estimation algorithm (QPEA) 42 for efficiently obtaining the eigen-energies and eigenstates of a quantum system 38 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
In the citing paper
“The Quantum Phase Estimation (QPE) algorithm 38,99 is the natural translation of the FCI procedure to quantum computers 45 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
In the citing paper
“Abrams and Lloyd 38 focused on state preparation in more detail and described concrete initialization procedures.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
In the citing paper
“They pointed out that state preparation is conceptually easier in second quantization, where a Fock state is represented by a simple product state of qubits in {| 0 〉 , | 1 〉} states.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
Citations
Cites
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Scheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
Rapid solution of problems by quantum computation
Deutsch, D., & Jozsa, R. (1992) · Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences · doi:10.1098/rspa.1992.0167 · Cited by 2,700
The Emperor's New Mind: Concerning Computers, Minds, and The Laws of Physics
Penrose, R., & Gardner, M. (1989) · doi:10.1093/oso/9780198519737.001.0001 · Cited by 2,007
Strengths and Weaknesses of Quantum Computing
Bennett, C. H., Bernstein, E., Brassard, G., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300933 · Cited by 1,470
On the Power of Quantum Computation
Simon, D. R. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796298637 · Cited by 1,295
Bernstein, E., & Vazirani, U. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167097 · Cited by 1,284
Benioff, P. (1980) · Journal of Statistical Physics · doi:10.1007/bf01011339 · Cited by 1,244
The Emperor's New Mind: Concerning Computers, Minds, and the Laws of Physics
Penrose, R., & Landauer, R. (1990) · Physics Today · doi:10.1063/1.2810599 · Cited by 1,110
Research works printed but not linked: 2
- [9]9. R. Penrose, Shadows of the mind,. Oxford University Press, 1994, pp. 348- 388.
- [14]14. Yao93J A. Yao, Quantum circuit complexip, Proceedings 34th Annual Symposium on Foundations of Computer Science (FOCS), 1993, pp. 352-361.
Cited by
Sorted by citations
Items 6,601–6,700 of 8,792
Methodologies for Quantum Circuit and Algorithm Design at Low and High Levels
Tsai, E. (2022) · doi:10.15760/etd.7927 · Cited by 1
New and improved zero-knowledge argument systems for code-based cryptography
Tang, K. H. (2022) · doi:10.32657/10356/160385 · Cited by 1
Variational quantum iterative power algorithms for global optimizationPreprint
Kyaw, T. H., Soley, M. B., Allen, B., Bergold, P., Sun, C., Batista, V. S., & Aspuru‐Guzik, A. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2208.10470 · Cited by 1
Iterative Qubits Management for Quantum SearchPreprint
Mu, W. (2022) · Preprints.org · doi:10.20944/preprints202209.0358.v1 · Cited by 1
Quantum Algorithms for Matrix Multiplication and Product Verification
Kothari, R., & Nayak, A. (2015) · Springer eBooks · doi:10.1007/978-3-642-27848-8_303-2 · Cited by 2
Quantum Cryptography a Real Threat to Classical Blockchain: Requirements and ChallengesPreprint
Khan, W. Z., Arshad, Q., Raza, M., & Imran, M. A. (2022) · doi:10.36227/techrxiv.21341817.v1 · Cited by 1
When a Quantum Scientist Interviews ChatGPTPreprint
Topaloglu, R. O. (2023) · doi:10.36227/techrxiv.21982619 · Cited by 1
Scalable Addressing Circuits for a Surface Code Silicon-based Quantum ComputerPreprint
Absar, R., Merino, Z. D., Elgabra, H., Chen, X., Baugh, J., & Wei, L. (2023) · doi:10.36227/techrxiv.22685098.v1 · Cited by 1
Revolutionizing Computing: A Comprehensive Introduction to Quantum ComputingPreprint
Jerbi, D. (2023) · doi:10.36227/techrxiv.22710361 · Cited by 1
Realization of Multi-Valued Logic Using Optical Quantum Computing
Choe, S. (2023) · PDXScholar (Portland State University) · doi:10.15760/etd.8192 · Cited by 1
Kumar, A., Kwatra, P., & Garhwal, S. (2023) · Research Square · doi:10.21203/rs.3.rs-2250025/v2 · Cited by 1
Discrete optimization: A quantum revolution (Part II)Preprint
Creemers, S., & Armas, L. F. P. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4494506 · Cited by 1
Chen, H. (2023) · OSF Preprints (OSF Preprints) · doi:10.31219/osf.io/nsuf5 · Cited by 1
Quantum-Safe Protection for the Tls Protocol Using Wrapped CertificatesPreprint
Giron, A. A., do Nascimento, J. P. A., & Custódio, R. F. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4536384 · Cited by 1
Large-Scale Simulation of Shor's Quantum Factoring AlgorithmPreprint
Willsch, D., Willsch, M., Jin, F., Raedt, H. A. D., & Michielsen, K. F. L. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2308.05047 · Cited by 1
Micro- and Nanoelectronics - 2023
(2023) · LCC MAKS Press eBooks · doi:10.29003/m3563.icmne-2023 · Cited by 2
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.005.0003 · Cited by 1
Quantum overlapping tomography based on linear optics
Yang, Z. (2023) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/170876 · Cited by 1
A Primer to Underwater Quantum Key DistributionPreprint
Paglierani, P., Raouf, A. H. F., Pelekanakis, K., et al. (2023) · doi:10.36227/techrxiv.22299160.v3 · Cited by 1
Distributed Quantum Computing – Classical and Quantum
Loke, S. W. (2023) · doi:10.1002/9781394185542.ch3 · Cited by 1
Machine Learning Algorithms in Quantum Computing
Vasques, X. (2024) · doi:10.1002/9781394220649.ch5 · Cited by 1
Fluid Insights: Navigating Water's Quantum Potential in ComputingPreprint
Jerbi, D. (2024) · doi:10.36227/techrxiv.170905729.92545004/v1 · Cited by 1
Towards Quantum Computational MechanicsPreprint
Liu, B., Ortíz, M., & Cirak, F. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4761763 · Cited by 1
Hybrid genetic optimisation for quantum feature map design.
Pellow-Jarman, R. (2024) · doi:10.29086/10413/22903
Al-Bayaty, A., & Perkowski, M. A. (2024) · doi:10.17504/protocols.io.dm6gp9bd8vzp/v1 · Cited by 1
Robot Localization Aided by Quantum AlgorithmsPreprint
Antero, U., Sierra, B., Oñativia, J., Osaba, E., & Ruíz, A. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.5070796 · Cited by 1
Quantum Computing for Advanced Large-Scale Data Integration: Enhancing Accuracy and Speed.Preprint
Thirunagalingam, A. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5047667 · Cited by 1
Quantum-Resistant Cryptography via Lemniscate Lattices and AGM TransformationsPreprint
Vince, R. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5180911 · Cited by 1
Quantum Computing and Its Impact on Modern Cybersecurity and CryptographyPreprint
Fajinmi, J. O. (2025) · doi:10.22541/au.174483096.69812127/v1 · Cited by 1
Lantyer, V. H. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5218548 · Cited by 2
Quantum Accounting: Challenges, Future Outlook, and RecommendationsPreprint
mulla, H. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5324442 · Cited by 1
Yahweh, B., Ekanem, A. M., George, N. J., Oduntan, E. O., Mohammed, S. S. N., Abdulhamid, A., Takim, B. N., Ante, J. E., Emmanuel, Y., & Essang, S. O. (2025) · Research Square · doi:10.21203/rs.3.rs-7262536/v1 · Cited by 1
Application of Quantum Key Distribution in Intelligent Transport Systems
Ullrich, H., Bayerl, D., Hutzelmann, T., et al. (2025) · doi:10.1145/3736130.3762692 · Cited by 1
Secure Boot in Automotive Real-Time Systems in Context of Post-Quantum Cryptography
Oka, D. K., & Jungklass, P. (2025) · doi:10.1145/3736130.3764513 · Cited by 1
Sang, S., Hour, L., & Han, Y. (2025) · Research Square · doi:10.21203/rs.3.rs-7364412/v1 · Cited by 1
Xu, L.-S., Sha, E., Cui, X., & Zhuge, Q. (2025) · International Conference on Software Composition · doi:10.1145/3712285.3759789 · Cited by 4
Query Complexity of Quantum Biased Oracles
Iwama, K., Raymond, R., & Yamashita, S. (2006) · Springer eBooks · doi:10.1007/11683858_2 · Cited by 1
Transport d'un électron unique dans des nanostructures
Hermelin, S. (2012) · doi:10.70675/b2bfaac2ze967z4cbdzac87z44b1be19dfe7 · Cited by 1
Reversible Circuits Synthesis Based on EXOR-sum of Products of EXOR-sums
Tran, L. (2000) · doi:10.15760/etd.2299 · Cited by 1
Quantum Search on Strongly Regular Graphs
Janmark, J. (2013) · KTH Publication Database DiVA (KTH Royal Institute of Technology) · Cited by 1
Robust String Matching in O(\sqrt{N}+M) Quantum QueriesPreprint
Lomont, C. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0311043 · Cited by 1
A Review of Quantum Attention Mechanisms: Quantum Models, Applications, and ChallengesPreprint
Zhao, R.-X., Lu, Y., JinJing, S. H. I., Wang, S., Wang, Y., & Li, X. (2025) · doi:10.36227/techrxiv.174494983.39165941/v2 · Cited by 1
Evolving Hardware-Efficient Grover Circuits via Grammatical EvolutionPreprint
Obidiegwu, A. (2025) · doi:10.31219/osf.io/ch9mq_v1 · Cited by 1
YOUTIAO: Hybrid Multiplexing with Dynamic Qubit Grouping for Low-cost and Scalable Quantum Wiring
Tian, W., Lu, L., Tan, S., Li, S., Li, H., Chu, T., Zhang, X., Chen, M., & Yin, J. (2025) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1145/3725843.3756061
NEUROKEX ПОСТ-КВАНТОВЫЙ ПРОТОКОЛ ОБМЕНА КЛЮЧАМИ РАЗМЕРОМ 8 КБ С ЗАЩИТОЙ ОТ SIDE-CHANNEL АТАКPreprint
Surkova, M. (2026) · doi:10.24108/preprints-3114769 · Cited by 1
NEUROCIPHER: НЕЙРОСЕТЕВОЙ ГЕНЕРАТОР ПСЕВДОСЛУЧАЙНЫХ ПОСЛЕДОВАТЕЛЬНОСТЕЙ РАЗМЕРОМ 8 КБPreprint
Surkova, M. (2026) · doi:10.24108/preprints-3114767 · Cited by 1
Surkova, M. (2026) · doi:10.24108/preprints-3114770 · Cited by 1
Towards a squeezing-enhanced atomic clock on a chip
Ott, K. (2016) · theses.fr (ABES) · doi:10.70675/60128f9bzdd16z47acz91cfz96bc7837b0a1 · Cited by 2
NEUROHASH: ОЦЕНКА УСТОЙЧИВОСТИ К КВАНТОВЫМ АТАКАМPreprint
Surkova, M. (2026) · doi:10.24108/preprints-3114766 · Cited by 1
NEUROSIGN: НЕЙРОСЕТЕВАЯ СИСТЕМА ЦИФРОВОЙ ПОДПИСИ РАЗМЕРОМ 8 КБPreprint
Surkova, M. (2026) · doi:10.24108/preprints-3114768 · Cited by 1
Security for wireless communications
Kamel, S. (2017) · doi:10.70675/690a4609z038fz42f3zb20ezd876e809e3e9 · Cited by 1
Dhungana, D. S. (2018) · theses.fr (ABES) · doi:10.70675/94d56e52z85c4z4c28zbe88zc7186b908b10 · Cited by 1
Non-locality tests and quantum communication protocols using hybrid entanglement of light
Cavaillès, A. (2019) · theses.fr (ABES) · doi:10.70675/abf30852ze63fz40e1zb36fz11b6a29a281f · Cited by 1
Fully event-based motion estimation of neuromorphic binocular systems
Dardelet, L. (2021) · theses.fr (ABES) · doi:10.70675/9f6435dfz4289z4e9eza70fz9690293ffaba · Cited by 1
NeuroKDF ПОСТ-КВАНТОВАЯ ФУНКЦИЯ ВЫВОДА КЛЮЧЕЙ С РАЗМЕРОМ КОДА 9 КБPreprint
Surkova, M. (2026) · doi:10.24108/preprints-3114877 · Cited by 1
Surkova, M. (2026) · doi:10.24108/preprints-3115218 · Cited by 1
Electron dynamics in surface acoustic wave devices
Thorn, A. (2009) · Apollo (University of Cambridge) · doi:10.17863/cam.16557 · Cited by 1
Optical NMR Study of 31P Donor Spins in Isotopically Enriched 28Si
Saeedi, K. (2014) · Cited by 1
Experimental realization of an interferometric quantum circuit to increase the computational depth
Lipp, Y. O. (2011) · University of Vienna · doi:10.25365/thesis.17287 · Cited by 1
Faster search of clustered marked states with lackadaisical quantum walks
Saha, A., Majumdar, R., Saha, D., Chakrabarti, A., & Sur‐Kolay, S. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03606-6 · Cited by 27
Castagnoli, G. (2021) · Physical Review A · doi:10.1103/physreva.104.032203 · Cited by 8
An index theorem for one-dimensional gapless non-unitary quantum walks
Asahara, K., Funakawa, D., Seki, M., & Tanaka, Y. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03212-y · Cited by 6
Quantum Advantage Even Without Entanglement
Ratsaby, G. (2006)
Hacia una computadora cuántica
González, P. V. (2008) · Dialnet (Universidad de la Rioja)
Exploiting the Quantum Nature of Photons
Lewerenz, H. (2011) · Springer series in optical sciences/SPringer series in optical sciences · doi:10.1007/978-3-642-23749-2_6
Nicholson, L. E. (2010) · NSUWorks (Nova Southeastern University)
Information and Entropy in Neural Networks and Interacting Systems
Shafee, F. (2009)
Quantum Computational Cryptography
Kawachi, A., & Koshiba, T. (2006) · Springer eBooks · doi:10.1007/11683858_7
On Limitations and Alternatives of Privacy-Preserving Cryptographic Protocols for Genomic Data
Teruya, T., Nuida, K., Shimizu, K., et al. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-22425-1_15
Discussing the explanation of the quantum speed upPreprint
Castagnoli, G. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0910.2313
Quantum Computing as a Particular Case of Computing with Tensors
Ceberio, M. C., & Крейнович, В. (2021) · Studies in systems, decision and control · doi:10.1007/978-3-030-65324-8_8
Mathematics on a Quantum Computer
Williams, C. P. (2010) · Texts in computer science · doi:10.1007/978-1-84628-887-6_10
Polynomial Time Quantum Algorithm for Search Problem and Its Application
Iriyama, S., & Ohya, M. (2014) · Lecture notes in computer science · doi:10.1007/978-3-642-54943-4_15
Software for Quantum systems of Informatics
Francik, J. (2003) · Archiwum Informatyki Teoretycznej i Stosowanej
Quantum Algorithms of Solving the Backtracking of One-dimensional Cellular AutomataPreprint
Chang, W.-L., Feng, M., Lin, K. W., et al. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1109.2998
Control of Photon Storage Time in Photon Echoes using a Deshelving Process
Byoung Seung, H. A. M. (2011) · InTech eBooks · doi:10.5772/12888
Brain, Gene, and Quantum Inspired Computational Intelligence
Kasabov, N. K. (2013) · Springer eBooks · doi:10.1007/978-3-642-30574-0_60
Advanced Knowledge of the Solution in Quantum Algorithms Addressing Structured ProblemsPreprint
Castagnoli, G. (2011) · arXiv (Cornell University)
Computational costs of data definition at the quantum - classical interfacePreprint
Fields, C. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1005.4788
An Algorithmic Argument for Query Complexity Lower Bounds of Advised Quantum ComputationPreprint
Nishimura, H., & Yamakami, T. (2003) · arXiv (Cornell University)
Phaneendra, H. D., & Shivakumar, M. S. (2007) · Springer eBooks · doi:10.1007/978-0-387-44641-7_19
Forecasting Approach Using Hybrid Model ASVR/NGARCH with Quantum Minimization
Chang, B. R., & Tsai, H. F. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-74205-0_130
Simulador de Circuitos Quânticos
Figueiredo, F. D. R. L. S. (2013) · Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT) · doi:10.34626/qrnj-0g11
Simple characterizations for commutativity of quantum weakest preconditionsPreprint
Lin, T. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1108.4607
Maitra, A. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0611060
A Quantum Analog to Basis Function Networks
Ventura, D. A. (2002) · AIP conference proceedings · doi:10.1063/1.1503696
The Amplified Quantum Fourier Transform (Amplified-QFT)Preprint
Cornwell, D. J. (2010) · arXiv (Cornell University)
Simulation de systèmes quantiques sur un ordinateur quantique réaliste
Levi, B. P. (2004) · HAL
Quantum Teleportation and Von Neumann EntropyPreprint
Ju, Y. H., Jung, E., Hwang, M.-R., et al. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0707.1227
At the intersection of quantum computing and quantum chemistry
Whitfield, J. D. (2011)
Quantum Algorithm for Checking Matrix Identities
Nayak, A. (2008) · Encyclopedia of Algorithms · doi:10.1007/978-0-387-30162-4_303
Phase-Noise Limitations on Nonlinear-Optical Quantum Computing
Dove, J., Chudzicki, C., & Shapiro, J. H. (2015) · doi:10.1364/cleo_qels.2015.fm2e.6
Quantum Algorithm for Search on Grids
Ambainis, A. (2008) · Encyclopedia of Algorithms · doi:10.1007/978-0-387-30162-4_311
Ultrafast sources of entangled photons for quantum information processing
Kuzucu, O. (2008) · DSpace@MIT (Massachusetts Institute of Technology)
From QuantEYE to AquEYE—Instrumentation for Astrophysics on its Shortest Timescales
Barbieri, C., Naletto, G., Tamburini, F., et al. (2007) · Springer eBooks · doi:10.1007/978-1-4020-6518-7_9
Von der Turingmaschine zum Quantencomputer — ein Gang durch die Geschichte der Komplexitätstheorie
Köbler, J., & Beyersdorff, O. (2006) · Springer eBooks · doi:10.1007/3-540-32743-6_8
More On Grover's AlgorithmPreprint
Loo, K. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0502137
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
