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,301–3,400 of 8,792
An Efficient NTRU-Based Authentication Protocol in IoT Environment
Jeong, S., Park, K., Park, Y., & Park, Y. (2018) · Advances in intelligent systems and computing · doi:10.1007/978-3-030-01177-2_91 · Cited by 8
Ye, Z., Hu, X., Zhu, W., et al. (2018) · 系统科学与信息学报(英文) · doi:10.21078/jssi-2018-399-22 · Cited by 8
A Quantum Algorithm for the Commutativity of Finite Dimensional Algebras
Combarro, E. F., Ranilla, J., & Rúa, I. F. (2019) · IEEE Access · doi:10.1109/access.2019.2908785 · Cited by 8
Algebraic Characterization of CNOT-Based Quantum Circuits with its Applications on Logic Synthesis
Saeedi, M., Zamani, M. S., & Sedighi, M. (2007) · Euromicro Conference on Digital System Design: Architectures, Methods and Tools (DSD) · doi:10.1109/dsd.2007.4341490 · Cited by 8
An efficient Quantum Private Query Protocol Based on Oracle and Grover Iteration
Xiao, H., Huang, W., & Zhou, M. (2019) · International Journal of Theoretical Physics · doi:10.1007/s10773-019-04182-9 · Cited by 7
Efficient Hardware/Software Co-design for NTRU
Fritzmann, T., Schamberger, T., Frisch, C., et al. (2019) · IFIP advances in information and communication technology · doi:10.1007/978-3-030-23425-6_13 · Cited by 8
ROS: Resource-constrained Oracle Synthesis for Quantum Computers
Meuli, G., Soeken, M., Roetteler, M., & Micheli, G. D. (2020) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.318.8 · Cited by 10
A Quantum-Based Signcryption for Supervisory Control and Data Acquisition (SCADA) Networks
Ghosh, S., Zaman, M., Plourde, B., & Sampalli, S. (2022) · Symmetry · doi:10.3390/sym14081625 · Cited by 8
Quantum Coin Method for Numerical Integration
Shimada, N. H., & Hachisuka, T. (2020) · Computer Graphics Forum · doi:10.1111/cgf.14015 · Cited by 9
The Needs and Challenges of Workforce Development in Quantum Computing
Amin, M., Uhlig, R., Dey, P. P., et al. (2024) · ASEE Pacific Southwest Section Meeting · doi:10.18260/1-2--31846 · Cited by 8
Effect on ion-trap quantum computers from the quantum nature of the driving field
Yang, B., & Yang, L. (2020) · Science China Information Sciences · doi:10.1007/s11432-019-2689-4 · Cited by 10
Secure Decentralised Deployment of LoRaWAN Sensors
McPherson, R., & Irvine, J. M. (2020) · IEEE Sensors Journal · doi:10.1109/jsen.2020.3013117 · Cited by 8
Strengthening Post-Quantum Security for Automotive Systems
Fritzmann, T., Vith, J., & Sepúlveda, J. (2020) · Euromicro Conference on Digital System Design (DSD) · doi:10.1109/dsd51259.2020.00094 · Cited by 8
QML Based Community Detection in the realm of Social Network Analysis
Akbar, S., & Saritha, S. K. (2020) · International Conference on Computing, Communication and Networking Technologies (ICCCNT) · doi:10.1109/icccnt49239.2020.9225271 · Cited by 8
QSIM: A novel approach to node proximity estimation based on Discrete-time quantum walk
Wang, X., Lü, K., Zhang, Y., & Liu, K. (2020) · Applied Intelligence · doi:10.1007/s10489-020-01970-3 · Cited by 9
Yeniaras, E., & Cenk, M. (2022) · Journal of Cryptographic Engineering · doi:10.1007/s13389-021-00282-7 · Cited by 9
Pauli Channel Online Estimation Protocol for Quantum Turbo Codes
Martínez, J. E., Fuentes, P., Crespo, P. M., & Garcia‐Frias, J. (2020) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00023 · Cited by 8
Constant-Round Blind Classical Verification of Quantum Sampling
Chung, K.-M., Lee, Y., Lin, H.-H., & Wu, X. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-07082-2_25 · Cited by 9
Exponential-Time Quantum Algorithms for Graph Coloring Problems
Shimizu, K., & Mori, R. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-61792-9_31 · Cited by 8
Quantum Key Search for Ternary LWE
van Hoof, I., Kirshanova, E., & May, A. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-81293-5_7 · Cited by 8
Code Based Cryptography and Steganography
Véron, P. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40663-8_5 · Cited by 8
A Hash-Based Quantum-Resistant Chameleon Signature Scheme
Thanalakshmi, P., Anitha, R., Anbazhagan, N., et al. (2021) · Sensors · doi:10.3390/s21248417 · Cited by 8
Balanced K-means using Quantum annealing
Zaiou, A., Bennani, Y., Mateï, B., & Hibti, M. (2021) · IEEE Symposium Series on Computational Intelligence (SSCI) · doi:10.1109/ssci50451.2021.9659997 · Cited by 9
Quantum Computing for Computer Architects, Second Edition
Metodi, T. S., Faruque, A. I., & Chong, F. T. (2011) · Synthesis lectures on computer architecture · doi:10.2200/s00331ed1v01y201101cac013 · Cited by 11
Ruan, D., Long, G., Shi-Jie, W. E. I., & Wang, T. (2017) · Scientia Sinica Informationis · doi:10.1360/n112017-00178 · Cited by 8
Experimental Quantum‐Enhanced Machine Learning in Spin‐Based Systems
Wang, X., Lin, Z., Che, L., Chen, H.-Y., & Lu, D. (2022) · Advanced Quantum Technologies · doi:10.1002/qute.202200005 · Cited by 9
Teaching Quantum Computing with the QuIDE Simulator
Rycerz, K., Patrzyk, J., Patrzyk, B., & Bubak, M. (2015) · Procedia Computer Science · doi:10.1016/j.procs.2015.05.374 · Cited by 8
Introduction to Recent Quantum Algorithms
Høyer, P. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44683-4_7 · Cited by 7
A Quantum-classical Hybrid Architecture for Security Algorithms Acceleration
Possignolo, R. T., & Margi, C. B. (2012) · IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) · doi:10.1109/trustcom.2012.49 · Cited by 8
Quantum and classical complexity classes: Separations, collapses, and closure properties
Spakowski, H., Thakur, M., & Tripathi, R. S. (2005) · Information and Computation · doi:10.1016/j.ic.2004.10.009 · Cited by 8
A testing scheme for mixed-control based reversible circuits
Mondal, B., Bandyopadhyay, C., & Rahaman, H. (2016) · International Symposium on Embedded Computing and System Design (ISED) · doi:10.1109/ised.2016.7977062 · Cited by 8
A Faster Half Subtractor Circuit Using Reversible Quantum Gates
Orts, F. J., Ortega, G., & Garzón, E. M. (2019) · Baltic Journal of Modern Computing · doi:10.22364/bjmc.2018.7.1.08 · Cited by 8
Maji, R., Behera, B. K., & Panigrahi, P. K. (2021) · International Journal of Theoretical Physics · doi:10.1007/s10773-021-04817-w · Cited by 8
Quantum version of MMSE-based massive MIMO uplink detection
Ji, Y., Meng, F., Jin, J., Yu, X., Zhang, Z., You, X., & Zhang, C. (2020) · Quantum Information Processing · doi:10.1007/s11128-019-2547-4 · Cited by 8
Coined Quantum Walks Lift the Cospectrality of Graphs and Trees
Emms, D., Simone Severini, B., Wilson, R. C., & Hancock, E. R. (2005) · Lecture notes in computer science · doi:10.1007/11585978_22 · Cited by 8
Quantum information processing: The good, the bad and the ugly
Brassard, G. (1997) · Lecture notes in computer science · doi:10.1007/bfb0052246 · Cited by 8
Quantum Separation of Local Search and Fixed Point Computation
Chen, X., Sun, X., & Teng, S. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-69733-6_18 · Cited by 8
Unrelated parallel machine scheduling—perspectives and progress
Kamath, S. (2011) · OPSEARCH · doi:10.1007/s12597-011-0059-9 · Cited by 8
Quantum search with resonances
Romanelli, A., Auyuanet, A., & Donangelo, R. (2005) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2005.05.101 · Cited by 8
The clock of a quantum computer
Apolloni, B., & de Falco, D. (2002) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/35/47/305 · Cited by 9
A new quantum lower bound method,
Ambainis, A., Špalek, R., & de Wolf, R. (2006) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1132516.1132604 · Cited by 11
A Quantum Neural Network Approach for Portfolio Selection
Mahajan, R. P. (2011) · International Journal of Computer Applications · doi:10.5120/3550-4870 · Cited by 8
On quantum one-way permutations
Kashefi, E., Nishimura, H., & Vedral, V. (2002) · Quantum Information and Computation · doi:10.26421/qic2.5-5 · Cited by 8
Controllability of pure states for the Pöschl–Teller potential with a dynamical group SU(2)
Dong, S., Tang, Y., Sun, G.-H., Lara-Rosano, F., & Lozada‐Cassou, M. (2004) · Annals of Physics · doi:10.1016/j.aop.2004.09.003 · Cited by 8
Single query learning from abelian and non-abelian Hamming distance oraclesPreprint
MEYER, D. A., & Pommersheim, J. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0912.0583 · Cited by 8
A Quantum Time-Space Lower Bound for the Counting HierarchyPreprint
van Melkebeek, D., & Watson, T. W. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0712.2545 · Cited by 9
Fixed Phase Quantum Search AlgorithmPreprint
Younes, A. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0704.1585 · Cited by 8
Probabilistic bisimilarities between quantum processesPreprint
Feng, Y., Duan, R., Ji, Z., et al. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0601014 · Cited by 8
Quantum Computing and Hidden Variables II: The Complexity of Sampling HistoriesPreprint
Aaronson, S. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0408119 · Cited by 10
Quantum algorithms for formula evaluationPreprint
Ambainis, A. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1006.3651 · Cited by 8
Introduction to Quantum Computers
Grimes, R. A. (2019) · Wiley eBooks · doi:10.1002/9781119618232.ch2 · Cited by 9
Characterizations of symmetrically partial Boolean functions with exact quantum query complexityPreprint
Qiu, D., & Zheng, S. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1603.06505 · Cited by 12
Quantum Algorithms for Boolean Equation Solving and Quantum Algebraic Attack on CryptosystemsPreprint
Chen, Y.-A., & Gao, X.-S. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1712.06239 · Cited by 8
Search of clustered marked states with lackadaisical quantum walksPreprint
Saha, A., Majumdar, R., Saha, D., Chakrabarti, A., & Sur‐Kolay, S. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1804.01446 · Cited by 7
Graph Cut Segmentation Methods Revisited with a Quantum AlgorithmPreprint
Tse, L., Mountney, P., Klein, P., & Simone Severini, B. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1812.03050 · Cited by 10
Multiple Query Optimization on the D-Wave 2X Adiabatic Quantum ComputerPreprint
Trummer, I., & Koch, C. E. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1510.06437 · Cited by 8
A Depth-Aware Swap Insertion Scheme for the Qubit Mapping ProblemPreprint
Zhang, C., Chen, Y., Jin, Y., Ahn, W., Zhang, Y., & Zhang, E. Z. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.07289 · Cited by 19
Quantum Implications of Huang's Sensitivity TheoremPreprint
Aaronson, S., Ben-David, S., Kothari, R., & Tal, A. (2020) · arXiv (Cornell University) · doi:10.4230/lipics.ccc.2021.36 · Cited by 13
Quantum Communication for Military ApplicationsPreprint
Neumann, N. M. P., van Heesch, M. P. P., & de Graaf, P. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2011.04989 · Cited by 17
Resource Estimation of Grovers-kind Quantum Cryptanalysis against FSR based Symmetric Ciphers.Preprint
Anand, R., Maitra, S., Maitra, A., Mukherjee, C. S., & Mukhopadhyay, S. (2020) · IACR Cryptology ePrint Archive · Cited by 8
Quantum and Post‐Quantum Cryptography
Pal, O., Jain, M. K., Murthy, B. K., et al. (2022) · doi:10.1002/9781119795667.ch2 · Cited by 8
Schuld, M., & Petruccione, F. (2023) · Springer eBooks · doi:10.1007/978-1-4899-7502-7_913-2 · Cited by 9
Navigating the Quantum Computing Threat Landscape for Blockchains: A Comprehensive SurveyPreprint
Khodaiemehr, H., Bagheri, K., & Feng, C. (2023) · doi:10.36227/techrxiv.24136440 · Cited by 8
Quantum Computing Based on Cybersecurity
William, P., Parganiha, V., & Pardeshi, D. B. (2023) · doi:10.1002/9781394167401.ch9 · Cited by 8
Application of Quantum Computing for Power Systems
Li, Y., Venayagamoorthy, G. K., & Du, L. (2025) · Wiley eBooks · doi:10.1002/9781394334599.ch12 · Cited by 9
An Investigation into the Realities of a Quantum Datapath
Isailovic, N. (2010) · eScholarship (California Digital Library) · Cited by 8
Quantum Secure Lightweight Cryptography with Quantum Permutation Pad
Kuang, R., Lou, D., He, A., & Conlon, A. (2021) · Advances in Science, Technology and Engineering Systems Journal · doi:10.25046/aj060445 · Cited by 7
A lower bound on the quantum query complexity of read-once functions
Barnum, H., & Saks, M. (2004) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2004.02.002 · Cited by 72
Quantum Steering of Surface Error Correcting Codes
Volya, D., & Mishra, P. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00158 · Cited by 7
Quantum Measurement Classification Using Statistical Learning
Utt, Z., Volya, D., & Mishra, P. (2024) · ACM Transactions on Quantum Computing · doi:10.1145/3644823 · Cited by 7
Designing and Delivering a Post-Quantum Cryptography Course
Borrelli, T. J., Polak, M., & Radziszowski, S. (2024) · ACM Technical Symposium on Computer Science Education (SIGCSE) · doi:10.1145/3626252.3630823 · Cited by 9
An Example of Parallel Merkle Tree Traversal: Post-Quantum Leighton-Micali Signature on the GPU
Wang, Z., Dong, X., Kang, Y. M., et al. (2024) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/3659209 · Cited by 7
Quantum data centres: a simulation-based comparative noise analysis
Campbell, K., Lawey, A. Q., & Razavi, M. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad9cb8 · Cited by 7
Advanced authentication of IoT sensor network for industrial safety
Liu, C., & Wu, Z.-Y. (2024) · Internet of Things · doi:10.1016/j.iot.2024.101297 · Cited by 7
Quantum Annealing for Complex Optimization in Satellite Communication Systems
Dinh, T. Q., Dau, S. H., Lagunas, E., Chatzinotas, S., Nguyen, D. N., & Hoang, D. T. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2024.3481373 · Cited by 7
Finding All Solutions with Grover’s Algorithm by Integrating Estimation and Discovery
Lee, S., & Nam, S. Y. (2024) · Electronics · doi:10.3390/electronics13234830 · Cited by 7
Haddouti, S. E., Kettani, M. D. E.-C. E., & Chaoui, H. (2024) · International Conference on Advanced Communication Technologies and Networking (CommNet) · doi:10.1109/commnet63022.2024.10793363 · Cited by 8
A Secure Data Sharing Model Utilizing Attribute-Based Signcryption in Blockchain Technology
Song, C., Chen, L., Wu, X., et al. (2024) · Sensors · doi:10.3390/s25010160 · Cited by 7
Wang, Y. D., Zhang, S., Sun, T., Zhao, Z., Xu, X., Zhuang, X., Liu, H., Xue, C., Duan, P., Wu, Y., et al. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202400519 · Cited by 7
Parallel implementation of GCM on GPUs
Lee, J., Kim, D., & Seo, S. C. (2025) · ICT Express · doi:10.1016/j.icte.2025.01.006 · Cited by 7
Layer-Wise Security Framework and Analysis for the Quantum Internet
Yang, Z., Ghubaish, A., Jain, R. K., Al‐Fuqaha, A., Erbad, A., Kompella, R., Shapourian, H., & Nejabati, R. (2025) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2025.3568063 · Cited by 8
Quantum Key-Recovery Attacks on Permutation-Based Pseudorandom Functions
Sun, H.-W., Gao, F., Xu, R.-X., Li, D., Li, Z., & Zhang, K. (2025) · IEEE Internet of Things Journal · doi:10.1109/jiot.2025.3579024 · Cited by 7
Slysz, M., Grodzki, Ł., Rydlichowski, P., Siera, D., Kurowski, K., Waligóra, G., & Węglarz, J. (2025) · Future Generation Computer Systems · doi:10.1016/j.future.2025.107934 · Cited by 9
DemoQuanDT: a carrier-grade QKD network
Horoschenkoff, P., Henrich, J., Böhn, R., Khan, I., Rödiger, J., Gunkel, M., Bauch, M., Benda, J., Bläcker, P., Eichhammer, E., et al. (2025) · Journal of Optical Communications and Networking · doi:10.1364/jocn.563470 · Cited by 10
Future Digital Identity Management With Quantum Secure Blockchain
Bhoi, S. S., Saini, A., Diro, A. A., Kaisar, S., & Rao, A. (2025) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2025.3608794 · Cited by 8
Kurian, M. G., & Chen, Y. (2025) · Sensors · doi:10.3390/s25195936 · Cited by 8
Quantum computing for faster enzyme discovery and engineering
Damborský, J., Kouba, P., Šivic, J., Vasina, M., Bednář, D., & Mazurenko, S. (2025) · Nature Catalysis · doi:10.1038/s41929-025-01410-w · Cited by 9
TeleSABRE: Heuristic Layout Synthesis in Multi-Core Quantum Systems with Teleport Interconnect
Russo, E., Vinciguerra, E., Palesi, M., Patti, D., Ascia, G., & Catania, V. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00086 · Cited by 13
Quantum computing: foundations, algorithms, and emerging applications
Raseena, V. (2025) · Frontiers in Quantum Science and Technology · doi:10.3389/frqst.2025.1723319 · Cited by 7
Ilari, L., Tiribelli, S., & Caruso, F. (2026) · AI and Ethics · doi:10.1007/s43681-025-00935-x · Cited by 8
Quantum games and economics through teleportation
Ikeda, K. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05341-8 · Cited by 7
Quantum Computing: State-of-Art and Challenges
Vizzotto, J. K. (2013) · doi:10.1109/weit.2013.34 · Cited by 7
Grover's Quantum Search Based Data Detection Algorithm for MIMO System
Shen, J., Wu, M., & Luan, L. (2012) · International Journal of Advancements in Computing Technology · doi:10.4156/ijact.vol4.issue1.40 · Cited by 7
Matrix Representation of Quantum Gates
Poornima, A., Naghabhushana, N. M., & Ujjinimatad, R. (2017) · International Journal of Computer Applications · doi:10.5120/ijca2017913011 · Cited by 7
Quantum pattern matching oracle construction
Menon, V., & Chattopadhyay, A. (2021) · Pramana · doi:10.1007/s12043-020-02062-0 · Cited by 7
Quantum algorithms for learning the algebraic normal form of quadratic Boolean functions
Hao, X., Zhang, F., Xia, S., & Zhou, Y. Z. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02778-3 · Cited by 7
Quantum watermarking based on threshold segmentation using quantum informational entropy
Luo, J., Zhou, R., Hu, W., et al. (2021) · Chinese Physics B · doi:10.1088/1674-1056/ac2803 · Cited by 7
Kudrow, D., Bier, K., Deng, Z., Franklin, D. M., Tomita, Y., Brown, K. R., & Chong, F. T. (2013) · ACM SIGARCH Computer Architecture News · doi:10.1145/2508148.2485937 · Cited by 7
Improved quantum attack on several generalized unbalanced Feistel structures
Zou, K., Dong, X., & Fuzhong, Z. (2022) · International Conference on Networks, Communications and Information Technology (CNCIT) · doi:10.1109/cncit56797.2022.00026 · Cited by 7
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
