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 8,301–8,400 of 8,792
Mostari, L., Goupil, A., & Ahmed, A. T. (2026) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-026-10567-x
Noreen, T., Haider, M. Z., Zhang, K., Bensalem, H., & Gagnon, G. (2026) · Distributed Ledger Technologies Research and Practice · doi:10.1145/3801095
Sarkar, A., Kundu, A., Steinberg, M., Mishra, S., Fauquenot, S., Acharya, T., Miszczak, J. A., & Feld, S. (2026) · New Journal of Physics · doi:10.1088/1367-2630/ae5a54 · Cited by 7
Post Quantum Signature for Blockchain
Razdan, R., & Nene, M. J. (2025) · International Conference on Advancement in Futuristic Technologies (ICAFT) · doi:10.1109/icaft66710.2025.11453249 · Cited by 1
Authentication and encryption protocols : design, attacks and algorithmic improvements
Maimuţ, D. (2015) · theses.fr (ABES) · doi:10.70675/a4c4e8d2z5e4cz4eafzbf6bzfb9b77e3cfb7
Quantum walks of photons in disordered media
Defienne, H. (2015) · theses.fr (ABES) · doi:10.70675/0e85da43z5815z4df3z9a8aze657713c561f
Solutions évolutives pour les réseaux de communication quantique
Fedrici, B. (2017) · theses.fr (ABES) · doi:10.70675/4ee6f82ez8faez4962z907cz3c032c4ee820
Advances in public-key cryptology and computer exploitation
Géraud, R. (2017) · theses.fr (ABES) · doi:10.70675/990b2e4ez19fcz4589z9730z1849d78815d4 · Cited by 1
Cryptographic Collapse Forecasting: A Strategic Shift to Quantum Security
Majid, K., Chatterjee, S., Jha, A. K., & Kondepu, K. (2025) · IEEE International Conference on High Performance Computing, Data and Analytics Workshop (HiPCW) · doi:10.1109/hipcw66559.2025.00088
Bouillard, M. (2017) · theses.fr (ABES) · doi:10.70675/266da4e4zcebdz4037zba90zb03972e3234a
Gündüz, S., & Yılmaz, İ. (2026) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-026-07590-z
Measurement and control of electronic coherences
Cabart, C. (2018) · theses.fr (ABES) · doi:10.70675/7d7cb7a9zcf7az4f5dzbadfz777a1c3f82bd
Randomness for quantum information processing
Mezher, R. (2019) · theses.fr (ABES) · doi:10.70675/20d8dd52zead4z4afcz8e10z9e2c54fd7654
Hidden Structures and Quantum Cryptanalysis
Bonnetain, X. (2019) · theses.fr (ABES) · doi:10.70675/376c5157z8acez485dzab89z9e1bfa697ee9 · Cited by 1
Combinatorics in algebraic and logical cryptanalysis
Trimoska, M. (2021) · theses.fr (ABES) · doi:10.70675/f5b888c4zb2b8z4af0zb2ecz225ba5dbb791
High-Performance Post-Quantum Cryptographic Engineering in Hardware
Taghavi, B., Karabulut, M., Azarderakhsh, R., & Kermani, M. M. (2026) · Springer eBooks · doi:10.1007/978-3-032-09303-5_14
Quantum algorithms for the Monte Carlo method
Hamoudi, Y. (2021) · theses.fr (ABES) · doi:10.70675/43dbb94ez355ez42d2za9e8z47c1e9983ab9
Design Automation Challenges in Quantum Computing
Mishra, P. (2026) · Springer eBooks · doi:10.1007/978-3-032-09303-5_1
Apprentissage artificiel quantique
Benlamine, K. (2020) · theses.fr (ABES) · doi:10.70675/505407dcz47a5z4c4fz84cbzd0c742681596 · Cited by 2
Methods for optimizing the synthesis of quantum circuits
de Brugière, T. G. (2020) · theses.fr (ABES) · doi:10.70675/e70b70f9z8381z43a4z806fz68402f3080de · Cited by 4
de Visme, M. (2020) · doi:10.70675/1fe9d40fzc796z4fb8zbc8fz98a158e7d52a
Schaub, A. (2020) · theses.fr (ABES) · doi:10.70675/67533d19z18f8z441ez8fabz37f757e6028a
Classical and quantum cryptanalysis for Euclidean lattices and subset sums
Shen, Y. (2021) · theses.fr (ABES) · doi:10.70675/c36a63dbz469ez406azba4fza2fd2c7ca09b
Nonlinear quantum optics with a single Rydberg superatom coupled to a medium-finesse cavity
Vaneecloo, J. (2022) · theses.fr (ABES) · doi:10.70675/c24954e2z1ec5z468dza496zfd8979a93d27
Highly-efficient entanglement transfer into and out of cold-atom quantum memories
Hoffet, F. (2022) · theses.fr (ABES) · doi:10.70675/8e41d333z4f3bz4a06z85d9z99d8760f535b
Géneration d’états comprimés en simple passage et modes spatio-temporels
Volpe, L. L. (2019) · theses.fr (ABES) · doi:10.70675/387b1755z9276z4879zbdb4zc3601dc94e39
Study of Protocols Between Classical Clients and a Quantum Server
Colisson, L. (2022) · theses.fr (ABES) · doi:10.70675/81ee6bd6zb577z4b9bza57fzb37719ed77f2 · Cited by 1
Improved quantum algorithms for eigenvalue finding and gradient descent
Nghiem, N. A., & Wei, T.-C. (2026) · Physical Review Applied · doi:10.1103/ddlc-ynvv
Secret-key cryptography and impact of a quantum attacker on the telecommunication world
Frixons, P. (2022) · theses.fr (ABES) · doi:10.70675/816f8235z99bfz4cb9zbe68z075dcc32e303
Quantum algorithms for reinforcement learning
Cherrat, E. A. (2023) · theses.fr (ABES) · doi:10.70675/ec6ab96az80c1z473az8098z76724c736a49
Device-independent certification : quantum resources and quantum key distribution
Valcarce, X. (2023) · theses.fr (ABES) · doi:10.70675/47a9dcc2zbf3dz4453z98ffz90339ccb4186
Circuit compilation and error mitigation for near-term quantum computing
Niu, S. (2022) · theses.fr (ABES) · doi:10.70675/4b9fc4d0z9683z4a8dz8643zc514443d2d75
Quantum algorithms for energy management optimization problems
Veshchezerova, M. (2022) · theses.fr (ABES) · doi:10.70675/f0d70a66z3066z4c81z8aa7zf9e72830f940 · Cited by 1
On Adaptivity in Classical and Quantum Learning
Oufkir, A. (2023) · theses.fr (ABES) · doi:10.70675/bb8a85a6z8f6dz406ez8fb8ze4ae31a058ee
Surface acoustic waves as testbed for electron flying qubits
Wang, J. (2022) · theses.fr (ABES) · doi:10.70675/262a84adz8049z4ff9z8e53zcdd4e6800184 · Cited by 1
Zaiou, A. (2022) · theses.fr (ABES) · doi:10.70675/72d6811bzbf86z4920z88c7zc2de09bcd42f · Cited by 1
Kriekouki, I. (2022) · theses.fr (ABES) · doi:10.70675/9fed023fze214z429fzbf66z0d82f6e955c8 · Cited by 1
Díaz-Sánchez, D., Almenárez, F., Campo, C., et al. (2026) · Lecture notes in networks and systems · doi:10.1007/978-3-032-16995-2_36
Performance evaluation and control improvements for solving optimization problems on NISQ platforms
Gilbert, V. (2024) · theses.fr (ABES) · doi:10.70675/81f9c638z5867z40e4zaed8ze9824ff5a163
Zero-knowledge arguments from secure multiparty computation
Maire, J. (2024) · theses.fr (ABES) · doi:10.70675/af9d1b8az08abz41f0za364z66a2ed720b8f
Quantum Computing : Fundamental Principles, Quantum Algorithms, and Emerging Applications
Koteswararao P, D. G. V., & Lohithsrinivas4, K. S. S. R. K. T. (2026) · International Journal of Advanced Research in Science Communication and Technology · doi:10.48175/ijarsct-32705
Quantum Error Correction using cat qubits
Marquet, A. (2023) · theses.fr (ABES) · doi:10.70675/6748815fz4d8fz484dz94cfz143f5f473a21
Sousa, J., & Sousa, R. (2026) · J² · doi:10.29073/j2.v9i1.1139
Quantum Computing for Operations Research : A special approach for Project Scheduling
Armas, L. F. P. (2024) · theses.fr (ABES) · doi:10.70675/cf991df2zcbd5z4574z9f45z6f05451dcf70
Analog Quantum Computing for NP-Hard Combinatorial Graph Problems
Braida, A. (2024) · theses.fr (ABES) · doi:10.70675/ddc8a4b2z9f68z49d3z91e1zc1d6664298b1
Analysis of AES-based and arithmetization-oriented symmetric cryptography primitives
Bariant, A. (2024) · theses.fr (ABES) · doi:10.70675/91e98fcezfe0cz4b88z8e64zb2a679034ecd
Kwon, H.-Y., Ahn, B., Lee, M., et al. (2025) · IEEE Design Methodologies Conference (DMC) · doi:10.1109/dmc65958.2025.11475303
Machine learning for quantum bandits and quantum entanglement detection
Casalé, B. (2023) · theses.fr (ABES) · doi:10.70675/79dfdf3dz838fz4b8dza682z43d1528ed3f9
An Experimental Implementation of a QZKP Authentication Protocol for Critical Infrastructures
Garcia-Diaz, J., Escánez-Expósito, D., & Caballero‐Gil, P. (2026) · Lecture notes in networks and systems · doi:10.1007/978-3-032-16995-2_44
Mamann, H. (2024) · theses.fr (ABES) · doi:10.70675/a685a96dzb306z40f7zb0b7z826e9c7aa01b
Confidential integrity verification via quantum teleportation
Fu, Z. F., He, S.-X., Liao, W.-J., et al. (2026) · Physica Scripta · doi:10.1088/1402-4896/ae5cdd
Quantum non-Gaussianity certification in continuous-variable optics
Roeland, G. (2023) · theses.fr (ABES) · doi:10.70675/28adf046z7fd0z4d87zbe2ez7a0c628f64c9
Fluorescence Inhibition in the Vicinity of Spherical ENZ Nanoparticles
Atwi, H. (2022) · theses.fr (ABES) · doi:10.70675/6edc7ca7z3e8fz4509z9a6fz39a19e2b41f2
Quantum Key Distribution through atmospheric turbulence : secure satellite-to-ground links
Acosta, V. M. (2023) · theses.fr (ABES) · doi:10.70675/4245e6f5z2b9bz42e2zb959zd10039e0bcee
Quantum many-body dynamics for combinatorial optimisation and machine learning
Dalyac, C. (2023) · theses.fr (ABES) · doi:10.70675/d8d31cecza123z48adz86b7ze8a30aaa7c58
Continuous Variable Multimode Quantum States at Telecommunication Wavelengths for Quantum Networks
Fainsin, D. (2023) · theses.fr (ABES) · doi:10.70675/59e0ff53z15b6z40e5z8de0zd3e382a51b50
Few-body Förster resonances in Rydberg atoms for the implementation of quantum computing
Ashkarin, I. N. (2023) · theses.fr (ABES) · doi:10.70675/eebef4cdzf16dz4fbcz9077z90e6d536c474
Quantum and side-channel attacks
Chartouny, M. (2025) · doi:10.70675/df2903f6ze80az4acezb7a7zbac3d3410f94
Ohashi, R., & Onuki, H. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-22698-3_12
Conjugate coding based designated verifier quantum zero knowledge proof for user authentication
Garcia-Diaz, J., Escánez-Expósito, D., Caballero‐Gil, P., et al. (2026) · Cryptography and Communications · doi:10.1007/s12095-026-00878-y
HM-AKA+: Protecting against a semi-trusted third party with Hybrid Crypto
Munilla, J., & Braeken, A. (2026) · Cryptography and Communications · doi:10.1007/s12095-026-00883-1
Emerging Computing and AI Technologies at the Horizon
Wang, Z., Sannyasi, A., & Jiang, J. (2026) · Springer eBooks · doi:10.1007/978-3-032-14222-1_10
Sezer, B. B. (2026) · International Conference on Artificial Intelligence, Computer, Data Sciences and Applications (ACDSA) · doi:10.1109/acdsa67686.2026.11468128
QEMI: A Quantum Software Stacks Testing Framework via Equivalence Modulo Inputs
Luo, J., Xia, S., Zhang, F., & Zhao, J. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-22774-4_8
Adversarial Attack Detection and Mitigation in Next-Generation Intelligent Consumer Electronics
Bera, B., Bera, S., Liyanage, M., & Sikdar, B. (2026) · IEEE Transactions on Consumer Electronics · doi:10.1109/tce.2026.3684061
Improved quantum differential Meet-In-The-Middle attack and some applications
Wei, J., Zou, J. X., & Lin, R. (2025) · International Conference on Communication and Network Security (ICCNS) · doi:10.1145/3789456.3789469
Scalable multi-objective genetic algorithm for quantum circuit optimization
Ghlib, R., Bouhadouza, R., & Hnaien, F. (2026) · Scientific Reports · doi:10.1038/s41598-026-47674-5 · Cited by 1
Quantum Resource Management in the NISQ Era: Challenges, Vision, and a Runtime Framework
Lammers, M. G., Holik, F., & Fernández, A. (2025) · IEEE CHILEAN Conference on Electrical, Electronics Engineering, Information and Communication Technologies (CHILECON) · doi:10.1109/chilecon66915.2025.11476009
Muñoz, M. E. V., Carvajal, S. M., Manquillo, J. S., et al. (2025) · IEEE CHILEAN Conference on Electrical, Electronics Engineering, Information and Communication Technologies (CHILECON) · doi:10.1109/chilecon66915.2025.11476338
Efficient quantum algorithm for the design of complex materials: quantum circuit learning
Osaki, S., Hoshitani, K., Nakamura, M., Kimura, K., & Yamamoto, T. (2026) · Scientific Reports · doi:10.1038/s41598-026-43584-8
Inflections Points in Quantum Computing as an Information Technology: A Thematic Analysis
Elrod, N. J. (2026) · IEEE SoutheastCon · doi:10.1109/southeastcon63549.2026.11476365
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
