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,201–1,300 of 8,792
Quantum computing classical physics
Meyer, D. (2002) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2001.0936 · Cited by 34
Quantum Communication Complexity
Klauck, H. (2015) · Open Collections · doi:10.14288/1.0044511 · Cited by 33
Quantum Computing: Lecture NotesPreprint
de Wolf, R. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.09415 · Cited by 197
Wei, G., Fan, K., Zhang, K., Wang, H., Li, H., & Yang, Y. (2023) · IEEE Internet of Things Journal · doi:10.1109/jiot.2023.3323275 · Cited by 33
Quantum computing basics, applications and future perspectives
Balamurugan, K. S., Sivakami, A., Mathankumar, M., Prasad, Y. J. D. S., & Ahmad, I. (2024) · Journal of Molecular Structure · doi:10.1016/j.molstruc.2024.137917 · Cited by 37
Fault-tolerant one-bit addition with the smallest interesting color code
Wang, Y., Simsek, S., Gatterman, T. M., Gerber, J. A., Gilmore, K., Gresh, D., Hewitt, N., Horst, C. V., Matheny, M., Mengle, T., et al. (2024) · Science Advances · doi:10.1126/sciadv.ado9024 · Cited by 45
Chen, X., Xu, S., Gao, S., Guo, Y., Yiu, S., & Xiao, B. (2024) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2024.3455772 · Cited by 35
Baseri, Y., Chouhan, V., Ghorbani, A. A., & Chow, A. (2024) · Computers & Security · doi:10.1016/j.cose.2024.104272 · Cited by 48
Open Bisimulation for Quantum Processes
Deng, Y., & Feng, Y. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33475-7_9 · Cited by 32
A quantum-walk-inspired adiabatic algorithm for solving graph isomorphism problems
Tamascelli, D., & Zanetti, L. (2014) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/47/32/325302 · Cited by 37
On the complexity of minimizing probabilistic and quantum automata
Mateus, P., Qiu, D., & Li, L. (2012) · Information and Computation · doi:10.1016/j.ic.2012.07.002 · Cited by 32
Nested Quantum Walks with Quantum Data Structures
Jeffery, S., Kothari, R., & Magniez, F. (2013) · Cited by 34
Passarelli, G., Filippis, G. D., Cataudella, V., & Lucignano, P. (2018) · Physical Review A · doi:10.1103/physreva.97.022319 · Cited by 32
Curbing Address Reuse in the IOTA Distributed Ledger: A Cuckoo-Filter-Based Approach
Shafeeq, S., Zeadally, S., Alam, M., et al. (2019) · IEEE Transactions on Engineering Management · doi:10.1109/tem.2019.2922710 · Cited by 32
Order-encoded quantum image model and parallel histogram specification
Xu, G., Xu, X., Wang, X., et al. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2463-7 · Cited by 32
An Evolutionary Approach to Optimizing Teleportation Cost in Distributed Quantum Computation
Houshmand, M., Houshmand, M., Mohammadi, Z., et al. (2020) · International Journal of Theoretical Physics · doi:10.1007/s10773-020-04409-0 · Cited by 32
Towards Security of Cyber-Physical Systems using Quantum Computing Algorithms
Tosh, D. K., Galindo, O., Крейнович, В., & Kosheleva, O. M. (2020) · International Conference on System of Systems Engineering · doi:10.1109/sose50414.2020.9130525 · Cited by 32
AccQOC: Accelerating Quantum Optimal Control Based Pulse Generation
Cheng, J., Deng, H., & Qia, X. (2020) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca45697.2020.00052 · Cited by 37
Tools for Quantum Computing Based on Decision Diagrams
Wille, R., Hillmich, S., & Burgholzer, L. (2022) · ACM Transactions on Quantum Computing · doi:10.1145/3491246 · Cited by 32
Not All SWAPs Have the Same Cost: A Case for Optimization-Aware Qubit Routing
Liu, J., Li, P., & Zhou, H. (2022) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca53966.2022.00058 · Cited by 40
Variational quantum attacks threaten advanced encryption standard based symmetric cryptography
Wang, Z., Wei, S., Long, G., & Hanzo, L. (2022) · Science China Information Sciences · doi:10.1007/s11432-022-3511-5 · Cited by 37
Zhao, Z., Fan, L., & Han, Z. (2023) · IEEE Transactions on Sustainable Energy · doi:10.1109/tste.2023.3309244 · Cited by 32
Jang, K., Baksi, A., Kim, H., Song, G., Seo, H., & Chattopadhyay, A. (2025) · IACR Cryptology ePrint Archive · doi:10.62056/ay11zo-3y · Cited by 74
Functional Quantum Programming
Mu, S.-C., & Bird, R. S. (2001) · Cited by 32
Nonlinear quantum search using the Gross–Pitaevskii equation
Meyer, D. A., & Wong, T. G. (2013) · New Journal of Physics · doi:10.1088/1367-2630/15/6/063014 · Cited by 32
Choi, B.-S., Walker, T. A., & Braunstein, S. L. (2006) · Quantum Information Processing · doi:10.1007/s11128-006-0037-y · Cited by 32
Lent, C. S., Snider, G. L., Bernstein, G. H., Wolfgang Porod, Y., Orlov, A. O., Lieberman, M., Fehlner, T. P., Niemier, M. T., & Kogge, P. M. (2003) · Springer eBooks · doi:10.1007/978-1-4615-0437-5_10 · Cited by 32
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs
Klauck, H., Špalek, R., & de Wolf, R. (2004) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2004.52 · Cited by 53
Multiple sequence alignment by quantum genetic algorithm
Layeb, A., Soham, M. S., & Batouche, M. (2006) · doi:10.5555/1898699.1898843 · Cited by 32
Determination of equivalence between quantum sequential machines
Li, L., & Qiu, D. (2006) · Theoretical Computer Science · doi:10.1016/j.tcs.2006.03.001 · Cited by 31
Optimal Summation and Integration by Deterministic, Randomized, and Quantum Algorithms
Heinrich, S., & Novak, E. (2002) · Springer eBooks · doi:10.1007/978-3-642-56046-0_4 · Cited by 32
Physics: Quantum computer quest
Gibney, E. (2014) · Nature · doi:10.1038/516024a · Cited by 32
Cryptography in Post Quantum Computing EraPreprint
Sood, N. C. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4705470 · Cited by 32
Fault-Tolerant One-Bit Addition with the Smallest Interesting Colour Code
Wang, Y., Simsek, S., Gatterman, T. M., Gerber, J. A., Gilmore, K., Gresh, D., Hewitt, N., Horst, C. V., Matheny, M., Mengle, T., et al. (2023) · arXiv · doi:10.48550/arxiv.2309.09893 · Cited by 32
Quantum Computing Techniques for Multi-knapsack Problems
Awasthi, A., Bär, F., Doetsch, J. A., Ehm, H., Erdmann, M., Hess, M., Klepsch, J., Limacher, P. A., Luckow, A., Niedermeier, C. A., et al. (2023) · Lecture notes in networks and systems · doi:10.1007/978-3-031-37963-5_19 · Cited by 34
Large-Scale Simulation of Shor’s Quantum Factoring Algorithm
Willsch, D., Willsch, M., Jin, F., Raedt, H. A. D., & Michielsen, K. F. L. (2023) · Mathematics · doi:10.3390/math11194222 · Cited by 40
Separations in query complexity based on pointer functions
Ambainis, A., Balodis, K., Belovs, A., Lee, T., Sántha, M., & Smotrovs, J. (2016) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2897518.2897524 · Cited by 38
Yamashita, S., Minato, S.-I., & MILLER, D. M. (2008) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1093/ietfec/e91-a.12.3793 · Cited by 31
Quantum Existence Testing and Its Application for Finding Extreme Values in Unsorted Databases
Imre, S. (2007) · IEEE Transactions on Computers · doi:10.1109/tc.2007.1032 · Cited by 31
Quantum Error Correction Protects Quantum Search Algorithms Against Decoherence
Botsinis, P., Babar, Z., Alanis, D., Chandra, D., Nguyen, H. V., Ng, S. X., & Hanzo, L. (2016) · Scientific Reports · doi:10.1038/srep38095 · Cited by 30
Optimization of lattice surgery is NP-hard
Herr, D., Nori, F., & Devitt, S. J. (2017) · npj Quantum Information · doi:10.1038/s41534-017-0035-1 · Cited by 31
A Θ( √ n)-depth quantum adder on the 2D NTC quantum computer architecture
Choi, B.-S., & Meter, R. V. (2012) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/2287696.2287707 · Cited by 35
Konar, D., Sharma, K., Sarogi, V., et al. (2018) · Procedia Computer Science · doi:10.1016/j.procs.2018.04.301 · Cited by 31
A template-based technique for efficient Clifford+T-based quantum circuit implementation
Biswal, L., Das, R., Bandyopadhyay, C., Chattopadhyay, A., & Rahaman, H. (2018) · Microelectronics Journal · doi:10.1016/j.mejo.2018.08.011 · Cited by 32
Quantum Algorithms for the $$k$$-xor Problem
Grassi, L., Naya‐Plasencia, M., & Schrottenloher, A. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-03326-2_18 · Cited by 32
Improved Quantum Image Median Filtering in the Spatial Domain
Jiang, S.-X., Zhou, R., Hu, W., et al. (2019) · International Journal of Theoretical Physics · doi:10.1007/s10773-019-04103-w · Cited by 31
Scaling reconfigurable emulation of quantum algorithms at high precision and high throughput
Mahmud, N., El‐Araby, E., & Caliga, D. (2019) · Quantum Engineering · doi:10.1002/que2.19 · Cited by 31
Mobile Energy Requirements of the Upcoming NIST Post-Quantum Cryptography Standards
Saarinen, M.-J. O. (2020) · IEEE International Conference on Mobile Cloud Computing, Services, and Engineering (MobileCloud) · doi:10.1109/mobilecloud48802.2020.00012 · Cited by 34
Quantum neural networks model based on swap test and phase estimation
Li, P., & Wang, B. (2020) · Neural Networks · doi:10.1016/j.neunet.2020.07.003 · Cited by 31
Quantum circuit for the fast Fourier transform
Asaka, R., Sakai, K., & Yahagi, R. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02776-5 · Cited by 31
Avoiding blocking by scheduling transactions using quantum annealing
Bittner, T., & Groppe, S. (2020) · International Database Engineering and Applications Symposium (IDEAS) · doi:10.1145/3410566.3410593 · Cited by 31
On the Compressed-Oracle Technique, and Post-Quantum Security of Proofs of Sequential Work
Chung, K.-M., Fehr, S., Huang, Y., & Liao, T.-N. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-77886-6_21 · Cited by 56
Quantum algorithms with local particle-number conservation: Noise effects and error correction
Streif, M., Leib, M., Wudarski, F., Rieffel, E. G., & Wang, Z. (2021) · Physical Review A · doi:10.1103/physreva.103.042412 · Cited by 36
Quantum Technology for Economists
Hull, I., Sattath, O., Diamanti, E., & Wendin, G. P. (2020) · Contributions to economics · doi:10.1007/978-3-031-50780-9 · Cited by 36
Khan, F. M., Gupta, R. R., & Sekhri, S. (2021) · Groundwater for Sustainable Development · doi:10.1016/j.gsd.2021.100580 · Cited by 32
A bibliometric analysis of quantum computing literature: mapping and evidences from scopus
Wang, J., Shen, L., & Zhou, W. (2021) · Technology Analysis and Strategic Management · doi:10.1080/09537325.2021.1963429 · Cited by 37
Exploiting Long-Distance Interactions and Tolerating Atom Loss in Neutral Atom Quantum Architectures
Baker, J. M., Litteken, A., Duckering, C., Hoffmann, H., Bernien, H., & Chong, F. T. (2021) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca52012.2021.00069 · Cited by 42
Atomic cross-chain settlement model for central banks digital currency
Lee, Y., Son, B., Jang, H., Byun, J., Yoon, T., & Lee, J. (2021) · Information Sciences · doi:10.1016/j.ins.2021.09.040 · Cited by 32
Lee, W.-K., Jang, K., Song, G., Kim, H., Hwang, S., & Seo, H. (2021) · IEEE Access · doi:10.1109/access.2022.3179970 · Cited by 27
Twist: sound reasoning for purity and entanglement in Quantum programs
Yuan, C., McNally, C. M., & Carbin, M. (2022) · Proceedings of the ACM on Programming Languages · doi:10.1145/3498691 · Cited by 33
Simplified MITM Modeling for Permutations: New (Quantum) Attacks
Schrottenloher, A., & Stevens, M. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-15982-4_24 · Cited by 31
Exact solution for the quantum and private capacities of bosonic dephasing channels
Lami, L., & Wilde, M. M. (2023) · Nature Photonics · doi:10.1038/s41566-023-01190-4 · Cited by 38
Quantum reinforcement learning via policy iteration
Cherrat, E. A., Kerenidis, I., & Prakash, A. (2023) · Quantum Machine Intelligence · doi:10.1007/s42484-023-00116-1 · Cited by 42
Computational complexity and the genetic algorithm
Rylander, B., & Foster, J. A. (2001) · Cited by 31
Quantum asymmetric cryptography with symmetric keys
Gao, F., Wen, Q., Qin, S., et al. (2009) · Science in China. Series G, Physics, mechanics & astronomy/Science in China. Series G, Physics, Mechanics & Astronomy · doi:10.1007/s11433-009-0299-3 · Cited by 31
Phase matching in Grover's algorithm
Li, P., & Li, S. (2007) · Physics Letters A · doi:10.1016/j.physleta.2007.02.029 · Cited by 31
The geometry of quantum learning
Hunziker, M., Meyer, D., Park, J., Pommersheim, J., & Rothstein, M. J. (2009) · Quantum Information Processing · doi:10.1007/s11128-009-0129-6 · Cited by 35
Limitations of quantum coset states for graph isomorphism
Hallgren, S., Moore, C., Rötteler, M., Russell, A. C., & Sen, P. (2010) · Journal of the ACM · doi:10.1145/1857914.1857918 · Cited by 37
Logic Synthesis for Quantum State Generation
Niemann, P., Datta, R., & Wille, R. (2016) · IEEE International Symposium on Multiple-Valued Logic (ISMVL) · doi:10.1109/ismvl.2016.30 · Cited by 31
Quantum-Aided Multi-User Transmission in Non-Orthogonal Multiple Access Systems
Botsinis, P., Alanis, D., Babar, Z., Nguyen, H. V., Chandra, D., Ng, S. X., & Hanzo, L. (2016) · IEEE Access · doi:10.1109/access.2016.2591904 · Cited by 32
Search an unsorted database with quantum mechanics
Long, G., & Liu, Y. (2007) · Frontiers of Computer Science in China · doi:10.1007/s11704-007-0026-z · Cited by 31
Lower bounds for quantum communication complexity
Klauck, H. (2001) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959903 · Cited by 33
Proving Quantum Programs CorrectPreprint
Hietala, K., Rand, R., Hung, S.-H., Li, L., & Hicks, M. (2020) · arXiv (Cornell University) · doi:10.4230/lipics.itp.2021.21 · Cited by 54
Accelerated quantum Monte Carlo with probabilistic computers
Chowdhury, S., Camsari, K. Y., & Datta, S. (2023) · Communications Physics · doi:10.1038/s42005-023-01202-3 · Cited by 35
Quantum Machine Learning in Materials Prediction: A Case Study on ABO3 Perovskite Structures
Naseri, M., Gusarov, S., & Salahub, D. R. (2023) · The Journal of Physical Chemistry Letters · doi:10.1021/acs.jpclett.3c01703 · Cited by 32
Trends in Data Protection and Encryption Technologies
Mulder, V., Mermoud, A., Lenders, V., & Tellenbach, B. (2023) · Springer eBooks · doi:10.1007/978-3-031-33386-6 · Cited by 50
Solving the resource constrained project scheduling problem with quantum annealing
Armas, L. F. P., Creemers, S., & Deleplanque, S. (2024) · Scientific Reports · doi:10.1038/s41598-024-67168-6 · Cited by 39
Quantum Key Distribution-Assisted Image Encryption Using 7D and 2D Hyperchaotic Systems
Fauzyah, Z. A. N., Sambas, A., Adi, P. W., et al. (2025) · Journal of Future Artificial Intelligence and Technologies · doi:10.62411/faith.3048-3719-93 · Cited by 30
Experimental quantum-enhanced kernel-based machine learning on a photonic processor
Yin, Z., Agresti, I., de Felice, G., Brown, D., Toumi, A., Pentangelo, C., Piacentini, S., Crespi, A., Ceccarelli, F., Osellame, R., et al. (2025) · Nature Photonics · doi:10.1038/s41566-025-01682-5 · Cited by 53
Quantum search with multiple walk steps per oracle query
Wong, T. G., & Ambainis, A. (2015) · Physical Review A · doi:10.1103/physreva.92.022338 · Cited by 30
Novel Quantum Proxy Signature without Entanglement
Xu, G. (2015) · International Journal of Theoretical Physics · doi:10.1007/s10773-014-2491-0 · Cited by 30
Mandrà, S., Guerreschi, G. G., & Aspuru‐Guzik, A. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/7/073003 · Cited by 32
Quantum Computing: Codebreaking and Beyond
Roetteler, M., & Svore, K. M. (2018) · IEEE Security & Privacy · doi:10.1109/msp.2018.3761710 · Cited by 30
Quantum Attacks Against Type-1 Generalized Feistel Ciphers and Applications to CAST-256
Ni, B., Ito, G., Dong, X., et al. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-35423-7_22 · Cited by 30
Dey, A., Dey, S., Bhattacharyya, S., Platoš, J., & Snåšel, V. (2019) · Applied Soft Computing · doi:10.1016/j.asoc.2019.106040 · Cited by 30
First experiences of teaching quantum computing
Carrascal, G., Barrio, A. A. D., & Botella, G. (2020) · The Journal of Supercomputing · doi:10.1007/s11227-020-03376-x · Cited by 30
Readout rebalancing for near-term quantum computers
Hicks, R., Bauer, C., & Nachman, B. P. (2021) · Physical Review A · doi:10.1103/physreva.103.022407 · Cited by 32
Evaluation of Quantum Cryptanalysis on SPECK
Anand, R., Maitra, A., & Mukhopadhyay, S. (2020) · International Conference on Cryptology in India · doi:10.1007/978-3-030-65277-7_18 · Cited by 26
Degeneracy and Its Impact on the Decoding of Sparse Quantum Codes
Fuentes, P., Martínez, J. E., Crespo, P. M., & Garcia‐Frias, J. (2021) · IEEE Access · doi:10.1109/access.2021.3089829 · Cited by 33
Ashhab, S. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.013091 · Cited by 34
Nematic bits and universal logic gates
Kos, Ž., & Dunkel, J. (2022) · Science Advances · doi:10.1126/sciadv.abp8371 · Cited by 32
Automating the Comparison of Quantum Compilers for Quantum Circuits
Salm, M., Barzen, J., Leymann, F., Weder, B., & Wild, K. (2021) · Communications in computer and information science · doi:10.1007/978-3-030-87568-8_4 · Cited by 31
Bit-Slicing the Hilbert Space: Scaling Up Accurate Quantum Circuit Simulation
Tsai, Y.-H., Jiang, J.-H. R., & Jhang, C.-S. (2021) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac18074.2021.9586191 · Cited by 30
Optimal compression of quantum many-body time evolution operators into brickwall circuits
Tepaske, M. S. J., Hahn, D., & Luitz, D. J. (2023) · SciPost Physics · doi:10.21468/scipostphys.14.4.073 · Cited by 36
Quantum Image Encryption Based on Quantum DNA Codec and Pixel-Level Scrambling
Gao, J., Wang, Y., Song, Z., & Wang, S. (2023) · Entropy · doi:10.3390/e25060865 · Cited by 31
Hierarchy and equivalence of multi-letter quantum finite automata
Qiu, D., & Yü, S. (2009) · Theoretical Computer Science · doi:10.1016/j.tcs.2009.03.040 · Cited by 28
Randomized and quantum algorithms yield a speed-up for initial-value problems
Kacewicz, B. Z. (2004) · Journal of Complexity · doi:10.1016/j.jco.2004.05.002 · Cited by 30
Quantum learning by measurement and feedback
Gammelmark, S., & Mølmer, K. (2009) · New Journal of Physics · doi:10.1088/1367-2630/11/3/033017 · Cited by 30
Quantum versus classical learnability
Servedio, R. A., & Gortler, S. J. (2002) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.2001.933881 · Cited by 38
On the power of quantum proofs
Raz, R., & Shpilka, A. (2004) · doi:10.1109/ccc.2004.21 · Cited by 33
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
