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,001–5,100 of 8,792
Quantum Attacks on PRFs Based on Public Random Permutations
Guo, T., Wang, P., Hu, L., & Ye, D. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-22912-1_25 · Cited by 3
Quantum classifiers for domain adaptation
He, X., Du, F., Xue, M., Du, X., Lei, T., & Nandi, A. K. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03846-0 · Cited by 3
The concept of building security of the network with elements of the semiotic approach
Yevseiev, S., Tolkachov, M., Shetty, D., et al. (2023) · ScienceRise · doi:10.21303/2313-8416.2023.002828 · Cited by 3
Computer-aided-design methods for emerging quantum computing technologies
Thornton, M. A., & Feinstein, D. Y. (2008) · Cited by 3
Grover Algorithm for Multi-objective Searching with Iteration Auto-controlling
Zhu, W., Chen, H., Liu, Z., et al. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-11857-4_41 · Cited by 3
Comparison of Influence of Two Data-Encoding Methods for Grover Algorithm on Quantum Costs
Dhawan, S., & Perkowski, M. A. (2011) · Proceedings/Proceedings - International Symposium on Multiple-Valued Logic · doi:10.1109/ismvl.2011.29 · Cited by 3
Centro de Investigación y de Estudios Avanzados del Instituto Politécnico Nacional
Zacatenco, U. (2013) · Cited by 3
Distributed synthesis of chains with one-way biphotonic control
Ozhigov, Y. (2018) · Quantum Information and Computation · doi:10.26421/qic18.7-8-4 · Cited by 3
On-chip deterministic optical SWAP gate
Bozkurt, A., & Kocaman, S. (2019) · Quantum Nanophotonic Materials, Devices, and Systems · doi:10.1117/12.2529201 · Cited by 3
Quantum Resistant Public Key Encryption Scheme polarRLCE
Liu, J., Wang, Y., Yi, Z., & Pei, D. (2019) · Communications in computer and information science · doi:10.1007/978-3-030-36237-9_7 · Cited by 3
Variational Quantum Support Vector Machine based on Deutsch-Jozsa Ranking
Shiba, K., Sakamoto, K., & Sogabe, T. (2020) · Bulletin of Networking, Computing, Systems, and Software · Cited by 3
Blockchain and its Alternative Distributed Ledgers - A Survey
Khalifa, A. M., Bahaa-Eldin, A. M., & Sobh, M. (2019) · International Conference on Computer Engineering and Systems · doi:10.1109/icces48960.2019.9068183 · Cited by 3
Mahmud, N., & El‐Araby, E. (2019) · IEEE International System-on-Chip Conference (SOCC) · doi:10.1109/socc46988.2019.1570558150 · Cited by 3
Wave Algorithms: Optimal Database Search and Catalysis
Patel, A. D. (2006) · NOT FOUND REPOSITORY (Indian Institute of Science Bangalore) · Cited by 3
Superlinear Amplitude AmplificationPreprint
Grover, L. K. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0806.0154 · Cited by 3
Self-citationNonlinear Quantum SearchPreprint
Wong, T. G. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1506.04388 · Cited by 3
Maximum Likelihood Based Quantum Set Separation
Imre, S., & Balázs, F. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24685-5_40 · Cited by 3
Quantum and Classical Complexity Classes: Separations, Collapses, and Closure Properties
Spakowski, H., Thakur, M., & Tripathi, R. S. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-24597-1_32 · Cited by 2
Quantum information processing and quantum logic: toward mutual illuminationPreprint
Barnum, H. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0205129 · Cited by 3
Solving mathematical problems with quantum search algorithmPreprint
Ramos, R. V., de Sousa, P. B. M., & Oliveira, D. S. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0605003 · Cited by 3
Models of Quantum Algorithms in Sets and RelationsPreprint
Zeng, W. J. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1503.05857 · Cited by 3
A Coupled Oscillator Model for Grover's Quantum Database Search AlgorithmPreprint
Patel, A. A. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0711.4733 · Cited by 3
Entanglement, quantum phase transitions and quantum algorithmsPreprint
Orús, R. (2006) · arXiv (Cornell University) · Cited by 3
Almost-Everywhere Superiority for Quantum ComputingPreprint
Hemaspaandra, E., Hemaspaandra, L. A., & Zimand, M. (1999) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9910033 · Cited by 3
Simulations of Quantum Turing Machines by Quantum Multi-Stack MachinesPreprint
Qiu, D. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0501176 · Cited by 3
Theoretical Analyses of Quantum Counting against Decoherence ErrorsPreprint
Hasegawa, J., & Yura, F. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0503202 · Cited by 3
Quantum Ordered Binary Decision Diagrams with Repeated TestsPreprint
Homeister, M., & Waack, S. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0507258 · Cited by 3
Quantum Discrete Fourier Transform with Classical Output for Signal ProcessingPreprint
Pang, C.-Y., & Hu, B.-Q. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0706.2451 · Cited by 3
Stochastic Simulation of Grover's AlgorithmPreprint
MANSSUR, L. R. U., & Portugal, R. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0301077 · Cited by 3
Semantics of a purely quantum programming languagePreprint
Feng, Y., Duan, R., Ji, Z., & Ying, M. (2005) · arXiv (Cornell University) · Cited by 3
Quantum Algorithms, Lower Bounds, and Time-Space Tradeoffs
Špalek, R. (2006) · Data Archiving and Networked Services (DANS) · Cited by 3
Quantum designer and network simulator
Imre, S., Abronits, P., & Darabos, D. (2004) · ACM International Conference on Computing Frontiers (CF) · doi:10.1145/977091.977106 · Cited by 3
A fast natural algorithm for searching
Arulanandham, J. J., Calude, C. S., & Dinneen, M. J. (2004) · Theoretical Computer Science · doi:10.1016/j.tcs.2004.03.040 · Cited by 3
Splitting information securely with entanglement
Mihara, T. (2003) · Information and Computation · doi:10.1016/s0890-5401(03)00121-4 · Cited by 3
Gray code and the initialization problem of NMR quantum computers
Sawae, R., Sakata, T., Tei, M., et al. (2003) · International Journal of Quantum Chemistry · doi:10.1002/qua.10631 · Cited by 3
Quantum Pattern Recognition of Classical SignalPreprint
Pang, C.-Y., Ding, C.-B., & Hu, B.-Q. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0707.0936 · Cited by 3
Kato, K. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0803.3109 · Cited by 3
Implementation of quantum algorithms with Josephson charge qubits
Schuch, N. (2002) · University of Regensburg Publication Server (University of Regensburg) · doi:10.5283/epub.1511 · Cited by 5
Evolutionary Design in Biological Quantum ComputingPreprint
Vattay, G., & Kauffman, S. A. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1311.4688 · Cited by 3
Quantum measurement and entanglement of spin quantum bits in diamond
Pfaff, W. (2013) · Research Repository (Delft University of Technology) · doi:10.4233/uuid:62208a4a-72c6-45b5-af51-1a8e8f8bfdd8 · Cited by 3
Quantum walks and ground state problems
Richter, P. C. (2007) · Rutgers University Community Repository (Rutgers University) · doi:10.7282/t3w37wq1 · Cited by 3
Puzzuoli, D. (2014) · UWSpace (University of Waterloo) · Cited by 3
Multiparty Quantum Key Agreement based on Quantum Secret Direct Communication with GHZ statesPreprint
Zeng, G.-J., Chen, K.-H., Chang, Z.-H., et al. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1602.00832 · Cited by 3
Classical and Quantum Algorithms for the Boolean Satisfiability ProblemPreprint
Barrón-Romero, C. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1510.02682 · Cited by 3
A Highly Automated Laboratory Experiment
Jones, R. (1999) · Transactions of the Kansas Academy of Science · doi:10.2307/3627873 · Cited by 3
Quantum Encryption Algorithm Based on Modified BB84 and Authentication DH Algorithm
Khalaf, R. Z. (2015) · Eastern Mediterranean University Institutional Repository (Eastern Mediterranean University) · Cited by 3
Quantum Computation and Isomorphism Testing
Rosenbaum, D. J. (2015) · ResearchWorks at the University of Washington (University of Washington) · Cited by 2
SurvSec Security Architecture for Reliable Surveillance WSN Recovery from Base Station Failure
Megahed, M. H. M. (2014) · uO Research (University of Ottawa) · doi:10.20381/ruor-3718 · Cited by 3
Digital Signature Schemes Based on Hash Functions
Lafrance, P. (2017) · UWSpace (University of Waterloo) · Cited by 3
$Q|SI\rangle$: A Quantum Programming EnvironmentPreprint
Liu, S., Wang, X., Zhou, L., et al. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1710.09500 · Cited by 3
Evolving Quantum Algorithms with Genetic Programming
MacKinnon, D. (2017) · The Atrium (University of Guelph) · Cited by 3
Exact quantum query complexity of weight decision problems.Preprint
He, X., Sun, X., Yang, G., et al. (2018) · arXiv (Cornell University) · Cited by 3
Quantum-Assisted BlockchainPreprint
Sapaev, D. A., Bulychkov, D. A., Ablayev, F. M., et al. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1802.06763 · Cited by 3
Design and Implementation of a Digital Signature Scheme Based on Low-density Generator Matrix CodesPreprint
Baldi, M., Barenghi, A., Chiaraluce, F., et al. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1807.06127 · Cited by 3
Reproducible Codes and Cryptographic Applications.Preprint
Santini, P., Persichetti, E., & Baldi, M. (2018) · IACR Cryptology ePrint Archive · Cited by 3
On the Power of Quantum Queue Automata in Real-timePreprint
Bhatia, A. S., & Kumar, A. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.12095 · Cited by 3
Application of Flexible Presentation of Quantum Images in Multipartite CorrelationsPreprint
Sanchez, M. A. M., Sun, G.-H., & Dong, S. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1812.11053 · Cited by 3
The quantum algorithm for graph isomorphism problemPreprint
Li, X., & Chen, H. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1901.06530 · Cited by 3
Algorithms on Ensemble Quantum ComputersPreprint
Boykin, P. O., Mor, T., Roychowdhury, V., et al. (1999) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9907067 · Cited by 3
Two-dimensional quantum random walkPreprint
Baryshnikov, Y. M., Brady, W., Bressler, A., & Pemantle, R. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0810.5495 · Cited by 3
Quantum Algorithms for Evaluating MIN-MAX TreesPreprint
Cleve, R., Gavinsky, D., & Yonge-Mallo, D. L. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0710.5794 · Cited by 3
Quantum Attacks on Classical Proof Systems - The Hardness of Quantum RewindingPreprint
Ambainis, A., Rosmanis, A., & Unruh, D. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1404.6898 · Cited by 9
Robust Quantum Algorithms with $\eps$-Biased OraclesPreprint
Suzuki, T., Yamashita, S., Nakanishi, M., & Watanabe, K. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0605077 · Cited by 3
Lower bounds for predecessor searching in the cell probe modelPreprint
Sen, P., & Venkatesh, S. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0309033 · Cited by 3
Optimal Error Correcting Code For Ternary Quantum SystemsPreprint
Majumdar, R., & Sur‐Kolay, S. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1906.11137 · Cited by 8
Quantum Query-To-Communication Simulation Needs a Logarithmic OverheadPreprint
Chakraborty, S., Chattopadhyay, A., Mande, N. S., & Paraashar, M. (2019) · arXiv (Cornell University) · doi:10.4230/lipics.ccc.2020.32 · Cited by 5
Quantum Safe Cryptography Based on Hash Functions: A Survey
Zych, M. (2018) · NORA - Norwegian Open Research Archives · Cited by 3
Limitations of Clustering Using Quantum Persistent HomologyPreprint
Neumann, N. M. P., & den Breeijen, S. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1911.10781 · Cited by 3
Improved quantum algorithm for the random subset sum problemPreprint
Li, Y., & Li, H. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1912.09264 · Cited by 6
Quantum Computing @ MIT: The Past, Present, and Future of the Second Revolution in ComputingPreprint
Vasconcelos, F. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.05559 · Cited by 7
The quantum query complexity of composition with a relationPreprint
Belovs, A., & Lee, T. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2004.06439 · Cited by 3
Saha, A., Majumdar, R., Saha, D., Chakrabarti, A., & Sur‐Kolay, S. (2020) · arXiv (Cornell University) · Cited by 3
Post-Quantum Security of the Bitcoin Backbone and Quantum Multi-Solution Bernoulli Search.Preprint
Cojocaru, A., Garay, J. A., Kiayias, A., et al. (2020) · arXiv (Cornell University) · Cited by 3
On Interfacing the Brain with Quantum Computers: An Approach to Listen to the Logic of the MindPreprint
Miranda, E. R. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2101.03887 · Cited by 5
Benchmarking 16-element quantum search algorithms on superconducting quantum processorsPreprint
Gwinner, J., Briański, M., Burkot, W., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2007.06539 · Cited by 3
Svensson, M., Andersson, M., Grönkvist, M., Vikstål, P., Dubhashi, D., Ferrini, G., & Johansson, G. (2021) · arXiv (Cornell University) · Cited by 3
A Comparison of Quantum Algorithms for the Maximum Clique Problem
Haverly, A. (2021) · RIT Scholar Works (Rochester Institute of Technology) · Cited by 3
Grover on Caesar and Vigenère Ciphers.Preprint
Song, G., Jang, K., Kim, H., et al. (2021) · IACR Cryptology ePrint Archive · Cited by 3
Quantum Multi-Collision Distinguishers.Preprint
Bao, Z., Guo, J., Li, S., et al. (2021) · IACR Cryptology ePrint Archive · Cited by 3
Playing with a Quantum ComputerPreprint
Müller, R., & Greinert, F. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2108.06271 · Cited by 3
An exponentially more efficient optimization algorithm for noisy quantum computersPreprint
Rančić, M. J. (2021) · arXiv (Cornell University) · doi:10.5281/zenodo.5592833 · Cited by 3
Quantum Model-DiscoveryPreprint
Heim, N., Ghosh, A., Kyriienko, O., & Elfving, V. E. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.06376 · Cited by 16
Quantum Advantage on Proof of WorkPreprint
Bard, D. A., Kearney, J. J., & Pérez-Delgado, C. A. (2021) · SSRN Electronic Journal · doi:10.2139/ssrn.3979439 · Cited by 5
Error correction for reliable quantum computing
Fuentes, P. (2022) · Deposito Adademico Digital Universidad De Navarra (University of Navarra) · doi:10.15581/10171/63067 · Cited by 4
Glisic, S., & Lorenzo, B. (2022) · Wiley eBooks · doi:10.1002/9781119790327.ch11 · Cited by 4
Bitcoin Revisited: Formalization, Benchmarking, and Open Security IssuesPreprint
Baniata, H., & Kertész, A. (2022) · doi:10.36227/techrxiv.20496492.v1 · Cited by 3
Gate-based Quantum Computing: An OverviewPreprint
da Silva, R. P. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4347584 · Cited by 4
A tutorial on Underwater Quantum Key distributionPreprint
Paglierani, P., Raouf, A. H. F., Pelekanakis, K., Petroccia, R., Alves, J., & Uysal, M. (2023) · doi:10.36227/techrxiv.22299160.v1 · Cited by 3
A Novel Framework to Construct Quantum Circuits of S-Boxes: Applications to 4-bit S-boxesPreprint
Jeon, Y., Baek, S., & Kim, J. (2023) · Research Square · doi:10.21203/rs.3.rs-2727191/v1 · Cited by 3
Analysis of Design Quantum Multiplexer Using CSWAP and Controlled‐R Gates
Tara, V., Sharma, N., Kumar, P., & Gautam, K. (2023) · Wiley eBooks · doi:10.1002/9781119905172.ch3 · Cited by 3
Motion Planning Algorithms for Safety and Quantum Computing Efficiency
Lathrop, P., & (NNSA), U. N. N. S. A. (2023) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/2229652 · Cited by 3
Machine Learning for Anomaly Detection in Particle PhysicsPreprint
Belis, V., Odagiu, P., & Aarrestad, T. K. (2023) · arXiv (Cornell University) · doi:10.3929/ethz-b-000654879 · Cited by 3
Solving Chromatic Number with Quantum Search and Quantum Counting
Lutze, D. (2021) · doi:10.15368/theses.2021.59 · Cited by 3
Solving the Resource-Constrained Project Scheduling Problem (RCPSP) with Quantum AnnealingPreprint
Armas, L. F. P., Creemers, S., & Deleplanque, S. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4689017 · Cited by 3
The Quantum Computing Paradigm
Ehmer, T., Karemore, G., & Melo, H. (2024) · Wiley eBooks · doi:10.1002/9783527840748.ch26 · Cited by 3
Post-quantum attacks against symmetric-key cryptography systems
Pham, T. M. P. (2024) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/174201 · Cited by 3
Chamorro, N. L. (2024) · Documento ocasional/Documento ocasional - Banco de España · doi:10.53479/36696 · Cited by 3
The Impact of Quantum Computing on Present CryptographyPreprint
Gangwar, S., Pachnanda, V., & Pundir, T. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5017957 · Cited by 3
Post‐Quantum Cryptography Methods
Kundalakesi, M., & Devi, M. R. (2025) · Wiley eBooks · doi:10.1002/9781394242399.ch2 · Cited by 3
Quantum Computing in the Spotlight: Redefining Cybersecurity and CryptographyPreprint
Fajinmi, J. O. (2025) · doi:10.22541/au.174483096.65933269/v1 · Cited by 3
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
