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
0 of 8 cited sources checked · 0 supported · 0 flagged
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
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passes- 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
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe 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
Load-bearingStrength:boosted· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe 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
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe 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
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe 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
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passes- 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
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe 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
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe 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
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes? Based: unclear- 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
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passes
- 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
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably 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
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe 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 > ------------------------------------------------
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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.
Strength:boosted· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably 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
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably 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
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably 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
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably 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.
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably 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.
Strength:hedged· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably 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.
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably 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
Flagged first, then by citations
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 601–700 of 8,792
Quantum algorithms for jet clustering
Wei, A. Y., Naik, P., Harrow, A. W., & Thaler, J. (2020) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.101.094015 · Cited by 65
Blockchained Post-Quantum Signatures
Chalkias, K., Brown, J., Hearn, M., Lillehagen, T., Nitto, I., & Schroeter, T. (2018) · 2018 IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData) · doi:10.1109/cybermatics_2018.2018.00213 · Cited by 69
Fiber-based quantum secure direct communication without active polarization compensation
Liu, X., Luo, D., Lin, G., Chen, Z., Huang, C., Li, S., Zhang, C., Zhang, Z., & Wei, K. (2022) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-022-1976-0 · Cited by 67
Quantum-resistant Transport Layer Security
García, C. R., Rommel, S., Takarabt, S., Olmos, J. J. V., Guilley, S., Nguyen, P. E., & Monroy, I. T. (2023) · Computer Communications · doi:10.1016/j.comcom.2023.11.010 · Cited by 77
Cryptanalysis of a multi-party quantum key agreement protocol with single particles
Huang, W., Wen, Q., Liu, B., Su, Q., & Gao, F. (2014) · Quantum Information Processing · doi:10.1007/s11128-014-0758-2 · Cited by 65
Quantum private set intersection cardinality and its application to anonymous authentication
Shi, R., Mu, Y., Zhong, H., Zhang, S., & Cui, J. (2016) · Information Sciences · doi:10.1016/j.ins.2016.07.071 · Cited by 66
From Schrödinger’s equation to the quantum search algorithm
Grover, L. K. (2001) · Pramana · doi:10.1007/s12043-001-0128-3 · Cited by 66
Self-citationQuantum Computing and Communication Complexity
de Wolf, R. (2001) · Cited by 78
On the construction of a post-quantum blockchain for smart city
Chen, J., Gan, W., Hu, M., & Chen, C. (2021) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2021.102780 · Cited by 65
QuCloud: A New Qubit Mapping Mechanism for Multi-programming Quantum Computing in Cloud Environment
Liu, L., & Dou, X. (2021) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca51647.2021.00024 · Cited by 79
Space-efficient binary optimization for variational quantum computing
Glos, A., Krawiec, A., & Zimborás, Z. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00546-y · Cited by 103
Hasan, K. F., Simpson, L. R., Baee, M. A. R., Islam, C., Rahman, Z., Armstrong, W., Gauravaram, P., & McKague, M. (2024) · IEEE Access · doi:10.1109/access.2024.3360412 · Cited by 86
Arithmetic on a distributed-memory quantum multicomputer
Meter, R. V., Munro, W. J., Nemoto, K., & Itoh, K. M. (2008) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/1324177.1324179 · Cited by 65
Wei, C., Gao, F., Wen, Q., & Wang, T. (2014) · Scientific Reports · doi:10.1038/srep07537 · Cited by 65
Duality quantum algorithm efficiently simulates open quantum systems
Wei, S.-J., Ruan, D., & Long, G. (2016) · Scientific Reports · doi:10.1038/srep30727 · Cited by 65
UNDERSTANDING QUANTUM ALGORITHMS VIA QUERY COMPLEXITY
Ambainis, A. (2019) · International Congress of Mathematicians (ICM) · doi:10.1142/9789813272880_0181 · Cited by 80
Duality of Quantum and Classical Error Correction Codes: Design Principles and Examples
Babar, Z., Chandra, D., Nguyen, H. V., Botsinis, P., Alanis, D., Ng, S. X., & Hanzo, L. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2861361 · Cited by 65
An Outlook for Quantum Computing [Point of View]
Maslov, D., Nam, Y., & Kim, J. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2884353 · Cited by 65
Succinct Arguments in the Quantum Random Oracle Model
Chiesa, A., Manohar, P., & Spooner, N. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-36033-7_1 · Cited by 71
On quantum methods for machine learning problems part I: Quantum tools
Ablayev, F. M., Ablayev, M., Huang, J. Z., Khadiev, K. R., Salikhova, N., & Wu, D. (2019) · Big Data Mining and Analytics · doi:10.26599/bdma.2019.9020016 · Cited by 65
Quantum Algorithms for Hidden Nonlinear Structures
Childs, A. M., Schulman, L. J., & Vazirani, U. V. (2007) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2007.18 · Cited by 67
Both Toffoli and Controlled-NOT need little help to universal quantum computing
Shi, Y.-Y. (2003) · Quantum Information and Computation · doi:10.26421/qic3.1-7 · Cited by 193
Quantum Computation and Quantum Information
Wang, Y. (2012) · Statistical Science · doi:10.1214/11-sts378 · Cited by 72
A novel quantum blockchain scheme base on quantum entanglement and DPoS
Yu-long, G., Chen, X., Xu, G., Yuan, K., Liu, W., & Yang, Y. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02915-y · Cited by 64
The Quantum software lifecycle
Weder, B., Barzen, J., Leymann, F., Salm, M., & Vietz, D. (2020) · doi:10.1145/3412451.3428497 · Cited by 69
AI meets physics: a comprehensive survey
Jiao, L., Song, X., You, C., Liu, X., Li, L., Chen, P., Tang, X., Feng, Z., Liu, F., Guo, Y., et al. (2024) · Artificial Intelligence Review · doi:10.1007/s10462-024-10874-4 · Cited by 80
Quantum Automata with Open Time Evolution
Hirvensalo, M. (2010) · International Journal of Natural Computing Research · doi:10.4018/jncr.2010010104 · Cited by 61
Dey, S., Bhattacharyya, S., & Maulik, U. (2013) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2013.11.002 · Cited by 65
Improving the mapping of reversible circuits to quantum circuits using multiple target lines
Wille, R., Soeken, M., Otterstedt, C., & Drechsler, R. (2013) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1109/aspdac.2013.6509587 · Cited by 64
Optimal quantum networks and one-shot entropies
Chiribella, G., & Ebler, D. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/9/093053 · Cited by 71
Duality Computing in Quantum Computers
Gui-Lu, L., & Yang, L. (2008) · Communications in Theoretical Physics · doi:10.1088/0253-6102/50/6/11 · Cited by 65
Efficient decoding for the Hayden-Preskill protocol
Yoshida, B., & Kitaev, A. (2017) · arXiv · doi:10.48550/arxiv.1710.03363 · Cited by 64
Genome assembly using quantum and quantum-inspired annealing
Boev, A. S., Rakitko, A. S., Usmanov, S. R., Kobzeva, A. N., Popov, I. V., Ilinsky, V. V., Kiktenko, E. O., & Fedorov, A. K. (2021) · Scientific Reports · doi:10.1038/s41598-021-88321-5 · Cited by 63
Lower bounds for predecessor searching in the cell probe model
Sen, P., & Venkatesh, S. (2007) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2007.06.016 · Cited by 62
QDNN: deep neural networks with quantum layers
Zhao, C., & Gao, X.-S. (2021) · Quantum Machine Intelligence · doi:10.1007/s42484-021-00046-w · Cited by 85
Quantum Computation-Based Image Representation, Processing Operations and Their Applications
Yan, F., Iliyasu, A. M., & Jiang, Z. (2014) · Entropy · doi:10.3390/e16105290 · Cited by 67
Tractability of Approximation for Weighted Korobov Spaces on Classical and Quantum Computers
Novak, E., Sloan, I. H., & Woźniakowski, H. (2003) · Foundations of Computational Mathematics · doi:10.1007/s10208-002-0074-6 · Cited by 66
Towards Realising Secure and Efficient Image and Video Processing Applications on Quantum Computers
Iliyasu, A. M. (2013) · Entropy · doi:10.3390/e15082874 · Cited by 63
Decryption Failure Attacks on IND-CCA Secure Lattice-Based Schemes
D’Anvers, J.-P., Guo, Q., Johansson, T., et al. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-17259-6_19 · Cited by 63
Quantum Walks for Computer Scientists
Venegas-Andraca, S. E. (2008) · Synthesis lectures on quantum computing · doi:10.2200/s00144ed1v01y200808qmc001 · Cited by 67
Nita, L., Smith, L. M., Chancellor, N., & Cramman, H. (2021) · Research in Science & Technological Education · doi:10.1080/02635143.2021.1920905 · Cited by 79
Niraula, D., Jamaluddin, J., Matuszak, M. M., Haken, R. K. T., & Naqa, I. E. (2021) · Scientific Reports · doi:10.1038/s41598-021-02910-y · Cited by 66
Mutation Testing of Quantum Programs: A Case Study With Qiskit
Fortunato, D., Campos, J., & Abreu, R. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2022.3195061 · Cited by 82
Application of quantum approximate optimization algorithm to job shop scheduling problem
Kurowski, K., Pecyna, T., Slysz, M., Różycki, R., Waligóra, G., & Węglarz, J. (2023) · European Journal of Operational Research · doi:10.1016/j.ejor.2023.03.013 · Cited by 72
Security and Privacy of Blockchain and Quantum Computation
Ikeda, K. (2018) · Advances in computers · doi:10.1016/bs.adcom.2018.03.003 · Cited by 63
B-SIDH: Supersingular Isogeny Diffie-Hellman Using Twisted Torsion
Costello, C. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-64834-3_15 · Cited by 62
Optimal control of traffic signals using quantum annealing
Hussain, H., Javaid, M. B., Khan, F. S., Dalal, A., & Khalique, A. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02815-1 · Cited by 66
Verifying Results of the IBM Qiskit Quantum Circuit Compilation Flow
Burgholzer, L., Raymond, R., & Wille, R. (2020) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00051 · Cited by 64
DTSMA: Dominant Swarm with Adaptive T-distribution Mutation-based Slime Mould Algorithm
Yin, S., Luo, Q., Du, Y., Zhou, Y., & Guangxi Key Laboratories of Hybrid Computation and IC Design Analysis, N. 5. (2022) · Mathematical Biosciences & Engineering · doi:10.3934/mbe.2022105 · Cited by 62
Scaling Superconducting Quantum Computers with Chiplet Architectures
Smith, K. N., Ravi, G. S., Baker, J. M., & Chong, F. T. (2022) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1109/micro56248.2022.00078 · Cited by 69
Yun, W. J., Kim, J. P., Jung, S., Kim, J., & Kim, J. (2023) · IEEE Internet of Things Journal · doi:10.1109/jiot.2023.3234911 · Cited by 68
Baseri, Y., Chouhan, V., & Hafid, A. S. (2024) · Computers & Security · doi:10.1016/j.cose.2024.103883 · Cited by 91
Quantum Computation and Information
Sernadas, A., Mateus, P., & Omar, Y. (2007) · Springer eBooks · doi:10.1007/978-1-4020-5690-1_3 · Cited by 65
(Tightly) QCCA-Secure Key-Encapsulation Mechanism in the Quantum Random Oracle Model
Xagawa, K., & Yamakawa, T. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-25510-7_14 · Cited by 64
Quantum Image Edge Extraction Based on Improved Sobel Operator
Zhou, R., & Liu, D. (2019) · International Journal of Theoretical Physics · doi:10.1007/s10773-019-04177-6 · Cited by 61
Haraka v2 – Efficient Short-Input Hashing for Post-Quantum Applications
Kölbl, S., Lauridsen, M. M., Mendel, F., & Rechberger, C. (2017) · IACR Transactions on Symmetric Cryptology · doi:10.46586/tosc.v2016.i2.1-29 · Cited by 65
Oskin, M., Chong, F. T., Chuang, I. L., & Kubiatowicz, J. D. (2003) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/859618.859661 · Cited by 61
Long, G., & Liu, Y. (2008) · Frontiers of Computer Science in China · doi:10.1007/s11704-008-0021-z · Cited by 60
Automatic Object Segmentation by Quantum Cuts
Aytekin, Ç., Serkan Kiranyaz, B., & Gabbouj, M. (2014) · Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition · doi:10.1109/icpr.2014.29 · Cited by 60
Optimizing Teleportation Cost in Distributed Quantum Circuits
Moghadam, M. Z., Houshmand, M., & Houshmand, M. (2017) · International Journal of Theoretical Physics · doi:10.1007/s10773-017-3618-x · Cited by 59
Quantum circuit representation of Bayesian networks
Borujeni, S. E., Nannapaneni, S., Nguyen, N. H., Behrman, E., & Steck, J. E. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.114768 · Cited by 63
Circuit Depth Reduction for Gate-Model Quantum Computers
Gyöngyösi, L., & Imre, S. (2020) · Scientific Reports · doi:10.1038/s41598-020-67014-5 · Cited by 65
Deep-Neural-Network Discrimination of Multiplexed Superconducting-Qubit States
Lienhard, B., Vepsäläinen, A. P., Govia, L. C. G., Hoffer, C. R., Qiu, J. Y., Ristè, D., Ware, M., Kim, D. K., Winik, R., Melville, A. J., et al. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.17.014024 · Cited by 73
An Automated Deductive Verification Framework for Circuit-building Quantum Programs
Chareton, C., Bardin, S., Bobot, F., Perrelle, V., & Valiron, B. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-72019-3_6 · Cited by 86
QDiff: Differential Testing of Quantum Software Stacks
Wang, J., Zhang, Q., Xu, G. H., & Kim, M. (2021) · IEEE/ACM International Conference on Automated Software Engineering (ASE) · doi:10.1109/ase51524.2021.9678792 · Cited by 82
QFaaS: A Serverless Function-as-a-Service framework for Quantum computing
Nguyen, H. T., Usman, M., & Buyya, R. (2024) · Future Generation Computer Systems · doi:10.1016/j.future.2024.01.018 · Cited by 77
Naik, A. S., Yeniaras, E., Hellstern, G., Prasad, G., & Vishwakarma, S. (2025) · Financial Innovation · doi:10.1186/s40854-025-00751-6 · Cited by 75
Nondeterministic Quantum Query and Communication Complexities
de Wolf, R. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539702407345 · Cited by 67
Quantum walks, Ihara zeta functions and cospectrality in regular graphs
Ren, P., Aleksić, T., Emms, D., Wilson, R. C., & Hancock, E. R. (2010) · Quantum Information Processing · doi:10.1007/s11128-010-0205-y · Cited by 60
Daskin, A., & Kais, S. (2011) · The Journal of Chemical Physics · doi:10.1063/1.3575402 · Cited by 60
Software Speed Records for Lattice-Based Signatures
Güneysu, T. E., Oder, T., Pöppelmann, T., & Schwabe, P. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38616-9_5 · Cited by 60
Quantum Computing for Computer Architects
Metodi, T. S., & Chong, F. T. (2006) · Synthesis lectures on computer architecture · doi:10.1007/978-3-031-01718-6 · Cited by 61
Cost analysis of hash collisions : will quantum computers make SHARCS obsolete?
Bernstein, D. J. (2009) · TU/e Research Portal · Cited by 61
Szymanski, T. H. (2022) · IEEE Access · doi:10.1109/access.2022.3169137 · Cited by 59
On Bitcoin Security in the Presence of Broken Cryptographic Primitives
Giechaskiel, I., Cremers, C. J. F., & Rasmussen, K. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-45741-3_11 · Cited by 63
An Enhanced Quantum K-Nearest Neighbor Classification Algorithm Based on Polar Distance
Feng, C., Zhao, B., Zhou, X., Ding, X., & Shan, Z. (2023) · Entropy · doi:10.3390/e25010127 · Cited by 70
Synthesizing Quantum Circuits of AES with Lower T-depth and Less Qubits
Huang, Z., & Sun, S. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-22969-5_21 · Cited by 63
Conservation of Information in Search: Measuring the Cost of Success
Dembski, W. A., & Marks II, R. J. (2009) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/tsmca.2009.2025027 · Cited by 59
A quantum-inspired genetic algorithm for solving the antenna positioning problem
Dahi, Z. A., Mezioud, C., & Draa, A. (2016) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2016.06.003 · Cited by 58
Optimized surface code communication in superconducting quantum computers
Javadi-Abhari, A., Gokhale, P., Holmes, A. A., Franklin, D. M., Brown, K. R., Martonosi, M., & Chong, F. T. (2017) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1145/3123939.3123949 · Cited by 69
Hosoyamada, A., & Sasaki, Y. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-76953-0_11 · Cited by 59
The NISQ Analyzer: Automating the Selection of Quantum Computers for Quantum Algorithms
Salm, M., Barzen, J., Breitenbücher, U., Leymann, F., Weder, B., & Wild, K. (2020) · Communications in computer and information science · doi:10.1007/978-3-030-64846-6_5 · Cited by 66
Adaptive quantum computation in changing environments using projective simulation
Tiersch, M., Ganahl, E. J., & Briegel, H. J. (2015) · Scientific Reports · doi:10.1038/srep12874 · Cited by 56
Practical Lattice-Based Cryptography: NTRUEncrypt and NTRUSign
Hoffstein, J., Howgrave-Graham, N., Pipher, J. C., & Whyte, W. (2009) · Information security and cryptography · doi:10.1007/978-3-642-02295-1_11 · Cited by 60
Abreu, A. C. D. (2007) · Cited by 59
Quantum Optimization: Potential, Challenges, and the Path Forward
Abbas, A., (NNSA), U. N. N. S. A., Ambainis, A., Augustino, B., Bärtschi, A., Buhrman, H., Coffrin, C., Cortiana, G., Dunjko, V., Egger, D., et al. (2023) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/2229681 · Cited by 65
Reliable hash trees for post-quantum stateless cryptographic hash-based signatures
Kermani, M. M., & Azarderakhsh, R. (2015) · Proceedings · doi:10.1109/dft.2015.7315144 · Cited by 59
Scheduling of space to ground quantum key distribution
Polnik, M., Mazzarella, L., Carlo, M. D., Oi, D. K. L., Riccardi, A., & Arulselvan, A. (2020) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-020-0079-6 · Cited by 63
Expanding Data Encoding Patterns For Quantum Algorithms
Weigold, M., Barzen, J., Leymann, F., & Salm, M. (2021) · IEEE International Conference on Software Architecture Companion (ICSA-C) · doi:10.1109/icsa-c52384.2021.00025 · Cited by 67
Teaching Quantum Computing to High-School-Aged Youth: A Hands-On Approach
Angara, P. P., Stege, U., MacLean, A., Müller, H. A., & Markham, T. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3127503 · Cited by 71
Quantum Cryptography for Future Networks Security: A Systematic Review
Durr-E-Shahwar, Imran, M., Altamimi, A. B., Khan, W., Hussain, S., & Alsaffar, M. S. (2024) · IEEE Access · doi:10.1109/access.2024.3504815 · Cited by 78
Exact Quantum Algorithms for the Leader Election Problem
Tani, S., Kobayashi, H., & Matsumoto, K. (2012) · ACM Transactions on Computation Theory · doi:10.1145/2141938.2141939 · Cited by 59
Measuring energy, estimating Hamiltonians, and the time-energy uncertainty relation
Aharonov, Y., Massar, S., & Popescu, S. (2002) · Physical Review A · doi:10.1103/physreva.66.052107 · Cited by 55
Esser, A., Kübler, R., & May, A. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-63715-0_17 · Cited by 58
The Complexity of Computations
Pudlák, P. (2013) · Springer monographs in mathematics · doi:10.1007/978-3-319-00119-7_5 · Cited by 57
A theory of computation based on quantum logic (I)
Ying, M. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2005.04.001 · Cited by 57
Quantum machine learning for data scientistsPreprint
Kopczyk, D. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1804.10068 · Cited by 74
Status report on the second round of the NIST lightweight cryptography standardization process
Turan, M. S., McKay, K. A., Chang, D., Çalık, Ç., Bassham, L. E., Kang, J., & Kelsey, J. M. (2021) · doi:10.6028/nist.ir.8369 · Cited by 72
Improved Quantum Algorithm for Triangle Finding via Combinatorial Arguments
Gall, F. L. (2014) · 2014 IEEE 55th Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2014.31 · Cited by 56
LEDAkem: A Post-quantum Key Encapsulation Mechanism Based on QC-LDPC Codes
Baldi, M., Barenghi, A., Chiaraluce, F., Pelosi, G., & Santini, P. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-79063-3_1 · Cited by 57
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
