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,001–8,100 of 8,792
Du, Y., Wang, X., Guo, N., Yu, Z., Qian, Y., Zhang, K., Hsieh, M.-H., Rebentrost, P., & Tao, D. (2025) · Springer eBooks · doi:10.1007/978-981-95-1284-3_2
Du, Y., Wang, X., Guo, N., Yu, Z., Qian, Y., Zhang, K., Hsieh, M.-H., Rebentrost, P., & Tao, D. (2025) · Springer eBooks · doi:10.1007/978-981-95-1284-3_1
Du, Y., Wang, X., Guo, N., Yu, Z., Qian, Y., Zhang, K., Hsieh, M.-H., Rebentrost, P., & Tao, D. (2025) · Springer eBooks · doi:10.1007/978-981-95-1284-3_4
Quantum algorithm for metabolic network analysis
Joshi, A., & Koyama, T. (2026) · Machine Learning with Applications · doi:10.1016/j.mlwa.2026.100913
Group Key Establishment in the Post-quantum Setting: Constructions and Research Avenues
Vasco, M. I. G., & Steinwandt, R. (2025) · Association for Women in Mathematics series · doi:10.1007/978-3-031-93669-2_11
The implications of quantum computing in real world scenarios
Pokhriyal, S., Pokhriyal, T., & Rawal, D. N. (2025) · AIP conference proceedings · doi:10.1063/5.0294579
A Complex-Based Rethinking of Communications
Scatà, M. (2025) · Studies in systems, decision and control · doi:10.1007/978-3-032-04243-9_3 · Cited by 1
Junagade, N., Bhandari, S. U., & Patil, R. Y. (2025) · Lecture notes in networks and systems · doi:10.1007/978-981-96-8901-9_8
Šekrst, K. (2025) · Springer eBooks · doi:10.1007/978-3-032-05562-0_15
Studies of quantum combinatorial optimization algorithms: <?A3B2 pi6?>a review
Li, Z., Wu, Y., Zhang, R., Wen, J., Wang, T., & Wang, C. (2025) · Chinese Science Bulletin (Chinese Version) · doi:10.1360/csb-2025-5565
Smart Vault Security in Banks: A Quantum AI-Enabled Intrusion Detection System
Kar, A., Roy, S., Paul, T., Nessa, M., Dutta, P., Das, A., & Mahala, S. (2025) · International Conference on Engineering Innovations and Technologies (ICoEIT) · doi:10.1109/icoeit63558.2025.11211817
Construction and optimization of quantum modular exponentiation circuits based on the V gate
Zhang, X., Rong, X., & Li, Z. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04968-3
SYMMETRIC ENCRYPTION FROM CYCLIC CODES OVER NON-CHAIN RINGS
DERTLI, R., & Eren, Ş. (2025) · Journal of Science and Arts · doi:10.46939/j.sci.arts-25.3-a08
Quantum algorithm for solving nonlinear algebraic equations
Nghiem, N. A., & Wei, T.-C. (2025) · Physical Review Applied · doi:10.1103/c4l1-9782
Kim, J., & Chung, D. (2026) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2025.3626768 · Cited by 1
Software Implementation of Hybrid QKD Protocol for Multi-User Networks
Begimbayeva, Y., Zhaxalykov, T., Makarov, M., et al. (2025) · doi:10.1109/opcs67346.2025.11219391
Singh, S., Kaur, A., Kumar, Y., et al. (2025) · Studies in systems, decision and control · doi:10.1007/978-3-031-89771-9_116
An Evaluation of Post-Quantum Cryptographic Algorithms in IoT-Blockchain Systems
Takenouchi, R., Kurisaka, H., Su, Y., Nguyen, K. T., & Sekiya, H. (2025) · International Conference on Mobile Computing and Ubiquitous Network (ICMU) · doi:10.23919/icmu65253.2025.11219152 · Cited by 1
Improved update rule for probabilistic computers
Rockovich, A., Lafyatis, G. P., & Gauthier, D. J. (2025) · Physical Review Applied · doi:10.1103/t1wc-j7yp
Post-quantum secure authentication protocol based on OTP and TEE
Kasse, M. C., & Mboup, E. H. M. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-025-08029-5
An Efficient Mapping Framework for 2D Quantum Architecture
Chen, J., Li, C., & Tsang, K. F. (2025) · Communications in computer and information science · doi:10.1007/978-981-95-3736-5_2
Tarannum, D., Syed, M. A., Biswas, B. K., & Chowdhury, M. R. (2025) · APL Quantum · doi:10.1063/5.0281728 · Cited by 1
Ulutas, E., & Çeliktaş, B. (2025) · Black Sea Journal of Engineering and Science · doi:10.34248/bsengineering.1670109
Quantum Round Key Recovery Attack on Extended Generalized Feistel Network
Dyhas, B., & Fesenko, A. (2024) · IEEE International Conference on Advanced Trends in Information Theory (ATIT) · doi:10.1109/atit64324.2024.11222453
Amplitude Amplification and Estimation
Raisuddin, O. M., & De, S. (2025) · Springer eBooks · doi:10.1007/978-3-032-03325-3_24
Pareek, N., & Saini, N. (2025) · IGI Global eBooks · doi:10.4018/979-8-3373-3326-7.ch007
Post-Quantum Cryptography: Number Theoretic Foundations and Future-Proof Protocols
Mpofu, K. T., & Mthunzi-Kufa, P. T. (2025) · IntechOpen eBooks · doi:10.5772/intechopen.1012847
Novel Quantum Approaches to Hyperdimensional Computing for Neural Networks
Lavagna, L., Ceschini, A., Rosato, A., et al. (2025) · doi:10.1109/ijcnn64981.2025.11229083
Mori, Y., Hakoshima, H., & Fujii, K. (2026) · PRX Quantum · doi:10.1103/qw5z-3bwz · Cited by 2
The Theoretical Rationale for Using Quantum Computers to Crack Cryptosystems
Andrusenko, Y., Lukyanov, D., Dmitrienko, A., Kushchenko, A. A., & Fedash, D. (2025) · Lecture notes in networks and systems · doi:10.1007/978-3-032-07275-7_4
An Outlook to Quantum Gate Computing
Bauckhage, C., & Sifa, R. (2025) · Cognitive technologies · doi:10.1007/978-3-031-99402-9_13
Bauckhage, C., & Sifa, R. (2025) · Cognitive technologies · doi:10.1007/978-3-031-99402-9_1
SYMBOLIC MODELING OF THE QUANTUM GROVER SEARCH ALGORITHM ON TWO QUBITS: QUIRK + MAPLE
Chuiko, G. P. (2025) · Komp'ûternì sistemi ta merežì · doi:10.23939/csn2025.02.235
Quantum algorithm for binary vector encoding and retrieval utilizing the permutation trick
Wichert, A. (2026) · Quantum Machine Intelligence · doi:10.1007/s42484-026-00454-w
Steane and Iceberg Code Implementations on Toffoli Gates
Riffel, C., Robertson, R., Slodov, M., & Hendrickson, P. (2025) · IEEE National Aerospace and Electronics Conference (NAECON) · doi:10.1109/naecon65708.2025.11235387 · Cited by 1
Giri, U., & Amsaad, F. (2025) · IEEE National Aerospace and Electronics Conference (NAECON) · doi:10.1109/naecon65708.2025.11235372
Li, L., Cao, M., Li, Y., et al. (2025) · Chinese Science Bulletin (Chinese Version) · doi:10.1360/csb-2025-5418
CNOT Oriented Synthesis for Small-Scale Boolean Functions Using Spatial Structures of Parallelotopes
Zheng, Q., Xu, Y., Zhang, J., Su, Z., & Zheng, S. (2025) · doi:10.1109/iccad66269.2025.11240690
Circuit Folding: Scalable and Graph-Based Circuit Cutting via Modular Structure Exploitation
Kan, S., Li, Y., Wang, H., et al. (2025) · doi:10.1109/iccad66269.2025.11240933
Zhao, Y., Li, K., Guo, Z., & Zhang, J. (2025) · doi:10.1109/iccad66269.2025.11240780
Gaussian continuous-variable quantum neural networks for MedMNIST classification
Lopez, D. A., Montiel, O., Castillo, O., & Lopez-Montiel, M. A. (2026) · Physica Scripta · doi:10.1088/1402-4896/ae7bd1 · Cited by 1
Van, N. N., Vu, M. T., Thi, H. T., Ngo, N. H., Vu, B. L., & Nguyen, V. D. (2025) · International Conference on Cryptography and Information Security (VCRIS) · doi:10.1109/vcris68011.2025.11250564
Rani, M., Dutta, S., & Banerjee, S. (2025) · Annalen der Physik · doi:10.1002/andp.202500310
Shiba, R., & Iwata, T. (2025) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3719027.3760732
PQ-STAR Post-quantum Stateless Auditable Rekeying
Dolev, S., Yagudaev, A., & Yung, M. M. (2025) · Lecture notes in computer science · doi:10.1007/978-3-032-10759-6_26
Influence of Scalable Quantum Cryptography in Cybersecure Space
Rajput, U., Srivastava, H., Tripathy, H. K., et al. (2025) · Lecture notes in networks and systems · doi:10.1007/978-981-96-8043-6_39
Multi-Objective Quantum Power System Redispatch
Lee, L. K., Gerlach, T., Knaute, J., Gerhardt, F., Völker, P., Maras, T., Dotterweich, A., & Piatkowski, N. (2025) · IEEE International Conference on Data Science and Advanced Analytics (DSAA) · doi:10.1109/dsaa65442.2025.11247977
Isotropic Bonding and Quantum Entanglement
O’Hara, P. (2025) · IntechOpen eBooks · doi:10.5772/intechopen.1013656
Miki, G., & 都倉, 康. (2026) · Physical Review A · doi:10.1103/vv11-n11b
Peleshenko, T. A., Fedash, D., & Gish, A. (2025) · IGI Global eBooks · doi:10.4018/979-8-3373-2240-7.ch003
A Hybrid Quantum-Classical Approach for Dynamic Fleet Logistics of Urban Hydrogen Buses
Aguayo, M., Soto, I., Seguel, S., et al. (2025) · doi:10.1109/sacvlc67412.2025.11261953
Xue, P. (2025) · Elsevier eBooks · doi:10.1016/b978-0-443-33965-3.00003-1
Extending Qutes: a practical high-level language for quantum computing
Faro, S., Marino, F. P., & Messina, G. (2025) · The Computer Journal · doi:10.1093/comjnl/bxaf133
Dynamic Spectrum Allocation Using Quantum Annealing Considering Burstiness of Traffic
Kurebayashi, Y., Inoue, S., Yamashita, Y., Kawakita, Y., & Tobe, Y. (2025) · IEEJ Transactions on Electronics Information and Systems · doi:10.1541/ieejeiss.145.1069
Advances in Medical Image Classification Using Quantum Machine Learning: A Survey
Anisurrahman, Alam, B., & Hamid, M. (2025) · Lecture notes in networks and systems · doi:10.1007/978-981-95-0681-1_16
QUARTET : Quantum Utilization and Adaptation via Resource-Tuned Execution Techniques
Choudhury, N., Bhave, A., & Basu, K. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00082
Optimal Qubit Reuse for Quantum Computation with Gate Reordering and Eager Measurement
Yu, W., Chen, T.-F., Chan, Y., Jiang, J.-H. R., Chiou, D.-W., & Chang, Y. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00067
An Efficient Algorithm for Extending Uniform Superposition States for Time-Series Data
Rieger, C., Grossi, M., Guerreschi, G. G., Vallecorsa, S., & Werner, M. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00037
Bedford, Q., & Shukla, S. K. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.20529
Towards Hybrid Spatial Structure Rendering Models Using Quantum Orthographic Ray Casting
Zhang, Z. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00261
Qubit-Width-Aware Grover Adaptive Search for Combinatorial Optimization Problems
Moriya, T., Tawada, M., & Togawa, N. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.10409
A Modular ATCA-Based Approach Towards Scalable Multi-Qubit Systems
Scheller, L., Fuchs, M., Gartmann, R., et al. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00153
Clique Detection Using Symmetry-Restricted Quantum Circuits
Mansky, M. B., Rohe, T., Stein, J., Bondarenko, D., Menzel, L., & Linnhoff–Popien, C. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.10301
Optimizing Compilation for Distributed Quantum Computing via Clustering and Annealing
Zhou, R., Cheng, J., Gan, Y., Liu, J., & Qian, C. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00146
Introducing the Quantum Economic Advantage Online Calculator
Mejia, F., Gundlach, H., Lynch, J., Dukatz, C., Lucas, A., Crane, E., Shukla, P., & Thompson, N. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00205
Distinguishing Quantum Software Bugs from Hardware Noise: A Statistical Approach
Virani, A., Devraj, Suresh, A., et al. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00096
Practical Scalability of LuGo: Benchmarking the HHL Algorithm Using an Enhanced QPE Algorithm
Lu, C., Meena, M. G., Georgiadou, A., Gottiparthi, K. C., Sandoval, M., Pérez, E. A. C., Lin, P. T., Suh, I., Kim, S., & Baroni, A. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00029
Towards Efficient Verification of Computation in Quantum Devices
Li, K., Yan, P., Jiang, H., & Yu, N. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00147
Twiddle: Twirling and Dynamical Decoupling, and Crosstalk Noise Modeling
Safi, H., Niedermeier, C. A., & Mauerer, W. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.10313
Hunt, E., Nguyen, H., Tukkugudam, D. S., Horton, D., & Nguyen, T. N. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00036
A Good First Impression for Quantum Algorithms
Shukla, S. K. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.20535
Grover's Algorithm for Image Edge Detection
Giri, P. R., & Saito, K. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.10405
Qwerty: A Basis-Oriented Quantum Programming Language
Adams, A. J., Khan, S., Bhamra, A. S., Abusaada, R. R., Humble, T. S., Young, J., & Conte, T. M. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00093
QIRopt: An Optimization Method for Quantum Intermediate Representation
Luo, J.-J., Zhang, H.-Y., & Zhao, J.-J. (2025) · International Conference on Quantum Computing and Engineering · doi:10.1109/qce65121.2025.00058
Enhancing the Clique Local Decoder to Correct Length-2 Space Errors in the Surface Code
Jia, Z., Veerapaneni, S., & Ravi, G. S. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00072
Seedless Condensers for Efficiently Samplable Sources
Freitag, C., Silbak, J., & Wichs, D. (2025) · Lecture notes in computer science · doi:10.1007/978-3-032-12293-3_2
Dautel, C. A., Lehmann, M., & Isidory, E. (2025) · IEEE/AIAA Digital Avionics Systems Conference (DASC) · doi:10.1109/dasc66011.2025.11257367
Quantum Key Distribution and Applications
Mohan, P. V. A. (2025) · IETE Journal of Education · doi:10.1080/09747338.2025.2595014
Quantum Computing Threats to Management and Operational Safeguards of IEC 62351
Goncalves, B., Mahari, A., Mashatan, A., et al. (2025) · International Conference on Privacy, Security and Trust (PST) · doi:10.1109/pst65910.2025.11268843
A Review of Quantum Supremacy in QUBO-Based Applications
Ryou, A., Kim, K., & Jun, K. (2025) · doi:10.1109/icce-asia67487.2025.11263592
Almost Optimal Synthesis of Reversible Function in Qudit Model
Xu, B., Nie, J., & Sun, X. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3640111
Quantum-Enhanced Zero-Knowledge Proofs for zk Rollup Security in Web3 Ecosystem
Yadav, N., & Indra, G. (2025) · doi:10.1109/cises66934.2025.11265658
Digitally controlled conveyor-belt spin shuttling in silicon for large-scale quantum computation
Nagai, R., Takemoto, T., Wachi, Y., & Mizuno, H. (2025) · Physical Review Applied · doi:10.1103/ng22-2cgg · Cited by 7
Quantum Circuit Synthesis for AES with Low DW-cost
Liao, H., & Luo, Q.-B. (2025) · IACR Cryptology ePrint Archive · doi:10.1007/978-981-95-5096-8_15 · Cited by 2
On Quantum Query Complexities of Collision-Finding in Non-uniform Random Functions
Peng, T., Cao, S., & Xue, R. (2025) · Lecture notes in computer science · doi:10.1007/978-981-95-5125-5_7
Hybrid-Query Bounds with Partial Input Control Framework and Application to Tight M-eTCR
Hülsing, A., Kudinov, M., & Majenz, C. (2025) · Lecture notes in computer science · doi:10.1007/978-981-95-5125-5_9
Optimal Transfer of Entanglement in Oscillator Chains in Non-Markovian Open Systems
Luo, D.-W., Yu, E. T., & Yu, T. (2025) · Entropy · doi:10.3390/e27121239
Post-Quantum Digital Signatures over Finite Fields with Hidden Generators
Kim, T. N., Dung, L. H., Tho, H. D., et al. (2025) · Engineering Technology & Applied Science Research · doi:10.48084/etasr.13269
General Distributed Quantum Key Recovery Attack on Permutation‐Based Block Ciphers
Shang, T., Zhang, K., Zhang, Y., et al. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202500508
Wen, Z., Chen, J., Lu, Y., et al. (2025) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2025.3642559
Symmetry operations and critical behavior in classical to quantum stochastic processes
Cabrera, G. M., Biswas, S., & Gorin, T. (2025) · Physical review. E · doi:10.1103/sxv8-vv6r
Cryptanalysis of a LINE cryptosystem
Khalimov, G., Kotukh, Y. V., Khalimova, S., Korobchynskyi, M., Podlipaiev, V., & Зайцев, О. (2025) · International Conference on Electrical, Computer, Communications and Mechatronics Engineering (ICECCME) · doi:10.1109/iceccme64568.2025.11277439 · Cited by 2
Hash Tables as Engines of Randomness at the Limits of Computation: A Unified Review of Algorithms
Gagniuc, P. A., & Togan, M. (2025) · Algorithms · doi:10.3390/a18120804
Khudaybergenov, T. A., Рустамович, Х. Т., Sabirov, B. I., et al. (2025) · doi:10.1109/apeie66761.2025.11289437
Post-Quantum Secure Digital Signature Scheme Based on Non-Commutative Matrix Algebra
Juraev, G., Mavlonov, A. B., Muminov, S., et al. (2025) · doi:10.1109/apeie66761.2025.11289289
Quantum Computing and Quantum Sensing: A Pedagogical Introduction to Emerging Quantum Technologies
Ling, A., & Pandya, N. (2025) · Journal of Applied Mathematics and Physics · doi:10.4236/jamp.2025.1312239
An Improved Quantum Search Algorithm
Mitra, A. (2025) · Journal of Quantum Information Science · doi:10.4236/jqis.2025.154012
Algorithmes coniques pour la minimisation quasiconcave
Meyer, C. (1996) · PolyPublie (École Polytechnique de Montréal)
Local techniques in quadratic optimization and Satisfiability, and their applications
Wang, C. (2014) · Summit (Simon Fraser University)
Complexité de la communication sur un canal avec délai
Lapointe, R. (2014) · doi:10.71781/9963
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
