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 3,401–3,500 of 8,792
Sponge-Based Authenticated Encryption: Security Against Quantum Attackers
Janson, C., & Struck, P. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-17234-2_12 · Cited by 7
Secure Smart Grids: Based on Post-Quantum Blockchain
Khan, B., Haq, I. U., Rana, S., & Rasheed, H. U. (2022) · International Bhurban Conference on Applied Sciences and Technology (IBCAST) · doi:10.1109/ibcast54850.2022.9990096 · Cited by 8
Quantum hybrid algorithm for solving SAT problem
Moudina, C. V., Fendji, J. L. E. K., Njafa, J.-P. T., & Atemkeng, M. (2023) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2023.106058 · Cited by 7
SEQUENT: Towards Traceable Quantum Machine Learning Using Sequential Quantum Enhanced Training
Altmann, P. J., Sünkel, L., Stein, J., Müller, T., Roch, C., & Linnhoff–Popien, C. (2023) · International Conference on Agents and Artificial Intelligence (ICAART) · doi:10.5220/0011772400003393 · Cited by 7
Quantum Binary Field Multiplication with Optimized Toffoli Depth and Extension to Quantum Inversion
Jang, K., Kim, W., Lim, S., Kang, Y., Yang, Y., & Seo, H. (2023) · Sensors · doi:10.3390/s23063156 · Cited by 7
Bandit Algorithm Driven by a Classical Random Walk and a Quantum Walk
Yamagami, T., Segawa, E., Mihana, T., Röhm, A., Horisaki, R., & Naruse, M. (2023) · Entropy · doi:10.3390/e25060843 · Cited by 8
Edge-assisted quantum protocol for secure multiparty logical AND its applications
Shi, R., & Fang, X.-Q. (2023) · iScience · doi:10.1016/j.isci.2023.106990 · Cited by 7
Slysz, M., Kurowski, K., Waligóra, G., & Węglarz, J. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-36030-5_15 · Cited by 8
Shortcuts to adiabaticity in superconducting circuits for fast multi-partite state generation
Cárdenas-López, F. A., Retamal, J. C., & Chen, X. (2023) · Communications Physics · doi:10.1038/s42005-023-01283-0 · Cited by 7
Quantum String Matching Unfolded and Extended
Cantone, D. A., Faro, S., & Pavone, A. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-38100-3_9 · Cited by 8
Li, M., Song, X., & El‐Latif, A. A. A. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04092-0 · Cited by 7
Zardini, E., Blanzieri, E., & Pastorello, D. (2023) · PLoS ONE · doi:10.1371/journal.pone.0287869 · Cited by 7
Cutting-Edge Trajectory Optimization through Quantum Annealing
Carbone, A., Grossi, F. D., & Spiller, D. (2023) · Applied Sciences · doi:10.3390/app132312853 · Cited by 7
A quantum approach for digital signal processing
Shukla, A., & Vedula, P. (2023) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-023-04730-7 · Cited by 7
Prokop, M., Wallden, P., & Joseph, D. (2024) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2024.3501683 · Cited by 7
The topology of data hides in quantum thermal states
Scali, S., Umeano, C., & Kyriienko, O. (2024) · APL Quantum · doi:10.1063/5.0209201 · Cited by 15
Schalkers, M. A., Dankers, K., Wimmer, M., & Vermaas, P. E. (2024) · Physics Education · doi:10.1088/1361-6552/ad2976 · Cited by 7
Implementation of Grover’s Iterator for Quantum Searching With an Arbitrary Number of Qubits
Lee, S., & Nam, S. (2024) · IEEE Access · doi:10.1109/access.2024.3380198 · Cited by 7
The Road to Near-Capacity CV-QKD Reconciliation: An FEC-Agnostic Design
Liu, X., Xu, C., Noori, Y. J., Ng, S. X., & Hanzo, L. (2024) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2024.3382225 · Cited by 8
Narayanan, A. K., Qiao, Y., & Tang, G. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-58734-4_6 · Cited by 9
Quantum implementation of SHA1 and MD5 and comparison with classical algorithms
Das, P., Biswas, S., & Kanoo, S. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04396-9 · Cited by 7
Balanced quantum neural architecture search
Li, Y., Liu, G., Zhao, P., Shang, R., & Jiao, L. (2024) · Neurocomputing · doi:10.1016/j.neucom.2024.127860 · Cited by 8
Quantum Approximate Optimization Algorithm for Maximum Likelihood Detection in Massive MIMO
Liu, Y., Meng, F., Li, Z., Yu, X., & Zhang, Z. (2024) · IEEE Wireless Communications and Networking Conference · doi:10.1109/wcnc57260.2024.10571165 · Cited by 9
Gate Branch Coverage: A Metric for Quantum Software Testing
Fortunato, D., Campos, J., & Abreu, R. (2024) · doi:10.1145/3663531.3664753 · Cited by 7
Secure multiparty quantum computation for summation and data sorting
Li, X., Xiong, Y., & Zhang, C. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04528-1 · Cited by 7
Securing the Internet of Things with Ascon-Sign
Magyari, A., & Chen, Y. (2024) · Internet of Things · doi:10.1016/j.iot.2024.101394 · Cited by 7
Exploring AES Encryption Implementation Through Quantum Computing Techniques
Gorine, A., & Suhaib, M. (2024) · American Journal of Computer Science and Technology · doi:10.11648/j.ajcst.20240704.12 · Cited by 8
Grover Speedup from Many Forms of the Zeno Effect
Berwald, J., Chancellor, N., & Dridi, R. (2024) · Quantum · doi:10.22331/q-2024-11-20-1532 · Cited by 11
Termanova, A., Melnikov, A. A., Mamenchikov, E., Belokonev, N., Dolgov, S., Berezutskii, A. V., Ellerbrock, R., Mansell, C., & Perelshtein, M. R. (2024) · New Journal of Physics · doi:10.1088/1367-2630/ad985b · Cited by 7
Reducing the Number of Qubits in Quantum Information Set Decoding
Chevignard, C., Fouque, P.-A., & Schrottenloher, A. (2024) · Lecture notes in computer science · doi:10.1007/978-981-96-0944-4_10 · Cited by 7
A Highly Hardware Efficient ML-KEM Accelerator with Optimised Architectural Layers
Ni, Z., Khalid, A., Liu, W., et al. (2024) · ACM Transactions on Embedded Computing Systems · doi:10.1145/3708469 · Cited by 7
Hybrid Quantum-inspired Evolutionary Neural Networks for Intrusion Detection System
Kuo, S., Shen, J., Liu, C., et al. (2024) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/smc54092.2024.10831208 · Cited by 7
Oldfield, N. H., Laaber, C., Yue, T., & Ali, S. (2025) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3714468 · Cited by 11
Teleporting two-qubit entanglement across 19 qubits on a superconducting quantum computer
Kang, H., Kam, J. F., Mooney, G. J., & Hollenberg, L. C. L. (2025) · Physical Review Applied · doi:10.1103/physrevapplied.23.014057 · Cited by 10
Research on Development Progress and Test Evaluation of Post-Quantum Cryptography
Zhang, M., Wang, J., Lai, J., et al. (2025) · Entropy · doi:10.3390/e27020212 · Cited by 7
Hacking Cryptographic Protocols with Advanced Variational Quantum Attacks
Aizpurua, B., Bermejo, P., Martínez, J. E., & Orús, R. (2025) · ACM Transactions on Quantum Computing · doi:10.1145/3718349 · Cited by 13
Huang, Z., Zhang, F., & Lin, D. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-91107-1_6 · Cited by 7
Post-Quantum Key Exchange and ID Encryption Analyses for 5G Mobile Networking
Khan, Q., Purification, S., & Chang, S. (2025) · IEEE Network Operations and Management Symposium (NOMS) · doi:10.1109/noms57970.2025.11073683 · Cited by 7
Dynamic Quantum Circuit Compilation
Fang, K., Zhang, M., Shi, R., & Li, Y. (2025) · IEEE Transactions on Computers · doi:10.1109/tc.2025.3643826 · Cited by 21
Quantum Intelligent Mobile System
Chen, C., & Dong, D. (2008) · Studies in computational intelligence · doi:10.1007/978-3-540-78532-3_4 · Cited by 9
New Maximally Entangled States and Pattern Classification in Two-Qubit System
Singh, M. P., & Rajput, B. S. (2014) · International Journal of Theoretical Physics · doi:10.1007/s10773-014-2120-y · Cited by 7
How Low can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions?
Ambainis, A., & de Wolf, R. (2014) · Computational Complexity · doi:10.1007/s00037-014-0083-2 · Cited by 10
Optimized methods for inserting and deleting records and data retrieving in quantum database
Gueddana, A., Chatta, R., & Boudriga, N. A. (2010) · International Conference on Transparent Optical Networks · doi:10.1109/icton.2010.5549171 · Cited by 7
Artificial intelligence and a universal quantum computer
Wichert, A. (2016) · AI Communications · doi:10.3233/aic-160699 · Cited by 7
Quantum Computing and Its Potential for Turbulence Simulations
Sammak, S., Nouri, A. G., Ansari, N., & Givi, P. (2015) · Communications in computer and information science · doi:10.1007/978-3-319-25058-8_13 · Cited by 7
Lukáč, M., Kameyama, M., Miller, D. M., & Perkowski, M. A. (2012) · Cited by 7
Progress, status, and prospects of superconducting qubits for quantum computing
Steffen, M., Gambetta, J., & Chow, J. M. (2016) · European Solid-State Device Research Conference · doi:10.1109/essderc.2016.7599578 · Cited by 7
Szepieniec, A., Beullens, W., & Bart Preneel, A. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59879-6_13 · Cited by 7
An Efficient Code Based Digital Signature Algorithm.
Ren, F., Zheng, D., & Wang, W. (2017) · Cited by 7
The Computer for the 21st Century: Security & Privacy Challenges after 25 Years
Oliveira, L. B., Pereira, F. M. Q., Misoczki, R., Aranha, D. F., Borges, F., & Liu, J. (2017) · International Conference on Computer Communications and Networks (ICCCN) · doi:10.1109/icccn.2017.8038394 · Cited by 7
Parallel simulation of Shor's and Grover's algorithms in the distributed geometric machine
Ávila, A., Reiser, R., Yamin, A., & Pilla, M. L. (2017) · International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD) · doi:10.1109/fskd.2017.8393304 · Cited by 7
Two quantum protocols for secure hamming distance computation
Peng, Z., Shi, R., Wang, P.-H., et al. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-2140-2 · Cited by 7
DAGS: Reloaded Revisiting Dyadic Key Encapsulation
Banegas, G., Barreto, P. S. L. M., Boidje, B. O., et al. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-25922-8_4 · Cited by 7
Efficient approximation of diagonal unitaries over the Clifford+T basis
Welch, J., Bocharov, A., & Svore, K. M. (2016) · Quantum Information and Computation · doi:10.26421/qic16.1-2-6 · Cited by 9
Using Grover's search quantum algorithm to solve Boolean satisfiability problems: Part I
Fernandes, D., & Dutra, I. (2019) · XRDS Crossroads The ACM Magazine for Students · doi:10.1145/3358251 · Cited by 7
Mapping a Quantum Circuit to 2D Nearest Neighbor Architecture by Changing the Gate Order
Hattori, W., & Yamashita, S. (2019) · IEICE Transactions on Information and Systems · doi:10.1587/transinf.2018edp7439 · Cited by 7
Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving
Apers, S., & de Wolf, R. (2022) · SIAM Journal on Computing · doi:10.1137/21m1391018 · Cited by 25
Generalization of Deutsch’s Algorithm
Nagata, K., & Nakamura, T. (2020) · International Journal of Theoretical Physics · doi:10.1007/s10773-020-04522-0 · Cited by 7
Quantum Computation and Its Effects in Database Systems
Jóczik, S., & Kiss, A. (2020) · Communications in computer and information science · doi:10.1007/978-3-030-54623-6_2 · Cited by 8
Design of a novel quantum neural network
Niu, X.-F., & Ma, W. (2020) · Laser Physics Letters · doi:10.1088/1612-202x/abaf58 · Cited by 7
Two-Dimensional Quantum Genetic Algorithm: Application to Task Allocation Problem
Mondal, S., & Tsourdos, A. (2021) · Sensors · doi:10.3390/s21041251 · Cited by 7
Non-Invertible Public Key Certificates
Lizama-Pérez, L. A., & R., J. M. L. (2021) · Entropy · doi:10.3390/e23020226 · Cited by 7
A New Quantum Payment Protocol Based on a Set of Local Indistinguishable Orthogonal Product States
Lin, M.-M., Xue, D.-W., Wang, Y., et al. (2021) · International Journal of Theoretical Physics · doi:10.1007/s10773-021-04749-5 · Cited by 7
Improved Quantum Algorithms for the k-XOR Problem
Schrottenloher, A. (2022) · Lecture notes in computer science · doi:10.1007/978-3-030-99277-4_15 · Cited by 7
High-Performance Systolic Array Montgomery Multiplier for SIKE
Ni, Z., Kundi, D., O'Neill, M. P., & Liu, W. (2021) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas51556.2021.9401062 · Cited by 7
Atchade-Adelomou, P., Alonso-Linaje, G., Albó-Canals, J., & Casado-Faulí, D. (2021) · Algorithms · doi:10.3390/a14070194 · Cited by 9
Dynamical Uncertainty Propagation with Noisy Quantum Parameters
Dalgaard, M., Weidner, C. A., & Motzoi, F. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.150503 · Cited by 7
Quantum learning theory: A classical perspective for quantum image
Singh, S., Pandian, M. T., Aggarwal, A. K., Awasthi, S. P., Bhardwaj, H., & Pruthi, J. (2021) · Materials Today Proceedings · doi:10.1016/j.matpr.2021.07.039 · Cited by 8
Estimating Gibbs partition function with quantum Clifford sampling
Wu, Y., & Wang, J. B. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac47f0 · Cited by 10
Flórez-Gutiérrez, A., Leurent, G., Naya‐Plasencia, M., Perrin, L. P., Schrottenloher, A., & Sibleyras, F. (2021) · Journal of Cryptology · doi:10.1007/s00145-021-09413-z · Cited by 7
Towards Quantum Large-Scale Password Guessing on Real-World Distributions
Dürmuth, M., Golla, M., Markert, P., May, A., & Schlieper, L. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92548-2_22 · Cited by 8
Liu, L., Guo, F.-Z., & Wen, Q. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03329-0 · Cited by 7
Ntalaperas, D., & Konofaos, N. (2021) · Technologies · doi:10.3390/technologies10010001 · Cited by 7
Quantum pulse coupled neural network
Wang, Z., Xu, M., & Zhang, Y. (2022) · Neural Networks · doi:10.1016/j.neunet.2022.04.007 · Cited by 7
A Grover based Quantum Algorithm for Finding Pure Nash Equilibria in Graphical Games
Roch, C., Castillo, S. L., & Linnhoff–Popien, C. (2022) · IEEE International Conference on Software Architecture Companion (ICSA-C) · doi:10.1109/icsa-c54293.2022.00036 · Cited by 7
An improved multiple populations quantum genetic algorithm
Niu, X.-F., & Ma, W. (2022) · Laser Physics Letters · doi:10.1088/1612-202x/ac8281 · Cited by 7
An optimizing method for performance and resource utilization in quantum machine learning circuits
Salehi, T., Moghadam, M. Z., Pławiak, P., Abbaszade, M., & Salari, V. (2022) · Scientific Reports · doi:10.1038/s41598-022-20375-5 · Cited by 8
Q-FW: A Hybrid Classical-Quantum Frank-Wolfe for Quadratic Binary Optimization
Yurtsever, A., Birdal, T., & Golyanik, V. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-20050-2_21 · Cited by 7
Quantum attacks against BBB secure PRFs or MACs built from public random permutations
Nan, J., Hu, H., Zhang, P., et al. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03774-5 · Cited by 7
Using Quantum Nodes Connected via the Quantum Cloud to Perform IoT Quantum Network
Subhi, D., & Bacsárdi, L. (2023) · Condensed Matter · doi:10.3390/condmat8010024 · Cited by 7
Basic Algorithms Quantum Cryptanalysis
Petrenko, A., & Petrenko, S. (2023) · Voprosy kiberbezopasnosti · doi:10.21681/2311-3456-2023-1-100-115 · Cited by 7
Novel optimization of quantum search algorithm to minimize complexity
Kumar, T., Kumar, D., & Singh, G. (2023) · Chinese Journal of Physics · doi:10.1016/j.cjph.2023.03.008 · Cited by 7
Quantum fingerprinting for heterogeneous devices localization
Shokry, A., & Youssef, M. A. (2023) · Computer Communications · doi:10.1016/j.comcom.2023.03.010 · Cited by 7
Quantum Computing Approaches for Vector Quantization—Current Perspectives and Developments
Engelsberger, A., & Villmann, T. (2023) · Entropy · doi:10.3390/e25030540 · Cited by 8
Quantum Computation by Biological Systems
D’Acunto, M. (2023) · IEEE Transactions on Molecular Biological and Multi-Scale Communications · doi:10.1109/tmbmc.2023.3272230 · Cited by 7
Zou, P., Jiao, J. R., & Zhou, F. (2023) · Journal of Engineering Design · doi:10.1080/09544828.2023.2188394 · Cited by 6
Extending the Design Space of Dynamic Quantum Circuits for Toffoli based Network
Kole, A., Deb, A., Datta, K., et al. (2023) · Design, Automation, and Test in Europe · doi:10.23919/date56975.2023.10137250 · Cited by 7
Chen, H., Li, Y., Abla, P., Li, Z., Jiao, L., & Wang, M. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-35486-1_19 · Cited by 7
Offline Quantum Reinforcement Learning in a Conservative Manner
Cheng, Z., Zhang, K., Shen, L., & Tao, D. (2023) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v37i6.25872 · Cited by 7
Post Quantum Cryptography Algorithms: A Review and Applications
Paul, B., & Trivedi, G. (2023) · Lecture notes in networks and systems · doi:10.1007/978-981-99-1912-3_1 · Cited by 10
Quantum optimisation for continuous multivariable functions by a structured search
Matwiejew, E., Pye, J., & Wang, J. B. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/ace6cc · Cited by 9
Post Quantum Implications on Private and Public Key Cryptography
Hegde, S. B., Jamuar, A., & Kulkarni, R. (2023) · International Conference on Smart Systems for Applications in Electrical Sciences (ICSSES) · doi:10.1109/icsses58299.2023.10199503 · Cited by 7
Solving some cryptanalytic problems for lattice-based cryptosystems with quantum annealing method
Lysakov, I. V. (2023) · Математические вопросы криптографии · doi:10.4213/mvk441 · Cited by 7
Quantum as a Service Architecture for Security in a Smart City
Barletta, V. S., Caivano, D., Lako, A., & Pal, A. (2023) · Communications in computer and information science · doi:10.1007/978-3-031-43703-8_6 · Cited by 7
Quantum circuit implementation and resource analysis of LBlock and LiCi
Jing, X., Li, Y., Zhao, G., Xie, H.-Q., & Wang, Q. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04105-y · Cited by 7
Biswas, S., & Das, P. (2023) · Communications in computer and information science · doi:10.1007/978-3-031-48879-5_7 · Cited by 7
PQ-DPoL: An Efficient Post-Quantum Blockchain Consensus Algorithm
Kim, W., Kang, Y., Kim, H., et al. (2024) · Lecture notes in computer science · doi:10.1007/978-981-99-8024-6_24 · Cited by 7
An Ultra-High Throughput AES-Based Authenticated Encryption Scheme for 6G: Design and Implementation
Anand, R., Banik, S., Caforio, A., Fukushima, K., Isobe, T., Kiyomoto, S., Liu, F., Nakano, Y., Sakamoto, K., & TAKEUCHI, N. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-50594-2_12 · Cited by 7
Solving Hamiltonian Cycle Problem with Grover’s Algorithm Using Novel Quantum Circuit Designs
Jiang, J., & Kao, T.-H. (2023) · IEEE Eurasia Conference on IOT, Communication and Engineering (ECICE) · doi:10.1109/ecice59523.2023.10383125 · Cited by 7
Ecmas: Efficient Circuit Mapping and Scheduling for Surface Code
Zhu, M., Fu, H., Wu, J., Zhang, C., Xie, W., & Li, X. (2024) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1109/cgo57630.2024.10444874 · Cited by 13
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
