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,601–8,700 of 8,792
بررسی جامع رمزنگاری پساکوانتومی و چالشهای پیادهسازی آن
رحمانی, ه., & سادات, س. م. (2026) · Algorithm Scientific Research Journal · doi:10.61438/asrj.v1i1.338
A Practical Specification Language for Automatic Quantum Program Verification
Tsai, W.-L., Chen, Y., & Lengál, O. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-32537-2_15
Formal Verification of Quantum Ancilla Safety
Li, J., Mei, J., Fang, W. S., & Guan, J. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-32537-2_16
Djeziri, I., & Faraoun, K. M. (2026) · Cluster Computing · doi:10.1007/s10586-026-06363-8
Generalized quantum walk search algorithm
Giri, P. R. (2026) · International Journal of Quantum Information · doi:10.1142/s0219749926500243
Villalba, K. M., Pardo, C., & Donado, S. A. (2026) · Future Internet · doi:10.3390/fi18080395
TabularQGAN: a quantum generative model for tabular data synthesis
Bhardwaj, P., Jones, C. R., Dierich, L., & Vučković, A. (2026) · Scientific Reports · doi:10.1038/s41598-026-62434-1 · Cited by 2
Finans, Muhasebe ve Denetimde Kuantum Bilgisayar Uygulamaları
ULUCENK, E. (2026) · Karadeniz Ekonomi Araştırmaları Dergisi · doi:10.71233/kared.1841634
Post-quantum group signature scheme for multi-party satellite control via CP-WOTS+ optimization
Sang, Q., Zhou, L., Lin, X., et al. (2026) · Cybersecurity · doi:10.1186/s42400-026-00632-0
Post-Quantum Cryptography Migration for Enterprise Security
Mini, T., V (2026) · International Journal of Information Technology Research Studies (IJITRS) · doi:10.63090/ijitrs/3139.3209.0032
Khadiev, K., & Khadieva, A. (2026) · 2026 IEEE International Conference on Smart Computing Workshops and Other Affiliated events (SmartComp Companion) · doi:10.1109/smartcomp-companion70724.2026.00039
Kołota, J. (2026) · IEEE Access · doi:10.1109/access.2026.3718517
The spectra of the time evolution matrix of a bipartite walk on a bipartite graph
Endo, T., Komatsu, T., Konno, N., & Sato, I. (2026) · Indian Journal of Pure and Applied Mathematics · doi:10.1007/s13226-026-01013-6
On Grover’s Algorithm in Continuous Variables
Grigorev, S. G., & Vashukevich, E. A. (2026) · International Conference Laser Optics (ICLO) · doi:10.1109/iclo69056.2026.11624668
Quantum Hamiltonian Descent for Rigid Image Registration
Voigts, J. D., Meli, N. K., & Lellmann, J. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-31452-9_10
Quantum Circuit Resource Assessment for ChaCha20 Stream Cipher
Thuy, D. T. T., Dat, L. Q., & Linh, H. D. (2026) · Communications in computer and information science · doi:10.1007/978-981-92-2584-2_4
SoK: PQC PAKEs Design, Security and Performance
Alnahawi, N., Haas, D., Mauß, E., & Wiesmaier, A. (2026) · IACR Communications in Cryptology · doi:10.62056/a6n5txl7s
Quantum Verification of Compressed Proofs through DLDS-to-Circuit Compilation
Saraiva, L., & Hæusler, E. H. (2026) · doi:10.5753/sbccq.2026.21925
Innovative Approaches to Strengthening PAKE Protocols and Quantum-Secure Key Exchange
Rahmani, N., & Serraj, T. (2026) · Lecture notes in networks and systems · doi:10.1007/978-3-032-18860-1_12
Simulation-Based Comparison of Classical Linear Search and Grover’s Quantum Algorithm
Stefanova, T., & Georgiev, T. S. (2026) · Lecture notes in networks and systems · doi:10.1007/978-3-032-24810-7_15
TUSQ: Tracking, Uncomputation, and Sampling for Noisy Quantum Simulation
Dangwal, S., Oberoi, T., Sailopal, A., et al. (2026) · ACM/IEEE International Symposium on Computer Architecture (ISCA) · doi:10.1109/isca66397.2026.00163
A Hybrid Blockchain Design Integrating Proof-of-Work and Proof-of-Quantum-Work Consensus
Zhang, J., Zeng, Y., & Yang, Y. (2026) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/2575-8411.2026.00140
Estratégias Preliminares de Consumo de Chaves Quânticas na Rede Hermes Quântica
Bessa, J. A., Tezzin, A., Udhre, G., et al. (2026) · doi:10.5753/sbccq.2026.22956
Quantum walks on a ring as a versatile single-parameter sensor
Zanoli, L., Ragazzi, G., Bordone, P., & Paris, M. G. A. (2026) · Frontiers in Quantum Science and Technology · doi:10.3389/frqst.2026.1894991
Secure Decentralized Key Relaying via Random Walks in Dynamic Semi‐Trusted QKD Networks
Kozlovičs, S., Petručeņa, K., Kalniņa, E., et al. (2026) · Advanced Quantum Technologies · doi:10.1002/qute.70393
Hybrid Quantum–Classical Framework for Quantum Complexity
Siripuri, K., Thota, S., & Mandala, P. (2026) · doi:10.1109/icicit69063.2026.11634060
Adaptive quantum ansatz circuit design and optimization
Cheng, X., Yang, F., Diao, R., Ding, F., Zhao, S., & Guan, Z. (2026) · Quantum Machine Intelligence · doi:10.1007/s42484-026-00428-y
Faster and Smaller Variants of BinSIDH and TerSIDH
Wang, B., Yu, W., Tian, S., Wang, K., & Xing, T. (2026) · Lecture notes in computer science · doi:10.1007/978-981-95-4677-0_1
Quantum Genetic Algorithm with Dynamic Encoding Scheme
Kim, J. S., Kim, M.-J., & Ahn, C. W. (2026) · Informatica · doi:10.15388/26-infor639
A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems
Zhang, Y., Wang, S., & Yang, W. (2026) · Entropy · doi:10.3390/e28080886
Design and Validation of a Quantum Software Engineering Lifecycle Framework
Zada, I., Jameel, A., Mumtaz, H., Hayat, F., Ahmad, J., Bibi, S., & Shehryar, L. (2025) · International Journal of Innovations in Science and Technology · doi:10.33411/ijist/1683
Weinberg, A. I. (2026) · Quantum Machine Intelligence · doi:10.1007/s42484-026-00427-z
Akhatov, A., Ruzikulovich, T. M., Kuvandikov, J., et al. (2026) · Future Internet · doi:10.3390/fi18080422
Guess-and-Determine Rebound Revisited: Full Quantum Collision Attack on AES-256 in DM Hash Mode
Tang, L., Qin, L., Hou, S., & Dong, X. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-35409-9_15
A Systematic Bibliometric and Topic Modelling Review of Crypto Financial Risk ResearchPreprint
Zhou, J., Li, J., Xu, B., et al. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.7225798
Permutation-Based Hash from Non-Idealized Assumptions: Adding Feed-Forward to Sponge
Guo, C., Hu, K., Jiang, S., et al. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-35412-9_3
Liu, C., Li, J., & Liao, Q. (2026) · Information · doi:10.3390/info17080763
Bhatt, A., Bhosale, P. N. P., & Mehan, V. (2026) · Research Square · doi:10.21203/rs.3.rs-10565365/v1
Quantum Disease Surveillance Algorithm Based on Private Set Intersection
Shi, J., Xu, R., Li, D., Zhang, K., Zhang, L., & Sun, H.-W. (2026) · Advanced Quantum Technologies · doi:10.1002/qute.70399
Quantum‐Enhanced Genetic Algorithm for Quantum Neural Network Optimization
Chen, K., Wei, Y., & Yan, F. (2026) · Advanced Quantum Technologies · doi:10.1002/qute.70394
An Improved Quantum Both-May ISD Algorithm
Li, Y., Cao, Y., Hou, S., et al. (2026) · International Conference on Electronic Engineering and Informatics (EEI) · doi:10.1109/eei70303.2026.11640518
EDM4QS: An Emulator-Driven Model for Quantum Scheduling
Nguyen, T., Chung, M. T., Diep, T.-D., et al. (2026) · Communications in computer and information science · doi:10.1007/978-981-92-2587-3_13
Quantum-Assisted Seed Recovery Under Probabilistic Leakage in Post-Quantum Cryptography
Gauthier–Umaña, V., Sanchez, J. D., & Villanueva-Polanco, R. (2026) · IEEE Access · doi:10.1109/access.2026.3722424
Introduction to Quantum Information Science
Kantsepolsky, B., & Topor, L. (2026) · Springer eBooks · doi:10.1007/978-3-032-26223-3_7
Post-Quantum Cryptography in Cloud-Based Educational Systems: Opportunities and Challenges
Turdiyev, T. T., Ataxanovich, M. U., Hoshimovich, K. D., et al. (2026) · IEEE International Conference of Young Professionals in Electron Devices and Materials (EDM) · doi:10.1109/edm69524.2026.11631928
Quantum Key Search Algorithms under Side-channel AttackPreprint
Yang, Y., Shi, J., Zhang, H., Li, H., Fu, X., Yang, Y., Zhu, Y., & Zhou, Y. (2026) · Research Square · doi:10.21203/rs.3.rs-10245840/v1
Quantum Computing and Cybercrime: The Legal Future of Post-Quantum Cryptography
Singh, P., & Chatterjee, A. (2026) · Studies in big data · doi:10.1007/978-3-032-29599-6_9
QROOT: Quantum-Assisted Root Cause Analysis for Enhanced Observability in Microservice Architectures
shin, S., & Kim, Y. (2026) · IEEE Access · doi:10.1109/access.2026.3723579
Pandey, A. K., Ghosh, D., Obaidat, M. S., Das, A. K., Pal, S., Kappagantu, R. K., Katakam, S. V., & Chougala, J. (2026) · International Conference on Computer, Information and Telecommunication Systems · doi:10.1109/cits70307.2026.11637333
Quantized NN Workflow for Low-Latency Multi-Qubit State Discrimination on FPGA
Gautam, P. K., Kalipatnapu, S., Shankaranarayanan, H., et al. (2026) · International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies (HEART) · doi:10.1145/3814576.3814580
Ouda, O. M. (2026) · Journal of King Saud University - Computer and Information Sciences · doi:10.1007/s44443-026-01064-z
Evaluating the Theoretical Quantum Resilience of SHAKE-256 via Complexity Modeling on WebSRC Data
Sivakumar, S., Mahalakshmi, J., Sumathi, I. R., et al. (2026) · doi:10.1109/icosaas68663.2026.11648576
Quantum image processing filters based on FRQI representation
Shayegan, A. H. S. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05321-y
Quantum machine learning in diabetes and metabolism: Applications and translational challenges
Riente, A., Serantoni, C., Giulio, M. M. D., Capezzone, S., Esposito, R., Spirito, M. D., & Maulucci, G. (2026) · Computer Methods and Programs in Biomedicine · doi:10.1016/j.cmpb.2026.109609
Schubaur, P., Urlbauer, P., & Merli, D. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-35586-7_18
Design and Implementation of NISQ-Compatible Quantum Machine Learning Models for Hardware Security
Kalyan, B. S., & Shahi, A. (2026) · 2026 IEEE Guwahati Subsection Conference (GCON) · doi:10.1109/gcon69192.2026.11649049
Quantum Fusion Learning for 6G Networks With Kolmogorov–Arnold Networks
Paracha, U. I., Khalid, U., Rizvi, S. M. A., Duong, T. Q., Win, M. Z., & Shin, H. (2026) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2026.3725065
A systematic review on the current scenarios and future frontiers for securing smart grid systems
Sivakumar, E., Ganesan, G., Premkumar, R., Rani, R. H. J., & Srinivasan, K. (2026) · Discover Computing · doi:10.1007/s10791-026-10348-x · Cited by 1
Quantum Annealing Applications for Power Grid Modernization
Christeson, T. (2025) · Digital Commons - DU (University of Denver) · doi:10.56902/etdcrp.2025.223
Integrating AI and Quantum-Resistant Encryption
Yemul, R. M., & Vyavahare, S. S. (2026) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-2600-0021-2.ch013
Ma, Y., & Zheng, X. (2026) · IEEE International Symposium on the Application of Artificial Intelligence in Electrical Engineering (AAIEE) · doi:10.1109/aaiee69872.2026.11649868
Post-Quantum Signature Migration for Ethereum Blockchain: A Verification Metrics Study
Ramzan, M. T., & Cimato, S. (2026) · IEEE Annual International Computer Software and Applications Conference (COMPSAC) · doi:10.1109/compsac69091.2026.00326 · Cited by 1
A, S. M., & Arifa, P. (2026) · International Journal of Technology & Emerging Research · doi:10.64823/ijter.2621007
Wang, Z., & Wang, X. (2026) · Computational Optimization and Applications · doi:10.1007/s10589-026-00825-w
Wagatsuma, K., Endo, K., & Terada, K. (2026) · International Journal for Numerical Methods in Engineering · doi:10.1002/nme.70407
Quantum Technologies: Paving the Way Towards “Smart Competition” in the EU
Rodríguez, A. G. (2026) · Springer eBooks · doi:10.1007/978-981-95-9226-5_15
Kuang, R. (2026) · Journal of Cybersecurity and Privacy · doi:10.3390/jcp6050173
Bio-Quantum Evolution of the Human Brain
Zhao, J. (2026) · Journal of Quantum Information Science · doi:10.4236/jqis.2026.163013
On B-Algebra Based Cryptographic Framework
Shahbazpour, K., & Soltani, M. (2025) · doi:10.1109/cfis68949.2025.11652116
Local Reasoning about Probabilistic Behaviour for Classical-Quantum ProgramsPreprint
Wu, H., Deng, Y., & Xu, M. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.7361162
Beyond encryption: post-quantum cryptography and the future of quantum-safe networks
Delhibabu, R. (2026) · Frontiers in Computer Science · doi:10.3389/fcomp.2026.1874869
SAOKD: Server-Assisted Oblivious Key Distribution for Resource-Constrained, Post-Quantum IoT Devices
Alqattan, A., Mahdi, M., & Dimitriou, T. D. (2026) · International Conference on Distributed Computing in Smart Systems and the Internet of Things (DCOSS-IoT) · doi:10.1109/dcoss-iot69657.2026.00038
Robust Shuttling Compilation for Trapped-Ion Quantum Computers
Schoenberger, D., & Wille, R. (2026) · IEEE International Conference on Quantum Software (QSW) · doi:10.1109/qsw72780.2026.00036
Quantum computing-driven evolution of drug discovery paradigms
Han, L., Ke, Z., Liu, L., et al. (2026) · Chinese Science Bulletin (Chinese Version) · doi:10.1360/csb-2026-0450
Hernández-Sánchez, L., Escudero, E. A. F., & Arceo, R. (2026) · Revista Multidisciplinar Epistemología de las Ciencias · doi:10.71112/nankke17
Distribuição de Chaves Quânticas com BB84: simulação e análise do QBER com Qiskit
Petenazzi, L. F., & Hayashi, V. T. (2026) · Revista Eletrônica de Iniciação Científica em Computação · doi:10.5753/reic.2026.8121
Multi-Unary: a dense input encoding scheme for the quantum circuit model
Alonso, D., Sánchez, P., Álvarez, B., et al. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05316-9
Quantum Threats to Contemporary Blockchain Systems: A Comparative Vulnerability and Risk Analysis
Kanoo, S., & Das, P. (2026) · International Conference on Computer Communication and the Internet (ICCCI) · doi:10.1109/iccci70321.2026.11666583
Kar, D., Krutz, D. E., & Desell, T. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-36226-1_18
Analysis of Noisy Environments on D‐Dimensional Quantum Secret Sharing
Mittal, N., Rathi, D., & Kumar, S. (2026) · Advanced Quantum Technologies · doi:10.1002/qute.70402
A Bi-directional multi-solution scalable Grover search Algorithm
Konar, D., Hafeez, Z., & Aggarwal, V. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05328-5
Dong, S., & Yao, Y. (2026) · Cybersecurity · doi:10.1186/s42400-026-00613-3
Network-integrated simulations for the quantum data center with NetQStack
Jain, C., Kissel, E., Yu, S.-Y., Chan, C.-H., Wu, W.-J., & Monga, I. (2026) · Proceedings of the 3rd ACM SIGCOMM Workshop on Quantum Networks and Distributed Quantum Computing · doi:10.1145/3833409.3833446
BB84 with ML-KEM Decapsulation-Failure-Based Security Parameters
Nikula, S., & Muurman, M. (2026) · Cryptography · doi:10.3390/cryptography10050064
Reimagining breast cancer diagnosis with quantum technology
ShivajiRao, G., Jaiganesh, M., Kumar, A. V. A., Sruthi, S., Balaji, K. S., & Lathika, M. (2026) · The Philosophical Magazine A Journal of Theoretical Experimental and Applied Physics · doi:10.1080/14786435.2026.2719597
Chen, J., Liang, D., & He, J. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.7411423
Oliveira, E. L., Machado, E. F. A., & de Menezes, G. R. (2026) · doi:10.5753/eritm.2026.27327
Kirubakaran, M., & Vijayarajan, V. (2026) · Frontiers in Digital Health · doi:10.3389/fdgth.2026.1933562
Ensembling personalized quantum models with local differential privacy
Xhelollari, F., Chen, S. Y.-C., Farooq, J., & Chen, J. (2026) · Quantum Machine Intelligence · doi:10.1007/s42484-026-00440-2
Decoupling the Chaotic Key Space: A Deep Feature Hard-Binding Image Cryptosystem via CNN
Zhou, Z., Wei, K., & Yuan, L. (2026) · International Conference on Advanced Computational Intelligence (ICACI) · doi:10.1109/icaci69731.2026.11677953
Discovering algorithms with computational language processing
Bourdais, T., Gnanasekaran, A., Owhadi, H., & Sahai, T. (2026) · Science Advances · doi:10.1126/sciadv.aea4216
Ren, W., Siha, A., & Xing, G. (2026) · Journal of Reinforced Plastics and Composites · doi:10.1177/07316844261486365
Li, W., Zhou, Y., Wang, J., et al. (2026) · Communications in computer and information science · doi:10.1007/978-981-95-9514-3_13
A Lattice-Based Designated Verifier Signcryption Scheme
Gao, B., Li, C., & Xin, X. (2026) · Communications in computer and information science · doi:10.1007/978-981-95-9514-3_5
Tang, W., Lee, H., Chenli, C., Liu, Y., Seo, J. H., & Jung, T. (2026) · Distributed Ledger Technologies Research and Practice · doi:10.1145/3845805
Solving the Nonlinear Vlasov Equation on a Quantum Computer
Vaszary, T., Datta, A., Goffrey, T., & Appelbe, B. (2026) · Quantum · doi:10.22331/q-2026-09-10-2206 · Cited by 5
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
