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,401–7,500 of 8,792
Quantum Technologies II: Cryptography, Blockchains, and Sensing
Sharma, A., Paradkar, A., & Rao, V. N. (2022) · Lecture notes on data engineering and communications technologies · doi:10.1007/978-3-031-04613-1_2
Djordjević, I. B. (2022) · Elsevier eBooks · doi:10.1016/b978-0-12-822942-2.00010-8
Entanglement in Quantum Search Database: Periodicity Variations and Counting
Ellinas, D., & Konstandakis, C. (2022) · Quantum Reports · doi:10.3390/quantum4030015
Quantum learning of concentrated Boolean functions
Palem, K. V., Pham, D. H., & Rao, M. V. P. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03607-5
Implementing quantum computing on superconducting qubits
Tan, P. Y. Z. (2022) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/160507
de Albuquerque, C. D., da Silva, E. B., & Soares, W. S. (2022) · SpringerBriefs in mathematics · doi:10.1007/978-3-031-06833-1_1
Quantum Computing: Unraveling the Hype
Willett, K. D. (2022) · Advanced sciences and technologies for security applications · doi:10.1007/978-3-031-06636-8_3
Quantum distributional semantics
Correia, A. D. (2022) · doi:10.33540/631
Machine learning-aided and SAT-aided cryptanalysis of symmetric-key primitives
Tu, Y. (2022) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/160785
Quantum Algorithm for Finding Triangles
Richter, P. C. (2008) · Springer eBooks · doi:10.1007/978-0-387-30162-4_308
Quantum Bitcoin: The Intersection of Bitcoin, Quantum Computing and Blockchain
Zhu, Y., Ni, Q., Jiang, R., et al. (2022) · Advanced sciences and technologies for security applications · doi:10.1007/978-3-031-04424-3_12
Transformation of Superposed Quantum States Using Measurement Operators
Ito, H., & Iida, S. (2022) · Quantum Engineering · doi:10.1155/2022/4819682
Cryptocurrencies and Blockchain: Potential Applications in Government and Business
Pestunov, A. I. (2022) · Russian Social Science Review · doi:10.1080/10611428.2022.2111186
Analysis of Imperfect Rephasing in Photon Echo-Based Quantum Memories
Byoung Seung, H. A. M. (2022) · Entropy · doi:10.3390/e24101367
Algebraic representation of Three Qubit Quantum Circuit Problems
Y., C. K., Shah, N. M., & T., C. K. (2022) · Malaysian Journal of Mathematical Sciences · doi:10.47836/mjms.16.3.10
XOR Chain and Perfect Encryption at the Dawn of the Quantum EraPreprint
Lizama-Pérez, L. A. (2022) · Preprints.org · doi:10.20944/preprints202209.0295.v1
Preface to The Revised Paperback Edition
(2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.002.0006
Derivation of the Landau Criterion of Superfluidity and Landau Formula
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.005.0002
Landau Quantisation and Renormalisation of Rabi Splitting
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.005.0003
(2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.002.0004
(2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.002.0005
Scattering Rates of Polariton Relaxation
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.005.0001
(2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.002.0012
O Computador para o Século 21: Desafios de Segurança e Privacidade após 25 Anos
de Oliveira, L. W., Pereira, F. M. B., Misoczki, R., Aranha, D. F., Borges, F., Nogueira, M., & Wangham, M. S. (2017) · doi:10.5753/sbc.8410.6.1
(2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.002.0009
(2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.002.0007
Time bin quantum key distribution protocols for free space communications
Castillo, A. T., Eso, E., & Donaldson, R. J. (2022) · doi:10.1117/12.2632286
Quantum Algorithm for Search on Grids
Ambainis, A. (2015) · Encyclopedia of Algorithms · doi:10.1007/978-3-642-27848-8_311-2
(2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.002.0011
Quantum Algorithm for Finding Triangles
Jeffery, S., & Richter, P. C. (2015) · Encyclopedia of Algorithms · doi:10.1007/978-3-642-27848-8_308-2
Advanced quantum image representation and compression using a DCTEFRQI approachPreprint
Haque, M. E., Paul, M., Ulhoq, A., et al. (2022) · Research Square · doi:10.21203/rs.3.rs-2141467/v1
Quantum approximate counting for Markov chains and collision counting
Gall, F. L., & Ng, I.-I. (2022) · Quantum Information and Computation · doi:10.26421/qic22.15-16-1
Compact Public-Key Encryption Using Learning with Rounding
Pandit, A. A., & Mishra, A. (2022) · Lecture notes in networks and systems · doi:10.1007/978-981-19-5221-0_75
A linear algorithm for the restricted subtraction games
Yang, Z., He, Z., Li, L., et al. (2022) · Frontiers in Physics · doi:10.3389/fphy.2022.1049019
Huang, W. (2022) · Research Square · doi:10.21203/rs.3.rs-2200915/v1
Liu, L., Wei, S., Zhu, J., et al. (2022) · Springer eBooks · doi:10.1007/978-981-19-7636-0_5
Analysis of Quantum Search Algorithm for Weighted Solutions: Simple Case
Seo, Y., & Heo, J. (2022) · International Conference on Information and Communication Technology Convergence (ICTC) · doi:10.1109/ictc55196.2022.9952459
Optimal Estimation of Entangled States in Classical Quantum Simulator
Jin, K., & Cha, G. (2022) · International Conference on Information and Communication Technology Convergence (ICTC) · doi:10.1109/ictc55196.2022.9952834
Variational Quantum Search with Exponential SpeedupPreprint
Zhan, J. (2022) · Research Square · doi:10.21203/rs.3.rs-2388911/v1
Chang, C., Wang, W., He, X.-G., & Kao, H.-C. (2022) · Research Square · doi:10.21203/rs.3.rs-2076990/v1
QUANTUM COMPUTERS: AN OVERVIEW OF THEIR MARKET AND PHYSICAL REALISATIONS
MARMELLO, P. T. D. S. M., & PAULA, C. D. P. (2022) · doi:10.17771/pucrio.acad.61595
Mondal, B., Kar, U. N., Bandyopadhyay, C., et al. (2022) · Communications in computer and information science · doi:10.1007/978-3-031-21514-8_22
Kudelić, R. (2022) · SpringerBriefs in computer science · doi:10.1007/978-3-031-10515-9_4
Solving the Learning Parity with Noise Problem Using Quantum Algorithms
Tran, B., & Serge Vaudenay, B. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-17433-9_13
Software Science View on Quantum Circuit AlgorithmsPreprint
Gurevich, Y. G., & Blass, A. R. (2022) · SSRN Electronic Journal · doi:10.2139/ssrn.4250911
Public Key Cryptographic Implementation Validation: A Review
Mohan, P. V. A., Jacob, A., & Patil, R. S. (2022) · doi:10.1109/pkia56009.2022.9952350
On Security of Quantum Cryptography by Probabilistic Analysis
Zhao, J. (2022) · Journal of Quantum Information Science · doi:10.4236/jqis.2022.124008
Quanten-Computer: Die Sachemit der Katze
Küppers, B. (2022) · Studienbücher Informatik · doi:10.1007/978-3-658-37838-7_5
Implicit Rejection in Fujisaki-Okamoto: Framework and a Novel Realization
Zhao, C., Lu, X., Jia, D., et al. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-22390-7_8
ASSESSMENT OF THE SECURITY LEVEL OF MODERN STANDARDIZED CRYPTOGRAPHIC TRANSFORMATIONS
Lavryk, I., Chevardin, V., & Marchuk, O. (2022) · Communication informatization and cybersecurity systems and technologies · doi:10.58254/viti.2.2022.03.21
Kudelić, R. (2022) · SpringerBriefs in computer science · doi:10.1007/978-3-031-10515-9_3
Farmani, A., & Beyranvand, R. (2022) · Journal of Iranian Association of Electrical and Electronics Engineers · doi:10.52547/jiaeee.20.1.97
Quantum Complexity for Vector Domination Problem
Ambainis, A., & Zvirbulis, A. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-23101-8_22
Is Our World Becoming Less Quantum?
Castro, L., & Крейнович, В. (2023) · Studies in systems, decision and control · doi:10.1007/978-3-031-16415-6_23
(2011) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199233212.002.0007
(2011) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199233212.002.0004
(2011) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199233212.002.0003
(2011) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199233212.005.0001
(2011) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199233212.002.0006
Equivalence of single-server and multiple-server blind quantum computation protocols
Sano, Y. (2023) · Quantum Information Processing · doi:10.1007/s11128-022-03812-2
Europas Rolle im weltweiten Quantum Computing Rennen
Hauser, M., & Lechner, W. (2022) · Springer eBooks · doi:10.1007/978-3-658-37534-8_19
Bacsárdi, L., & Kis, Z. (2023) · Magyar Tudomány · doi:10.1556/2065.184.2023.2.8
Attacking and defending post-quantum cryptography candidates
Paiva, T. A. B. (2022) · Digital Library of Theses and Dissertations (Universidade de São Paulo) · doi:10.11606/t.45.2022.tde-30012023-200916
When a Quantum Scientist Interviews ChatGPTPreprint
Topaloglu, R. O. (2023) · doi:10.36227/techrxiv.21982619.v1
The Ihara expression of a generalization of the weighted zeta function on a finite digraph
Ishikawa, A. (2023) · Linear and Multilinear Algebra · doi:10.1080/03081087.2023.2172134
Comparisons of Classic and Quantum String Matching Algorithms✱
Gao, M., Huang, R., Mazumder, A. R., & Li, F. (2022) · International Conference on Advanced Information Science and System (AISS) · doi:10.1145/3573834.3574498
Lang, V. (2022) · Springer eBooks · doi:10.1007/978-3-662-66285-4_2
Modularized and Scalable Compilation for Double Quantum Dot Quatum ComputingPreprint
He, R.-H., Xu, X., Byrd, M., & Wang, Z.-M. (2023) · Research Square · doi:10.21203/rs.3.rs-2596937/v1
Comparative Analysis of Secure QKD Protocols for Small Satellites Constellation
Kaur, H., & Singh, J. S. P. (2023) · Lecture notes in electrical engineering · doi:10.1007/978-981-19-8555-3_21
A quantum annealing approach to solve max-cover problem
Uyen, N. T., An, N. C., Trang, D. M., & Sang, T. X. (2022) · Vinh University Journal of Science · doi:10.56824/vujs.2022nt29
Quantum rebound attacks on reduced‐round ARIA‐based hash functions
Baek, S., & Kim, J. (2023) · ETRI Journal · doi:10.4218/etrij.2022-0032
Software science view on quantum circuit algorithms
Gurevich, Y. G., & Blass, A. R. (2023) · Information and Computation · doi:10.1016/j.ic.2023.105024
Review of Quantum Computer Development
Kang, X. (2023) · Highlights in Science Engineering and Technology · doi:10.54097/hset.v34i.5373
McCullin, D. E. (2023) · Expeditions with MCUP · doi:10.36304/expwmcup.2023.04 · Cited by 1
Practical Implications of Dequantization on Machine Learning Algorithms: A Survey
Kulkarni, V. R., Chen, D., Xu, S., Guan, Q., & Chaudhary, V. (2023) · Smart innovation, systems and technologies · doi:10.1007/978-981-19-8094-7_3
Quantum algorithm for search of largest square on two dimensional map
Khadiev, K. R., & Remidovskii, V. (2022) · Academician O.B. Lupanov International Scientific Seminar "Discrete Mathematics and Its Applications" · doi:10.20948/dms-2022-25
Quantum algorithm for search of longest segment of elements satisfying a predicate
Khadiev, K. R., & Bikmullin, T. E. (2022) · Academician O.B. Lupanov International Scientific Seminar "Discrete Mathematics and Its Applications" · doi:10.20948/dms-2022-24
Security Concerns regarding Software Development Migrations in Quantum Computing Context
Cornea, A.-A., & Obretin, A. M. (2022) · SAR Journal - Science and Research · doi:10.18421/sar51-02
Scalable Addressing Circuits for a Surface Code Silicon-based Quantum ComputerPreprint
Absar, R., Merino, Z. D., Elgabra, H., Chen, X., Baugh, J., & Wei, L. (2023) · doi:10.36227/techrxiv.22685098
Breaking Barriers: Unleashing the Power of Quantum AlgorithmsPreprint
Jerbi, D. (2023) · doi:10.36227/techrxiv.22710433
Breaking Barriers: Unleashing the Power of Quantum AlgorithmsPreprint
Jerbi, D. (2023) · doi:10.36227/techrxiv.22710433.v1
A reduction from an LWE problem to maximum independent set problems
Kawano, Y. (2023) · Scientific Reports · doi:10.1038/s41598-023-34366-7
García, D. P., Cruz-Benito, J., & García‐Peñalvo, F. J. (2023) · Lecture notes in educational technology · doi:10.1007/978-981-99-0942-1_130
Stepping up the NTRU-Post Quantum Algorithm Using Parallel ComputingPreprint
Elkabbany, G. F., Aslan, H. K., & Ibrahim, H. (2023) · Research Square · doi:10.21203/rs.3.rs-2885476/v1
GiFE: A Molecular-Size Agnostic and Understandable Gibbs Free Energy FunctionPreprint
Freeze, J. G., & Batista, V. S. (2023) · ChemRxiv · doi:10.26434/chemrxiv-2023-rcbx6
Kernel Approximation on a Quantum Annealer for Remote Sensing Regression TasksPreprint
Pasetto, E., Riedel, M., Michielsen, K. F. L., & Cavallaro, G. (2023) · doi:10.36227/techrxiv.22794146
Kernel Approximation on a Quantum Annealer for Remote Sensing Regression TasksPreprint
Pasetto, E., Riedel, M., Michielsen, K. F. L., & Cavallaro, G. (2023) · doi:10.36227/techrxiv.22794146.v1
Comparative studies and analysis of efficiency code-based hybrid cryptosystem
Kuznetsov, A. A., Gorbenko, Y., Кіян, А., et al. (2018) · Radiotekhnika · doi:10.30837/rt.2018.4.195.07
Datendarstellung und -verarbeitung
Kaufmann, J., & Mülder, W. (2023) · Springer eBooks · doi:10.1007/978-3-658-37937-7_6
Quantum-Secured Decentralized Directed Acyclic GraphsPreprint
Chapple, D. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4457368
Quantum Alternating Operator Ansatz for Solving the Minimum Exact Cover ProblemPreprint
Wang, S., Liu, H., Song, Y.-Q., Gao, F., Qin, S., & Wen, Q. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4458977
Search Space Reduction for Efficient Quantum Compilation
Srivastava, A., Lu, C., Choudhury, N., et al. (2023) · ACM Great Lakes Symposium on VLSI (GLSVLSI) · doi:10.1145/3583781.3590223
Integrated Control Addressing Circuits for a Surface Code Quantum Computer in Silicon
Absar, R., Merino, Z. D., Elgabra, H., Chen, X., Baugh, J., & Wei, L. (2022) · IEEE/ACM International Symposium on Nanoscale Architectures (NANOARCH) · doi:10.1145/3565478.3572541 · Cited by 1
Shadows of quantum machine learningPreprint
Jerbi, S., Gyurik, C., Marshall, S. C., Molteni, R., & Dunjko, V. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2306.00061 · Cited by 1
Wichert, A. (2023) · Entropy · doi:10.3390/e25060871
Dynamic Programming in Economics on a Quantum AnnealerPreprint
Fernández‐Villaverde, J., & Hull, I. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4475924
Hybrid quantum search with genetic algorithm optimizationPreprint
Udrescu, M., & Ardelean, S. M. (2023) · Research Square · doi:10.21203/rs.3.rs-3009060/v1
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
