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,001–3,100 of 8,792
Mahmoudi, Y., Zioui, N., Belbachir, H., Tadjine, M., & Rezgui, A. (2022) · Emerging Science Journal · doi:10.28991/esj-2023-07-01-020 · Cited by 10
Information- and Coding-Theoretic Analysis of the RLWE/MLWE Channel
Maringer, G., Puchinger, S., & Wachter-Zeh, A. (2022) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2022.3226907 · Cited by 9
Binary Classification Quantum Neural Network Model Based on Optimized Grover Algorithm
Zhao, W., Wang, Y., Qu, Y., Ma, H., & Wang, S. (2022) · Entropy · doi:10.3390/e24121783 · Cited by 9
Nearly Optimal Communication and Query Complexity of Bipartite Matching
Blikstad, J., van den Brand, J., Efron, Y., et al. (2022) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs54457.2022.00113 · Cited by 9
Practical efficient 1-out-of-n quantum oblivious transfer protocol
Zhang, X. J., Wei, C., Qin, S., Gao, F., & Wen, Q. (2023) · Quantum Information Processing · doi:10.1007/s11128-022-03817-x · Cited by 9
Liu, W., Wang, M., & Li, Z. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03877-7 · Cited by 9
Efficient Implementation of LIMDDs for Quantum Circuit Simulation
Vinkhuijzen, L., Grurl, T., Hillmich, S., Brand, S., Wille, R., & Laarman, A. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-32157-3_1 · Cited by 9
Memory-Efficient Quantum Information Set Decoding Algorithm
Kimura, N., Takayasu, A., & Takagi, T. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-35486-1_20 · Cited by 9
Efe, A. (2023) · Bilişim Teknolojileri Dergisi · doi:10.17671/gazibtd.1190670 · Cited by 9
Quantum impossible differential attacks: applications to AES and SKINNY
David, N., Naya‐Plasencia, M., & Schrottenloher, A. (2023) · Designs Codes and Cryptography · doi:10.1007/s10623-023-01280-y · Cited by 13
Variational Amplitude Amplification for Solving QUBO Problems
Koch, D., Cutugno, M., Patel, S., Wessing, L., & Alsing, P. M. (2023) · Quantum Reports · doi:10.3390/quantum5040041 · Cited by 10
Quantum attacks on generalized Feistel networks based on the strong–weak separability
Xu, Y., Du, X., Jia, M., et al. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04135-6 · Cited by 9
Efficient Hamiltonian Reduction for Quantum Annealing on SatCom Beam Placement Problem
Dinh, T. Q., Dau, S. H., Lagunas, E., & Chatzinotas, S. (2023) · International Conference on Communications · doi:10.1109/icc45041.2023.10279813 · Cited by 9
Universal resources for quantum computing
Wang, D. (2023) · Communications in Theoretical Physics · doi:10.1088/1572-9494/ad07d6 · Cited by 11
Two-round quantum homomorphic encryption scheme based on matrix decomposition
Shang, T., Wang, S., Jiang, Y., et al. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04173-0 · Cited by 9
Effective and Efficient Qubit Mapper
Fu, H., Zhu, M., Wu, J., Xie, W., Su, Z., & Li, X. (2023) · doi:10.1109/iccad57390.2023.10323857 · Cited by 10
Hybrid Quantum Machine Learning Assisted Classification of COVID-19 from Computed Tomography Scans
Sünkel, L., Martyniuk, D., Reichwald, J., Morariu, A., Seggoju, R. H., Altmann, P. J., Roch, C., & Paschke, A. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00048 · Cited by 11
Sahu, H., & Sen, K. (2024) · Scientific Reports · doi:10.1038/s41598-024-51709-0 · Cited by 9
Guided quantum compression for high dimensional data classification
Belis, V., Odagiu, P., Grossi, M., Reiter, F., Dissertori, G., & Vallecorsa, S. (2024) · Machine Learning Science and Technology · doi:10.1088/2632-2153/ad5fdd · Cited by 11
Gleeok: A Family of Low-Latency PRFs and its Applications to Authenticated Encryption
Anand, R., Banik, S., Caforio, A., et al. (2024) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2024.i2.545-587 · Cited by 9
Sharma, P., Gupta, V., & Sood, S. K. (2024) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-024-10122-6 · Cited by 9
On quantum computing for artificial superintelligence
Grabowska, A., & Gunia, A. (2024) · European Journal for Philosophy of Science · doi:10.1007/s13194-024-00584-7 · Cited by 14
Bitstream Fault Injection Attacks on CRYSTALS Kyber Implementations on FPGAs
Ni, Z., Khalid, A., Liu, W., et al. (2024) · doi:10.23919/date58400.2024.10546550 · Cited by 9
A Multiparty Quantum Private Equality Comparison Scheme Relying on |GHZ3⟩ States
Andronikos, T., & Sirokofskich, A. (2024) · Future Internet · doi:10.3390/fi16090309 · Cited by 9
Quantum 2-Player Games and Realizations with Circuits
Zhang, J., Chen, T., Deng, W., Tong, X., & Zhang, X. (2024) · Research · doi:10.34133/research.0480 · Cited by 8
Quantum advantages in (n,d) ↦ 1 random access codes
Ambainis, A., Kravchenko, D., Sazim, S., Bae, J., & Rai, A. (2024) · New Journal of Physics · doi:10.1088/1367-2630/ad9bdf · Cited by 8
Discrete optimization: A quantum revolution?
Creemers, S., & Armas, L. F. P. (2024) · European Journal of Operational Research · doi:10.1016/j.ejor.2024.12.016 · Cited by 9
Jiang, J., & Wang, Y. (2024) · Mathematics · doi:10.3390/math13010090 · Cited by 9
Universal single-server blind quantum computation for classical clients
Xu, H.-R., & Wang, B.-H. (2021) · Laser Physics Letters · doi:10.1088/1612-202x/ac3a0d · Cited by 10
Quantum Query Complexity of Boolean Functions with Small On-Sets
Ambainis, A., Iwama, K., Nakanishi, M., Nishimura, H., Raymond, R., Tani, S., & Yamashita, S. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-92182-0_79 · Cited by 10
New Developments in Quantum Algorithms
Ambainis, A. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15155-2_1 · Cited by 11
Liu, Y., & Zhang, F. (2015) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-015-5661-z · Cited by 10
Some Properties of Quantum Data Search Algorithms
Arima, K., Miyajima, H., Shigei, N., et al. (2008) · Cited by 9
Quantum-Inspired Neural Network with Quantum Weights and Real Weights
Shang, F. (2015) · Open Journal of Applied Sciences · doi:10.4236/ojapps.2015.510060 · Cited by 9
Quantum processes: A new interpretation for quantum transformations in the VPE-qGM environment
Maron, A., Reiser, R., Pilla, M. L., & Yamin, A. (2012) · Latin American Computer Conference (CLEI) · doi:10.1109/clei.2012.6426919 · Cited by 9
Zhang, K., Kwek, L. C., Ma, C., Zhang, L., & Sun, H.-W. (2018) · Quantum Information Processing · doi:10.1007/s11128-017-1808-3 · Cited by 9
Two new results about quantum exact learning
Arunachalam, S., Chakraborty, S., Lee, T., Paraashar, M., & de Wolf, R. (2021) · Quantum · doi:10.22331/q-2021-11-24-587 · Cited by 10
Controlled SWAP attack and improved quantum encryption of arbitrated quantum signature schemes
Feng-lin, C., Zhang, L., & Hai, Z. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2265-y · Cited by 9
Synthesizing Quantum Circuits via Numerical Optimization
de Brugière, T. G., Baboulin, M., Valiron, B., & Allouche, C. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-22741-8_1 · Cited by 9
On the importance of cryptographic agility for industrial automation
Paul, S., & Niethammer, M. (2019) · at - Automatisierungstechnik · doi:10.1515/auto-2019-0019 · Cited by 11
A Comprehensive Study of the Key Enumeration Problem
Villanueva-Polanco, R. (2019) · Entropy · doi:10.3390/e21100972 · Cited by 9
Quantum simulation of quantum relativistic diffusion via quantum walks
Arnault, P., Macquet, A., Anglés-Castillo, A., Márquez-Martín, I., Pina-Canelles, V., Pérez, A., Molfetta, G. D., Arrighi, P. J., & Debbasch, F. (2020) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ab8245 · Cited by 9
Quantum subspace alignment for domain adaptation
He, X. (2020) · Physical Review A · doi:10.1103/physreva.102.062403 · Cited by 12
A Quantum Algorithm for Ray Casting using an Orthographic Camera
Alves, C., Santos, L. P., & Bashford‐Rogers, T. (2019) · International Conference on Graphics and Interaction (ICGI) · doi:10.1109/icgi47575.2019.8955061 · Cited by 9
Experimental pairwise entanglement estimation for an N-qubit system
Thompson, N. L., Nguyen, N. H., Behrman, E., & Steck, J. E. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02877-1 · Cited by 10
A novel quantum image parallel searching algorithm
Xu, G., Xu, X., Wang, X., et al. (2020) · Optik · doi:10.1016/j.ijleo.2020.164565 · Cited by 9
Periodicity of Grover walks on complete graphs with self-loops
Ito, N., Matsuyama, T., & Tsurii, T. (2020) · Linear Algebra and its Applications · doi:10.1016/j.laa.2020.04.003 · Cited by 10
Quantum image sharpness estimation based on the Laplacian operator
Jiang, S.-X., Zhou, R., & Hu, W. (2020) · International Journal of Quantum Information · doi:10.1142/s0219749920500082 · Cited by 9
Simulation and Design of Quantum Circuits
Zulehner, A., & Wille, R. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-47361-7_3 · Cited by 12
Efficient BIKE Hardware Design with Constant-Time Decoder
Reinders, A. H., Misoczki, R., Ghosh, S., & Sastry, M. R. (2020) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00033 · Cited by 10
Hybrid divide-and-conquer approach for tree search algorithms
Rennela, M., Brand, S., Laarman, A., & Dunjko, V. (2023) · Quantum · doi:10.22331/q-2023-03-23-959 · Cited by 9
Asymmetric scaling scheme over the two dimensions of a quantum image
Zhou, R., Cheng, Y., Qi, X., Yu, H. J., & Jiang, N. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02837-9 · Cited by 9
Nanosciences fostering cross domain engineering applications
Bale, A. S., Khatokar, J. A., Singh, S., Bharath, G., Mohan, M. S. K., Reddy, S. V., Satheesha, T. Y., & Huddar, S. A. (2020) · Materials Today Proceedings · doi:10.1016/j.matpr.2020.09.076 · Cited by 9
Introduction to Blockchain Technology
Bolfing, A. (2020) · Oxford University Press eBooks · doi:10.1093/oso/9780198862840.003.0006 · Cited by 11
Reconciliation based key exchange schemes using lattices: a review
Dabra, V., Bala, A., & Kumari, S. (2021) · Telecommunication Systems · doi:10.1007/s11235-021-00759-0 · Cited by 9
RED: Learning the role embedding in networks via Discrete-time quantum walk
Wang, X., Jian, S., Lü, K., Zhang, Y., & Liu, K. (2021) · Applied Intelligence · doi:10.1007/s10489-021-02342-1 · Cited by 10
Circuit Design for k-Coloring Problem and Its Implementation in Any Dimensional Quantum System
Saha, A., Saha, D., & Chakrabarti, A. (2021) · SN Computer Science · doi:10.1007/s42979-021-00813-3 · Cited by 9
Test Data-Driven Machine Learning Models for Reliable Quantum Circuit Output
Saravanan, V., & Saeed, S. M. (2021) · IEEE European Test Symposium (ETS) · doi:10.1109/ets50041.2021.9465405 · Cited by 9
Towards Post-Quantum Enhanced Identity-Based Encryption
Verchyk, D., & Sepúlveda, J. (2021) · Euromicro Conference on Digital System Design (DSD) · doi:10.1109/dsd53832.2021.00081 · Cited by 9
Model checking QCTL plus on quantum Markov chains
Xu, M., Fu, J., Mei, J., & Deng, Y. (2022) · Theoretical Computer Science · doi:10.1016/j.tcs.2022.01.044 · Cited by 9
Song, G., Jang, K., Kim, H., Lee, W., Hu, Z. H., & Seo, H. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-08896-4_22 · Cited by 9
Survey on the Improvement and Application of HHL Algorithm
Liu, X., Xie, H., Liu, Z., & Zhao, C. (2022) · Journal of Physics Conference Series · doi:10.1088/1742-6596/2333/1/012023 · Cited by 9
A New Lattice-Based Blind Ring Signature for Completely Anonymous Blockchain Transaction Systems
Xie, Y., Chen, X., & Yang, Y. (2022) · Security and Communication Networks · doi:10.1155/2022/4052029 · Cited by 9
Challenges in the Transition towards a Quantum-safe Government
Kong, I., Janssen, M., & Bharosa, N. (2022) · Annual International Conference on Digital Government Research · doi:10.1145/3543434.3543644 · Cited by 9
Recent progress of quantum simulation of non-Hermitian systems
Gao, X.-E., Li, D.-L., Liu, Z., & Zheng, C. (2022) · Acta Physica Sinica · doi:10.7498/aps.71.20221825 · Cited by 10
Benedikt, B. J., Fischlin, M., & Huppert, M. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-22969-5_20 · Cited by 10
Biomolecular and quantum algorithms for the dominating set problem in arbitrary networks
Wong, R., Chang, W.-L., Chung, W., & Vasilakos, A. V. (2023) · Scientific Reports · doi:10.1038/s41598-023-30600-4 · Cited by 10
Evolution of Quantum Machine Learning and an Attempt of Its Application for SDN Intrusion Detection
Shinde, A. R., & Bendale, S. P. (2023) · Studies in computational intelligence · doi:10.1007/978-981-19-9530-9_22 · Cited by 9
A probabilistic model of quantum states for classical data security
Waseem, H. M., & Hwang, S. O. (2023) · Frontiers of Physics · doi:10.1007/s11467-023-1293-3 · Cited by 11
Quantum Circuit Based on Grover’s Algorithm to Solve Exact Cover Problem
Jiang, J., & Wang, Y. (2023) · doi:10.1109/apwcs60142.2023.10234054 · Cited by 9
Q# as a Quantum Algorithmic Language
Singhal, K., Hietala, K., Marshall, S., et al. (2023) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.394.10 · Cited by 9
Chen, J., Liu, Q., Fan, Y.-H., Wu, L.-X., Li, B., & Wang, M.-Q. (2024) · IACR Cryptology ePrint Archive · doi:10.62056/anmmp-4c2h · Cited by 5
On Quantum and Approximate Privacy
Klauck, H. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45841-7_27 · Cited by 10
Quantum Algorithm for Triangle Finding in Sparse Graphs
Gall, F. L., & Nakajima, S. (2017) · Algorithmica · doi:10.1007/s00453-016-0267-z · Cited by 9
Properties of Quantum Languages
Gudder, S., & Ball, R. N. (2002) · International Journal of Theoretical Physics · doi:10.1023/a:1015226708860 · Cited by 9
A System F accounting for scalars
Arrighi, P. J., & Díaz-Caro, A. (2012) · Logical Methods in Computer Science · doi:10.2168/lmcs-8(1:11)2012 · Cited by 9
One-way quantum computer simulation
Nikahd, E., Houshmand, M., Zamani, M. S., et al. (2015) · Microprocessors and Microsystems · doi:10.1016/j.micpro.2015.02.007 · Cited by 9
Li, Z., & Rudolph, G. (2007) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1276958.1277138 · Cited by 9
Is Grover’s Algorithm a Quantum Hidden Subgroup Algorithm?
Lomonaco, S. J., & Kauffman, L. H. (2007) · Quantum Information Processing · doi:10.1007/s11128-007-0066-1 · Cited by 13
A Novel Quantum Genetic Algorithm in TSP
Lv, H. (2014) · Applied Mechanics and Materials · doi:10.4028/www.scientific.net/amm.519-520.759 · Cited by 9
Quantum Computation in Computational Geometry
Sadakane, K., SUGAWARA, N., & Tokuyama, T. (2002) · Interdisciplinary Information Sciences · doi:10.4036/iis.2002.129 · Cited by 9
Universality of quantum Turing machines with deterministic control
Mateus, P., Sernadas, A., & Souto, A. (2015) · Journal of Logic and Computation · doi:10.1093/logcom/exv008 · Cited by 9
Toward a world with quantum computers
Bacon, D., & Leung, D. (2007) · Communications of the ACM · doi:10.1145/1284621.1284648 · Cited by 9
Simulation of quantum gates on a novel GPU architecture
Gutiérrez, E., Romero, S., Trenas, M. A., et al. (2007) · Cited by 9
Precision Spectroscopy and Quantum Information Processing with Trapped Calcium Ions
Benhelm, J. (2008) · Cited by 10
Real-World Post-Quantum Digital Signatures
Butin, D., Gazdag, S.-L., & Buchmann, J. A. (2015) · Communications in computer and information science · doi:10.1007/978-3-319-25360-2_4 · Cited by 9
Precomputation Methods for Hash-Based Signatures on Energy-Harvesting Platforms
Aysu, A., & Schaumont, P. R. (2015) · IEEE Transactions on Computers · doi:10.1109/tc.2015.2500570 · Cited by 9
Multiobjective Optimization in a Quantum Adiabatic Computer
Barán, B., & Villagra, M. (2016) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2016.12.003 · Cited by 9
Graph embedding using a quasi-quantum analogue of the hitting times of continuous time quantum walks
Emms, D., Wilson, R. C., & Hancock, E. R. (2009) · doi:10.5555/2011781.2011785 · Cited by 9
Physical design of quantum circuits in ion trap technology – A survey
Mohammadzadeh, N. (2016) · Microelectronics Journal · doi:10.1016/j.mejo.2016.07.001 · Cited by 9
Multivariate Public Key Cryptosystems
Hashimoto, Y. (2017) · Mathematics for industry · doi:10.1007/978-981-10-5065-7_2 · Cited by 9
A novel trust evolution algorithm based on a quantum-like model of computational trust
Ashtiani, M., & Azgomi, M. A. (2018) · Cognition Technology & Work · doi:10.1007/s10111-018-0496-9 · Cited by 9
Classical Lower Bounds from Quantum Upper Bounds
Ben-David, S., Bouland, A., Garg, A., & Kothari, R. (2018) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2018.00040 · Cited by 16
Progress in experimental quantum digital signatures
Collins, R. J., Donaldson, R. J., & Buller, G. S. (2018) · doi:10.1117/12.2319015 · Cited by 9
Principles of Secure Processor Architecture Design
Szefer, J. M. (2019) · Synthesis lectures on computer architecture · doi:10.1007/978-3-031-01760-5 · Cited by 10
Quantum-inspired microwave signal processing for implementing unitary transforms
Zhang, S., Zhang, Y., Sun, Y., Sun, H., & Zhang, X. (2019) · Optics Express · doi:10.1364/oe.27.000436 · Cited by 9
Towards Higher Scalability of Quantum Hardware Emulation Using Efficient Resource Scheduling
Mahmud, N., & El‐Araby, E. (2018) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc.2018.8638610 · Cited by 9
Efficient Circuits for Quantum Search over 2D Square Lattice Architecture
Hu, S., Maslov, D., Pistoia, M., & Gambetta, J. (2019) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/3316781.3322464 · Cited by 9
Faster quantum algorithm for evaluating game trees
Reichardt, B. W. (2011) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611973082.43 · Cited by 10
A generic quantum protocol for one-sided secure two-party classical computations
Shi, R. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2517-x · Cited by 9
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
