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,401–6,500 of 8,792
Diósi, L. (2011) · Lecture notes in physics · doi:10.1007/978-3-642-16117-9_1 · Cited by 1
Kovács, L., & Pintér, Á. (2015) · doi:10.17048/tsz.2015.3 · Cited by 1
Schuld, M., & Petruccione, F. (2018) · Quantum science and technology · doi:10.1007/978-3-319-96424-9_3 · Cited by 1
APCFS – Post-Quantum Code Based Aggregate Signature Scheme
Makarov, A. (2019) · Voprosy kiberbezopasnosti · doi:10.21681/2311-3456-2019-2-69-76 · Cited by 1
Beyond the Binary: Building a Quantum Future
Ghose, S. (2021) · Morals & Machines · doi:10.5771/2747-5182-2021-1-44 · Cited by 1
Viability of quantum communication across interstellar distances
Berera, A., & Calderón-Figueroa, J. (2022) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.105.123033 · Cited by 4
Simulation and randomized measurement of topological phase on a trapped-ion quantum computer
Ahn, C.-E., & Cho, G. Y. (2022) · Journal of the Korean Physical Society · doi:10.1007/s40042-022-00536-5 · Cited by 1
Effect of Noise on Concurrence of Compact Photonic CNOT Gate Designed Using Universal Cloner
Sharma, A. K., Sharma, S. K., & Sharma, R. (2022) · Lecture notes in electrical engineering · doi:10.1007/978-981-19-0252-9_22 · Cited by 1
A Quantum Computing Approach to Harnessing the Logic of the Mind for Brain–Computer Interfacing
Miranda, E. R. (2022) · Springer eBooks · doi:10.1007/978-3-030-95538-0_9 · Cited by 1
Experimental Approach of the Quantum Volume on Different Quantum Computing Devices
Galanis, I. P., Savvas, I. Κ., & Garani, G. (2022) · Studies in computational intelligence · doi:10.1007/978-3-030-96627-0_43 · Cited by 1
Learning Based Hardware-Centric Quantum Circuit Generation
Schalkers, M. A., & Möller, M. (2022) · Communications in computer and information science · doi:10.1007/978-3-031-06668-9_22 · Cited by 1
On capabilities of quantum-mechanical computer models
Simonović, S. (2022) · Tehnika · doi:10.5937/tehnika2203337s · Cited by 1
A Quantum Mechanical Proof of Insecurity of the Theoretical QKD Protocols
Zhao, J. (2022) · Journal of Quantum Information Science · doi:10.4236/jqis.2022.123006 · Cited by 1
The Security of Information Systems and Image Processing Supported by the Quantum Computer: A review
Nouioua, T., & Belbachir, A. H. (2022) · Advances in Science Technology and Engineering Systems Journal · doi:10.25046/aj070609 · Cited by 1
Quantum Reinforcement Learning for Multi-Armed Bandits
Liu, Y.-P., Li, K., Cao, X., et al. (2022) · Chinese Control Conference (CCC) · doi:10.23919/ccc55666.2022.9902595 · Cited by 1
Hamidi-Rad, S., & Kaewell, J. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00141 · Cited by 1
Many Known Quantum Algorithms Are Optimal: Symmetry-Based Proofs
Крейнович, В., Galindo, O., & Kosheleva, O. M. (2022) · International Journal of Computing · doi:10.47839/ijc.21.4.2776 · Cited by 1
Quantum algorithm for matrix logarithm by integral formula
Wang, Y., Xiang, H., & Zhang, S. (2023) · Quantum Information Processing · doi:10.1007/s11128-022-03824-y · Cited by 1
IND-CCA Security of Kyber in the Quantum Random Oracle Model, Revisited
Zhao, C., Lu, X., Jia, D., et al. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-26553-2_8 · Cited by 1
Quantum Weighted Fractional-Order Transform
Zhao, T., & Chi, Y. (2023) · Fractal and Fractional · doi:10.3390/fractalfract7030269 · Cited by 1
Some Remarks on Super-Gram Operators for General Bipartite Quantum States
Gielerak, R., & Sawerwain, M. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-30445-3_16 · Cited by 1
(2020) · Electronic Journal of Mathematical Analysis and Applications · doi:10.21608/ejmaa.2020.312815 · Cited by 1
An Enhanced Study of Quantum Computing in the View of Machine Learning
Muthusamy, A., Ramprasath, M., Kalpana, A. V., & Ravishankar, T. N. (2023) · Advances in computer and electrical engineering book series · doi:10.4018/978-1-6684-7535-5.ch009 · Cited by 1
Ukai, R., Yoshimura, C., & Mizuno, H. (2023) · International Symposium on Computing and Networking · doi:10.1109/candar60563.2023.00034 · Cited by 1
Raikwar, M., & Wu, S. (2023) · Advances in information security · doi:10.1007/978-3-031-32146-7_2 · Cited by 3
Molotkov, S. N. (2023) · Письма в Журнал экспериментальной и теоретической физики · doi:10.31857/s1234567823010123 · Cited by 1
Adaptive protocols for the quantum depolarizing channel
Leung, A. W. (2007) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 1
Two-player interaction in quantum computing : cryptographic primitives & query complexity
Magnin, L. (2011) · theses.fr (ABES) · doi:10.70675/7fd872caz151az4eadzb0f5zc53f4c46586d · Cited by 1
Quantum Computing: A Way to Break Complexity?
Gesù, V. D., & Palma, G. M. (2003) · Springer eBooks · doi:10.1007/978-94-010-0155-7_21 · Cited by 1
Electron and hole spins in quantum dots
Pingenot, J. (2009) · doi:10.17077/etd.xsppxnst · Cited by 1
An Eigenanalysis and Synthesis of Unitary Operators used in Quantum Computing Algorithms
Hutsell, S. T. (2000) · doi:10.15760/etd.251 · Cited by 1
On exponential polynomials and quantum computingPreprint
Ohno, Y., Sasaki, Y., & Yamazaki, C. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0908.1027 · Cited by 1
Quantum games as quantum types
Delbecque, Y. (2009) · eScholarship@McGill (McGill) · doi:10.82308/15959 · Cited by 2
Chang, B. R. (2006) · Lecture notes in computer science · doi:10.1007/11881599_113 · Cited by 1
A Review of Procedure to Evolve Quantum ProceduresPreprint
Gepp, A., & Stocks, P. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0708.3278 · Cited by 1
Binary Subdivision for Quantum SearchPreprint
Zakaria, M. N. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1101.4703 · Cited by 1
String Matching in ${\tilde O}(\sqrt{n}+\sqrt{m})$ Quantum TimePreprint
Ramesh, H., & Vinay, V. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0011049 · Cited by 1
Kim, E. D. (2009) · Deep Blue (University of Michigan) · Cited by 1
Richter, P. C., & Szegedy, M. (2008) · Springer eBooks · doi:10.1007/978-0-387-30162-4_302 · Cited by 1
Adiabatic Quantum ComputingPreprint
Pinski, S. D. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1108.0560 · Cited by 2
Quantum Evaluation of Multi-Valued Boolean FunctionsPreprint
Iwama, K., Kawachi, A., Masuda, H., Putra, R. H., & Yamashita, S. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0304131 · Cited by 2
Hamiltonian Graphs and the Traveling Salesman ProblemPreprint
Mehendale, D. P. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0704.3672 · Cited by 1
Eigenvalues and Low Energy Eigenvectors of Quantum Many-Body SystemsPreprint
Movassagh, R. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1211.4908 · Cited by 1
Progress towards the creation of an on-demand single photon source using Rydberg atoms
Day, J. O. (2008) · PhDT · Cited by 1
Non-Cooperative Quantum Game TheoryPreprint
Lee, C. F., & Johnson, N. F. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0210192 · Cited by 1
Implementation of Quantum Fourier Transform and Simulation of Wave Functions by Fixed InteractionPreprint
Ozhigov, Y. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0201132 · Cited by 1
Constant-Time Quantum Algorithm For The Unstructured Search ProblemPreprint
Younes, A. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0811.4247 · Cited by 1
Quantum Inductive Learning and Quantum Logic Synthesis
Lukáč, M. (2000) · doi:10.15760/etd.2316 · Cited by 1
Quantum selfish gene (biological evolution in terms of quantum mechanics)Preprint
Ozhigov, Y. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1402.4713 · Cited by 1
Introduction to Quantum Computers and Quantum AlgorithmsPreprint
Zalka, C. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0305053 · Cited by 1
NP in BQP with NonlinearityPreprint
Gossett, P. (1998) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9804025 · Cited by 1
Quantum Phase Imaging using Spatial EntanglementPreprint
Lu, C.-H., Reichert, M. C., Sun, X., et al. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1509.01227 · Cited by 1
Decoder for Nonbinary CWS Quantum CodesPreprint
Melo, N., Santiago, D. F. G., & Portugal, R. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1204.2218 · Cited by 1
Algorithmic Cooling of a Quantum SimulatorPreprint
Kafri, D., & Taylor, J. M. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1207.7111 · Cited by 1
Grover's Quantum Search Algorithm and Free Fermionic Heterotic ModelsPreprint
Robinson, M. B., & Cleaver, G. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0810.1296 · Cited by 1
Exploiting the deep structure of constraint satisfaction problems with quantum computers
Hogg, T. (1997) · National Conference on Artificial Intelligence · Cited by 1
Teleportation of composite systems for communication and information processing
Louis, S. G. R., Greentree, A. D., Munro, W. J., et al. (2009) · Quantum Information and Computation · doi:10.26421/qic9.1-2-1 · Cited by 1
Entanglement in the Interaction Between Two Quantum Oscillators Systems
Kim, I., & IAFRATE, G. J. (2004) · Foundations of Physics Letters · doi:10.1007/s10702-004-0902-9 · Cited by 1
A new quantum claw-finding algorithm for three functions
Iwama, K., & Kawachi, A. (2003) · New Generation Computing · doi:10.1007/bf03037306 · Cited by 1
Quantum algorithms a decade after shor
Ambainis, A. (2004) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1007352.1007354 · Cited by 1
Chang, B. R., & Tsai, H. F. (2006) · Advances in intelligent systems research/Advances in Intelligent Systems Research · doi:10.2991/jcis.2006.125 · Cited by 1
Numerical method of entangled state selection in association of molecules
Arakelov, K. S., & Ozhigov, Y. I. (2008) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.801911 · Cited by 1
Contact between laboratory instruments and equations of quantum mechanics
Myers, J. M., & Madjid, F. H. (2000) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.391960 · Cited by 1
Parameterized Quantum Gates and Multidimensional Uncertainty of Information
Mayfield, J. L., & Ralescu, A. (2006) · Annual Meeting of the North American Fuzzy Information Processing Society (NAFIPS) · doi:10.1109/nafips.2006.365858 · Cited by 1
Schmidt Decomposition for Quantum Entanglement in Quantum Algorithms
OSHIMA, K. (2007) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1093/ietfec/e90-a.5.1012 · Cited by 1
Quantum Computation: Particle and Wave Aspects of AlgorithmsPreprint
Patel, A. D. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1108.1659 · Cited by 1
Gittins, B. (2010) · doi:10.1145/1852666.1852733 · Cited by 1
Neuro-quantum networks in tasks of pattern recognition
Ambaryan, T. R. (2006) · International Conference Physics and Control · doi:10.1109/phycon.2005.1514039 · Cited by 1
A Mathematical Theory of NMR Quantum Computations
Nishino, T. (2002) · Springer eBooks · doi:10.1007/978-4-431-66979-1_33 · Cited by 1
Projeto de um coprocessador quântico para otimização de algoritmos criptográficos.
Possignolo, R. T. (2012) · Digital Library of Theses and Dissertations (Universidade de São Paulo) · doi:10.11606/d.3.2012.tde-21062013-101915 · Cited by 1
Data Structures in Classical and Quantum ComputingPreprint
Fillinger, M. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1308.0833 · Cited by 1
Generalization of Common Gates for Quantum Computation
Ralescu, A., & Mayfield, L. (2005) · Annual Meeting of the North American Fuzzy Information Processing Society (NAFIPS) · doi:10.1109/nafips.2005.1548607 · Cited by 1
Feature Selection based on QFT
Zhou, R., Jiang, N., Yang, S., et al. (2007) · International Conference on Natural Computation (ICNC) · doi:10.1109/icnc.2007.384 · Cited by 1
Algorithm-based analysis of collective decoherence in quantum search
Master, C. P., Utsunomiya, S., & Yamamoto, Y. (2006) · Progress in Informatics · doi:10.2201/niipi.2006.3.2 · Cited by 1
Quantum Information Processing and its Linear Optical Implementation
Calsamiglia, J. (2001) · Työväentutkimus Vuosikirja · Cited by 2
Photonic crystal chips for optical interconnects and quantum information processing
Englund, D., Faraon, A., Fushman, I., et al. (2008) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.774680 · Cited by 1
LSI-BASED EFFICIENT EMULATION OVERCOMING ALGORITHMIC RESTRICTIONS INHERENT IN QUANTUM COMPUTERS
Fujishima, M. (2003) · Fluctuation and Noise Letters · doi:10.1142/s0219477503001476 · Cited by 1
Regularizing BWGC/NGARCH Model by Quantum Minimization
Chang, B. R., Tsai, H. F., Chen, S. H., et al. (2006) · doi:10.1109/icicic.2006.338 · Cited by 1
About mathematical apparatus of many body quantum dynamicsPreprint
Ozhigov, Y. I. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0604055 · Cited by 1
Investigations in Quantum Computing: Causality and Graph Isomorphism
Beckman, D. (2004) · CaltechTHESIS (California Institute of Technology) · doi:10.7907/s1r0-0v87 · Cited by 1
Graph Matching using Interference of Coined Quantum Walks
Emms, D., Hancock, E. R., & Wilson, R. C. (2006) · Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition · doi:10.1109/icpr.2006.615 · Cited by 1
Everything is a matter of degree: A new theoretical justification of Zadeh’s principle
Nguyen, H. T., & Крейнович, В. (2008) · Annual Meeting of the North American Fuzzy Information Processing Society (NAFIPS) · doi:10.1109/nafips.2008.4531303 · Cited by 1
Quantum Direct Product Theorems for Symmetric Functions and Time-Space Tradeoffs
Ambainis, A., Špalek, R., & Wolf, R. (2005) · Cited by 1
Constructions of quantum Bose–Chadhuri–Hocquenghem code using spectral techniques
Guo, Y., Zeng, G., Lee, M. H., & Jianping Fan, B. (2007) · Physica Scripta · doi:10.1088/0031-8949/76/2/006 · Cited by 1
Constant‐time solution to database searching by NMR ensemble computing
Hsueh, C.-C., & Chen, C. ‐. (2006) · Fortschritte der Physik · doi:10.1002/prop.200510300 · Cited by 1
Quantum Algorithms for Matrix Multiplication and Product Verification
Kothari, R., & Nayak, A. (2016) · Springer eBooks · doi:10.1007/978-1-4939-2864-4_303 · Cited by 2
A light-matter interface based on ion Coulomb crystals in an optical cavity
Albert, M. (2010) · Cited by 1
Quantum Optics in Information and Control
Zhi, T., & Colin, W. (2013) · National University of Singapore · Cited by 1
Quantum error modelling and correction in long distance teleportation using singlet states
Aung, J. (2002) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 1
Haverkort, H. J., & Toma, L. (2016) · Springer eBooks · doi:10.1007/978-1-4939-2864-4_585 · Cited by 1
Spingineering : quantum control in the presence of relaxation
Recht, B. (2002) · Cited by 1
An approach to bridging atom optics and bulk spin quantum computation
Murali, K. V. R. M. (2003) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 1
Time-space tradeoffs for two-way finite automataPreprint
Zheng, S., Qiu, D., & Gruska, J. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1507.01346 · Cited by 1
On the Complexity of Searching Maximum of a Function on a Quantum ComputerPreprint
Goćwin, M. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0507060 · Cited by 1
Coherent control of nuclear and electron spins for quantum information processing
Park, K. (2015) · UWSpace (University of Waterloo) · Cited by 1
Quaternions, Octonions, and the Quantization of Games
Ahmed, A. (2009) · doi:10.15760/etd.7814 · Cited by 1
The Effective Solving of the Tasks from NP by a Quantum ComputerPreprint
Sysoev, S. S. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1401.6030 · Cited by 1
Time-Optimal Control of Quantum Systems: Numerical Techniques and Singular Trajectories
Holden, T. (2011) · UWSpace (University of Waterloo) · Cited by 1
О сравнительной сложности квантовых и классических бинарных программ
Gainutdinova, A., & Gainutdinova, A. (2002) · Дискретная математика · doi:10.4213/dm258 · Cited by 1
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
