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,401–8,500 of 8,792
Abstractions and Modularity in Quantum Programs Design
Alegría, J. A. H., Pantoja, L., Collazos, C., et al. (2025) · IEEE CHILEAN Conference on Electrical, Electronics Engineering, Information and Communication Technologies (CHILECON) · doi:10.1109/chilecon66915.2025.11476283
Kunnath, L., & Babu, C. R. N. (2026) · Lecture notes in networks and systems · doi:10.1007/978-3-032-18138-1_5
Kundu, S., & Ghosh, U. (2026) · International Conference on Emerging Smart Computing and Informatics (ESCI) · doi:10.1109/esci68015.2026.11493273
Integration of Quantum Computing and ML: A New Era of Cybersecurity for Power Electronics
Koduru, S. S., Nutakki, M., Machina, V. S. P., et al. (2026) · doi:10.1109/ccic68129.2026.11486245
A quantum algorithm for localization using limited cellular information
Shokry, A., & Youssef, M. A. (2026) · npj Wireless Technology · doi:10.1038/s44459-026-00033-2
Li, J., Ding, X., Wang, K., Li, J., Jia, B., Wang, M., & Hu, C. (2026) · IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing · doi:10.1109/jstars.2026.3689689
A novel centralised e-payment protocol based on superdense coding
Çelik, Z., & Bodur, H. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05175-4
Jha, M., Chen, S. Y.-C., Kulkarni, C. M., & Kim, J. (2026) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2026.114991 · Cited by 2
ADAPTIVE METHOD FOR ESTIMATING DOMINANT STATES OF A QUANTUM SYSTEM
Kravets, P. A., Dosyn, D., & Lytvyn, V. (2026) · Ukrainian Journal of Information Technology · doi:10.23939/ujit2026.01.060
Quantum-Enhanced Network Flow Optimization: A Max-Flow Min-Cut Perspective
Phadke, G., & Ladwani, V. M. (2026) · 2026 International Conference on Next-Gen Quantum and Advanced Computing: Algorithms, Security, and Beyond (NQComp) · doi:10.1109/nqcomp68334.2026.11497679
Quantum migration exposes Bitcoin's deferred values choicePreprint
Rudd, M. A. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.6693259
SKYTRA: Traceable Key Encapsulation for Secure Multi-Agent Communications in Embodied UAV Networks
Xie, M., Zeng, M., Gu, Z., Zeng, H., Yan, Y., Xuan, H., & Li, C. (2026) · IEEE Transactions on Cognitive Communications and Networking · doi:10.1109/tccn.2026.3689867
Kotha, R. K., Dorthi, K., Kumar, A., et al. (2026) · doi:10.1109/nqcomp68334.2026.11497720
Quantum Circuit Implementation and Resource Analysis of AIM2
Song, G., Jang, K., Yoon, S., Lee, M., & Seo, H. (2025) · IACR Cryptology ePrint Archive · doi:10.1007/978-981-95-8034-7_12 · Cited by 1
Quantum Infrastructure in Biology and the Brain
Roeloffs, J. (2026) · The frontiers collection · doi:10.1007/978-3-032-20068-6_2
Tracking Affine Subspace with Gaussian Elimination for Adaptive Quantum Circuit Simulation
Jin, K., On, J., & Cha, G. (2026) · ACM Transactions on Quantum Computing · doi:10.1145/3815191
Homomorphic Transciphering for Secure Migration from LEA-128 to LEA-256
Lee, J., Cho, S., Jung, S., et al. (2026) · Lecture notes in computer science · doi:10.1007/978-981-95-8034-7_17
DGSP: An Efficient Scalable Fully Dynamic Group Signature Scheme Using $$\textrm{SPHINCS}^{+}$$
Fadavi, M., Azimi, S. A., Karati, S., & Jaques, S. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-25330-9_16
Post-quantum TLS 1.3 Handshake from CPA-Secure KEMs with Tighter Reductions
Chen, J., Zhou, B., Chen, R., Jiang, H., Wang, Y. R., Huang, X., Zhao, Y., & Yung, M. M. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-25317-0_17 · Cited by 2
A Hybrid Quantum-Classical Framework for Saliency-Aware Medical Image Encoding
Nikam, V., Atre, T. S., Santhosh, L., N, A. K., & Praveena, M. V. (2026) · Quantum Reports · doi:10.3390/quantum8020046
Efficient hybrid post-quantum authentication for quantum key distribution under finite-size effects
Wang, L., Fu, Z. F., Zhou, Y.-Y., Yin, J.-M., & Chen, Q. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05185-2
Efficient QKD in Non-Ideal Scenarios with User-Defined Output Length Requirements
Martín-Megino, A., López, B., Vidal, I., & Valera, F. (2026) · Technologies · doi:10.3390/technologies14050284
Another Look at the Quantum Security of the Vectorization Problem with Shifted Inputs
Frixons, P., Gilchrist, Kutas, P., et al. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-25291-3_22
Low-Depth Construction of Grover Oracles from Fully Functional Quantum Circuits
Gu, J., & Abdolmaleki, B. (2026) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc69040.2026.00134
Real Quantum Computers Applied to Audio
Alani, A., & Miranda, E. R. (2026) · 2026 International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc69040.2026.00175
Efficient Quantum Generic Key-Recovery Attack on Feistel Ciphers
Zhang, K., Shang, T., & Zhang, Y. (2026) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc69040.2026.00032
On finding quantum multi-collisions in non-uniform random functions
Peng, T., & Xue, R. (2026) · Cybersecurity · doi:10.1186/s42400-026-00568-5
Resource-Constrained Quantum Implementation and Analysis of Mini-AES Cipher
Shahmir, S., Murtaza, G., Bentafat, E., Abdallah, M. M., Al‐Fuqaha, A., Al-Kuwari, S. M., & Abbas, T. (2026) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc69040.2026.00166
Lackadaisical Quantum Walk Search on Dicyclic Cayley Graphs
Ng, R. Y., Tiong, Y. Q., & Ong, K. L. (2026) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc69040.2026.00133
How to Prove Post-quantum Security for Succinct Non-interactive Reductions
Chiesa, A., Di, Z., Hu, Z., & Zheng, Y. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-25336-1_14
Universal blind quantum computation with recursive rotation gates
Joshi, M., Mishra, M. K., & Karthikeyan, S. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05188-z
Simulation Paths for Quantum Circuit Simulation with Decision Diagrams
Burgholzer, L., & Wille, R. (2026) · Springer eBooks · doi:10.1007/978-3-032-06770-8_6
Quantum circuit evolutionary framework applied to the set partitioning problem
Fernandez, B. O., Bloot, R., & Moret, M. A. (2026) · The Journal of Supercomputing · doi:10.1007/s11227-026-08511-8
Experimental qudit-assisted quantum operations by dimension expansion and partial measurement
Chi, Y., Pan, C., Lu, X. P., Zhu, Y., & Wang, F. (2026) · APL Photonics · doi:10.1063/5.0309870
Zhou, Y., Wu, Y., Li, X.-R., Yang, Y., & Shi, W. (2026) · Advanced Quantum Technologies · doi:10.1002/qute.70306
Dynamic Adaptive Multi‐Party Quantum Key Agreement Based on Entanglement Swapping
Wang, C., Li, M., Zhu, H., et al. (2026) · Advanced Quantum Technologies · doi:10.1002/qute.70309
A Post-Quantum Secure Digital Signature System for Cryptocurrency Transactions Based on SM3-SPHINCS+
Tian, K., Zhang, Q., Guo, B., et al. (2026) · International Conference on Computer Network Security and Software Engineering (CNSSE) · doi:10.1145/3803633.3803643
Automatic Index Tuning via Quantum Deep Reinforcement Learning
Duarte, J., Gruenwald, L., d’Orazio, L., et al. (2026) · Machine Learning and Knowledge Extraction · doi:10.3390/make8050130
Technikfolgenabschätzung aktueller Technologien
Keuthen, T. (2026) · Springer eBooks · doi:10.1007/978-3-658-51418-1_10
Efficient quantum detection of maximum clique via hybrid heuristic and global information encoding
Han, W., Zheng, S., Chen, P., & Wang, Y. (2026) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ae6cc6
Mayaluri, Z. L., & Ganapati, P. (2026) · Cureus Journal of Computer Science. · doi:10.7759/s44389-025-00066-8
Feedback-Receiver-Based Compensation of Nonlinearities in Trapped Ion Qubit Gate Signaling
Baecker, M., Jaeger, M., Tegowski, B., et al. (2026) · German Microwave Conference · doi:10.1109/gemic71240.2026.11516472
Lightweight and Post-Quantum Cryptography for AIoT Authentication
Al-E’mari, S., Sanjalawe, Y. K., & Hajjaj, R. Y. (2026) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-3373-6299-1.ch004
Full-phase distributed quantum differential cryptanalysis and its variants on block ciphers
Shang, T., Zhang, K., & Zhang, Y. (2026) · Designs Codes and Cryptography · doi:10.1007/s10623-026-01814-0
Nonia, R. K., Sarkar, M., & Shaw, D. K. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.6778403
A verification scheme for universal quantum computers
Reddy, A., Tene, A. G., & Konrad, T. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05193-2
Verifiable dynamic multiparty quantum secret sharing protocol based on orthogonal product states
Guo, H., Li, S., & Li, J. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05183-4
Noise resilience in symmetric exchange interactions on NISQ processors
AbuGhanem, M. (2026) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-026-07757-8
A Hybrid Approach Combining Quantum and Neuromorphic Computing for Live City Traffic Management
Swain, S. S., Sekaran, R., S., G., S, J., K.Vengatesan, & Nagu, B. (2026) · 2026 Third International Conference on Networking and Communications (ICNWC) · doi:10.1109/icnwc68145.2026.11518477
Measurement-Driven Adaptive Low-Overhead Implementation of Multi-Controlled Toffoli Gates
Kole, A., Schnittka, T., & Drechsler, R. (2026) · IEEE Workshop on Design and Diagnostics of Electronic Circuits and Systems · doi:10.1109/ddecs69233.2026.11521018 · Cited by 1
FCA Quantum Neural Networks for Interpretable Neuro-symbolic Classification
Akremi, O., Sellami, M., & Gammoudi, M. M. (2026) · IEEE International Conference on Complex Systems and Intelligent Computing (ICCSIC) · doi:10.1109/iccsic69301.2026.11521467
Lattice-Based Blind Ring Signature With Applications to Anonymous Voting Systems
Chen, X. Y., Xu, S. Z., Guo, Y., et al. (2026) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2026.3694695
A Simulation of Quantum Key Distribution Using BB84 Protocol
Manzoor, A., Saeed, M., & Ahmed, F. (2025) · International Multi-Topic ICT Conference (IMTIC) · doi:10.1109/imtic68267.2025.11520516
Thouless quantum walks in topological flat bands
Danieli, C., Conti, C., Pilozzi, L., & Brosco, V. (2026) · Light Science & Applications · doi:10.1038/s41377-025-02140-1
A Structure‐Based Benchmarking Suite for Quantum Learning
Lee, D., & Choi, B.-S. (2026) · Concurrency and Computation Practice and Experience · doi:10.1002/cpe.70758
Rezaei, P., Rahgozar, B., Khan, M. S., Yadollahi, M., & SaberiKamarposhti, M. (2026) · IEEE International Colloquium on Signal Processing & Its Applications (CSPA) · doi:10.1109/cspa68262.2026.11517902
LATON: A Quantum-Resilient Unified Compression and Encryption Technique For IoT
Rafat, K. F. (2026) · International Conference on Data Science, Machine Learning, and Intelligence (DataSciMI) · doi:10.1109/datascimi67380.2026.11523974
Attacks on PRISM-id via Torsion over Small Extension Fields
Nakagawa, K., & Onuki, H. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-26731-3_16
High-Efficiency Lightweight Quantum Key Agreement Scheme Based on Bell State Entanglement
Zhang, C., LIU, Y., Jiang, Y., et al. (2026) · Mathematics · doi:10.3390/math14101774
A Structural Theory of Quantum Computational Advantage from Admissible Histories
Li, B. (2026) · Quantum Reports · doi:10.3390/quantum8020049
Quantum simulation in the entanglement picture
Wang, D.-S., Xu, X., & Liu, Y.-D. (2026) · Quantum Review Letters · doi:10.1016/j.qrl.2026.05.003 · Cited by 1
Quantum Partial Sorting for Signal Decoding in Wireless Communication Systems
Alsaui, A. A., Al-Nahhal, I., Dobre, O. A., & Shin, H. (2026) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2026.3695844
Reasoning about Parameterized Recursive Quantum Programs with Ancilla Data and Probabilistic Control
Unruh, D., Valiron, B., & Ying, M. (2026) · ACM Transactions on Computational Logic · doi:10.1145/3815573
Investigations of Quantum-Based Algorithm for Breast Tumor Diagnosis
Sundharakumar, K. B., Dhivya, S., Mohanavalli, S., et al. (2026) · Lecture notes in networks and systems · doi:10.1007/978-981-95-8497-0_20
Erciyes, K. (2026) · Texts in computer science · doi:10.1007/978-3-032-05294-0_16
Kumar, S., Kundu, S., Rahaman, H., et al. (2026) · Lecture notes in networks and systems · doi:10.1007/978-981-95-0497-8_39
Automatic De-Quantization of Quantum Programs Using Constant Propagation
Remme, L., Weinert, A., Waschk, A., Burgholzer, L., & Wille, R. (2026) · 2026 IEEE International Conference on Quantum Software (QSW) · doi:10.1109/qsw72780.2026.00021
Çıldıroğlu, H. Ö., Basmaci, H., & Yayla, O. (2026) · Open Physics · doi:10.1515/phys-2025-0297
FPGA-Based Real-Time Image Encryption Using Reversible Gate-Based Transformations
Cheng, Y.-L., Chen, C. Y., Huang, T. W., & Liao, Y.-P. (2026) · Electronics · doi:10.3390/electronics15112297
QUARK: A Quantum-Powered Index Advisor
Kesarwani, M., Murthi, A. K., & Haritsa, J. R. (2026) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/3788853.3801597
How Quantum Computing Breaks RSA? - A Study of Shor's Algorithm
Jain, A. (2025) · IEEE MIT Undergraduate Research Technology Conference (URTC) · doi:10.1109/urtc68753.2025.11533064
Chaudhari, M. H. N. (2026) · International Journal of Latest Technology in Engineering Management & Applied Science · doi:10.51583/ijltemas.2026.150500034
Quantum Differential‐Linear Key Recover Attack and its Application on Simon32/64 and Simeck32/64
Z, C., Guan, J., Shi, T., et al. (2026) · Advanced Quantum Technologies · doi:10.1002/qute.70307
W stronę bezhasłowej bankowości
Kot, M., & Wawrzyniak, D. (2026) · Wroclaw University of Economics and Business eBooks · doi:10.15611/2026.43.2.06
Unveiling the link between quantum ghost imaging and Grover’s quantum searching algorithm
Gounden, N., Nothlawala, F., Obando, P. C., et al. (2026) · APL Quantum · doi:10.1063/5.0322996
Understanding the basics of quantum blockchain
Karthiga, M., Sankarananth, S., Sangeethaa, S. N., & Jothimani, S. (2026) · Elsevier eBooks · doi:10.1016/b978-0-443-33700-0.00011-x
Miriyala, S., & Chirra, V. R. (2026) · Advanced Quantum Technologies · doi:10.1002/qute.70310 · Cited by 1
Mathews, M. M., & Panchami, V. (2026) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2026.3699264
Quantum Computing Explained: A Beginner's Guide to the Future of Processing
John, W. M. (2025) · International Journal of Information Technology Research Studies (IJITRS) · doi:10.63090/ijitrs/3139.3209.0013
Kumar, A., Gupta, U., & Goyal, M. (2026) · International Conference on Intelligent Systems in Engineering, Secured Systems and Cybersecurity (ICISESSC) · doi:10.1109/icisessc68634.2026.11542690 · Cited by 1
A Mathematical Exploration to Equivalence Checking of Quantum Circuits
Lin, Y.-C., Li, Y., Tang, W., Chen, Y.-C., Chu, C.-C., & Wang, C.-Y. (2026) · Design, Automation, and Test in Europe · doi:10.23919/date69613.2026.11539441
WITHDRAWN: Quantum-Resilient Emergency Operating Mode for Unmanned UAM Aircrafts
Janakiraman, K., Rao, N., Baggaley, N., et al. (2026) · AIAA AVIATION Forum · doi:10.2514/6.2026-4224
RetractedQuantum-Assisted Federated Learning for Privacy-Preserving Medical Diagnosis
Pathak, R., Mohammed, B. A., Saxena, S., et al. (2026) · doi:10.1109/icisessc68634.2026.11542760
Optimal Compilation of Syndrome Extraction Circuits for General Quantum LDPC Codes
Zhang, K., Gao, D., Yang, Z., Zhou, R., Liu, F., Ji, Z., & Chen, J. (2026) · Design, Automation, and Test in Europe · doi:10.23919/date69613.2026.11539585 · Cited by 7
Securing Wireless Surgical Ecosystems in the Quantum Era
Fatima, S., Reddy, C. K. K., Anisha, P. R., et al. (2026) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-3373-8022-3.ch006
Quantum physics-informed neural network for scattered wavefields
Duarte, D. H. G., de Lima, P. D. S., de Palhares, A. B., Varela, J. M., de Araújo, J. M., & Chaves, R. (2026) · International Journal of Modern Physics C · doi:10.1142/s0129183126430096
The Transformative Impact of Quantum Computing on Cybersecurity
Mummadi, S., Shiva Spoorthi, V., Neha, S., Ashwath Reddy, K., Balakiran Reddy, K., & Udari, G. C. (2026) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-3373-0990-3.ch003
Prediction of Compilation Options for Quantum Circuits via Adaptive Deep Residual Neural Network
He, S., Wen, L., Li, Y., Li, M., Chen, K., & Lu, Y. (2026) · Quantum Information and Computation · doi:10.2478/qic-2026-0003
Hemajothi, S., Keerthana, B., Janani, R., & Farzana, E. (2026) · International Conference on Pervasive Computing and Social Networking (ICPCSN) · doi:10.1109/icpcsn68523.2026.11543578
On the Need for (Quantum) Memory with Short Outputs
Hao, Z., Huang, Z., & Liu, Q. (2026) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3798129.3800896
Earliest Failure Localization in Pipelines Via Quantum Search
Fisher, A., & Bobda, C. (2026) · IEEE Dallas Circuits and Systems Conference (DCAS) · doi:10.1109/dcas69364.2026.11544612
Hardware-Efficient Quantum Grid Sampling for Low-Latency Amplitude Estimation
Kao, Y.-T., Lu, H., Chang, Y.-J., et al. (2026) · IEEE Dallas Circuits and Systems Conference (DCAS) · doi:10.1109/dcas69364.2026.11544432
StateQ: A novel framework for intuitive and accessible quantum programming
Li, J. L., Li, D., Wang, Z., Sun, H., Chen, H., Cui, T., & Ye, Y. (2026) · Quantum Machine Intelligence · doi:10.1007/s42484-026-00403-7
Krušniauskas, S., Grigaliūnas, Š., Brūzgienė, R., et al. (2026) · Electronics · doi:10.3390/electronics15122546
Kim, I., Lee, M., Kang, T., et al. (2026) · ACM/SIGAPP Symposium on Applied Computing (SAC) · doi:10.1145/3748522.3779914
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
