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 6,801–6,900 of 8,792
Remarks on Servo Controller Using Quantum Neural Network with Qubit Neurons
Takahashi, K. (2012) · Spring Congress on Engineering and Technology · doi:10.1109/scet.2012.6341959
Computational Performance of Quantum Phase Estimation Algorithm
Jiayu, Z., Junsuo, Z., & Xu, F. (2013) · doi:10.5121/csit.2013.3303
On efficien quantum algorithm using classical amplificatio process
Iriyama, S., & Ohya, M. (2014) · IEEE International Conference on Cognitive Informatics · doi:10.1109/icci-cc.2014.6921446
Enlarging the gap between quantum and classical query complexity of multifunctions
Vasilieva, A., Shishova, E., & Mischenko-Slatenkova, T. (2013) · International Conference on Natural Computation (ICNC) · doi:10.1109/icnc.2013.6818058
Quantum collision search algorithm against New FORK-256
Du, F., Wang, H., & Ma, Z. (2014) · Journal of Electronics (China) · doi:10.1007/s11767-014-3146-2
Quaternary quantum algorithm for determining properties of quaternary logic function
Khan, M. H. A. (2011) · International Conference on Computer and Information Technology (ICCIT) · doi:10.1109/iccitechn.2011.6164771
Quantum Separation of Local Search and Fixed Point Computation
Chen, X., Sun, X., & Teng, S. (2009) · Algorithmica · doi:10.1007/s00453-009-9289-0 · Cited by 1
Boolean Functions of Low Polynomial Degree for Quantum Query Complexity Theory
Freivalds, R., & Garkaje, L. (2007) · IEEE International Symposium on Multiple-Valued Logic (ISMVL) · doi:10.1109/ismvl.2007.11
The Research of Auto-regressive Load-Balancing Model Based on Quantum Clustering
Dong, Y., Li, Z., & Chen, T. (2013) · International Symposium on Computational Intelligence and Design · doi:10.1109/iscid.2013.221
High precision quantum query algorithm for computing AND-based boolean functions
Vasilieva, A., & Mischenko-Slatenkova, T. (2010) · ACM International Conference on Computing Frontiers (CF) · doi:10.1145/1787275.1787332
FROM THE QUBIT TO THE QUANTUM SEARCH ALGORITHMS
Cariolaro, G., & Occhipinti, T. (2007) · doi:10.1142/9789812779458_0033
Non-traditional Approach to Quantum Computing
Geru, I. I. (2014) · Applied Magnetic Resonance · doi:10.1007/s00723-014-0594-7
Gueddana, A., Attia, M., & Chatta, R. (2015) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.2076669
Quantum computations on ion traps
Burkov, A. S., & Ozhigov, Y. (2008) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.801895
Approximability of Optimization Problems through Adiabatic Quantum Computation
Cruz-Santos, W., & Morales-Luna, G. B. (2014) · Synthesis lectures on quantum computing · doi:10.2200/s00596ed1v01y201409qmc009 · Cited by 1
An improved quantum query algorithm for computing AND Boolean function
Vasilieva, A., & Mischenko-Slatenkova, T. (2010) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2010.5586292
Minimizing Reversible Circuits in the 2n Scheme Using Two and Three Bits Patterns
Lukáč, M., Hawash, M., Kameyama, M., et al. (2014) · Euromicro Conference on Digital System Design (DSD) · doi:10.1109/dsd.2014.106
A Macroscopic Device for Quantum Computation
Aerts, D., D’Hondt, E., D’Hooghe, B., et al. (2007) · International Journal of Theoretical Physics · doi:10.1007/s10773-007-9507-y
EXPLORATIONS IN QUANTUM COMPUTING FOR FINANCIAL APPLICATIONS
Gare, J. (2010) · Summit (Simon Fraser University)
Semiclassical genetic algorithm with quantum crossover and mutation operationsPreprint
Saitoh, A., Rahimi, R., & Nakahara, M. (2012) · arXiv (Cornell University)
Collapsing a Perfect Superposition to a Chosen Quantum State without Measurement
Younes, A., & Abdel‐Aty, M. (2014) · PLoS ONE · doi:10.1371/journal.pone.0103612
Plummeting the Software Testing Time Complexity
Baig, M. M., & Khan, A. A. (2009) · World Congress on Software Engineering (WCSE) · doi:10.1109/wcse.2009.465
Quantum Algorithms of Bio-molecular Solutions for the Clique Problem on a Quantum ComputerPreprint
Chang, W.-L., Ren, T.-T., Feng, M., Luo, J. L., Lin, K. W., Guo, M., & Lu, L. C. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0905.2028
Quantum Algorithms and Complexity for Numerical Problems
Zhang, C. (2011) · doi:10.7916/d8gf11gx
An efficient functional verification method for quantum boolean circuits
Wang, S.-A., Lu, C.-Y., & Kuo, S. (2005) · IEEE Conference on Nanotechnology (IEEE NANO) · doi:10.1109/nano.2004.1392436
AN ASSOCIATIVE MODEL BASED ON QUANTUM SEARCH ALGORITHMS
Miyajima, H., & Fujisaki, N. S. M. (2013) · Digital Enterprise and Information Systems
An approach to realize a quantum NOT gate through optical implementation
Sajeed, S., Mozumder, Z. H., Ahmed, A., Ullah, S. M., & Rafique, S. (2010) · IEEE International Conference on Electro Information Technology · doi:10.1109/eit.2010.5612117
Quantum Computation and Many Body Physics
D’Souza, A. G. (2014) · Libraries and Cultural Resources (University of Calgary) · doi:10.5072/prism/27510 · Cited by 1
Computação quântica baseada em medidas projetivas em sistemas quânticos abertos
Arruda, L. G. E. (2011) · Digital Library of Theses and Dissertations (Universidade de São Paulo) · doi:10.11606/t.76.2011.tde-30082011-091437
On evolutionary algorithms for effective quantum computing
Kruger, M. G. (2012) · SUNScholar (Stellenbosch University)
Some aspects of computing, data security and upcoming technologies
Holleboom, L. J. (2002)
Introduction to Quantum Information Processing
Kashefi, E. (2004)
Characterization of non-universal two-qubit Hamiltonians
Mančinska, L. (2009) · UWSpace (University of Waterloo)
From non-abelian anyons to quantum computation to coin-flipping by telephone
Mochon, C. (2005) · CERN Document Server (European Organization for Nuclear Research) · doi:10.7907/7js5-ve50
Quantum elastic net and the traveling salesman problem
Kostenko, B. F., Pribiš, J., & Yur'iev, M. Z. (2009) · Physics of Particles and Nuclei Letters · doi:10.1134/s1547477109070231
Analysis and design of symmetric cryptographic algorithms
Aumasson, J.-P. (2009) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · doi:10.5075/epfl-thesis-4506
A Study of Quantum Strategies for Newcomb's Paradox
Mihara, T. (2010) · iBusiness · doi:10.4236/ib.2010.21004
Computing with Tensors: Potential Applications of Physics-Motivated Mathematics to Computer Science
Ceberio, M. C., & Крейнович, В. (2008) · scholarworks - UTEP (The University of Texas at El Paso)
A Quantum Algorithm for Finding Minimum Exclusive-Or Expressions
Sampson, M., Voudouris, D., & Papakonstantinou, G. (2007) · IEEE Computer Society Annual Symposium on VLSI · doi:10.1109/isvlsi.2007.17
Sun TZUand quantum information - a strategic view for the information technique of tomorrow
Chang, M. (2005) · IEEE International Engineering Management Conference (IEMC) · doi:10.1109/iemc.2005.1559245
Quantum algorithms for bio-molecular solutions to the satisfiability problem on a quantum computer
Chang, W.-L., Ren, T.-T., Luo, J., Feng, M., & Guo, M. (2008) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2008.4630931
A New Combinatorial Optimal Algorithm Based on QEA
Zhang, Y., & Li, G. (2009) · doi:10.1109/ebiss.2009.5137881
Scalable Optical MEMS Technology for Quantum Information Processing
Knoernschild, C. W. (2011) · DukeSpace (Duke University)
Toward Quantum Matchmaker Agents
Klusch, M. (2008) · IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT) · doi:10.1109/wiiat.2008.15
Lange, T. (2011) · Springer eBooks · doi:10.1007/978-1-4419-5906-5_413
Control-target inversion property on Abelian groupsPreprint
Amini, M. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0308148
Natural Dynamics of Spin Chains
Ronke, R. (2012) · White Rose eTheses Online (University of Leeds, The University of Sheffield, University of York)
Adiabatic quantum evolution for preparation of quantum entanglement states
Jiayan, W., & Daowen, Q. (2008) · Chinese Control Conference (CCC) · doi:10.1109/chicc.2008.4605004
Exact Algorithms for 0-1 Integer Programs with Linear Equality ConstraintsPreprint
Ueno, K. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1405.6851
A reconfigurable accelerator for quantum computations
Zampetakis, M., Samoladas, V., & Dollas, A. (2008) · International Conference on Field Programmable Logic and Applications (FPL) · doi:10.1109/fpl.2008.4630024
Discrete adiabatic quantum computation with quadric variation
El-fiky, M., Ono, S., & Nakayama, S. (2010) · World Congress on Nature and Biologically Inspired Computing (NaBIC) · doi:10.1109/nabic.2010.5716272
Noise in quantum and classical computation & non-locality
Unger, F. (2008) · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands
A Symbolic Approach to Quantum Computation Simulation
Pereira, A., & Rodrigues, R. (2006) · Lecture notes in computer science · doi:10.1007/11758525_61
Vector quantization complexity and quantum computing
Gastaldo, P., Ridella, S., & Zunino, R. (2005) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2004.1381201
Woods, D., Naughton, T. J., & Gibson, J. P. (2001)
A novel quantumized Fuzzy C-medians algorithm
Srivastava, P., Nallabelly, M., & Verma, V. K. (2009) · International Conference on Computer Science & Education (ICCSE) · doi:10.1109/iccse.2009.5228262
Probabilistic Model-Checking of Quantum Protocols (Extended Abstract)
Nagarajan, R., & Papanikolaou, N. K. (2005)
Entanglement and Interference Resources in Quantum Computation and Communication
Stahlke, D. (2014) · KiltHub Repository · doi:10.1184/r1/6716282
Mani, A., & Patvardhan, C. (2011) · International Conference on Information Technology: New Generations · doi:10.1109/itng.2011.218
Hybrid Intelligent Data Fusion Approach to Collision Warning Information Extraction
Chang, B. R., & Tsai, H. F. (2011) · International Journal of Fuzzy Systems · doi:10.30000/ijfs.201106.0007
Protection of information in quantum databases
Ozhigov, Y. (1997) · CERN Document Server (European Organization for Nuclear Research)
Development of the Visible Light Photon Counter for Applications in Quantum Information Science
McKay, K. S. (2011) · DukeSpace (Duke University)
Quantum versions of k-CSP algorithms
Dantsin, E. Y., Wolpert, A., & Крейнович, В. (2006) · ACM Symposium on Applied Computing · doi:10.1145/1141277.1141663
Models of Query Complexity for Boolean Functions
Chakraborty, S. (2010)
Study of Unentanglement in Quantum Computers
Chikhi, R. (2008)
QUANTUM COMPUTATION BASED PROBABILITY DENSITY FUNCTION ESTIMATION
Balázs, F., & Imre, S. (2004) · International Journal of Quantum Information · doi:10.1142/s0219749905000578
Plekhanov, V. G. (2012) · SpringerBriefs in physics · doi:10.1007/978-3-642-28750-3_4
Parametrizações otimais de trajetórias adiabáticas em sistemas quânticos dissipativos
Gontijo, M. M. (2012) · Digital Library of Theses and Dissertations (Universidade de São Paulo) · doi:10.11606/d.43.2012.tde-05122014-101358
Research on Qos Routing Protocol Based on Quantum State Algorithm for MANET
Meng, L., Zhou, K., Xu, Z., et al. (2009) · International Conference on Natural Computation (ICNC) · doi:10.1109/icnc.2009.302
Using Quantum Search to Solve Dynamic Maximum Network Flow Problem
Chen, C., Lin, Y., Chou, Y., et al. (2011) · IEEE International Symposium on Parallel and Distributed Processing with Applications (ISPA) · doi:10.1109/ispa.2011.12
QUANTUM LEARNING SEMINAR LECTURE 1: INTRODUCTION
MEYER, D. A. (2002)
Approaching unstructured search from function bilateral symmetry detection - A quantum algorithmPreprint
Kumar, D., & Srivastava, P. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1505.01116
Continuous-variable quantum computation of oracle decision problems
Sanders, B. C., Høyer, P., & Adcock, M. (2012) · doi:10.5072/prism/25442
An Upper Bound on the Rate of Information Transfer by Grover’s Oracle
Arıkan, E. (2006) · Lecture notes in computer science · doi:10.1007/11889342_25
Introducció matemàtica a la computació quàntica
Perna, J. R., & Descamps, S. X. (2013) · RECERCAT (Consorci de Serveis Universitaris de Catalunya) · doi:10.2436/20.2002.01.51
On fault-tolerance of Grover's algorithm
Nahimovs, N., Rivosh, A., & Kravchenko, D. (2012)
Mwanik, S., Kahonge, A. M., & Miriti, E. K. (2013)
Studies in the efficiency and (versus) security of cryptographic tasks
Barak, B., & Mahmoody, M. (2010)
Square Root of \Not": A Major Difierence Between Fuzzy and
Logics, Q., Крейнович, В., Kohout, L., et al. (2009)
RESEARCH ARTICLE Quantum Computation Techniques for Gauging Reliability of Interval and Fuzzy Data
Servín, C., & Крейнович, В. (2009)
Artificial Neural Network-inspired Quantum Adiabatic Evolution Algorithm with Energy Dissipation
Kinjo, M., Sato, S., Nakamiya, Y., et al. (2005) · IEICE Proceedings Series
Whiteld, J. D. (2011)
The complexity class PDQP SPUR Final Paper: Summer 2013
Lee, M., Bouland, A., & Aaronson, S. (2013)
QUANTUM ENTANGLEMENT DISTILLATION IN THE STABILIZER FORMALISM
Ingenieurswetenschappen, F., & Elektrotechniek, D. (2007)
Quantum operators: A classical perspective
Georgiou, T. (2009)
Collision Finding with Many Classical or Quantum Processors
Jeery, S. (2011) · Cited by 1
Impossibility of a Quantum Speed-up with a Faulty Oracle
Sackler, B. (2008)
A Quantum Neural Network Approach for Portfolio Selection
Ahilya, D. (2011)
Construction and Application to Complex Networks
Comellas, F. (2014)
nite automata with quantum and classical states
Grilo, A. B., & Moura, A. V. (2012)
A Practical for Reliable Quantum Computers
Oskin, M., Frederic, T., & Isaac, L. (2002)
A QuantumReinforcement Learning MethodforRepeated GameTheory
Chen, C. (2006)
Practical Lattice Basis Sampling Reduction
Informatik, V. F. (2005)
Vasilieva, A. (2013)
Introduction to Quantum Information
von Steinkirch, M. (2011)
QUANTUM INFORMATION EXCHANGE BETWEEN PHOTONS AND ATOMS
Yi-min, W. (2013) · National University of Singapore
Introduction to Quantum Mechanics From Geometry to Spectra
Lindner, J. F. (2015)
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
