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 5,401–5,500 of 8,792
The Building and Optimization of Quantum Database
Shi-man, X., & Xin-zhi, S. (2012) · Physics Procedia · doi:10.1016/j.phpro.2012.03.282 · Cited by 2
Realization of the new summing algorithm on an NMR ensemble quantum computer
Wei, D., Yang, X., Luo, J. L., Sun, X., & Zeng, X. (2004) · Chemical Physics Letters · doi:10.1016/j.cplett.2004.08.009 · Cited by 2
Security Evolution in Vehicular Systems
Lang, D., Corbett, C., & Kargl, F. (2016) · edoc Publication server (Humboldt University of Berlin) · doi:10.18452/1433 · Cited by 2
Performance and error modeling of Deutsch's algorithm in IBM Q
Buksman, E., de Oliveira, A. L. F., & Allende, C. (2020) · Revista Mexicana de Física · doi:10.31349/revmexfis.66.239 · Cited by 2
Generalised Quantum Tree Search
Sequeira, A., Santos, L. P., & Barbosa, L. S. (2021) · doi:10.1109/q-se52541.2021.00015 · Cited by 2
Information Hiding Using Quantum Image Processing State of Art Review
Thenmozhi, S., BalaSubramanya, K., Shrinivas, S., et al. (2021) · Lecture notes in networks and systems · doi:10.1007/978-981-33-4305-4_18 · Cited by 2
Secure Multiparty Computation in the Bounded Storage Model
Liu, J., & Vusirikala, S. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92641-0_14 · Cited by 2
Quantum Density Peak Clustering Algorithm
Wu, Z., Song, T., & Zhang, Y. (2022) · Entropy · doi:10.3390/e24020237 · Cited by 2
An Efficient 2D Mapping of Quantum Circuits to Nearest Neighbor Designs
Bhattacharjee, A., & Rahaman, H. (2021) · International Symposium on Smart Electronic Systems · doi:10.1109/ises52644.2021.00024 · Cited by 1
Evaluating Hash-Based Post-Quantum Signature in Smart IoT Devices for Authentication
Tandel, P., & Nasriwala, J. (2022) · Lecture notes on data engineering and communications technologies · doi:10.1007/978-981-16-9605-3_44 · Cited by 2
Kendon, V. M. (2011) · Springer eBooks · doi:10.1007/978-1-4614-1800-9_148 · Cited by 2
Bolfing, A. (2020) · Oxford University Press eBooks · doi:10.1093/oso/9780198862840.003.0007 · Cited by 2
Control of quantum particle dynamics by impulses of magnetic field
Архинчеев, В. Е. (2016) · Nonlinear Dynamics · doi:10.1007/s11071-016-3159-5 · Cited by 2
Beyond the Binary: Building a Quantum Future
Ghose, S. (2021) · Morals & Machines · doi:10.5771/2747-5174-2021-1-44 · Cited by 2
Bhattacharyya, M., & Raina, A. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05074-8 · Cited by 2
Constant-time Quantum Algorithm for Homology Detection of Closed Curves
Nghiem, N. A., Gu, X. D., & Wei, T.-C. (2023) · Optica Quantum 2.0 Conference and Exhibition · doi:10.1364/quantum.2023.qm4b.6 · Cited by 2
A Novel Pauli Evolutionary Quantum Algorithm for Combinatorial Optimization
Xiong, Y., Liang, X., & Miao, F. (2010) · Chinese Journal of Electronics · Cited by 2
Ren, P., Aziz, F., Han, L., et al. (2013) · Advances in computer vision and pattern recognition · doi:10.1007/978-1-4471-5628-4_6 · Cited by 2
Solving Unbounded Knapsack Problem Based on Quantum Genetic Algorithms
Chen, R.-C., Huang, Y.-H., & Lin, M. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12145-6_35 · Cited by 2
Zuliani, P. (2005) · Lecture notes in computer science · doi:10.1007/11560319_23 · Cited by 3
Implementation of Quantum Logic Gates Using Coupled Bose-Einstein Condensates
Luiz, F. S., Duzzioni, E. I., & Sanz, L. (2015) · Brazilian Journal of Physics · doi:10.1007/s13538-015-0347-6 · Cited by 2
Numerical Analysis on a Quantum Computer
Heinrich, S. (2006) · Lecture notes in computer science · doi:10.1007/11666806_3 · Cited by 2
The Quantum Computing Challenge
Vitanyi, P. M. B. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44577-3_15 · Cited by 2
A Formal Technique for Reducing Software Testing Time Complexity
Baig, M. M., & Khan, A. A. (2009) · Springer eBooks · doi:10.1007/978-90-481-3658-2_34 · Cited by 2
Graph Similarity Using Interfering Quantum Walks
Emms, D., Hancock, E. R., & Wilson, R. C. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-74272-2_102 · Cited by 2
Realizacje układów odwracalnych w technologiach półprzewodnikowych
Szyprowski, M., & Kerntopf, P. (2011) · Pomiary Automatyka Kontrola · Cited by 2
Contabilidad, Ontología y el futuro
MATTESSICH, R. V. (2013) · Contaduría Universidad de Antioquia · doi:10.17533/udea.rc.14681 · Cited by 2
Improved Algorithms for Quantum Identification of Boolean Oracles
Ambainis, A., Iwama, K., Kawachi, A., Raymond, R., & Yamashita, S. (2006) · Lecture notes in computer science · doi:10.1007/11785293_27 · Cited by 2
Quantum Processes: A Novel Optimization for Quantum Simulation
Maron, A., Reiser, R., Pilla, M. L., et al. (2013) · TEMA (São Carlos) · doi:10.5540/tema.2013.014.03.0399 · Cited by 2
Incentive compatible quantum secure division
Yang, W., Huang, L., Zhu, Y. W., et al. (2010) · The European Physical Journal D · doi:10.1140/epjd/e2010-00210-9 · Cited by 2
Chang, B. R., & Tsai, H. F. (2007) · Applied Intelligence · doi:10.1007/s10489-007-0110-y · Cited by 2
Design and Implementation of Quantum Factorization Algorithm
Fu, X.-Q., Bao, W., & Zhou, C. H. (2010) · International Symposium on Intelligent Information Technology and Security Informatics · doi:10.1109/iitsi.2010.150 · Cited by 2
Schemes for teleportation of quantum gates
Mendes, F. V., & Ramos, R. V. (2010) · Quantum Information Processing · doi:10.1007/s11128-010-0189-7 · Cited by 2
Computational Model Based on Evolutionary Primitives
Granichin, O. N., & Vasilev, V. (2010) · International Journal of Nanotechnology and Molecular Computation · doi:10.4018/jnmc.2010010103 · Cited by 2
Digital Quantum Forensics: Challenges and Responses
Overill, R. E. (2011) · Communications in computer and information science · doi:10.1007/978-3-642-22309-9_13 · Cited by 2
Quantum Mechanics and Computation
D’Hooghe, B., & Pykacz, J. (2004) · Foundations of Science · doi:10.1007/s10699-005-4827-y · Cited by 2
Circuit QED: implementation of the three-qubit refined Deutsch–Jozsa quantum algorithm
Su, Q.-P., & Yang, C. (2014) · Quantum Information Processing · doi:10.1007/s11128-014-0829-4 · Cited by 2
CHANG, B., TSAI, H., & Young, C.-P. (2007) · Expert Systems with Applications · doi:10.1016/j.eswa.2007.05.001 · Cited by 2
Efficient simulation of quantum-based searching
Varga, T., & Bacsárdi, L. (2014) · International Conference on Software, Telecommunications and Computer Networks (SoftCOM) · doi:10.1109/softcom.2014.7039089 · Cited by 2
Noisy Grovers searching algorithm
Ellinas, D., & Konstadakis, C. (2001) · Optical Fiber Communication Conference and International Conference on Quantum Information · doi:10.1364/icqi.2001.pb12 · Cited by 2
High performance quantum cryptography architectures in IEEE 802.11 WLAN
Ma, H., & Wang, S. (2010) · International Conference on Advanced Computer Control · doi:10.1109/icacc.2010.5486846 · Cited by 2
Evolutionary Algorithms for Quantum Computers
Johannsen, D., Kurur, P. P., & Lengler, J. (2013) · Algorithmica · doi:10.1007/s00453-013-9784-1 · Cited by 2
Simulation methods for quantum walks on graphs applied to formal language recognition
Barr, K. E., Fleming, T., & Kendon, V. M. (2014) · Natural Computing · doi:10.1007/s11047-014-9441-x · Cited by 2
Solving the flexible job-shop scheduling problem with quantum-inspired algorithm
Wu, X. (2012) · World Congress on Intelligent Control and Automation · doi:10.1109/wcica.2012.6357938 · Cited by 2
Unstructured Fingerprint Database Matching Method Based on Grover’s Quantum Algorithm
Li, H., & Zhang, Z. (2012) · Journal of Software · doi:10.4304/jsw.7.10.2301-2308 · Cited by 2
The shortest path method for quantum Boolean circuits construction
Lu, C.-Y., & Wang, S.-A. (2013) · IEEE International Conference on Nanotechnology (IEEE-NANO) · doi:10.1109/nano.2013.6721055 · Cited by 2
Quantum-minimized BWGC/NGARCH approach to financial time series forecast
Chang, B. R., & Tsai, H. F. (2008) · Neurocomputing · doi:10.1016/j.neucom.2008.11.002 · Cited by 2
An application of quantum-inspired particle swarm optimization to function optimization problems
Tazuke, K., Muramoto, N., Matsui, N., et al. (2013) · 2022 International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2013.6706880 · Cited by 2
Cryptography from tensor problems
Schulman, L. J. (2012) · CaltechAUTHORS (California Institute of Technology) · Cited by 2
A Novel Multiagent Reinforcement Learning Algorithm Combination with Quantum Computation
Meng, X., Chen, Y., Pi, Y., et al. (2006) · World Congress on Intelligent Control and Automation · doi:10.1109/wcica.2006.1712835 · Cited by 2
Quantum computation techniques for gauging reliability of interval and fuzzy data
Longpré, L., & Servín, C. (2008) · Annual Meeting of the North American Fuzzy Information Processing Society (NAFIPS) · doi:10.1109/nafips.2008.4531328 · Cited by 2
A logarithmic time complexity algorithm for pattern searching using product–sum property
Aamir, K. M., Abbas, M., & Radenović, S. (2011) · Computers & Mathematics with Applications · doi:10.1016/j.camwa.2011.07.001 · Cited by 2
Recognition of Noisy English Letter by Quantum Back Propagation Network
Zhao, S., Huang, J., & Zheng, B. (2006) · doi:10.1109/icosp.2006.345748 · Cited by 2
On Random Routing and its Application to Quantum Interconnection Networks
Ratan, R., Shukla, M., & Oruç, A. Y. (2006) · Conference on Information Sciences and Systems · doi:10.1109/ciss.2006.286436 · Cited by 2
An Improved Semi-blind Joint Data Detection and Channel Estimation Algorithm for MIMO-OFDM System
Shen, J. Q., Wu, M., & Luan, L. (2012) · INTERNATIONAL JOURNAL ON Advances in Information Sciences and Service Sciences · doi:10.4156/aiss.vol4.issue1.47 · Cited by 2
Dolev, S., Korach, E., Li, X., Li, Y., & Uzan, G. (2016) · Theoretical Computer Science · doi:10.1016/j.tcs.2016.04.032 · Cited by 1
Coherent Computing with Injection-Locked Laser Network
Utsunomiya, S., Wen, K., Takata, K., Tamate, S., & Yamamoto, Y. (2015) · Lecture notes in physics · doi:10.1007/978-4-431-55756-2_10 · Cited by 2
Quantum Multiple-Valued Decision Diagrams Containing Skipped Variables.
Feinstein, D. Y., & Thornton, M. A. (2015) · Cited by 2
Introducción a la computación cuántica
Díaz-Caro, A. (2015) · Cited by 2
Data Search Algorithms based on Quantum Walk
Fujisaki, M., Miyajima, H., & Shigei, N. (2012) · Lecture notes in computer science · Cited by 2
Improvements for the XL Algorithm with Applications to Algebraic Cryptanalysis
Fachbereich, V. (2011) · Cited by 2
High-Speed Emulation of the Quantum Computing Based on Logic Operations
Saito, K., Suzuki, Y., Fujishima, M., et al. (2002) · International Conference on Solid State Devices and Materials (SSDM) · doi:10.7567/ssdm.2002.p1-5 · Cited by 2
Deaton, R. J. (2001) · Cited by 2
Failures Guide Probabilistic Search for a Hard-to-Find Test
Venkatasubramanian, M., & Agrawal, V. D. (2016) · IEEE North Atlantic Test Workshop (NATW) · doi:10.1109/natw.2016.18 · Cited by 2
Optimizations and Complexity Analysis on the Quantum Level
Abdessaied, N., & Drechsler, R. (2016) · Springer eBooks · doi:10.1007/978-3-319-31937-7_5 · Cited by 2
Optimal Parallel Quantum Query Algorithms
Jeffery, S., Magniez, F., & de Wolf, R. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44777-2_49 · Cited by 1
Quantum Teleportation and Grover’s Algorithm Without the Wavefunction
Niestegge, G. (2017) · Foundations of Physics · doi:10.1007/s10701-016-0060-5 · Cited by 5
Rapid prototyping with symbolic computation: Fast development of quantum annealing solutions
Hodson, M. J., Fletcher, D., Padilha, D., et al. (2016) · IEEE High Performance Extreme Computing Conference · doi:10.1109/hpec.2016.7761632 · Cited by 2
Quantum Identification of Boolean Oracles
Ambainis, A., Iwama, K., Kawachi, A., Raymond, R., & Yamashita, S. (2006) · Springer eBooks · doi:10.1007/11683858_1 · Cited by 4
Optimal control protocols can be exponentially accelerated by quantum algorithms
Sun, H., Zhang, J., Wu, R.-B., RABITZ, H. A., & Tarn, T. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7798682 · Cited by 2
Generalized quantum counting algorithm for non-uniform amplitude distribution
Tan, J., Ruan, Y., Li, X., et al. (2017) · Quantum Information Processing · doi:10.1007/s11128-016-1471-0 · Cited by 2
Grover's Quantum Search Algorithm and Mixed States
Kenigsberg, D., & Biham, E. (2001) · Cited by 2
Data Analytics in Quantum Paradigm: An Introduction
Maitra, A., Maitra, S., & Pal, A. K. (2017) · Springer eBooks · doi:10.1007/978-3-319-54840-1_15 · Cited by 2
Evolution Via Epr-Entanglement Algorithm
Cooper, W. G. (2017) · Journal of Biomedical Engineering and Medical Imaging · doi:10.14738/jbemi.42.2795 · Cited by 1
Kalp Hastaları İçin Bulut Bilişim Temelli Erken Uyarı Sistemi
ERYILMAZ, Ö., KAHRAMAN, İ., & ŞAHİN, M. (2016) · Journal of Advanced Research in Natural and Applied Sciences · doi:10.28979/comufbed.277922 · Cited by 2
Incomplete information and quantum decision trees
Kak, S. C. (2017) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/smc.2017.8122615 · Cited by 2
The spectral analysis of the unitary matrix of a 2-tessellable staggered quantum walk on a graph
Konno, N., Ide, Y., & Sato, I. (2018) · Linear Algebra and its Applications · doi:10.1016/j.laa.2018.01.022 · Cited by 2
Quantum resistant NTRU-based key distribution scheme for SIP
Jeong, S., Park, K., & Park, Y. (2018) · International Conference on Electronics, Information, and Communication (ICEIC) · doi:10.23919/elinfocom.2018.8330689 · Cited by 2
Consequences of EPR–Proton Qubits Populating DNA
Cooper, W. G. (2018) · Advances in quantum chemistry · doi:10.1016/bs.aiq.2017.12.001 · Cited by 2
Amplitude Amplification for Operator Identification and Randomized Classes
Bera, D. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-94776-1_48 · Cited by 1
A Hybrid Metaheuristic Algorithm Based on Quantum Genetic Computing for Image Segmentation
Djemame, S., & Batouche, M. (2018) · Springer eBooks · doi:10.1007/978-3-319-77625-5_2 · Cited by 2
Sadowski, P., Pawela, Ł., Lewandowska, P., & Kukulski, R. (2019) · International Journal of Theoretical Physics · doi:10.1007/s10773-019-04212-6 · Cited by 2
Application of Isotopic Materials Science in Bulk and Low-Dimensional Structures
Plekhanov, V. G. (2018) · Springer series in materials science · doi:10.1007/978-3-319-42261-9_4 · Cited by 2
Schnorr Digital Signature to Improve Security Using Quantum Cryptography
Kumari, P., Kumar, U., & Singh, S. K. (2019) · Springer eBooks · doi:10.1007/978-981-13-3185-5_7 · Cited by 2
The Impact of Quantum Computing on Computer Science
Amellal, H., Meslouhi, A., & Allati, A. E. (2019) · Lecture notes in intelligent transportation and infrastructure · doi:10.1007/978-3-030-11196-0_51 · Cited by 2
A Quantum Algorithm for Minimising the Effective Graph Resistance upon Edge Addition
de Ridder, F., Neumann, N. M. P., Veugen, T., et al. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-14082-3_6 · Cited by 2
Lower Bounding the AND-OR Tree via Symmetrization
Kretschmer, W. (2021) · ACM Transactions on Computation Theory · doi:10.1145/3434385 · Cited by 2
Quantum Algorithm for Triangle Finding in Sparse Graphs
Gall, F. L., & Nakajima, S. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-48971-0_50 · Cited by 2
Quantum algorithms for formula evaluation
Ambainis, A. (2010) · NATO science for peace and security series. D, Information and communication security · doi:10.3233/978-1-60750-547-1-115 · Cited by 8
Quantum Information and Statistical Mechanics: An Introduction to Frontier
Fujii, K. (2013) · Interdisciplinary Information Sciences · doi:10.4036/iis.2013.1 · Cited by 3
Quantum-Based Solutions for the Next-Generation Internet
Niemiec, M., Dziech, A., Stypiński, M., et al. (2019) · Information & Security An International Journal · doi:10.11610/isij.4306 · Cited by 2
How Quantum Cryptography and Quantum Computing Can Make Cyber-Physical Systems More Secure
Tosh, D. K., Galindo, O., Крейнович, В., et al. (2020) · scholarworks - UTEP (The University of Texas at El Paso) · Cited by 2
Optimizing Quantum Models of Classical Channels: The Reverse Holevo Problem
Loomis, S. P., Mahoney, J. R., Aghamohammadi, C., & Crutchfield, J. P. (2020) · Journal of Statistical Physics · doi:10.1007/s10955-020-02649-2 · Cited by 2
Quantum control using quantum memory
Roget, M., Herzog, B., & Molfetta, G. D. (2020) · Scientific Reports · doi:10.1038/s41598-020-78455-3 · Cited by 2
Kaptol, Y., & Горбенко, І. Д. (2020) · Radiotekhnika · doi:10.30837/rt.2020.3.202.03 · Cited by 4
Um estudo passo a passo dos algoritmos de Grover e Shor
Vieira, L. A., & de Albuquerque, C. D. (2020) · C Q D - Revista Eletrônica Paulista de Matemática · doi:10.21167/cqdvol19ic201023169664lavcda0120 · Cited by 2
Wong, R., & Bhatia, A. S. (2021) · Advances in information security, privacy, and ethics book series · doi:10.4018/978-1-7998-6677-0.ch005 · Cited by 2
The spectra of the unitary matrix of a 2-tessellable staggered quantum walk on a graph
Konno, N., Sato, I., & Segawa, E. (2016) · Institutional Repositories DataBase (IRDB) · Cited by 2
Quantum algorithms for structured prediction
Sepehry, B., Iranmanesh, E., Friedlander, M. P., & Ronagh, P. (2022) · Quantum Machine Intelligence · doi:10.1007/s42484-022-00078-w · Cited by 2
Nagata, K., Wong, R., Diep, D. N., & Nakamura, T. (2023) · Quantum Studies Mathematics and Foundations · doi:10.1007/s40509-023-00294-4 · Cited by 2
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
