The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index; none of the 8 sources its claims cite is checked for support yet.
A fast quantum mechanical algorithm for database search
Open accessAbstract
An unsorted database contains N records, of which just one satisfies a particular property.The problem is to identify that one record.Any classical algorithm, deterministic or probabilistic, will clearly take O (N) steps since on the average it will have to examine a large fraction of the N records.Quantum mechanical systems can do several operations simultaneously due to their wave like properties.This paper gives an O ( JN) step quantum mechanical algorithm for identifying that record.It is within a constant factor of the fastest possible quantum mechanical algorithm.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
19 No basis given · 8 Sources not found · 4 Own interpretation
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This paper gives an O ( JN) step quantum mechanical algorithm for identifying that record.”
§ A fast quantum mechanical algorithm for database search > Abstract
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- The authors state this as an assumption: There is a unique state that satisfies the condition C(S)=1.
- The authors state this as an assumption: For any state S, the condition C(S) can be evaluated in unit time.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Corollary 3.1-Let the state vector be as followsfor any one state the amplitude is k, for each of the remaining (N-1) states the amplitude is 1.Let k and 1 be real numbers (in general the amplitudes can be complex).Let k be negative and 1 be positive such that ~< ~N.Then after applying the diffusion transform both k and 1are positive numbers.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“First, it is proved that the system is a valid quantum mechanical system (theorems 1 & 2)”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
boosted- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“As mentioned in the introduction, the algorithm of this paper does not use any Imowledge about the problem.”
§ A fast quantum mechanical algorithm for database search > 114
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Theorem 1-The matix D is unitary.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The following sections prove that the system discussed in section 3 is indeed a valid quantum mechanical system and that it converges to the desired state with a probability O(l).”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- The authors state this as an assumption: There is a unique state that satisfies the condition C(S)=1.
- The authors state this as an assumption: For any state S, the condition C(S) can be evaluated in unit time.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Theorem 2 -D can be expressed as D = FRF, where F, the Fourier Transform Matrix and R, the rotation matrix are defined as follows”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Since the proba-& bility of the system being found in any particular state is proportional to the square of the amplitude, it follows that the probability of the system being in tlhe desired state when k is ~, 1 J2 is k2 = ~.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In case there is a unique state SV such that C(SV) = 1, the final state is SV with a probability of at least ~. 2”
§ A fast quantum mechanical algorithm for database search > T. Acknowledgments
plainconditional- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
- The authors state this as an assumption: There is a unique state that satisfies the condition C(S)=1.
- The authors state this as an assumption: For any state S, the condition C(S) can be evaluated in unit time.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“It can be easily modified to take care of the case when there are multiple states satisfying the condition C(S) = 1 and it is required to return one of these.”
§ A fast quantum mechanical algorithm for database search > 114
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Probably not a substantial claim. 8
- It may state two separate claims as one. 4
- The quote only partly states this claim. 1
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Theorem 5-Let the probability of a particular outcome in an experiment be &.Then if the experiment be repeated ~times, the probability that the outcome does not happen even once is less than or equal to e-K.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The change in k ( Ak) after steps (a) and (b) of the algorithm is lower bounded by Ak>~.Also after steps (a) and (b), 1>0.2fi”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Using this it immediately follows that there exists a number M less than EN, such that in M repetitions of the loop in step (ii), k wifl become ~.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The quote only partly states this claim.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The most efficient classical algorithm for this is to examine the items in the database one by one.”
§ A fast quantum mechanical algorithm for database search > ------------------------------------------------
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“Very recent results [Shor95] have shown the existence of quantum mechanical error corr~ting cod~which enable transmission of data even in the presence of noise”
§ A fast quantum mechanical algorithm for database search > 114
What the sources say
- Not matchedcites [Shor95]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
boosteddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This algorithm, by cleverly making use of some features of the structure of the problem, is the only known algorithm that solves the problem in O (logIV) steps.”
§ A fast quantum mechanical algorithm for database search > 114
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The phase does not have an analog in classical probabilistic algorithms.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This illustrates the point that, in quantum mechanics, the complete description of the system requires the amplitudes over all states, just the probabilities is not enough.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
In the paper
“For example Shor's primality testing algorithm [Shor94] for a number N can be viewed as a search of the (N-l) numbers smaller than N to see if any of them is a factor of N.”
§ A fast quantum mechanical algorithm for database search > 114
What the sources say
- Not matchedcites [Shor94]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
In the paper
“There is also a scheme discussed in [VV86] by which it is possible to modify any algorithm that solves an NPsearch problem with a unique solution and use it to solve an NP-search problem in general.”
§ A fast quantum mechanical algorithm for database search > 114
What the sources say
- Not matchedcites [VV86]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
hedgeddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
In the paper
“This operation is one of the things that makes quantum mechanical algorithms more powerful than classical algorithms and forms the basis for most significant quantum mechanical algorithms.”
§ A fast quantum mechanical algorithm for database search > T. Acknowledgments
What the sources say
- Not matchedcites [DJ92]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
- Not matched
The authors state this as an assumption.
There is a unique state that satisfies the condition C(S)=1.
“Let there be a unique state, say Sv, that satisfies the condition C(SV) = 1, whereas for all other states S, C(S) = 0”
“The algorithm as discussed here assumes a unique state that satisfies the desired condition.”
The authors state this as an assumption.
For any state S, the condition C(S) can be evaluated in unit time.
“(assume that for any state S, the condition C(S) can be evaluated in unit time)”
The paper relies on this without support.
There does not exist any sorting on the database that would aid selection of the desired item.
“However, there does not exist any sorting on the database that would aid its selection.”
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Symmetric cryptography remains comparatively resilient, yet Grover's algorithm offers a quadratic speed-up for brute-force key search, effectively halving the security margin of symmetric ciphers [13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Similarly, for hash functions, Grover's algorithm [185] can facilitate quantum birthday attack to find collision, thereby necessitating an output of larger size.”
From Zero Trust Architecture (ZTA): A Comprehensive Survey (2022) · cites this paper as [185]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Similarly, Grover’s algorithm concedes a quadratic advantage for mining blocks in certain consensus protocols such as proof of work.”
From Quantum-resistance in blockchain networks (2023) · cites this paper as [71]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Quantum computers will be able to find these nonces quadratically faster using Grover’s algorithm71.”
From Quantum-resistance in blockchain networks (2023) · cites this paper as [71]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“This model is realistic given the falling cost of storage, the rise of large-scale surveillance infrastructures, and the expected disruption of quantum algorithms such as Shor's and Grover's [1,2,13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measured
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Grover's algorithm provides only a quadratic speedup, effectively halving brute-force resistance. Comparable security margins can be restored by doubling key sizes (for example, AES-128 to AES-256) [13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“This explains why AES-256 maintains post-quantum security margins, whereas AES-128 requires upgrading to maintain equivalent protection levels [13,14].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“At the same time, Grover's algorithm shows that symmetric cryptography, though more resilient, also demands doubled key sizes to maintain equivalent margins [13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“In this sense, Grover-based optimization algorithms [184] such as Grover Adaptive Search [161] have been proposed.”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [184]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The former bound is tight since recent work of Grover [13] shows how to accept the class NP relative to any oracle on a quantum computer in time O (2 n/ 2 ).”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“In view of Grover's algorithm [13], we know that the constant '1 / 2' in the statement of Theorem 3.5 cannot be improved.”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The former bound is tight since recent work of Grover [13] shows how to accept the class NP relative to any oracle on a quantum computer in time O (2 n/ 2 ).”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“Grover’s algorithm [54] is a quantum algorithm for searching in a database, ofering quadratic speedup over classical searching methods.”
From QASMBench: A Low-Level Quantum Benchmark Suite for NISQ Evaluation and Simulation (2023) · cites this paper as [54]
The cited source says what the claim attributes to it.
In the citing paper
“However, quantum machines can recognize this language quadratically faster, in time O ( √ 2 n ), using Grover's algorithm [13].”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
The cited source says what the claim attributes to it.
In the citing paper
“That this was a real possibility is clear from Grover's [13] result, which gives a black-box approach to solving NP -complete problems in square-root as much time as is required classically.”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
The cited source says what the claim attributes to it.
In the citing paper
“Various strategies can be imagined, but a good one (called 'inversion about the average' by Grover [13]) is to perform an oracle-independent unitary transformation so as to change the phase difference into an amplitude difference, leaving the y term with the same sign as all the other terms but a magnitude approximately threefold larger.”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“The HNDL adversary departs from conventional cryptanalysis in its temporal asymmetry. Instead of attempting immediate decryption, the attacker passively collects encrypted traffic or stored archives and defers decryption until sufficient computational resources become available.”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredIn the citing paper
“This algorithm uses a single function evaluation to label the single state which satisfies the function, followed by a series of gates which drive the system into this particular state.”
From Implementation of a quantum search algorithm on a quantum computer (1998) · cites this paper as [9]
In the citing paper
“Here we show how such a computer can be used to implement a fast quantum search algorithm initially developed by Grover. 9, 10”
From Implementation of a quantum search algorithm on a quantum computer (1998) · cites this paper as [9]
In the citing paper
“Among other applications Grover's algorithms enable an extremely rapid search over the domain of a binary function to find elements for which this function is satisfied (that is, the function has the value 1).”
From Implementation of a quantum search algorithm on a quantum computer (1998) · cites this paper as [9]
In the citing paper
“the ability to efficiently perform Hamiltonian simulation is used in conjunction with another technique known as the quantum phase estimation algorithm (QPEA) 42 for efficiently obtaining the eigen-energies and eigenstates of a quantum system 38 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
In the citing paper
“The Quantum Phase Estimation (QPE) algorithm 38,99 is the natural translation of the FCI procedure to quantum computers 45 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
In the citing paper
“Abrams and Lloyd 38 focused on state preparation in more detail and described concrete initialization procedures.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
In the citing paper
“They pointed out that state preparation is conceptually easier in second quantization, where a Fock state is represented by a simple product state of qubits in {| 0 〉 , | 1 〉} states.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
Citations
Cites
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Scheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
Rapid solution of problems by quantum computation
Deutsch, D., & Jozsa, R. (1992) · Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences · doi:10.1098/rspa.1992.0167 · Cited by 2,700
The Emperor's New Mind: Concerning Computers, Minds, and The Laws of Physics
Penrose, R., & Gardner, M. (1989) · doi:10.1093/oso/9780198519737.001.0001 · Cited by 2,007
Strengths and Weaknesses of Quantum Computing
Bennett, C. H., Bernstein, E., Brassard, G., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300933 · Cited by 1,470
On the Power of Quantum Computation
Simon, D. R. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796298637 · Cited by 1,295
Bernstein, E., & Vazirani, U. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167097 · Cited by 1,284
Benioff, P. (1980) · Journal of Statistical Physics · doi:10.1007/bf01011339 · Cited by 1,244
The Emperor's New Mind: Concerning Computers, Minds, and the Laws of Physics
Penrose, R., & Landauer, R. (1990) · Physics Today · doi:10.1063/1.2810599 · Cited by 1,110
Research works printed but not linked: 2
- [9]9. R. Penrose, Shadows of the mind,. Oxford University Press, 1994, pp. 348- 388.
- [14]14. Yao93J A. Yao, Quantum circuit complexip, Proceedings 34th Annual Symposium on Foundations of Computer Science (FOCS), 1993, pp. 352-361.
Cited by
Sorted by citations
Items 6,001–6,100 of 8,792
Quantum algorithm for estimating Olivier-Ricci curvature
Nghiem, N. A., Nguyen, L., Do, K. T., Wei, T.-C., & Phan, T. V. (2026) · Physical Review Research · doi:10.1103/hj52-lksk · Cited by 3
Zero-Downtime Post-quantum TLS 1.3 Migration: A Bridge-Server-Based Approach
Sim, M., Jo, S., Song, H., et al. (2026) · Lecture notes in computer science · doi:10.1007/978-981-95-8034-7_7 · Cited by 1
Deterministic Entanglement as a Prerequisite for Scalable Quantum Photonic Resource State Generation
Reum, Y., Santandrea, M., Prasad, R., Weber, R., Finley, J. J., Huber, T., Pfenning, A. T., Barz, S., & Höfling, S. (2026) · Advanced Quantum Technologies · doi:10.1002/qute.70301 · Cited by 1
Super-Quadratic Quantum Speed-ups and Guessing Many Likely Keys
Bashiri, K., Glaser, T., May, A., et al. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-25291-3_16 · Cited by 1
Fourier Analysis Perspective on Quantum Neural Networks
Oh, S., Roh, E. J., Vasilakos, A. V., Park, S., & Kim, J. (2026) · Communications Physics · doi:10.1038/s42005-026-02680-x · Cited by 2
Agentic AI-enhanced quantum computing for cybersecurity: a new horizon in internet defense
Shaw, K., Mishra, S., & Zelinka, I. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05161-w · Cited by 1
Post-Quantum Key Encapsulation Mechanisms: A Comparative Review of ML-KEM, BIKE, and HQC
Reazaei, P., Rashid, A. S. K., Mand, A. A., & Saberikamarposhti, M. (2026) · 2026 22nd IEEE International Colloquium on Signal Processing & Its Applications (CSPA) · doi:10.1109/cspa68262.2026.11517877 · Cited by 1
Construction and depth optimization of quantum controlled adder
Jeon, C., Heo, D., 신효준, et al. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05211-3 · Cited by 1
Relational Database Engines on Quantum Platforms: Concepts, Algorithms, and Implementations
Kesarwani, M., & Haritsa, J. (2026) · SIGMOD Companion · doi:10.1145/3788853.3801876 · Cited by 1
Quantum annealing for joint chance-constrained unit commitment
Marzá, D. R., & Grandón, T. G. (2026) · Journal of Mathematics in Industry · doi:10.1186/s13362-026-00181-8 · Cited by 1
A Low-overhead Dilithium-NTT Architecture using Accelerated K-RED Modular Reduction Unit
Gupta, H., Goyal, A., Dhadwal, P., et al. (2026) · International Symposium on Quality Electronic Design (ISQED) · doi:10.1109/isqed69900.2026.11534654 · Cited by 1
Model, data, and knowledge-driven geophysical inverse problems and intelligent computing
Wang, Y. (2026) · Science China Earth Sciences · doi:10.1007/s11430-025-1868-y · Cited by 2
The Single-Rotation Quantum Search Algorithm: Amplitude Amplification with One Oracle Call
Liu, Y. (2026) · Journal of Quantum Information Science · doi:10.4236/jqis.2026.162006 · Cited by 1
Elhoseny, M., Taher, F., & Hassan, M. K. (2026) · IEEE Internet of Things Journal · doi:10.1109/jiot.2026.3703326 · Cited by 1
Casado-González, A., Sobrín-Hidalgo, D., Álvarez-Aparicio, C., et al. (2026) · Communications in computer and information science · doi:10.1007/978-3-032-29251-3_7 · Cited by 1
Asymptotic bounds on quantum partial search algorithm and its applications to parallel search
Jiang, Y.-B., Wang, X.-H., Zhang, K., & Korepin, V. E. (2026) · Physical Review A · doi:10.1103/jlsp-78n7 · Cited by 1
Singh, R., & Suseelan, A. D. (2026) · Electronics · doi:10.3390/electronics15132832 · Cited by 1
High-performance Vector-length Agnostic Quantum Circuit Simulations on ARM Processors
Shi, R., Schieffer, G., Lin, P., Gokhale, M. B., Herten, A., & Peng, I. B. (2026) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps65963.2026.00080 · Cited by 1
Observation of disorder-free localization using a (2+1)D lattice gauge theory on a quantum processor
Collaborators, G. A. Q. A., Gyawali, G., Kumar, S., Lensky, Y. D., Rosenberg, E. N., Szasz, A., Cochran, T. A., Chen, R., Karamlou, A. H., Yosri, N., et al. (2026) · Science · doi:10.1126/science.adr9680 · Cited by 10
Hybrid Classical-Quantum Architecture for Vectorised Image Classification of Hand-Written Sketches
Cordero, Y., Biswas, S., Vilariño, F., & Bilkis, M. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-31673-8_24 · Cited by 1
A brief overview of quantum computing theory
Siedlecka, O. (2006) · Cited by 1
Sekwencyjne odwracalne układy logiczne
Zagniński, P., & Kerntopf, P. (2010) · Pomiary Automatyka Kontrola · Cited by 1
Design Signal Detection Project of MIMO Communication Systems Based on Improved Grover Algorithm
Xin-Bo, L. (2012) · Lecture notes in electrical engineering · doi:10.1007/978-94-007-2169-2_2 · Cited by 1
Remarks on Multi-layer Quantum Neural Network Controller Trained by Real-Coded Genetic Algorithm
Takahashi, K., Kurokawa, M., & Hashimoto, M. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-31919-8_7 · Cited by 1
Evolutionary Computation in Coded Communications: an Implementation of Viterbi Algorithm
Jamal, S., Dia, I., & Haw, M. (2009) · InTech eBooks · doi:10.5772/9606 · Cited by 1
Energy Dissipation Effect on a Quantum Neural Network
Kinjo, M., Sato, S., & Nakajima, K. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-69162-4_76 · Cited by 1
STOCK PRICE PREDICTION USING QUANTUM NEURAL NETWORK
Mahajan, R. P. (2010) · Journal of Global Research in Computer Sciences · Cited by 1
A SIMPLE EXPLANATION OF SEARCH TECHNIQUE IN QUANTUM FRAMEWORK
Nayak, S., Nayak, S., & Singh, J. (2012) · Journal of Global Research in Computer Sciences · Cited by 1
A graphical development environment for quantum algorithms
Zeiter, D. (2008) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-a-005675863 · Cited by 1
Proposal for realization of a Toffoli gate via cavity-assisted atomic collision
Ollivier, H., & Milman, P. (2003) · Quantum Information and Computation · doi:10.26421/qic3.6-3 · Cited by 1
Quantum Complexity of Boolean Matrix Multiplication and Related Problems
Gall, F. L. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-13350-8_13 · Cited by 1
An Idea to Improve QuIDD Based Quantum Simulations
Friedl, K., & Kabódi, L. (2015) · Periodica Polytechnica Electrical Engineering and Computer Science · doi:10.3311/ppee.8214 · Cited by 1
Ultrametric Vs. Quantum Query Algorithms
Freivalds, R. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-13749-0_1 · Cited by 1
Quantum algorithms for finding constant-sized sub-hypergraphs
Gall, F. L., Nishimura, H., & Tani, S. (2015) · Theoretical Computer Science · doi:10.1016/j.tcs.2015.10.006 · Cited by 7
Challenges of adiabatic quantum evaluation of NAND trees
Tarrataca, L. D. T. J. (2015) · Quantum Information Processing · doi:10.1007/s11128-015-1137-3 · Cited by 1
Lin, D. (2009) · Texas ScholarWorks (Texas Digital Library) · Cited by 1
Quantum One Go Computation and the Physical Computation Level of Biological Information Processing
Castagnoli, G. (2009) · International Journal of Theoretical Physics · doi:10.1007/s10773-009-0203-y · Cited by 1
Fairness of QoS Degradation in Multimedia Wireless Networks
Xiao, W., & Zhang, X. (2007) · International Conference on Wireless Communications, Networking and Mobile Computing · doi:10.1109/wicom.2007.507 · Cited by 1
Quantum Memory Management Systems
Koca, C., & Akan, Ö. B. (2015) · ACM International Conference on Nanoscale Computing and Communication (NANOCOM) · doi:10.1145/2800795.2800810 · Cited by 1
Non-binary quantum codes constructed from classical BCH codes
Gao, Y., & Tao, Y.-Y. (2010) · International Conference on Machine Learning and Cybernetics · doi:10.1109/icmlc.2010.5580593 · Cited by 1
A note on the search for k elements via quantum walk
Dörn, S., & Thierauf, T. (2010) · Information Processing Letters · doi:10.1016/j.ipl.2010.08.004 · Cited by 1
TSAI, H., & CHANG, B. (2007) · Expert Systems with Applications · doi:10.1016/j.eswa.2007.05.026 · Cited by 1
Arbitrated Quantum Signature Scheme with Message Bits Intertwined
Chen, N., Quan, D., Pei, C. X., et al. (2013) · Applied Mechanics and Materials · doi:10.4028/www.scientific.net/amm.481.7 · Cited by 1
Quantum process in living cells
Finkel, R. W. (2013) · Advances in Bioscience and Biotechnology · doi:10.4236/abb.2013.44071 · Cited by 1
Simulating quantum circuits with GNU Octave and Python
Senekane, M., Mohapi, L., & Petruccione, F. (2013) · doi:10.1109/afrcon.2013.6757857 · Cited by 1
Quantum Mechanical Search and Harmonic Perturbation
Jiang, J.-H. R., Chiou, D.-W., & Wu, C.-E. R. (2007) · Quantum Information Processing · doi:10.1007/s11128-007-0062-5 · Cited by 1
Vieterbi decoder algorithm using quantum computing
Rahhal, J. S., Abualnadi, D. I., & Hawa, M. (2007) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2007.4425005 · Cited by 1
Peng, H., Fu, S.-Y., Meng, L., et al. (2012) · International Journal of Computational Intelligence Systems · doi:10.1080/18756891.2012.733207 · Cited by 1
Meng, X., Wang, J., Pi, Y., et al. (2009) · International Journal of Intelligent Systems Technologies and Applications · doi:10.1504/ijista.2009.022687 · Cited by 1
Amplitudes distribution over two copies of small quantum subsystems
Younes, A., & Abdel‐Aty, M. (2013) · Quantum Information Processing · doi:10.1007/s11128-013-0575-z · Cited by 1
Formal Methods for Emerging Technologies
Wille, R., & Drechsler, R. (2015) · International Conference on Computer Aided Design · doi:10.5555/2840819.2840829 · Cited by 1
Multipartite entanglement in adiabatic quantum searching algorithm
Jiayan, W., & Wei, C. (2012) · International Conference on Natural Computation (ICNC) · doi:10.1109/icnc.2012.6234553 · Cited by 2
Pattern classification using maximally entangled quantum states (MES)
Singh, M. P., & Rajput, B. S. (2014) · The European Physical Journal Plus · doi:10.1140/epjp/i2014-14057-7 · Cited by 1
On simulating the quantum and classical branching programs
Gainutdinova, A. (2007) · Journal of Applied and Industrial Mathematics · doi:10.1134/s1990478907010048 · Cited by 1
Quantum protocols for untrusted computations
Mihara, T. (2006) · Journal of Discrete Algorithms · doi:10.1016/j.jda.2006.03.007 · Cited by 1
A class of quantum low-density parity check codes by combining seed graphs
Hwang, Y., Chung, Y., & Jeon, M. (2013) · Quantum Information Processing · doi:10.1007/s11128-012-0519-z · Cited by 1
I think there is a world market for maybe five quantum computers
Schultes, D. (2004) · Cited by 1
Speed-up of Neuromorphic Adiabatic Quantum Computation by Local Adiabatic Evolution
Kinjo, M., & Shimabukuro, K. (2011) · IEEE International Symposium on Multiple-Valued Logic (ISMVL) · doi:10.1109/ismvl.2011.63 · Cited by 1
Wei, X., & Fujimura, S. (2012) · IEEJ Transactions on Electrical and Electronic Engineering · doi:10.1002/tee.21712 · Cited by 1
Application of improved quantum particle swarm optimization algorithm in power network planning
Cheng-dong, C., & Chang, X. (2011) · doi:10.1109/mec.2011.6025899 · Cited by 1
Generalized quantum neural predictive networks
Nan, D., & Zhang, Y. (2008) · Chinese Control Conference (CCC) · doi:10.1109/chicc.2008.4605237 · Cited by 1
Tsai, H. F., & Chang, B. R. (2007) · International Conference on Natural Computation (ICNC) · doi:10.1109/icnc.2007.591 · Cited by 1
FAST AND ACCURATE SIMULATION OF QUANTUM COMPUTING BY MULTI-PRECISION MPS: RECENT DEVELOPMENT
SAITOH, A. (2014) · doi:10.1142/9789814602372_0004 · Cited by 1
Quantum Cryptanalysis of Multivariate Permutation Problem
Sun, G., Su, S., & Xu, M. (2014) · International Journal of Security and Its Applications · doi:10.14257/ijsia.2014.8.6.23 · Cited by 1
Ultrametric Algorithms and Automata
Freivalds, R. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-21819-9_2 · Cited by 1
Demonstration of quantum permutation algorithm with a single photon ququart
Zhang, P., Wang, F., Wang, Y., Liu, R., & Li, F. (2015) · Conference on Lasers and Electro-Optics Pacific Rim (CLEO-PR) · doi:10.1109/cleopr.2015.7376023 · Cited by 1
Efficient quantum circuits for arithmetic operations and their applications
高橋, 康. (2008) · Medical Entomology and Zoology · Cited by 1
Optimization of quantum Hamiltonian evolution: From two projection operators to local Hamiltonians
Patel, A. D., & Priyadarsini, A. (2016) · International Journal of Quantum Information · doi:10.1142/s0219749916500271 · Cited by 2
A Quantum Processing Framework for Quantum Algorithms
Aghaei, M. R. S., & Zukarnain, Z. A. (2012) · DOAJ (DOAJ: Directory of Open Access Journals) · Cited by 1
QUANTUM LEARNING SEMINAR LECTURE 2: GROVER'S ALGORITHM
MEYER, D. A. (2002) · Cited by 1
Grover’s Search with Faults on Some Marked Elements
Kravchenko, D., Nahimovs, N., & Rivosh, A. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-49192-8_28 · Cited by 1
Drechsler, R., & Wille, R. (2013) · Cited by 1
A Quantum Chaos Clonal Multiobjective Evolutionary Method Reasearch
Wu, S. (2016) · Indonesian Journal of Electrical Engineering and Computer Science · doi:10.11591/ijeecs.v3.i1.pp226-234 · Cited by 1
Optimizations and Complexity Analysis on the Reversible Level
Abdessaied, N., & Drechsler, R. (2016) · Springer eBooks · doi:10.1007/978-3-319-31937-7_3 · Cited by 1
Control of Quantum Particle Dynamics by Impulses of Magnetic Field
Архинчеев, В. Е. (2016) · InTech eBooks · doi:10.5772/63697 · Cited by 1
Optimization and Complexity Analysis on the Mapping Level
Abdessaied, N., & Drechsler, R. (2016) · Springer eBooks · doi:10.1007/978-3-319-31937-7_4 · Cited by 1
Optimal One-shot Quantum Algorithm for EQUALITY and AND
Ambainis, A., & Iraids, J. (2016) · Baltic Journal of Modern Computing · doi:10.22364/bjmc.2016.4.4.09 · Cited by 2
An O(N 3/4 log 2 N) Quantum Algorithm for the 1-dimensional Closest-Pair Problem
VOLPATO, N., & Moura, A. (2009) · Cited by 1
Storing the Quantum Fourier Operator in the QuIDD Data Structure
Friedl, K., & Kabódi, L. (2017) · Acta Cybernetica · doi:10.14232/actacyb.23.2.2017.5 · Cited by 1
Biologically motivated quantum neural networks
Steck, J. E., & Behrman, E. (2017) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/smc.2017.8122746 · Cited by 1
Hybrid scheme for secure communications using quantum and classical mechanisms
Pleṣa, M.-I. (2017) · International Conference on Electronics, Computers and Artificial Intelligence (ECAI) · doi:10.1109/ecai.2017.8166458 · Cited by 1
Avila, M. A., & Elizalde-Salas, J. B. (2018) · Computación y Sistemas · doi:10.13053/cys-21-4-2367 · Cited by 1
Short Solutions to Nonlinear Systems of Equations
Szepieniec, A., & Bart Preneel, A. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-76620-1_5 · Cited by 1
Dynamical Controls for Improving Quantum Search Algorithm Through Flux Qubits System
Homid, A. H., Abdel‐Aty, M., El-Shahat, T. M., et al. (2018) · Fortschritte der Physik · doi:10.1002/prop.201700080 · Cited by 1
Parallel Computational Structure of Noisy Quantum Circuits Simulation
Chernyavskiy, A. Y., Voevodin, V., & Воеводин, В. В. (2018) · Lobachevskii Journal of Mathematics · doi:10.1134/s1995080218040042 · Cited by 1
Defects for quantum information processing in silicon
Abe, E., & Itoh, K. M. (2018) · Elsevier eBooks · doi:10.1016/b978-0-08-102053-1.00009-0 · Cited by 1
An Introduction to Quantum Search Algorithm and Its Implementation
Dumas, J. P., Soni, K. K., & Rasool, A. (2018) · Advances in intelligent systems and computing · doi:10.1007/978-981-13-1402-5_2 · Cited by 1
Dooley, J. F. (2018) · History of computing · doi:10.1007/978-3-319-90443-6_15 · Cited by 1
The Research of Grover’s Quantum Search Algorithm with Use of Quantum Circuits QX2 and QX4
Liber, A., & Nita, L. (2018) · Advances in intelligent systems and computing · doi:10.1007/978-3-319-99981-4_14 · Cited by 1
Maron, A., Reiser, R., Pilla, M. L., et al. (2013) · CLEI electronic journal · doi:10.19153/cleiej.16.3.3 · Cited by 1
Megahed, M. H., Makrakis, D., Mouftah, H. T., et al. (2013) · International Conference on Aerospace Sciences and Aviation Technology · doi:10.21608/asat.2013.22186 · Cited by 1
Optimization of Raman Cooling of 25Mg+ Ion to Ground Vibrational State in Linear Paul Trap
Sidorov, P., Khabarova, K. Y., Zalivako, I. V., Borisenko, A. S., & Semerikov, I. A. (2019) · Bulletin of the Lebedev Physics Institute · doi:10.3103/s1068335619040080 · Cited by 1
Finding shortest lattice vectors faster using quantum search
Laarhoven, T., Mosca, M., & van de Pol, J. (2014) · Cited by 1
A New Quantum Private Query Protocol with Better Performance in Resisting Joint-Measurement Attack
Chen, X., He, S., Hou, G., et al. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-24268-8_48 · Cited by 1
SYMMETRY AND QUANTUM TRANSPORT ON NETWORKS
Salimi, S., Radgohar, R., & Soltanzadeh, M. M. (2010) · International Journal of Quantum Information · doi:10.1142/s0219749911006661 · Cited by 1
Patel, A. D. (2011) · Resonance · doi:10.1007/s12045-011-0100-6 · Cited by 1
The Discrete-time Quaternionic Quantum Walk and the Second Weighted Zeta Function on a Graph
Konno, N., Mitsuhashi, H., & Sato, I. (2017) · Interdisciplinary Information Sciences · doi:10.4036/iis.2017.a.02 · Cited by 1
Quantum and classical query complexities for generalized Deutsch–Jozsa problems
Xie, Z., & Qiu, D. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02652-2 · Cited by 1
Variable word length: a quantum-proof encryption solution
Palmer, M. (2020) · doi:10.1117/12.2559740 · Cited by 1
Generalized Quantum Deutsch-Jozsa Algorithm
Arodź, T. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-50433-5_36 · Cited by 1
Metadata
- Authors
- Grover, L. K.
- Affiliations
- AT&T (United States) (US)
- Corresponding author
- Grover, Lov K.
- Venue
- Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96
- Publisher
- ACM Press
- Published
- 1996
- Pages
- 212-219
- OpenAlex
- W2084652510
- Semantic Scholar
- 298d799da82395a64a3bda38ef9d2a4646828ccb
- Cited by
- 8,830
- References
- 24
- Citations by year
- 2026: 664 · 2025: 1066 · 2024: 896 · 2023: 841 · 2022: 674 · 2021: 655 · 2020: 529 · 2019: 423 · 2018: 288 · 2017: 283 · 2016: 219 · 2015: 221 · 2014: 184 · 2013: 161 · 2012: 158
- FWCI
- 36.24
- Type
- conference paper
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- ACM Symposium on Theory of Computing (STOC) (publishedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- quantum search, unsorted database search, Grover's algorithm, quantum algorithms, time complexity, quantum parallelism, lower bounds
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
A language model drew the claims from the paper on 2026-10-21, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-21 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
