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,501–8,600 of 8,792
A novel improved information set decoding algorithm via nearest neighbor search
Li, Y., Wang, L.-P., & Pan, X. (2026) · Cybersecurity · doi:10.1186/s42400-025-00469-z
Quantum Cybersecurity: A Rising Strategic Imperative
Troublefield, T. C. (2026) · Journal of Quantum Information Science · doi:10.4236/jqis.2026.162007
Experimental Analysis of Quantum Neural Networks on Odra 5 Quantum Computer
Jȩdruszek, M., Idzikowski, R. M., & Kucharski, M. A. (2026) · Lecture notes in networks and systems · doi:10.1007/978-3-032-27927-9_18
Quantum Bayesian networks can speed up reinforcement learning in partially observable environments
Cunha, G., Ramôa, A., Sequeira, A., de Oliveira, M., & Barbosa, L. (2026) · Quantum Machine Intelligence · doi:10.1007/s42484-026-00401-9 · Cited by 1
Securing Healthcare Data With Quantum-Safe Encryption
Bhagat, T. T., Bondre, S., Bondre, V. D., Yadav, U., & Dasarwar, P. B. (2026) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-3373-7426-0.ch003
Future of AI for Cybersecurity: Quantum Computing and Beyond
Ramachandran, M. (2026) · Texts in computer science · doi:10.1007/978-3-032-25874-8_3
Shiny, S., Vidhya, S., Raja, P. M. S., & Jasmine, R. M. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05214-0
AI-Sensing Neuromorphic Computing for Cybersecurity in Healthcare Data Lakes
Khan, R. I., Nirzhor, S. S. R., Khou, T., & Roosan, D. (2026) · Communications in computer and information science · doi:10.1007/978-3-032-22211-4_13
HHGS: Forward-Secure Dynamic Group Signatures from Symmetric Primitives
Cao, X., Yang, Z., Reijsbergen, D., Ning, J., Ke, J., Ma, Z., & Zhou, J. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-22931-1_9
Image thresholding using quantum approximate optimization algorithm and Grover’s algorithm
Pachuau, J. L., Singh, N. B., & Saha, A. K. (2026) · The Journal of Supercomputing · doi:10.1007/s11227-026-08618-y
Constructing quantum circuits for Grover key search in MK-3 featuring 16-bit S-boxes
Liao, H., Luo, Q.-B., Zheng, Y., Lv, Y., & Ding, L. (2026) · Cybersecurity · doi:10.1186/s42400-025-00504-z · Cited by 1
A Divergent Index Tuning Advisor Using Quantum Machine Learning for Distributed Databases
Bird, S., Gruenwald, L., & Groppe, S. (2026) · IEEE International Conference on Data Engineering Workshops (ICDEW) · doi:10.1109/icdew71238.2026.00005
Capturing Quantum Algorithms by Quantum Abstract State Machines
Ferrarotti, F. A., & Schewe, K. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-24494-9_17
Quantum-Safe Aadhaar: A Decentralized Multi-Chain KYC System Using Ring-LWE DIDs using did:pqiePreprint
Koradia, D. H., & Agrawal, P. V. (2026) · Research Square · doi:10.21203/rs.3.rs-9980589/v1
Li, M.-C., Ghosh, A., Jaiswal, R., et al. (2026) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.2026.3699984
Quantum-Enhanced Adversarial Robustness in Artificial Intelligence
Sen, J. (2026) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-2600-0156-1.ch009
Borgalli, R. A., Raj, U., & Shetty, S. (2026) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-2600-0156-1.ch005
Additive Resource Scaling in Quantum Circuits for Search in Cryptanalysis
Lavagna, L., Vittori, G., Rosato, A., & Panella, M. (2026) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas66217.2026.11562218
Current Technological Advances in Quantum Computing
Yadav, P., & Kumari, J. (2026) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-2600-0156-1.ch011
A Unified Quantum Circuit Framework for Grover Search and Quantum Walks in NISQ Cryptanalysis
Lavagna, L., Vittori, G., Rosato, A., et al. (2026) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas66217.2026.11562366
Wang, Q., Zhukas, L. A., Miao, Q., Dalvi, A. S., Love, P. J., Monroe, C., Chong, F. T., & Ravi, G. S. (2026) · npj Unconventional Computing · doi:10.1038/s44335-026-00073-5
BRAM-Free ML-KEM NTT with SRL-Based Reordering Unit
Kim, G., Park, Y., & Rhee, C. E. (2026) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas66217.2026.11563045
Forward-Secure Linearly Homomorphic Signature Scheme in the Standard Model and Its Application
Wang, L., & Chang, Z. (2026) · Entropy · doi:10.3390/e28060706
Grover’s Model with Single Oracle Call and Log(N) Different Diffusion Calls
Liu, Y. (2026) · Journal of Quantum Information Science · doi:10.4236/jqis.2026.162009
DAG-Aware Gate Fusion for Efficient State-Vector Quantum-Circuit Simulation
Li, S., Wang, Z.-A., & Fan, H. (2026) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2026.3705783
Daka, C., & Bhattacharyya, S. (2026) · New Journal of Physics · doi:10.1088/1367-2630/ae8053 · Cited by 1
Luo, B., & Lui, J. C. S. (2026) · International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt) · doi:10.23919/wiopt71098.2026.11568180
Portfolio Optimization Using Quantum Computing
Bharad, S. V., Sutar, S. R., Babhulgaonkar, A., & Jadhav, S. M. (2026) · 2026 International Conference on Sustainable and Futuristic Technologies (ICSFT) · doi:10.1109/icsft67370.2026.11566093
Solving mixed-integer problems as QUBO: Encodings, reformulations, and rolling-precision algorithm
Iftakher, A., Türkay, M., & Hasan, M. M. F. (2026) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2026.109757
NeuroAtom Компактное криптографическое ядро (9.6 КБ, 8 функций) с квантовой стойкостьюPreprint
Surkova, M. (2026) · doi:10.24108/preprints-3115598
Authentication feature for ADS-B using overlaid phase modulation
Álvarez, D. P., Agudelo, A. F. R., Acedo, R. F. F., Huerta, A. G., Ibañez, A. F., & Martín, D. D. (2026) · Integrated Communications, Navigation and Surveillance Conference (ICNS) · doi:10.1109/icns69853.2026.11570333
Towards Quantum Machine Learning for Assessing the Resilience of Post-quantum Cryptography
Miszczak, J. A. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-29918-5_3
Quantum Walks for Collision-Based Information Set Decoding
Perriello, S., Barenghi, A., & Pelosi, G. (2026) · ACM International Conference on Computing Frontiers (CF) · doi:10.1145/3801487.3801826
Post-quantum blind signature-based authentication for intelligent transportation systems
Khan, B., Malip, A., & Khan, A. (2026) · Computer Networks · doi:10.1016/j.comnet.2026.112513 · Cited by 1
Kharade, K. G., K.Vengatesan, K., & Algabri, H. K. (2026) · CyberSystem journal. · doi:10.57238/csj.2026.1021
Shubber, M., & Rashno, A. (2026) · CyberSystem journal. · doi:10.57238/csj.2026.1023
Berrada, K., & Bougouffa, S. B. (2026) · Symmetry · doi:10.3390/sym18071086
Ajani, Y. A., Malik, F. O., Abubakar, S., & Jagaba, I. A. (2026) · Information Services & Use · doi:10.1177/18758789261465192
Quantum-Projected Semantic Retrieval: A Universal Low-Latency Backbone for Multi-Modal AI SystemsPreprint
Rana, A. (2026) · Research Square · doi:10.21203/rs.3.rs-10144776/v1
Kirar, J. S., & Rao, A. (2026) · Discover Quantum Science · doi:10.1007/s44464-026-00027-7
Quantum-enhanced hyperdimensional computing for graph representation
Zakeri, A., Poduval, P., & Imani, M. (2026) · Knowledge-Based Systems · doi:10.1016/j.knosys.2026.116550
Lattice Patch Structure for Fixed-Frequency Transmon Quantum Computer with High-Fidelity CNOT Gates
Kim, C., Kang, J., & Kwon, Y. (2026) · Entropy · doi:10.3390/e28070736
Mellor, V., & Ahmad, F. (2026) · Quantum Reports · doi:10.3390/quantum8030062
Brief Announcement: Exponential Quantum Advantage for Message Complexity in Distributed Algorithms
Gall, F. L., Luce, M., Marchand, J., & Roget, M. (2026) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/3796701.3815907
Resource-efficient Grover-meets-BV Q1 attacks on permutation-based pseudorandom functions
Zhou, J.-W., Zhou, B.-M., Zhang, L., et al. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05257-3
Quantum Interior Point Methods: A Review of Developments and an Optimally Scaling Framework
Mohammadisiahroudi, M., Wu, Z., Sampourmahani, P., Harkness, A., & Tamás Terlaky, B. (2026) · Communications in computer and information science · doi:10.1007/978-981-95-7829-0_11
Diagonal-Budgeted Trotterization for Efficient Quantum Hamiltonian Simulation
Chundury, S., Burgstahler, B., Li, J., Suh, I., & Mueller, F. (2026) · International Conference on Supercomputing · doi:10.1145/3797905.3807869
EZCache: A Hierarchical Memory System for Zoned Neutral Atom Quantum Computers
Zhong, J., Deng, Y., Jiang, H., & Feng, J. (2026) · International Conference on Supercomputing · doi:10.1145/3797905.3807838
Building Hybrid Quantum–Classical Computing Ecosystems: A Survey
Bharadwaj, D., Hou, Y., Knapen, A., Kwun, G., Zhitkov, N., & Ravi, G. S. (2026) · Communications in computer and information science · doi:10.1007/978-981-95-7829-0_13
Quantum cryptography based encryption:-A secure transmission and transaction protocol
Rupesh, G., Kanthimathi, M., Valarmathy, G., et al. (2025) · IEEE International Conference on Cybernetics, Cognition and Machine Learning Applications (ICCCMLA) · doi:10.1109/icccmla66092.2025.11580476
Shin, H., Lee, S., Kwak, M., & Kim, Y. (2026) · International Conference on Supercomputing · doi:10.1145/3797905.3816723
Geometric Origin of Fourier Coefficients in Data-Reuploading Single-Qubit Circuits
Oh, S., Im, C., Park, S., & Kim, J. (2026) · Communications in computer and information science · doi:10.1007/978-981-95-7829-0_4
Securing Financial Transactions Using DLT-Enabled Quantum-Safe Authentication Scheme
Ghosh, D., Pandey, A. K., Bagchi, P., et al. (2026) · International Wireless Communications and Mobile Computing Conference (IWCMC) · doi:10.1109/iwcmc69287.2026.11580107
AlAbdulla, S., Samara, M. A., Atia, O. B., Bennis, I., & Brik, B. (2026) · International Wireless Communications and Mobile Computing Conference (IWCMC) · doi:10.1109/iwcmc69287.2026.11579854
Wang, Z., Gong, T., Ji, B., et al. (2026) · International Wireless Communications and Mobile Computing Conference (IWCMC) · doi:10.1109/iwcmc69287.2026.11580000
Cost-Aware Quantum Bit Mapping for Distributed Quantum Computing
Zhan, F., 王, X. G. 晓. W., Zhao, Y., et al. (2026) · International Wireless Communications and Mobile Computing Conference (IWCMC) · doi:10.1109/iwcmc69287.2026.11580025
A quantum-hybrid decomposition strategy for the traveling salesman problem in the planePreprint
Leib, D., Fritzler, S., Seidel, T., et al. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.7050863
Quantum Key Distribution for Sustainable and Secure Communication: Opportunities and Challenges
Thakur, S. (2023) · Vidhyayana · doi:10.58213/r288cx43
Kulkarni, P. P., & Alam, A. (2026) · Workshop on Quantum Computing and Quantum-Inspired Technology for Data-Intensive Systems and Applications (Q-Data) · doi:10.1145/3811628.3811832
Quantum Index Advisors: Beyond Configuration Selection?
Kesarwani, M., & Haritsa, J. R. (2026) · doi:10.1145/3811628.3811838
Ghosh, D., Das, A. K., Prajapat, S., et al. (2026) · Distributed Ledger Technologies Research and Practice · doi:10.1145/3827623
A Case-Based Evaluation of Quantum-Resistant Data Indexing Techniques for Blockchain Databases
Ali, A., Munawar, S., & Naveed, N. (2026) · International Journal of Innovations in Science and Technology · doi:10.33411/ijist/1836
HIRZ: Hybrid Post-Quantum Cryptography for Secure Long-Term Data Archiving
Alajmi, W., Alsafi, F., Aldhafyan, R., Alshammari, L. F., Almutairi, A., & Batouche, M. (2026) · Learning and Technology Conference (L&T) · doi:10.1109/lt68265.2026.11592519
A regularization method for quantum neural networks using data symmetry
Ohno, H. (2026) · Discover Quantum Science · doi:10.1007/s44464-026-00039-3
Tariq, M., Abdelrahim, R. F., Alhussein, O., & Muhaidat, S. (2025) · IEEE Globecom Workshops (GC Wkshps) · doi:10.1109/gcwkshps68340.2025.11591108
Vaněk, M., Saadi, N., Isoard, V., et al. (2026) · MIPRO ICT and Electronics Convention (MIPRO) · doi:10.1109/mipro70003.2026.11591625
Designing Biologics with Quantum AI
Khan, M. Z. I., Sojib, N., Karim, M., & Roosan, D. (2026) · Springer eBooks · doi:10.1007/978-3-032-19536-4_6
QAFE2: Quantum accelerated multiscale finite element analysis
Wang, Y., Ortiz, M., & Cirak, F. (2026) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2026.119204
Quantum Polynomial-Time Key-Recovery Attacks on Generalized TWINE and LBlock
Lu, H., Yu, Q., Li, B. Q., et al. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-31130-6_5
A Study of PQC Migration Frameworks
Nzetchuen, E., Stöttinger, M., Wiesmaier, A., & Yeşilbek, E. (2026) · Communications in computer and information science · doi:10.1007/978-3-032-28946-9_4 · Cited by 1
Quantum-accelerated shortest path search on a graph in unsorted space
Хури, П. М., Клишева, А. Д., Demchenko, P., et al. (2026) · Scientific and technical journal of information technologies mechanics and optics · doi:10.17586/2226-1494-2026-26-3-652-661
Evolving Hardware-Efficient Grover Circuits with Grammatical Evolution
Obidiegwu, A., Dias, D. M., Obidiegwu, E., & Ryan, C. (2026) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/3795095.3805176
Stabilizing Grover Search via Density-Aware Phase Control
Faro, S., Rosa, G. L., & Pavone, A. (2026) · ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) · doi:10.1145/3806645.3816163
Quantum LCS in Practice: Circuits, Optimizations, and Evaluation
Cantone, R., Falci, G., Faro, S., Giannelli, L., Pavone, A., Trovato, D., & Viola, C. (2026) · ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) · doi:10.1145/3806645.3816161
The Energy Cost of Post-Quantum Transition: Benchmarking PQC Algorithms on Commodity Hardware
Jindal, K., Judd, T. E., & Uludag, S. (2026) · ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) · doi:10.1145/3806645.3816159
Quantum Bit-Parallel Swap Matching
Faro, S., Marino, F. P., Pavone, A., Spina, S., & Viola, C. (2026) · ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) · doi:10.1145/3806645.3816165
Delta-Based Rare Pattern Discovery with Quantum Speedup
Faro, S., Farsian, F., Marino, F. P., et al. (2026) · ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) · doi:10.1145/3806645.3816160
Structural Parallelism in Quantum Programs
Faro, S., Marino, F. P., & Messina, G. (2026) · ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) · doi:10.1145/3806645.3816162
Post-quantum multivariate signature scheme QR-UOV: Security, parameters, and implementations
Furue, H., Ikematsu, Y., Hoshino, F., et al. (2026) · Japan Journal of Industrial and Applied Mathematics · doi:10.1007/s13160-026-00809-7
Efficient and Secure Lattice-Based Unique Ring Signature with Applications in IoT
Pareek, V., Biswas, C., Agarwal, H., et al. (2026) · The Journal of Supercomputing · doi:10.1007/s11227-026-08700-5
Accelerated Quantum Algorithm Prototyping: Modular Simulation and Noise Modelling with CUDA Support
Marevac, E., Kadušić, E., Zivic, N. S., et al. (2026) · Journal of Advances in Information Technology · doi:10.12720/jait.17.6.1188-1210
Quantum-Safe Lattice-Based Authentication and Key Agreement Protocol for Internet of Things
Bera, B., Parameswarath, R. P., & Sikdar, B. (2026) · International Conference on Communications · doi:10.1109/icc59461.2026.11588078
Security Evaluations of Post-Quantum Cryptographic Primitives Against Quantum and AI-Based Attacks
Zeydan, E., Aydeger, A., Yadav, A. K., & Liyanage, M. (2026) · International Conference on Communications · doi:10.1109/icc59461.2026.11587016
Geng, Y., Fu, H., Chen, H., et al. (2026) · Digest of papers - IEEE Radio Frequency Integrated Circuits Symposium · doi:10.1109/rfic70222.2026.11602232
A Novel PQC-Based Image Encryption Scheme Using Seismic Wave Permutation
İnce, C. (2026) · Entropy · doi:10.3390/e28070800
One Approach on Improved Communication Secrecy
Tikhonyuk, A. I., Portnoy, S. L., & Zyablov, V. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-23537-4_33
Iavich, M., Lopata, A., & Bagalishvili, N. (2026) · Mathematics · doi:10.3390/math14142555
Prawira, R. I., & Mantoro, T. (2026) · International Conference on Frontiers of Engineering and Emerging Technologies (FET) · doi:10.1109/fet68771.2026.11601614
Ar-Nur, S. A., & Mantoro, T. (2026) · International Conference on Frontiers of Engineering and Emerging Technologies (FET) · doi:10.1109/fet68771.2026.11601850
Optimizing multiple-control Toffoli quantum circuit design with constraint programming
Jung, J., Dalmeijer, K., & Hentenryck, P. V. (2026) · Constraints · doi:10.1007/s10601-026-09399-0
A Practical Tutorial on Implementing Shor’s Algorithm
Deligiannidis, L. (2026) · Communications in computer and information science · doi:10.1007/978-3-032-22193-3_13
A Comparative Analysis of Grover's Algorithm with Classical Algorithms
Jingle, I. D. J., & Pereira, S. A. (2026) · Lecture notes in networks and systems · doi:10.1007/978-981-95-3163-9_27
AI-Empowered Quantum Circuit Synthesis and Compilation Optimization: Overview and Prospects
Yan, G., Wu, W., Chen, Y., Pan, K., Lü, X., Zh, Z., Wang, Y., Wang, R. L., & Yan, J. (2026) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2026.3715237 · Cited by 90
Efficient parallel compilation and profiling of quantum circuits at large scales
Moore, J., Hart, M., & McAllister, J. (2026) · npj Unconventional Computing · doi:10.1038/s44335-026-00079-z
Quantum Artificial Intelligence Architectures and Applications
Yıldırım, R., & Demirci, F. S. (2026) · International Symposium on AI-Driven Engineering Systems (ISADES) · doi:10.1109/isades69945.2026.11608200
Protecting Quantum Circuits Through Compiler-Resistant Obfuscation
Parayil, P., Raj, A., & Balachandran, V. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-32560-0_7
28-nm Cryo-CMOS Mixer-First Reflectometer for the FDM Readout of Transmon Qubits
Geng, Y., Xu, Z., Dong, T., Chen, Y., Wang, W., Yang, Y., Sun, Z., Wu, R., Lin, H., Deng, M., et al. (2026) · IEEE Transactions on Microwave Theory and Techniques · doi:10.1109/tmtt.2026.3712115 · Cited by 1
Singh, N. P., Omana, J., & Nair, S. G. S. (2026) · Frontiers in Artificial Intelligence · doi:10.3389/frai.2026.1836641
Research and Implementation of an Image Search Method Based on Grover's Algorithm
Yang, H., & Guo, X. (2025) · Asia Conference on Cognitive Engineering and Intelligent Interaction (CEII) · doi:10.1109/ceii67787.2025.00074
Visualizing Quantum Algorithms in NISQ Era: A Full Stack Platform
Lakshmi, G., Varma, D. R., Sai, B. N., Lokesh, D., & Reddy, B. (2026) · 2026 International Conference on Cognitive Computing and Networking Systems (ICC-CNS) · doi:10.1109/icc-cns70518.2026.11606114
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
