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 701–800 of 8,792
Beyond Bits: A Review of Quantum Embedding Techniques for Efficient Information Processing
Khan, M. A., Aman, M. N., & Sikdar, B. (2024) · IEEE Access · doi:10.1109/access.2024.3382150 · Cited by 67
Cybersecurity in Critical Infrastructures: A Post-Quantum Cryptography Perspective
del Moral, J. O., iOlius, A. D., Vidal, G., Crespo, P. M., & Martínez, J. E. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2024.3410702 · Cited by 76
Quantum cryptography and its applications over the internet
Chen, C., Zeng, G.-J., Lin, F.-J., Chou, Y., & Chao, H. (2015) · IEEE Network · doi:10.1109/mnet.2015.7293307 · Cited by 59
A quantum approach to homomorphic encryption
Tan, S.-H., Kettlewell, J. A., Ouyang, Y., Chen, L., & Fitzsimons, J. F. (2016) · Scientific Reports · doi:10.1038/srep33467 · Cited by 74
Grassl, M., Geiselmann, W., & Beth, T. (1999) · Lecture notes in computer science · doi:10.1007/3-540-46796-3_23 · Cited by 57
Post-Quantum Cryptography: State of the Art
Buchmann, J. A., Butin, D., Göpfert, F., & Petzoldt, A. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-49301-4_6 · Cited by 65
Variational learning of Grover's quantum search algorithm
Morales, M. E. S., Tlyachev, T., & Biamonte, J. (2018) · Physical Review A · doi:10.1103/physreva.98.062333 · Cited by 57
Quantum Collision Attacks on AES-Like Hashing with Low Quantum Random Access Memories
Dong, X., Sun, S., Shi, D., Gao, F., Wang, X., & Hu, L. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-64834-3_25 · Cited by 58
A quantum approach to homomorphic encryption
Tan, S. H., Kettlewell, J. A., Ouyang, Y., Chen, L., & Fitzsimons, J. F. (2016) · White Rose Research Online (University of Leeds, The University of Sheffield, University of York) · Cited by 57
Quantum switching and quantum merge sorting
Cheng, S.-T., & Wang, C.-Y. (2006) · IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications · doi:10.1109/tcsi.2005.856669 · Cited by 57
Quantum communications: explained for communication engineers
Imre, S. (2013) · IEEE Communications Magazine · doi:10.1109/mcom.2013.6576335 · Cited by 57
Sanders, J. W., & Zuliani, P. (2000) · Lecture notes in computer science · doi:10.1007/10722010_6 · Cited by 166
Resilience of Quantum Random Access Memory to Generic Noise
Hann, C. T., Lee, G., Girvin, S. M., & Jiang, L. (2021) · University of Chicago · doi:10.6082/027wm-z2x67 · Cited by 57
Qu, Z., Meng, Y., Liu, B., Muhammad, G., & Tiwari, P. (2023) · IEEE Internet of Things Journal · doi:10.1109/jiot.2023.3285388 · Cited by 59
A Quantum-Resistant Blockchain System: A Comparative Analysis
Thanalakshmi, P., Rishikhesh, A., Marceline, J. M., Joshi, G. P., & Cho, W. (2023) · Mathematics · doi:10.3390/math11183947 · Cited by 59
Efficient optimization with higher-order Ising machines
Bybee, C., Kleyko, D. V., Nikonov, D. E., Khosrowshahi, A., Olshausen, B. A., & Sommer, F. T. (2023) · Nature Communications · doi:10.1038/s41467-023-41214-9 · Cited by 70
A Quantum-Inspired Immune Algorithm for Hybrid Flow Shop with Makespan Criterion
Niu, Q., Ma, S., & Zhou, T. (2020) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.3217/jucs-015-04-0765 · Cited by 56
Coined quantum walks lift the cospectrality of graphs and trees
Emms, D., Simone Severini, B., Wilson, R. C., & Hancock, E. R. (2008) · Pattern Recognition · doi:10.1016/j.patcog.2008.10.025 · Cited by 58
Global and Local Translation Designs of Quantum Image Based on FRQI
Zhou, R., Tan, C., & Ian, H. (2017) · International Journal of Theoretical Physics · doi:10.1007/s10773-017-3279-9 · Cited by 57
A new real-coded quantum-inspired evolutionary algorithm for continuous optimization
Talbi, H., & Draa, A. (2017) · Applied Soft Computing · doi:10.1016/j.asoc.2017.07.046 · Cited by 57
Oracle separation of BQP and PH
Raz, R., & Tal, A. (2019) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3313276.3316315 · Cited by 61
Reverse quantum annealing of the p -spin model with relaxation
Passarelli, G., Yip, K.-W., Lidar, D. A., Nishimori, H., & Lucignano, P. (2020) · Physical Review A · doi:10.1103/physreva.101.022331 · Cited by 55
Lattice-Gas Quantum Computation
Yepez, J. (1998) · International Journal of Modern Physics C · doi:10.1142/s0129183198001436 · Cited by 56
Single quantum querying of a database
Terhal, B. M., & Smolin, J. A. (1998) · Physical Review A · doi:10.1103/physreva.58.1822 · Cited by 58
The Hidden Subgroup Problem - Review and Open ProblemsPreprint
Lomont, C. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0411037 · Cited by 99
Privacy-preserving Quantum Sealed-bid Auction Based on Grover’s Search Algorithm
Shi, R., & Zhang, M. (2019) · Scientific Reports · doi:10.1038/s41598-019-44030-8 · Cited by 55
Lin, A. (2019) · WikiJournal of Science · doi:10.15347/wjs/2019.005 · Cited by 55
Quantum computing for future real-time building HVAC controls
Deng, Z., Wang, X., & Dong, B. (2023) · Applied Energy · doi:10.1016/j.apenergy.2022.120621 · Cited by 59
Probabilistic bisimulations for quantum processes
Feng, Y., Duan, R., Ji, Z., & Ying, M. (2007) · Information and Computation · doi:10.1016/j.ic.2007.08.001 · Cited by 62
A quantum genetic algorithm with quantum crossover and mutation operations
SaiToh, A., Rahimi, R., & Nakahara, M. (2013) · Quantum Information Processing · doi:10.1007/s11128-013-0686-6 · Cited by 55
The quantum communication complexity of sampling
Ambainis, A., Schulman, L. J., Ta‐Shma, A., Vazirani, U. V., & Wigderson, A. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1998.743480 · Cited by 55
Estimating the Security of Lattice-based Cryptosystems.Preprint
Rückert, M., & Schneider, M. (2010) · IACR Cryptology ePrint Archive · Cited by 55
Communication Lower Bounds Using Directional Derivatives
Sherstov, A. A. (2014) · Journal of the ACM · doi:10.1145/2629334 · Cited by 54
Efficient Implementation of PRESENT and GIFT on Quantum Computers
Jang, K., Song, G., Kim, H., Kwon, H., Kim, H., & Seo, H. (2021) · Applied Sciences · doi:10.3390/app11114776 · Cited by 54
Shaping the Future of the Application of Quantum Computing in Intelligent Transportation System
Wang, S., Pei, Z., Wang, C., & Wu, J. (2021) · Intelligent and Converged Networks · doi:10.23919/icn.2021.0019 · Cited by 57
Hybrid Quantum-Classical Neural Networks
Arthur, D., & Date, P. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00023 · Cited by 59
Demonstration of three- and four-body interactions between trapped-ion spins
Katz, O., Feng, L., Risinger, A., Monroe, C. R., & Cetina, M. (2023) · Nature Physics · doi:10.1038/s41567-023-02102-7 · Cited by 65
A Perspective on Protein Structure Prediction Using Quantum Computers
Doğa, H., Raubenolt, B. A., Cumbo, F., Joshi, J., DiFilippo, F. P., Qin, J., Blankenberg, D. J., & Shehab, O. (2024) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.4c00067 · Cited by 67
Quantum Walk Computing: Theory, Implementation, and Application
Qiang, X., Ma, S., & Song, H. (2024) · Intelligent Computing · doi:10.34133/icomputing.0097 · Cited by 75
A Flexible Representation and Invertible Transformations for Images on Quantum Computers
Le, P. Q., Iliyasu, A. M., Dong, F., & Hirota, K. (2011) · Studies in computational intelligence · doi:10.1007/978-3-642-11739-8_9 · Cited by 53
Quantum annealing: The fastest route to quantum computation?
Laumann, C. R., Moessner, R., Scardicchio, A., & Sondhi, S. L. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02344-2 · Cited by 54
Realizing reversible circuits using a new class of quantum gates
Sasanian, Z., Wille, R., & Miller, D. M. (2012) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/2228360.2228368 · Cited by 54
Trojan-horse attacks on quantum key distribution with classical Bob
Yang, Y., Sun, S.-J., & Zhao, Q. (2014) · Quantum Information Processing · doi:10.1007/s11128-014-0872-1 · Cited by 54
Why genetic information processing could have a quantum basis
Patel, A. (2001) · Journal of Biosciences · doi:10.1007/bf02703638 · Cited by 54
An efficient quantum scheme for Private Set Intersection
Shi, R., Mu, Y., Zhong, H., et al. (2015) · Quantum Information Processing · doi:10.1007/s11128-015-1165-z · Cited by 54
LIGHTER-R: Optimized Reversible Circuit Implementation For SBoxes
Dasu, V. A., Baksi, A., Sarkar, S., et al. (2019) · IEEE International System-on-Chip Conference (SOCC) · doi:10.1109/socc46988.2019.1570548320 · Cited by 54
Universal quantum simulation of single-qubit nonunitary operators using duality quantum algorithm
Zheng, C. (2021) · Scientific Reports · doi:10.1038/s41598-021-83521-5 · Cited by 54
Bonnetain, X., Leurent, G., Naya‐Plasencia, M., & Schrottenloher, A. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92062-3_15 · Cited by 55
Almost uniform sampling via quantum walks
Richter, P. C. (2007) · New Journal of Physics · doi:10.1088/1367-2630/9/3/072 · Cited by 56
A Near-Term Quantum Computing Approach for Hard Computational Problems in Space ExplorationPreprint
Smelyanskiy, V., Rieffel, E. G., Knysh, S., Williams, C. P., Johnson, M. W., Thom, M. C., Macready, W. G., & Pudenz, K. L. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1204.2821 · Cited by 74
Probabilistic Model--Checking of Quantum ProtocolsPreprint
Gay, S. J., Nagarajan, R., & Papanikolaou, N. K. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0504007 · Cited by 68
Constructing Algorithms for Constraint Satisfaction and Related Problems : Methods and Applications
Angelsmark, O. (2005) · DiVA (Linkoping University) · Cited by 54
Fixed-Complexity Quantum-Assisted Multi-User Detection for CDMA and SDMA
Botsinis, P., Ng, S. X., & Hanzo, L. (2014) · IEEE Transactions on Communications · doi:10.1109/tcomm.2014.012514.130615 · Cited by 52
A review on reversible quantum adders
Orts, F. J., Ortega, G., Combarro, E. F., & Garzón, E. M. (2020) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2020.102810 · Cited by 54
Enhancing IoT security in smart grids with quantum-resistant hybrid encryption
Xiong, J., Shen, L., Liu, Y. B., & Fang, X. (2025) · Scientific Reports · doi:10.1038/s41598-024-84427-8 · Cited by 64
QRDA: Quantum Representation of Digital Audio
Wang, J. (2015) · International Journal of Theoretical Physics · doi:10.1007/s10773-015-2800-2 · Cited by 52
Barz, S. (2015) · Journal of Physics B Atomic Molecular and Optical Physics · doi:10.1088/0953-4075/48/8/083001 · Cited by 56
Ozols, M., Roetteler, M., & Roland, J. (2013) · ACM Transactions on Computation Theory · doi:10.1145/2493252.2493256 · Cited by 60
Quantum image edge extraction based on classical Sobel operator for NEQR
Fan, P., Zhou, R., Hu, W., & Jing, N. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-2131-3 · Cited by 53
Improved Quantum Communication Complexity Bounds for Disjointness and Equality
Høyer, P., & de Wolf, R. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45841-7_24 · Cited by 58
Quantum associative memory with distributed queries
Ezhov, A. A., Nifanova, A. V., & Ventura, D. A. (2000) · Information Sciences · doi:10.1016/s0020-0255(00)00057-8 · Cited by 53
Undecidability on quantum finite automata
Amano, M., & Iwama, K. (1999) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/301250.301344 · Cited by 53
Counting, fanout and the complexity of quantum ACC
Green, F., Homer, S., Moore, C., & Pollett, C. (2002) · Quantum Information and Computation · doi:10.26421/qic2.1-3 · Cited by 51
Communication Links for Distributed Quantum Computation
Meter, R. V., Nemoto, K., & Munro, W. J. (2007) · IEEE Transactions on Computers · doi:10.1109/tc.2007.70775 · Cited by 52
Philosophical Aspects of Quantum Information TheoryPreprint
Timpson, C. G. (2016) · arXiv (Cornell University) · doi:10.4324/9781315612676-9 · Cited by 54
Machine learning \& artificial intelligence in the quantum domainPreprint
Dunjko, V., & Briegel, H. J. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1709.02779 · Cited by 54
Quantum Computing: An Overview Across the System StackPreprint
Resch, S., & Karpuzcu, U. R. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.07240 · Cited by 94
Artificial dreams: the quest for non-biological intelligence
(2008) · Choice Reviews Online · doi:10.5860/choice.46-1526 · Cited by 53
Reversible Circuits: Recent Accomplishments and Future Challenges for an Emerging Technology
Drechsler, R., & Wille, R. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-31494-0_53 · Cited by 52
Quantum Collision Attacks on Reduced SHA-256 and SHA-512
Hosoyamada, A., & Sasaki, Y. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-84242-0_22 · Cited by 52
Implementing evolutionary optimization on actual quantum processors
Acampora, G., & Vitiello, A. (2021) · Information Sciences · doi:10.1016/j.ins.2021.06.049 · Cited by 54
M-SIDH and MD-SIDH: Countering SIDH Attacks by Masking Information
Fouotsa, T. B., Moriya, T., & Petit, C. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-30589-4_10 · Cited by 54
Opportunities and Challenges of Quantum Computing for Engineering Optimization
Wang, Y., Kim, J. E., & Suresh, K. (2023) · Journal of Computing and Information Science in Engineering · doi:10.1115/1.4062969 · Cited by 55
Performance Analysis of Post-Quantum Cryptography Algorithms for Digital Signature
Opiłka, F., Niemiec, M., Gagliardi, M., & Kourtis, M. A. (2024) · Applied Sciences · doi:10.3390/app14124994 · Cited by 52
Ponnuru, R. B., Kumar, S., Reddy, A. G., & Das, A. K. (2024) · Computer Science Review · doi:10.1016/j.cosrev.2024.100676 · Cited by 60
Some attacks on quantum-based cryptographic protocols
Lo, H., & Ko, T.-M. (2005) · Quantum Information and Computation · doi:10.26421/qic5.1-4 · Cited by 52
Ying, M., & Feng, Y. (2010) · Acta Informatica · doi:10.1007/s00236-010-0117-4 · Cited by 51
A “Medium-Field” Multivariate Public-Key Encryption Scheme
Wang, L.-C., Yang, B., Hu, Y.-H., & Lai, F. (2005) · Lecture notes in computer science · doi:10.1007/11605805_9 · Cited by 52
Eigenpath traversal by phase randomization
Boixo, S., Knill, E., & Somma, R. D. (2009) · Quantum Information and Computation · doi:10.26421/qic9.9-10-7 · Cited by 74
Faster search by lackadaisical quantum walk
Wong, T. G. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-1840-y · Cited by 51
Correlation and coherence in quantum-dot cellular automata
Tóth, G. (2000) · Cited by 52
Integrating Quantum Computing into Workflow Modeling and Execution
Weder, B., Breitenbücher, U., Leymann, F., & Wild, K. (2020) · IEEE/ACM International Conference on Utility and Cloud Computing (UCC) · doi:10.1109/ucc48980.2020.00046 · Cited by 61
Quantum computer simulation using the CUDA programming model
Gutiérrez, E., Romero, S., Trenas, M. A., & Zapata, E. L. (2009) · Computer Physics Communications · doi:10.1016/j.cpc.2009.09.021 · Cited by 50
A Parallel Quantum Computer SimulatorPreprint
Obenland, K., & Despain, A. M. (1998) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9804039 · Cited by 61
Stateless Hash-Based Digital Signature Standard
(2023) · doi:10.6028/nist.fips.205.ipd · Cited by 58
RetractedA study of the performance of classical minimizers in the Quantum Approximate Optimization Algorithm
Fernández-Pendás, M., Combarro, E. F., Vallecorsa, S., Ranilla, J., & Rúa, I. F. (2022) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2021.113388 · Cited by 52
Can artificial intelligence benefit from quantum computing?
Moret‐Bonillo, V. (2014) · Progress in Artificial Intelligence · doi:10.1007/s13748-014-0059-0 · Cited by 51
Quantum Voting Scheme Based on Locally Indistinguishable Orthogonal Product States
Jiang, D., Wang, J., Liang, X.-Q., et al. (2019) · International Journal of Theoretical Physics · doi:10.1007/s10773-019-04337-8 · Cited by 51
Security Comparisons and Performance Analyses of Post-quantum Signature Algorithms
Raavi, M., Wuthier, S., Chandramouli, P., Balytskyi, Y., Zhou, X., & Chang, S. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-78375-4_17 · Cited by 62
Hybrid Quantum Benders’ Decomposition For Mixed-integer Linear Programming
Zhao, Z., Fan, L., & Han, Z. (2022) · IEEE Wireless Communications and Networking Conference · doi:10.1109/wcnc51071.2022.9771632 · Cited by 51
Novel quantum circuit implementation of Advanced Encryption Standard with low costs
Li, Z., Cai, B., Sun, H.-W., Liu, H., Wan, L., Qin, S., Wen, Q., & Gao, F. (2022) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-022-1921-y · Cited by 51
AutoComm: A Framework for Enabling Efficient Communication in Distributed Quantum Programs
Wu, A., Zhang, H., Li, G., Shabani, A., Xie, Y., & Ding, Y. (2022) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1109/micro56248.2022.00074 · Cited by 68
Quantum computing in bioinformatics: a systematic review mapping
Nałęcz-Charkiewicz, K., Charkiewicz, K., & Nowak, R. M. (2024) · Briefings in Bioinformatics · doi:10.1093/bib/bbae391 · Cited by 54
Quantum Theory, Namely the Pure and Reversible Theory of Information
Chiribella, G., D’Ariano, G. M., & Perinotti, P. (2012) · Entropy · doi:10.3390/e14101877 · Cited by 51
Benchmarking Neural Networks For Quantum Computations
Nguyen, N. H., Behrman, E., Moustafa, M. A., & Steck, J. E. (2019) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2019.2933394 · Cited by 54
Quantum Algorithms for Portfolio Optimization
Kerenidis, I., Prakash, A., & Szilágyi, D. (2019) · ACM Conference on Advances in Financial Technologies (AFT) · doi:10.1145/3318041.3355465 · Cited by 52
Quantum Image Watermarking Algorithm Based on Haar Wavelet Transform
Hu, W., Zhou, R., El-Rafei, A., & Jiang, S.-X. (2019) · IEEE Access · doi:10.1109/access.2019.2937390 · Cited by 53
Quantum Programming Language: A Systematic Review of Research Topic and Top Cited Languages
Garhwal, S., Ghorani, M., & Ahmad, A. (2019) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-019-09372-6 · Cited by 50
Anand, R., Maitra, A., & Mukhopadhyay, S. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02844-w · Cited by 53
Towards a Quantum Software Modeling Language
Pérez-Delgado, C. A., & Pérez‐González, H. G. (2020) · doi:10.1145/3387940.3392183 · Cited by 55
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
