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 7,801–7,900 of 8,792
A Simplified Quantum Approach Using Grover's Algorithm for Solving the Vertex Cover Problem
Cherif, M. Y., Chaari, W. L., & Driss, O. B. (2024) · IEEE/ACS International Conference on Computer Systems and Applications (AICCSA) · doi:10.1109/aiccsa63423.2024.10912613 · Cited by 1
Zhang, J., Che, X., Jin, S., et al. (2025) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp49660.2025.10889351
How AI Empowers Quantum Computing
Subbaiah, S., & Kavitha, M. (2025) · doi:10.1002/9781394242399.ch5
Introduction to Quantum Computing
Vinoj, J., Swathika, R., Gavaskar, S., & Manikandan, K. B. (2025) · Wiley eBooks · doi:10.1002/9781394242399.ch0
Quantum Computing's Implications for Cybersecurity
Gowri, K., Jawahar, S., Kavitha, V., et al. (2025) · doi:10.1002/9781394242399.ch15
Singh, A. P. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5172592
Prospect of Future Computing Era Using Quantum ComputingPreprint
Singh, A. P. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5171765
Perugini, L., Pino, A., Solavagione, A., et al. (2025) · Engineering cyber-physical systems and critical infrastructures · doi:10.1007/978-3-031-83149-2_5
Optimized quantum implementations of SM3 with low T-depth and low width
TingYu, Y., Zhang, S., Xiang, Z., Lin, D., & YunYu, G. (2025) · Zhongguo kexue. Wulixue Lixue Tianwenxue · doi:10.1360/sspma-2025-0077
Research on Drone Network Security Issues under Quantum Attack Threats
Xia, T., Wang, M., He, J., Guo, H., Qu, Z., & Yuan, J. (2024) · International Conference on Communication Technology and Information Technology (ICCTIT) · doi:10.1109/icctit64404.2024.10928461
Multi-Armed Bandits and Quantum Channel Oracles
Buchholz, S., Kübler, J. M., & Schölkopf, B. (2025) · Quantum · doi:10.22331/q-2025-03-25-1672 · Cited by 4
On the Simulation and Verification of Noisy Quantum Circuits
Tani, S. (2025) · Springer eBooks · doi:10.1007/978-981-96-0668-9_18
A Novel Approach for Quantum Simulation Software Framework
Jin, K., On, J., & Cha, G. (2025) · International Conference on Consumer Electronics · doi:10.1109/icce63647.2025.10930073
Fang, X.-Q., & Shi, R. (2025) · Physica Scripta · doi:10.1088/1402-4896/adc640
Flow-Model Capacity for Large Scale Quantum Complex Networks
Quintas, R., & Coutinho, B. C. (2025) · Studies in computational intelligence · doi:10.1007/978-3-031-82435-7_34
Optimizing Depth of Quantum Circuit for Generating GHZ States
Venkannagari, N. R., Puram, V., & Thomas, J. P. (2025) · Communications in computer and information science · doi:10.1007/978-3-031-85884-0_8
Robust implementation of discrete-time quantum walks in any finite-dimensional quantum system
Nandi, B., Singha, S., Datta, A., Saha, A., & Chakrabarti, A. (2025) · Modern Physics Letters A · doi:10.1142/s021773232550035x · Cited by 1
Herausforderungen der Post-Quanten-Kryptographie
Kempka, C. (2025) · Datenschutz und Datensicherheit - DuD · doi:10.1007/s11623-025-2062-y
QCG-QuantumLauncher: A Modular Tool for Quantum Scenarios
Pecyna, T., Siera, D., & Bosak, B. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-85700-3_26
Authenticated Multiparty Secret Key Sharing Using Quantum Entanglement Swapping
Alshowkan, M., & Elleithy, K. M. (2025) · doi:10.18260/1-2-1153-53875
Faster Quantum Algorithms for MQ2 and Applications
Edme, Q., Fouque, P.-A., & Schrottenloher, A. (2025) · IACR Communications in Cryptology · doi:10.62056/anjbksuc2
Barber: Balancing Thermal Relaxation Deviations of NISQ Programs by Exploiting Bit-Inverted Circuits
Jang, E., Choi, S., Kim, Y., et al. (2024) · doi:10.1145/3676536.3676689
Hybrid Classical-Quantum Neural Network for n-Dimensional Embedding
Das, A., & Mukherjee, S. (2024) · International Conference on Intelligent Systems and Embedded Design (ISED) · doi:10.1109/ised63599.2024.10957130
Enhancing Machine Learning with Quantum Methods
Hickmann, M. L., Lange, M., & Rieser, H.-M. (2025) · European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning (ESANN) · doi:10.14428/esann/2025.es2025-29
Rethinking Security: Cryptography in the Age of Quantum ComputingPreprint
Fajinmi, J. O. (2025) · doi:10.22541/au.174492500.06660684/v1
A Review of Quantum Attention MechanismsPreprint
Zhao, R.-X., Lu, Y., Shi, J., et al. (2025) · doi:10.36227/techrxiv.174494983.39165941/v1
Quantum Computing: Redefining Computational Limits for the Next Era
Sarpeshkar, R., & Kurtz, T. E. (2025) · International Journal of Innovative Computer Science and IT Research · doi:10.63665/ijicsitr.v1i01.02
Walia, G. S., Saranya, R., Maheswari, S. U., et al. (2024) · doi:10.1109/emergin63207.2024.10961439
Evaluating the Impact of Single Event Effect Duration on Quantum Circuits
Pesegoginski, M., Gobatto, L. R., Kastensmidt, F. L., & Azambuja, J. R. (2025) · IEEE Latin American Symposium on Circuits and Systems (LASCAS) · doi:10.1109/lascas64004.2025.10966317
Runtime–Coherence Tradeoffs for Hybrid Satisfiability Solvers
Eshaghian, V., Wilkening, S., Åberg, J., et al. (2025) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2025.3563805
Quantum Computing: Foundations, Opportunities, Challenges, and Applications in Healthcare
Glauner, P. (2025) · Future of business and finance · doi:10.1007/978-3-031-78322-7_1
Dang, V. T., & Volkov, A. (2024) · Telecom IT · doi:10.31854/2307-1303-2024-12-3-29-51
Information leakage resistant quantum dialogue based on Grover’s quantum searching
Chen, Q., Li, X., & Ye, T.-Y. (2025) · Laser Physics Letters · doi:10.1088/1612-202x/adcde8
Quantum Chosen-Cipher Attack on Camellia
Li, Y., Wang, Q., Huang, D., et al. (2025) · Mathematics · doi:10.3390/math13091383
Roshani, N., Stein, J., Zorn, M., Kölle, M., Altmann, P. J., & Linnhoff–Popien, C. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-87327-0_12
Quantum Transfer Learning: The Impact of Classical Preprocessing
Kölle, M., Maurer, J., Altmann, P. J., Sünkel, L., Stein, J., Hager, J., Zielinski, S., & Linnhoff–Popien, C. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-87327-0_18 · Cited by 3
Refinement Orders for Quantum Programs
Feng, Y., & Zhou, L. (2026) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3843234
Haque, M. E., Tohidi, F., & Ulhaq, A. (2025) · IGI Global eBooks · doi:10.4018/979-8-3373-0020-7.ch009
Quantum Resonators Circuit for EEG Signals Pattern Matching
Biswas, H. (2025) · INTERANTIONAL JOURNAL OF SCIENTIFIC RESEARCH IN ENGINEERING AND MANAGEMENT · doi:10.55041/ijsrem46528
Securing the Digital Frontier: Transitioning from Pre-quantum to Post-quantum Internet Security
Singh, S. D., Mathur, T., Verma, V., et al. (2025) · Lecture notes in networks and systems · doi:10.1007/978-981-97-8591-9_41
Digital quantum simulation of reaction–diffusion systems on lattice
Yao, L. H. (2025) · The European Physical Journal B · doi:10.1140/epjb/s10051-025-00930-5
Amarasinghege, T. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5203410
Investigating the Impact of Quantum Computing on Existing Encryption Methods
Sharma, N. K. (2025) · Journal of Information Systems Engineering & Management · doi:10.52783/jisem.v10i41s.8035
Genetic Engineering with Quantum Circuits: creating codes and studying BioBloQu genetic elementsPreprint
Pascoal, P. V., Bambil, D. R., Lima, R. N., de Oliveira, M. A., de Tacca, L. A., Vainstein, M. H., & Rech, E. L. (2025) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2025.05.02.651535
Potential and Limitations of Quantum-Computer-Based Seismic Survey Data Preprocessing Techniques
Lee, J., & Cho, Y. (2025) · Journal of the Korean Society of Mineral and Energy Resources Engineers · doi:10.32390/ksmer.2025.62.2.169
A Comprehensive Analysis of Grover's Search Quantum Algorithm in Qiskit Simulator
Barthwal, V., Thakur, A. R., & Rana, P. (2025) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-3373-0462-5.ch015
Quantum E-voting System Using QKD and Enhanced Quantum Oracles
Landers, V. S. (2025) · Advanced sciences and technologies for security applications · doi:10.1007/978-3-031-82031-1_4
Quantum Binary Neural Networks for Reinforcement Learning
Haverly, A., Rahimi, S., & Novotny, M. A. (2025) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc64685.2025.00118
Tensor-Based Binary Graph Encoding for Variational Quantum Classifiers
An, S., & Slavakis, K. (2025) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc64685.2025.00095
QuCloudSim: A Customizable Discrete Event Simulator for Quantum Cloud Computing Enviroment
Zhou, R., Gan, Y., Shen, L., et al. (2025) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc64685.2025.00018
Hybrid Quantum Algorithms for N-Body Simulations
Rajasekaran, S., Agrawal, P., Lagasse, R., et al. (2025) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc64685.2025.00078
Towards Classical Software Verification using Quantum Computers
Issel, S., Tscharke, K., & Debus, P. (2025) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc64685.2025.00099
Enumerating security analysis of NTRU cryptosystem
Pandey, G., & Gupta, I. (2025) · Cryptologia · doi:10.1080/01611194.2025.2463932
Black Hole as an Information Mirror
Wang, X. (2025) · IntechOpen eBooks · doi:10.5772/intechopen.1009847 · Cited by 1
Quantum Computation: A Brief Overview
Huang, H. (2025) · Theoretical and Natural Science · doi:10.54254/2753-8818/2025.23145
Fu, X.-Q., Tian, T.-C., 李, H.-W. 宏. L., 史, J.-H. 建. S., 杨, X.-L. 晓. Y., Li, T., & Bao, W. (2025) · Chinese Physics B · doi:10.1088/1674-1056/addcc2
Circuit Width Estimation via Effect Typing and Linear Dependency
Colledan, A., Lago, U. D., & Vazou, N. (2025) · ACM Transactions on Programming Languages and Systems · doi:10.1145/3737282
Preventing collusion in secure computation with preprocessing via function secret sharing
Heydari, G., Mahdavi, M., & Mala, H. (2025) · Expert Systems with Applications · doi:10.1016/j.eswa.2025.128285
Li, G., Wang, S., Ni, X., et al. (2025) · Physics Letters A · doi:10.1016/j.physleta.2025.130690
DONG, 董. Y., YANG, 杨. F., WANG, 王. C., et al. (2025) · Acta Sinica Quantum Optica · doi:10.3788/jqo20253101.0301
Quantum Optimization for Enhanced Combinatorial Algorithms
Pandey, P. K., Chaturvedi, R., & Dangi, S. B. (2025) · The Nucleus · doi:10.71330/thenucleus.2025.1453
Melo, G. R., & Cardoso, W. R. (2025) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-025-06444-4
From Theory to Reality: Tracing the Milestones of Quantum Information Systems
Miah, M. S. U., Islam, S. S., & Bhowmik, A. (2024) · International Conference on Computing Advancements (ICCA) · doi:10.1145/3723178.3723269 · Cited by 1
Molecular topological quantum computer
Sheu, S., Hsu, H.-Y., Yang, T.-H., Deng, J.-P., & Yang, D. (2025) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-025-00375-w · Cited by 1
Shi, T., Wu, W., Ding, L., Wang, S., Zhang, M., Hu, B., & Guan, J. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04781-y · Cited by 1
Raj, G. K. R. G. K. (2025) · Journal of Software Engineering and Simulation · doi:10.35629/3795-11051521
QUANTUM COMPUTING AND CLOUD SECURITY: FUTURE-PROOFING HEALTHCARE DATA PROTECTION
Gundaboina, A. K. (2022) · INTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND INFORMATION TECHNOLOGY · doi:10.34218/ijrcait_05_01_005
Preparation of digital-encoded and analog-encoded quantum states corresponding to matrix operations
Gao, K., Yang, Y., & Du, Z. (2025) · Chinese Physics B · doi:10.1088/1674-1056/ade3ad
Xu, K., Li, Z., Liu, X., Li, D., & Wang, Y. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202500125 · Cited by 2
Quantum Circuit for Curve25519 with Fewer Qubits
Song, G., & Seo, H. (2025) · Lecture notes in computer science · doi:10.1007/978-981-96-5566-3_12
Optimizing Ancilla-Based Quantum Circuits with SPARE
Sharma, R., & Achour, S. (2025) · Proceedings of the ACM on Programming Languages · doi:10.1145/3729253
Genetic Algorithm-based QAOA Training improved with Fuzzy Clustering
Acampora, G., Chiatto, A., & Vitiello, A. (2025) · doi:10.1109/mcii64973.2025.11032773
Reducing the Cost of Clifford+T Quantum Gates
Ishioka, T., Lukac, M., & Nagayama, S. (2025) · IEEE International Symposium on Multiple-Valued Logic · doi:10.1109/ismvl64713.2025.00029
Choi, S., Moses, W. S., & Thompson, N. (2025) · Proceedings of the IEEE · doi:10.1109/jproc.2025.3574102
A Summary of the Security of Tweakable Block Ciphers Against Simon's Quantum Algorithm
Ruan, J., Liu, G., Shen, B., et al. (2025) · International Conference on Cloud Computing and Big Data Analytics (ICCCBDA) · doi:10.1109/icccbda64898.2025.11030506
An efficient implementation of a quantum search algorithm for arbitrary $$N$$
Shukla, A., & Vedula, P. (2025) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-025-06518-3
Improved Quantum Query Upper Bounds Based on Classical Decision Trees
Cornelissen, A., Mande, N. S., & Patro, S. (2025) · Quantum · doi:10.22331/q-2025-06-23-1777
An Analysis of Lattice-Based Cryptography with Existing Protocols
Chaturvedi, A., Joshi, A. B., & Yadav, S. (2025) · Algorithms for intelligent systems · doi:10.1007/978-981-96-3256-5_16
Enhanced Quantum Ensemble Classification Algorithm With Shallow Circuit and Parallelism Mechanism
Rathi, N., & Kumar, S. (2025) · Concurrency and Computation Practice and Experience · doi:10.1002/cpe.70166
Relational Database Engines on Quantum Platforms
Haritsa, J. R., & Kesarwani, M. (2024) · doi:10.1145/3703323.3704285
Krishnan, U. (2024) · International Journal of Artificial Intelligence Data Science and Machine Learning · doi:10.63282/3050-9262.ijaidsml-v5i4p101
Quantum Cryptography in the Post-Quantum Era: Threats, Algorithms, and Implementation Challenges
Romano, L. (2024) · International Journal of AI BigData Computational and Management Studies · doi:10.63282/3050-9416.ijaibdcms-v5i2p102
Quantum Computing’s Impact on Banking Encryption: Preparing for Post-Quantum Security
Shivarudraiah, A. (2023) · International Journal of AI BigData Computational and Management Studies · doi:10.63282/3050-9416.ijaibdcms-v4i3p105
Advances in Quantum-Secure Banking: Cryptographic Solutions
Ogundola, T. O. (2020) · International Journal of Science and Research Archive · doi:10.30574/ijsra.2020.1.1.0048
Swiftn: Accelerating Quantum Circuit Simulation Through Tensor Optimization
Kim, S., Kim, C., Sim, A., Wu, K. J., Tang, H., & Kim, S. (2025) · IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid) · doi:10.1109/ccgrid64434.2025.00022
Quantum Machine Learning for Drug Discovery: A Systematic Review
Anisurrahman, Alam, B., & Hamid, M. (2025) · International Journal on Smart & Sustainable Intelligent Computing · doi:10.63503/j.ijssic.2025.158 · Cited by 2
Exploring the Application of Quantum Search Algorithms in Symbolic Computation
Thi, H. L. (2025) · Lecture notes in networks and systems · doi:10.1007/978-981-97-9324-2_13
Dang, L., Lu, D. V., & Bac, N. T. P. (2025) · Lecture notes in networks and systems · doi:10.1007/978-981-97-9324-2_35
Rahmati, M. (2025) · InPrime Indonesian Journal of Pure and Applied Mathematics · doi:10.15408/inprime.v7i1.44960
https://herald-journal.omsu.ru/issues/436/13319.php
Pereguda, & Vakilov, A. N. (2025) · Herald of Omsk University · doi:10.24147/1812-3996.2025.2.12-21
Formal Security Analysis of the Authentication Protocol in Smart Cities Using AVISPA
Park, H., & Park, Y. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-97573-8_1 · Cited by 2
QUDA: quantum distributed adder algorithm
Catrina, S.-A., Guţoiu, R. A., Tănăsescu, A., & Popescu, P. G. (2025) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-025-00387-6
High- and Low-Rank Optimization of SNOVA on ARMv8: From High-Security Applications to IoT Efficiency
Lee, M., Sim, M., Eum, S., et al. (2025) · Electronics · doi:10.3390/electronics14132696
Multi-party quantum secret sharing protocol based on orthogonal product states
Chen, Y., Xuanbing, L., & Li, S. (2025) · Acta Physica Sinica · doi:10.7498/aps.74.20250394
Kim, S., & Shin, D. (2025) · Journal of computational fluids engineering · doi:10.6112/kscfe.2025.30.2.001
Network Vulnerability Analysis via Quantum Computing
Kennedy, A. P., Dinh, T. N., & Thai, M. T. (2024) · doi:10.1109/icmc60390.2024.00024
Towards Quantum Security of Hirose Compression Function and Romulus-H
Zhang, S., Guo, C. F., & Wang, M. (2025) · Lecture notes in computer science · doi:10.1007/978-981-96-9098-5_1
Investigating the Impact of Grover's Algorithm on AES S-Box
Irwan, N. F. I. B. A., Zawawi, M. N. A., & Thabit, R. (2024) · International Conference on Knowledge and Systems Engineering/Proceedings · doi:10.1109/kse63888.2024.11063483 · Cited by 2
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
