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 7,201–7,300 of 8,792
Quantum Spike Neural NetworkPreprint
Chen, Y., Guo, H., Wang, C., Gao, X., & Wu, J. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2011.05062
Liu, C. (2020) · D-Scholarship@Pitt (University of Pittsburgh)
Quantum learning algorithms imply circuit lower boundsPreprint
Arunachalam, S., Grilo, A. B., Gur, T., Oliveira, I. C. L., & Sundaram, A. (2020) · arXiv (Cornell University) · Cited by 1
Time-Space Lower Bounds for Simulating Proof Systems with Quantum and Randomized VerifiersPreprint
Mudigonda, A. S., & Williams, R. (2020) · arXiv (Cornell University) · doi:10.4230/lipics.itcs.2021.50
Qsimulation V2.0: An Optimized Quantum Simulator
Wu, H., Deng, Y., Xu, M., et al. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-64276-1_16
Flores, A. A. O. (2020) · Revista de la Escuela de Física · doi:10.5377/ref.v8i1.10085
de Jager, T. (2014) · Datenschutz und Datensicherheit - DuD · doi:10.1007/s11623-014-0204-8
Symmetry and Quantum Query-To-Communication Simulation
Chakraborty, S., Chattopadhyay, A., Høyer, P., Mande, N. S., Paraashar, M., & de Wolf, R. (2022) · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · doi:10.4230/lipics.stacs.2022.20 · Cited by 2
Time-inhomogeneous Quantum Markov Chains with Decoherence on Finite State SpacesPreprint
Chou, C.-H., & Yang, W.-S. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2012.05449
Quantum network routing via link prediction
Száva, A. (2019) · Research Repository (Delft University of Technology)
QuPAA: Exploiting Parallel and Adaptive Architecture to Scale up Quantum Computing
Fu, Y., Sun, Y., & Li, T. (2020) · IEEE International Conference on Computer Design: VLSI in Computers and Processors (ICCD) · doi:10.1109/iccd50377.2020.00037
Fault-tolerantly implementing dense rotation operations based on non-stabilizer states
Xiang-Yan, W., Yan-Ling, X., Ya-Fei, Y., & Zhang, Z. (2014) · Acta Physica Sinica · doi:10.7498/aps.63.220304
Quantum Search Algorithm and Its Applications
Chang, W.-L., & Vasilakos, A. V. (2020) · Studies in big data · doi:10.1007/978-3-030-63583-1_3
Quantum Implementation for Comparing Sets of Data
Roth, Y. G. (2021) · Journal of Physics Conference Series · doi:10.1088/1742-6596/1730/1/012009
Apply Quantum Search to the Safety Check for Mono Operational Attribute Based Protection Systems
Hu, V. C. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-68851-6_12
Implementation of Gradient Descent Method by Optical Treatment
TSUJIBAYASHI, T., NITTA, K., Quan, X., & Matoba, O. (2019) · The Review of Laser Engineering · doi:10.2184/lsj.47.3_164
Parallelism strategies for the tuneable golden-claw finding problem
Azarderakhsh, R., Biasse, J., Khatib, R. E., Langenberg, B., & Pring, B. (2021) · International Journal of Computer Mathematics Computer Systems Theory · doi:10.1080/23799927.2021.1884605
Entanglement-Enabled Information Processing Implies Human Consciousness Mechanism
Grant Cooper, W. (2018) · Physical Science & Biophysics Journal · doi:10.23880/psbj-16000106
Quantum programming. Pt.1: Development tools analysis
Ryabov, N., В., И. О., Korenkov, V., et al. (2020) · System Analysis in Science and Education · doi:10.37005/2071-9612-2020-3-53-64
Classical Computation in the Quantum World
Huang, J. (2019) · Deep Blue (University of Michigan)
Giraldo, D., & Steibeck, M. (2020)
When Turing Meets Deutsch: A Confrontation between Classical Computing and Quantum Computing
D’Hondt, E. (2002) · VUBIR (Vrije Universiteit Brussel)
Models of quantum search algorithms. Introduction for IT students – pedagogical examples
В., И. О., Ryabov, N., Korenkov, V., & Ulyanov, S. V. (2020) · System Analysis in Science and Education · doi:10.37005/2071-9612-2020-1-126-151
The quantum mechanical notion of unobservable causal loop and the anthropic principlePreprint
Castagnoli, G. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.03173
Quantum Algorithms in CyberneticsPreprint
Nikolov, P. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.05952 · Cited by 1
Gong, M.-J. M. (2020) · TSpace (University of Toronto)
Computational Perspectives on Bell Inequalities and Many-body Quantum CorrelationsPreprint
Hoban, M. J. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1204.5913 · Cited by 1
Araújo, T., & Panetta, J. (2019) · Simpósio Brasileiro de Cibersegurança (SBSeg) · doi:10.5753/sbseg.2019.13959
Helm, L., & Julien, C. (2007)
Security of Quantum Key Distribution Against All Collective Attacks
Gelles, R., & Iit, T. (2005)
Quantum Walks, Feynman Propagators and Graph Topology on an IBM Quantum ComputerPreprint
Feng, Y., Miceli, R., & McGuigan, M. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2104.06458
Gaussian Boson Sampling Complexity
Tanggara, A. (2021) · ANU Open Research (Australian National University) · doi:10.25911/j9r5-e059
Time-inhomogeneous Quantum Walks with Decoherence on Discrete Infinite SpacesPreprint
Chou, C.-H., & Yang, W.-S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2104.09104
QZNs: Quantum Z-numbersPreprint
Deng, J., & Deng, Y. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2104.05190
Applications of Locality and Asymmetry to Quantum Fault-Tolerance
Newman, M. (2018) · Deep Blue (University of Michigan)
On Assessing the Quantum Advantage for MaxCut Provided by Quantum Neural Network AnsätzePreprint
Lee, J. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2105.05365
Implementing Quantum Gates With Length-3 Dynamic Graphs
Adisa, I. A. (2021) · Creighton Digital Repository (CDR)
Grover's Algorithm for Question AnsweringPreprint
Correia, A. D., Moortgat, M., & Stoof, H. T. C. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.05299 · Cited by 2
Comparison on security of single server and multiple servers blind quantum protocolsPreprint
Sano, Y. (2021) · arXiv (Cornell University)
Quantum Computers Can Find Quadratic Nonresidues in Deterministic Polynomial TimePreprint
Draper, T. G. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.03991
Bao, M., Powers, C., & Perkowski, M. A. (2021) · Proceedings/Proceedings - International Symposium on Multiple-Valued Logic · doi:10.1109/ismvl51352.2021.00029
Квантовая теория физических явлений и квантовые вычисления
Капитан, В. Ю., Dyachenko, O. I., Nefedev, K. V., & Belokon, V. I. (2020) · Publishing House of the Far Eastern Federal University eBooks · doi:10.24866/7444-4849-3
White-Box Encryption Scheme Using a Quantum Memory.Preprint
Kuwakado, H., Hirose, S., & Mambo, M. (2021) · IACR Cryptology ePrint Archive
On a poset of quantum exact promise problems
Combarro, E. F., Vallecorsa, S., Meglio, A. D., et al. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03156-3
Fault-Tolerant Logical Operators in Quantum Error-Correcting Codes
Webster, P. (2021) · The Sydney eScholarship Repository (The University of Sydney)
Post-Quantum Cryptography: Computational-Hardness Assumptions and Beyond.Preprint
Attema, T., Gervasoni, N., Marcus, M., & Spini, G. (2021) · IACR Cryptology ePrint Archive
On the Probabilistic Degree of an $n$-variate Boolean Function
Srinivasan, S., & Venkitesh, S. (2021) · doi:10.4230/lipics-approx/random.2021.42
MDE4QAI: Towards Model-Driven Engineering for Quantum Artificial IntelligencePreprint
Moin, A., Challenger, M., Badii, A., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.06708
Modeling Time-Dependent Systems using Dynamic Quantum Bayesian NetworksPreprint
Borujeni, S. E., & Nannapaneni, S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.00713 · Cited by 5
Implementable Hybrid Quantum Ant Colony Optimization AlgorithmPreprint
Mikel, G. D. A., & Echanobe, J. (2021) · arXiv (Cornell University)
OPTIMALISASI WAKTU, SUHU, DAN pH FERMENTASI DAGING SAPI (Bos taurus) SEBAGAI BAHAN BAKU SOSIS
Nurul Putri, A. (2025) · Universitas Pasundan institutional repositories & scientific journals (Universitas Pasundan)
Multiplicative inverse with quantum search algorithm under π/18 phase rotation
Yang, Y.-F., Duan, L., Qiu, T., & Xie, X.-M. (2021) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-021-01704-5
Grover’s Algorithm and Walsh Spectrum
Sapv, T., Bera, D., Maitra, A., & Maitra, S. (2021) · SpringerBriefs in computer science · doi:10.1007/978-981-16-3061-3_3
Conclusion and Research Direction
Sapv, T., Bera, D., Maitra, A., et al. (2021) · SpringerBriefs in computer science · doi:10.1007/978-981-16-3061-3_5
Mathivanan, A., Prabhu, P., Venkataraman, R., & Palani, S. (2021) · Research Square · doi:10.21203/rs.3.rs-739081/v1
Universal Quantum Gates based on Quantum DotsPreprint
Tiwari, Y., & Poonia, V. S. (2021) · arXiv (Cornell University)
On the Exponential Sample Complexity of the Quantum State Sign Estimation ProblemPreprint
Rattew, A. G., & Pistoia, M. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2108.03193
Discrete Time Multi-particle Grover Search
Um, C. (2021) · International Conference on Communication and Electronics Systems (ICCES) · doi:10.1109/icces51350.2021.9489199
Majorana Nanostructures and Their Electrostatic Environment
Woods, B. D. (2021) · doi:10.33915/etd.8241
On the Computational Complexity of Determining ValuePreprint
Mondol, T. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2108.03462
Topological Properties and CharacterizationsPreprint
Zhang, J. H. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2108.07061 · Cited by 1
Semantic Security and Indistinguishability in the Quantum World
Gagliardoni, T., Hülsing, A., & Schaffner, C. (2015) · doi:10.48550/arxiv.1504.05255
Cao, X. (2021) · D-Scholarship@Pitt (University of Pittsburgh)
On a Categorically Sound Quantum Programming Language for Circuit Description
Rios, F. F. S. (2021) · DalSpace (Dalhousie University)
Quantum Grover's Oracles with Symmetry Boolean Functions
Gao, P. D. (2021) · doi:10.15760/etd.7622
Horgan, J., Murray, H., Malone, D., et al. (2021) · doi:10.1145/3477206.3477475
Processing Time Optimization for XMSS on an Object Oriented SPHINCS+ Implementation
Landa, R. S., Ortiz, O. O., & García, J. M. G. (2021) · Computación y Sistemas · doi:10.13053/cys-25-3-3331
Viera, L. C., & Liao, S.-H. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2109.06444
Testing Boolean Functions Properties
Xie, Z., Qiu, D., Cai, G., et al. (2021) · Fundamenta Informaticae · doi:10.46298/.8500
Application of graph theory in quantum computer sciencePreprint
Glos, A. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2109.12978
Parallel Quantum Pebbling: Analyzing the Post-Quantum Security of iMHFs.Preprint
Blocki, J., & Lee, S. (2021) · arXiv (Cornell University)
Quantum State Estimation and Tracking for Superconducting Processors Using Machine Learning
Barzili, S. L. (2021) · Chapman University Digital Commons (Chapman University) · doi:10.36837/chapman.000317
A quantum state readout method based on a single ancilla qubit
Ding, C., Li, T., Zhang, S., et al. (2021) · Acta Physica Sinica · doi:10.7498/aps.70.20211066
Aggarwal, D., Chen, Y., Kumar, R., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.07955
Evaluating NISQ Devices with Quadratic NonresiduesPreprint
Draper, T. G. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.09483
The Spooky Pebble Game.Preprint
Kornerup, N., Sadun, J., & Soloveichik, D. (2021) · arXiv (Cornell University)
Lower bounds on quantum query complexity for symmetric functionsPreprint
Mittal, R., Nair, S. S., & Patro, S. (2021) · arXiv (Cornell University)
A Programming Language For Quantum Oracle ConstructionPreprint
Tambde, A. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.12487
Topologically-driven impossibility of superposing unknown states.Preprint
Gavorová, Z. (2021) · arXiv (Cornell University)
Quantum Lattice SievingPreprint
Rodrigues, N., & Lackey, B. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.13352
Quadratic speedup of global search using a biased crossover of two good solutionsPreprint
Isomura, T. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.07680 · Cited by 3
Quantum Algorithms for Unsupervised Machine Learning and Neural NetworksPreprint
Landman, J. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.03598
Exploiting Long-Distance Interactions and Tolerating Atom Loss in Neutral Atom Quantum ArchitecturesPreprint
Baker, J. M., Litteken, A., Duckering, C., Hoffman, H., Bernien, H., & Chong, F. T. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.06469
Fixed-point Quantum Walk Search.Preprint
Li, L., Xu, Y., & Delong, Z. (2021) · arXiv (Cornell University)
Reflection-Based Adiabatic State PreparationPreprint
Lemieux, J., Scherer, A., & Ronagh, P. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.05461
The Impact of Logical Errors on Quantum Algorithms via Jump Formalism.Preprint
Subasi, O., & Krishnamoorty, S. (2021) · arXiv (Cornell University)
Physics of Complex Present: Properties of Action Strategy Cloud
Lubashevsky, I., & Plavinska, N. (2021) · Understanding complex systems · doi:10.1007/978-3-030-82612-3_6
Quantum Heaviside Eigen SolverPreprint
Sun, Z.-Z., & Su, G. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.08288
Demonstration of Optimal Fixed Point Quantum Search Algorithm : An IBM Quantum Experience.Preprint
Das, B., Gurnani, K., Behera, B. K., et al. (2021) · arXiv (Cornell University)
On Generating a Probability Distribution Amenable to NISQ Using Modifications to Grover’s Algorithm
Pramanik, S., & Chandra, M. G. (2021) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce52317.2021.00072
Sampling Using Controlled Quantum Walks
Bencivenga, D. (2020) · doi:10.11575/prism/39381
Quantum Advantage for AllPreprint
Kirsch, C. M., & Muroya, S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.12063
Metropolis-style random sampling of quantum gates to estimate low-energy observablesPreprint
Unmuth-Yockey, J. (2021) · arXiv (Cornell University)
A Measurement-based Algorithm for Graph Colouring.
Epping, M., & Stollenwerk, T. (2021) · elib (German Aerospace Center)
Linear Cryptanalysis through the Lens of Clauser-Horne-Shimony-Holt GamePreprint
Maitra, A., Anand, R., & Dutta, S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.01656
Performing Search with a Quantum Computer
Williams, C. P. (2010) · Texts in computer science · doi:10.1007/978-1-84628-887-6_5
Hogg, M. (2014) · Otago University Research Archive (University of Otago)
On the computational power of quantum computers
Schwarz, M. (2013) · University of Vienna · doi:10.25365/thesis.31407
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
