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 1,601–1,700 of 8,792
Yang, Y., Guo, X.-P., Xu, G., et al. (2018) · Computers & Security · doi:10.1016/j.cose.2018.08.012 · Cited by 23
On Quantum Distinguishers for Type-3 Generalized Feistel Network Based on Separability
Hodžić, S., Knudsen, L. R., & Kidmose, A. B. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-44223-1_25 · Cited by 23
Quantum random access memory via quantum walk
Asaka, R., Sakai, K., & Yahagi, R. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abf484 · Cited by 25
Efficient and Correct Compilation of Quantum Circuits
Wille, R., Hillmich, S., & Burgholzer, L. (2020) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas45731.2020.9180791 · Cited by 25
TILT: Achieving Higher Fidelity on a Trapped-Ion Linear-Tape Quantum Computing Architecture
Wu, X.-C., Debroy, D. M., Ding, Y., Baker, J. M., Alexeev, Y., Brown, K. R., & Chong, F. T. (2021) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca51647.2021.00023 · Cited by 33
Quantum Solutions to Possible Challenges of Blockchain Technology
Dey, N., Ghosh, M., & Chakrabarti, A. (2022) · Lecture notes on data engineering and communications technologies · doi:10.1007/978-3-031-04613-1_9 · Cited by 27
Natural Language Processing Meets Quantum Physics: A Survey and Categorization
Wu, S., Li, J., Zhang, P., & Zhang, Y. (2021) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/2021.emnlp-main.254 · Cited by 27
Drias, H., Drias, Y., Houacine, N. A., et al. (2022) · Soft Computing · doi:10.1007/s00500-022-06946-8 · Cited by 23
Pakhomchik, A. I., Voloshinov, V., Vinokur, V. M., et al. (2022) · Algorithms · doi:10.3390/a15020033 · Cited by 23
Noise-Aware Quantum Circuit Simulation With Decision Diagrams
Grurl, T., Fus, J., & Wille, R. (2022) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2022.3182628 · Cited by 26
A Survey on NIST Selected Third Round Candidates for Post Quantum Cryptography
Hasija, T., Ramkumar, K. R., Kaur, A., Mittal, S. K., & Singh, K. K. (2022) · International Conference on Communication and Electronics Systems (ICCES) · doi:10.1109/icces54183.2022.9835864 · Cited by 24
Attribute-Based Encryption in Securing Big Data from Post-Quantum Perspective: A Survey
Jemihin, Z. B., Fun, T. S., & Chung, G. C. (2022) · Cryptography · doi:10.3390/cryptography6030040 · Cited by 23
D-NISQ: A reference model for Distributed Noisy Intermediate-Scale Quantum computers
Acampora, G., Martino, F. D., Massa, A. A., Schiattarella, R., & Vitiello, A. (2022) · Information Fusion · doi:10.1016/j.inffus.2022.08.003 · Cited by 23
Finding Many Collisions via Reusable Quantum Walks
Bonnetain, X., Chailloux, A., Schrottenloher, A., & Shen, Y. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-30589-4_8 · Cited by 28
Systems Architecture for Quantum Random Access Memory
Xu, S., Hann, C. T., Foxman, B., Girvin, S. M., & Ding, Y. (2023) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1145/3613424.3614270 · Cited by 31
Quantifying non-stabilizerness via information scrambling
Ahmadi, A., & Greplová, E. (2024) · SciPost Physics · doi:10.21468/scipostphys.16.2.043 · Cited by 33
Using Boolean Satisfiability for Exact Shuttling in Trapped-Ion Quantum Computers
Schoenberger, D., Hillmich, S., Brandl, M., & Wille, R. (2024) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1109/asp-dac58780.2024.10473902 · Cited by 27
Systematic Review on Requirements Engineering in Quantum Computing: Insights and Future Directions
Sepúlveda, S., Cravero, A., Fonseca, G. M., & Antonelli, L. (2024) · Electronics · doi:10.3390/electronics13152989 · Cited by 25
A feasibility-preserved quantum approximate solver for the Capacitated Vehicle Routing Problem
Xie, N., Lee, X., Cai, D., Saito, Y., Asai, N., & Lau, H. C. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04497-5 · Cited by 25
Wei, X., Fan, L., Guo, Y., Gong, Y., Han, Z., & Wang, Y. (2024) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2024.3440930 · Cited by 28
Rylander, B., Soule, T., Foster, J. A., et al. (2000) · Cited by 23
Promised and Distributed Quantum Search
Zhang, S. (2005) · Lecture notes in computer science · doi:10.1007/11533719_44 · Cited by 23
Undergraduate computational physics projects on quantum computing
Candela, D. (2015) · American Journal of Physics · doi:10.1119/1.4922296 · Cited by 23
Quantum Pattern Recognition with Probability of 100%
Zhou, R., & Qiu-lin, D. (2007) · International Journal of Theoretical Physics · doi:10.1007/s10773-007-9561-5 · Cited by 23
General-Purpose Parallel Simulator for Quantum Computing
Niwa, J., Matsumoto, K., & Imai, H. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45833-6_20 · Cited by 24
Some formal tools for analyzing quantum automata
Bertoni, A., Mereghetti, C., & Palano, B. (2006) · Theoretical Computer Science · doi:10.1016/j.tcs.2006.01.042 · Cited by 23
A note on quantum black-box complexity of almost all Boolean functions
Ambainis, A. (1999) · Information Processing Letters · doi:10.1016/s0020-0190(99)00079-4 · Cited by 26
An N/4 fixed-point duality quantum search algorithm
Hao, L., Liu, D., & Long, G. (2010) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-010-4079-x · Cited by 23
de Wolf, R. (2008) · Quantum Information and Computation · doi:10.26421/qic8.10-4 · Cited by 34
An effective co-evolutionary quantum genetic algorithm for the no-wait flow shop scheduling problem
Deng, G., Wei, M., Su, Q., et al. (2015) · Advances in Mechanical Engineering · doi:10.1177/1687814015622900 · Cited by 23
Quantum walk search on Johnson graphs
Wong, T. G. (2016) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/49/19/195303 · Cited by 26
Jiang, N., Dang, Y., & Zhao, N. (2016) · International Journal of Theoretical Physics · doi:10.1007/s10773-016-3073-0 · Cited by 23
Mulholland, J., Mosca, M., & Braun, J. (2017) · IEEE Security & Privacy · doi:10.1109/msp.2017.3151325 · Cited by 23
Quantum Adder for Superposition States
Lu, X.-M., Jiang, N., Hu, H., & Ji, Z. (2018) · International Journal of Theoretical Physics · doi:10.1007/s10773-018-3779-2 · Cited by 23
Quantum Representation and Basic Operations of Digital Signals
Li, P., Wang, B., Xiao, H. Y., et al. (2018) · International Journal of Theoretical Physics · doi:10.1007/s10773-018-3841-0 · Cited by 23
Woods, D., & Naughton, T. J. (2009) · Applied Mathematics and Computation · doi:10.1016/j.amc.2009.04.061 · Cited by 23
Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model
Izumi, T., & Gall, F. L. (2019) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/3293611.3331628 · Cited by 23
Optimal separation in exact query complexities for Simon's problem
Cai, G., & Qiu, D. (2018) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2018.05.001 · Cited by 24
Novel One Time Signatures (NOTS): A Compact Post-Quantum Digital Signature Scheme
Shahid, F., Ahmad, I., Imran, M. A., & Shoaib, M. (2020) · IEEE Access · doi:10.1109/access.2020.2966259 · Cited by 23
A quantum multi-objective optimization algorithm based on harmony search method
Hesar, A. S., Kamel, S. R., & Houshmand, M. (2021) · Soft Computing · doi:10.1007/s00500-021-05799-x · Cited by 23
Implementation of quantum compression on IBM quantum computers
Pivoluska, M., & Plesch, M. (2022) · Scientific Reports · doi:10.1038/s41598-022-09881-8 · Cited by 26
Classical versus quantum communication complexity
Ta‐Shma, A. (1999) · ACM SIGACT News · doi:10.1145/333623.333628 · Cited by 23
Spatial search using the discrete time quantum walk
Lovett, N. B., Everitt, M., Trevers, M., Mosby, D., Stockton, D., & Kendon, V. M. (2011) · Natural Computing · doi:10.1007/s11047-011-9279-4 · Cited by 24
A framework for structured quantum search
Hogg, T. (1998) · Physica D Nonlinear Phenomena · doi:10.1016/s0167-2789(98)00047-5 · Cited by 27
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs
Klauck, H., Špalek, R., & de Wolf, R. (2004) · UvA-DARE (University of Amsterdam) · doi:10.48550/arxiv.quant-ph/0402123 · Cited by 23
Quantum Computation with Topological Codes: from qubit to topological fault-tolerancePreprint
Fujii, K. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1504.01444 · Cited by 23
Rapid sampling through quantum computingPreprint
Grover, L. K. (1999) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9912001 · Cited by 23
Self-citationEvery NAND formula of size N can be evaluated in time N^{1/2+o(1)} on a quantum computerPreprint
Childs, A. M., Reichardt, B. W., Špalek, R., & Zhang, S. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0703015 · Cited by 39
Quantum computation by local measurementPreprint
Raussendorf, R., & Wei, T.-C. (2014) · Cited by 25
On Testing and Debugging Quantum SoftwarePreprint
Miranskyy, A. V., Zhang, L., & Doliskani, J. (2021) · arXiv (Cornell University) · doi:10.13016/m2tytz-xb93 · Cited by 58
A formally certified end-to-end implementation of Shor’s factorization algorithm
Peng, Y., Hietala, K., Tao, R., Li, L., Rand, R., Hicks, M., & Wu, X. (2023) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2218775120 · Cited by 24
A novel quantum private set intersection scheme with a semi-honest third party
Chen, Y., Situ, H., Huang, Q., et al. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04195-8 · Cited by 22
Matsakos, T., & Nield, S. (2024) · Quantum · doi:10.22331/q-2024-04-04-1306 · Cited by 22
García, D. P., Cruz-Benito, J., & García‐Peñalvo, F. J. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2024.124427 · Cited by 26
Xia, T., Wang, M., He, J., et al. (2024) · Drones · doi:10.3390/drones8080359 · Cited by 22
Nguyen, H. P., & Chen, Y. (2024) · Electronics · doi:10.3390/electronics13224550 · Cited by 22
Incompressible Navier–Stokes solve on noisy quantum hardware via a hybrid quantum–classical scheme
Song, Z., Deaton, R., Gard, B., & Bryngelson, S. H. (2024) · Computers & Fluids · doi:10.1016/j.compfluid.2024.106507 · Cited by 31
Using modifications to Grover’s Search algorithm for quantum global optimization
Liu, Y., & Kœhler, G. J. (2010) · European Journal of Operational Research · doi:10.1016/j.ejor.2010.05.039 · Cited by 22
Faster quantum walk search on a weighted graph
Wong, T. G. (2015) · Physical Review A · doi:10.1103/physreva.92.032320 · Cited by 21
Aaronson, S. (2016) · Springer eBooks · doi:10.1007/978-3-319-32162-2_1 · Cited by 40
Fuzzy Matching Based on Gray-scale Difference for Quantum Images
Luo, G., Zhou, R., Liu, X., et al. (2018) · International Journal of Theoretical Physics · doi:10.1007/s10773-018-3766-7 · Cited by 22
Cloud computing in the quantum era
Kaiiali, M., Sezer, S., & Khalid, A. (2019) · IEEE Conference on Communications and Network Security · doi:10.1109/cns44998.2019.8952589 · Cited by 23
T-depth Optimization for Fault-Tolerant Quantum Circuits
Niemann, P., Gupta, A., & Drechsler, R. (2019) · IEEE International Symposium on Multiple-Valued Logic · doi:10.1109/ismvl.2019.00027 · Cited by 25
k-forrelation optimally separates Quantum and classical query complexity
Bansal, N., & Sinha, M. (2021) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3406325.3451040 · Cited by 22
Wille, R., Hillmich, S., & Burgholzer, L. (2020) · doi:10.1145/3400302.3415746 · Cited by 21
Liu, W., Wu, Q., Shen, J., et al. (2021) · Journal of Ambient Intelligence and Humanized Computing · doi:10.1007/s12652-020-02840-z · Cited by 22
On the Construction of a Post-Quantum Blockchain
Chen, J., Gan, W., Hu, M., & Chen, C. (2021) · IEEE Conference on Dependable and Secure Computing (DSC) · doi:10.1109/dsc49826.2021.9346253 · Cited by 23
A New Approach for Optimization of Distributed Quantum Circuits
Dadkhah, D., Moghadam, M. Z., & Hosseini, S. E. (2021) · International Journal of Theoretical Physics · doi:10.1007/s10773-021-04904-y · Cited by 22
Alternative Tower Field Construction for Quantum Implementation of the AES S-Box
Chung, D., Lee, S., Choi, D., & Lee, J. (2021) · IEEE Transactions on Computers · doi:10.1109/tc.2021.3135759 · Cited by 22
A Novel Approach for Web Mining Taxonomy for High-Performance Computing
Samanta, D., Dutta, S., Galety, M. G., et al. (2021) · Lecture notes in networks and systems · doi:10.1007/978-981-16-4284-5_37 · Cited by 22
Automatic generation of Grover quantum oracles for arbitrary data structures
Seidel, R., Becker, C. K., Bock, S., Tcholtchev, N., Gheorghe-Pop, I.-D., & Hauswirth, M. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/acaf9d · Cited by 28
Gharibian, S., & Gall, F. L. (2022) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3519935.3519991 · Cited by 41
Quantum Data Networking for Distributed Quantum Computing: Opportunities and Challenges
Qiao, C., Zhao, Y., Zhao, G., & Xu, H. (2022) · IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) · doi:10.1109/infocomwkshps54753.2022.9798138 · Cited by 22
Quantum algorithms for attacking hardness assumptions in classical and post‐quantum cryptography
Biasse, J., Bonnetain, X., Kirshanova, E., Schrottenloher, A., & Song, F. (2022) · IET Information Security · doi:10.1049/ise2.12081 · Cited by 23
Data-Driven Reliability Models of Quantum Circuit: From Traditional ML to Graph Neural Network
Saravanan, V., & Saeed, S. M. (2022) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2022.3202430 · Cited by 24
A fast and scalable qubit-mapping method for noisy intermediate-scale quantum computers
Park, S., Kim, D., Kweon, M., Sim, J., & Kang, S. (2022) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/3489517.3530402 · Cited by 26
TorchQuantum Case Study for Robust Quantum Circuits
Wang, H., Liang, Z., Gu, J., Li, Z., Ding, Y., Jiang, W., Shi, Y., Pan, D. Z., Chong, F. T., & Han, S. (2022) · International Conference on Computer Aided Design · doi:10.1145/3508352.3561118 · Cited by 28
Hybrid Post-Quantum Enhanced TLS 1.3 on Embedded Devices
Marchsreiter, D., & Sepúlveda, J. (2022) · Euromicro Conference on Digital System Design (DSD) · doi:10.1109/dsd57027.2022.00127 · Cited by 22
Demonstrating Quantum Advantage in Hybrid Quantum Neural Networks for Model Capacity
Kashif, M., & Al-Kuwari, S. M. (2022) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc57508.2022.00011 · Cited by 22
Deep-Learning-Based Cryptanalysis of Lightweight Block Ciphers Revisited
Kim, H., Lim, S., Kang, Y., Kim, W., Kim, D., Yoon, S., & Seo, H. (2023) · Entropy · doi:10.3390/e25070986 · Cited by 27
Continuous dynamical decoupling of optical 171Yb+ qudits with radiofrequency fields
Zalivako, I. V., Borisenko, A. S., Semerikov, I. A., Korolkov, A. E., Sidorov, P., Galstyan, K. P., Semenin, N. V., Smirnov, V. N., Aksenov, M. D., Fedorov, A. K., et al. (2023) · Frontiers in Quantum Science and Technology · doi:10.3389/frqst.2023.1228208 · Cited by 23
Using Differential Evolution to avoid local minima in Variational Quantum Algorithms
Faílde, D., Viqueira, J. D., Juane, M. M., & Gómez, A. (2023) · Scientific Reports · doi:10.1038/s41598-023-43404-3 · Cited by 22
Mahroo, R., & Kargarian, A. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3320872 · Cited by 28
Cruz, P. M. Q., & Murta, B. (2024) · APL Quantum · doi:10.1063/5.0187026 · Cited by 22
Biswas, S., Goswami, R. S., Reddy, K. H. K., et al. (2024) · IET Quantum Communication · doi:10.1049/qtc2.12105 · Cited by 22
Doubly Optimal Parallel Wire Cutting without Ancilla Qubits
Harada, H., Wada, K., & Yamamoto, N. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.040308 · Cited by 46
A Quantum Associative Memory Based on Grover’s Algorithm
Ventura, D. A., & Martinez, T. R. (1999) · Artificial Neural Nets and Genetic Algorithms · doi:10.1007/978-3-7091-6384-9_5 · Cited by 21
Quantum walks: Decoherence and coin-flipping games
Romanelli, A., & Hernández, G. (2010) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2010.12.006 · Cited by 23
Limiting distribution of decoherent quantum random walks
Zhang, K. (2008) · Physical Review A · doi:10.1103/physreva.77.062302 · Cited by 23
Quantum Secure Direct Communication with Authentication Using Two Nonorthogonal States
Yu, C., Guo, G., & Lin, S. (2012) · International Journal of Theoretical Physics · doi:10.1007/s10773-012-1336-y · Cited by 22
On the Size of One-way Quantum Finite Automata with Periodic Behaviors
Mereghetti, C., & Palano, B. (2002) · RAIRO - Theoretical Informatics and Applications · doi:10.1051/ita:2002014 · Cited by 22
Quantum random walks in one dimension via generating functions
Bressler, A., & Pemantle, R. (2007) · Discrete Mathematics & Theoretical Computer Science · doi:10.46298/dmtcs.3533 · Cited by 20
Quantum-Secured Data Transmission in Urban Fiber-Optics Communication Lines
Duplinskiy, A. V., Kiktenko, E. O., Pozhar, N. O., Anufriev, M. N., Ермаков, Р. П., Kotov, A. I., Brodskiy, A. V., Yunusov, R. R., Kurochkin, V. L., Fedorov, A. K., et al. (2018) · Journal of Russian Laser Research · doi:10.1007/s10946-018-9697-1 · Cited by 22
Spin Foam Vertex Amplitudes on Quantum Computer—Preliminary Results
B, J. M. A. (2019) · Universe · doi:10.3390/universe5080179 · Cited by 25
Vidick, T., & Watrous, J. (2016) · now publishers, Inc. eBooks · doi:10.1561/9781680831276 · Cited by 22
Coherence Depletion in Quantum Algorithms
Liu, Y.-C., Shang, J., & Zhang, X. (2019) · Entropy · doi:10.3390/e21030260 · Cited by 21
LEDAcrypt: QC-LDPC Code-Based Cryptosystems with Bounded Decryption Failure Rate
Baldi, M., Barenghi, A., Chiaraluce, F., Pelosi, G., & Santini, P. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-25922-8_2 · Cited by 22
Reversible Computation: Extending Horizons of Computing
Ulidowski, I., Lanese, I., Schultz, U. P., & Ferreira, C. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-47361-7 · Cited by 25
Quantum search for scaled hash function preimages
Ramos-Calderer, S., Bellini, E., Latorre, J. I., Manzano, M., & Mateu, V. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03118-9 · Cited by 22
Liang, Z., Wang, Z., Yang, J., Yang, L., Shi, Y., & Jiang, W. (2021) · International Conference on Computer Aided Design · doi:10.1109/iccad51958.2021.9643470 · Cited by 26
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
