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,601–7,700 of 8,792
Ardyani, M. W. (2023) · AIP conference proceedings · doi:10.1063/5.0126247
Quantum Query Lower Bounds for Key Recovery Attacks on the Even-Mansour Cipher
Kawachi, A., & Naito, Y. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-49193-1_1 · Cited by 1
High-Performance Computing: Unleashing the Power of Parallelism and Emerging Trends
(2023) · International Journal of Food and Nutritional Sciences · doi:10.48047/ijfans/v11/iss7/349
A flexible fixed-phase quantum search algorithm for searching unordered databases with any size
Li, P., & Li, Z. (2023) · Journal of Computational Electronics · doi:10.1007/s10825-023-02113-w
Comparison among Classical, Probabilistic and Quantum Algorithms for Hamiltonian Cycle Problem
Corrente, G., Stanzione, C. V., & Stanzione, V. (2023) · Journal of quantum computing · doi:10.32604/jqc.2023.044786
Kombination von Gattern in der DD-basierten Simulation
Zulehner, A., & Wille, R. (2023) · Springer eBooks · doi:10.1007/978-3-031-36751-9_6
Zulehner, A., & Wille, R. (2023) · Springer eBooks · doi:10.1007/978-3-031-36751-9_5
Zulehner, A., & Wille, R. (2023) · Springer eBooks · doi:10.1007/978-3-031-36751-9_1
Genauigkeit und Kompaktheit von DDs im Quantenbereich
Zulehner, A., & Wille, R. (2023) · Springer eBooks · doi:10.1007/978-3-031-36751-9_8
Zulehner, A., & Wille, R. (2023) · Springer eBooks · doi:10.1007/978-3-031-36751-9_10
Understand Noise on Universal Quantum Adder Circuit
Methachawalit, W., & Chongstitvatana, P. (2023) · Current Applied Science and Technology · doi:10.55003/cast.2023.255872
A polynomial system for bit-based division property solving by quantum algorithm
Zheng, Y., Gao, J., Li, X., et al. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04179-8
Two examples of implementation of the if/then/else conditional statement with quantum computers
He, G. P. (2023) · Proceedings of the Romanian Academy Series A Mathematics Physics Technical Sciences Information Science · doi:10.59277/pra-ser.a.24.3.09
Hamiltonian Minimization in the NISQ EraPreprint
da Silva, R. P. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4652979
Quantum Cryptography Analysis for Secure Data Communication in Multi-Core Environment
Surla, G., & Lakshmi, R. P. (2023) · Atlantis Highlights in Computer Sciences/Atlantis highlights in computer sciences · doi:10.2991/978-94-6463-314-6_20
Dutta, S., & Maitra, S. (2023) · Designs Codes and Cryptography · doi:10.1007/s10623-023-01346-x
On Query Complexity Measures and Their Relations for Symmetric Functions
Mittal, R., Nair, S. S., & Patro, S. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-52213-0_5
Cryogenic CMOS for Quantum Computing
Absar, R., Elgabra, H., Ma, D., Zhao, Y., & Wei, L. (2023) · Springer eBooks · doi:10.1007/978-3-031-42478-6_22 · Cited by 1
Hybrid Pattern Search-Quantum Optimization Method for Engineering Optimization ProblemsPreprint
Alfares, F. S., Alabdaly, A. A., Alfares, M. S., & Khorshid, E. A. (2024) · Research Square · doi:10.21203/rs.3.rs-3860130/v1
A Grover-like Quantum Algorithm for Minimum Distance Decoding of Linear Block Codes
Kim, G., & Oh, J. (2023) · International Conference on Information and Communication Technology Convergence (ICTC) · doi:10.1109/ictc58733.2023.10393803
Quantum Nested Search for Lattice EnumerationPreprint
Cao, R., Wang, B., & Gao, J. (2024) · Research Square · doi:10.21203/rs.3.rs-3887968/v1
An Automated Toolchain for QUBO-based Optimization with Quantum-inspired Annealers
Zhang, Y.-T., Nien, C.-F., Lin, C.-W., et al. (2023) · International SoC Design Conference · doi:10.1109/isocc59558.2023.10396459
Design of Quantum Associative Classifier based on Hamming Distance and Grover’s Algorithm
Meng, L., Li, Z., & Li, P. (2024) · International Journal of Theoretical Physics · doi:10.1007/s10773-024-05546-6
Milyen változásokat hozhatnak a kvantumszámítógépek az oktatás területén?
Prantner, C. K., Koczka, F., & Bíró, C. (2023) · Eszterházy Károly Katolikus Egyetem Líceum Kiadó eBooks · doi:10.46403/modszerekafenntarthatosagjegyeben.2023.143
Hoe, D. H. K., Binkley, D., & Lowe, M. L. (2024) · ASEE Annual Conference & Exposition · doi:10.18260/1-2--40691
Digital Signatures and Quantum Computing
Andrade, F., & Almeida, J. B. (2024) · Law, governance and technology series · doi:10.1007/978-3-031-41820-4_12
Shaik, S. P. (2020) · INTERNATIONAL RESEARCH JOURNAL OF ENGINEERING AND APPLIED SCIENCES · doi:10.55083/irjeas.2020.v08i01003
Ahmadi, A., & Greplová, E. (2023) · SciPost Physics · doi:10.21468/scipost.report.8319
Ahmadi, A., & Greplová, E. (2023) · SciPost Physics · doi:10.21468/scipost.report.7777
Ahmadi, A., & Greplová, E. (2023) · SciPost Physics · doi:10.21468/scipost.report.7728
Ahmadi, A., & Greplová, E. (2023) · SciPost Physics · doi:10.21468/scipost.report.7677
Benchmarking and Analysis of Quantum Error Correction Codes
Timmaraju, R. (2023) · Journal of Student Research · doi:10.47611/jsrhs.v12i3.5127
Exploit Reversible Gates to Implement Fast Quantum Sorting Algorithm
Bhattacharjee, S., Das, K., Sadhu, A., et al. (2024) · Lecture notes in networks and systems · doi:10.1007/978-981-99-9704-6_11
Reducing the Resources Needed to Implement Quantum Error Correction Codes Using Quantum Multiplexing
Nishio, S., Piparo, N. L., Hanks, M., et al. (2022) · Conference on Lasers and Electro-Optics Pacific Rim (CLEO-PR) · doi:10.1109/cleo-pr62338.2022.10432302
Quantum Prototype Clustering: Advancing AI Enhanced Machine Learning
Bangroo, I. S., & Kumar, R. (2023) · doi:10.1109/icsc60394.2023.10440984
Study of quantum algorithms and their implementations
Gamberi, G. P., & Bianchini, C. P. (2023) · International Conference on Electrical, Communication, and Computer Engineering (ICECCE) · doi:10.1109/icecce61019.2023.10442031
Functional quantum abstract detecting systems
Fernández, G. L., Combarro, E. F., & Rúa, I. F. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04273-5
Quantum Graph Drawing [Best Student Paper]
Caroppo, S., Lozzo, G. D., & Battista, G. D. (2024) · Lecture notes in computer science · doi:10.1007/978-981-97-0566-5_4
Introducing Reduced-Width QNNs, an AI-Inspired Ansatz Design Pattern
Stein, J., Rohe, T., Nappi, F., Hager, J., Bucher, D., Zorn, M., Kölle, M., & Linnhoff–Popien, C. (2024) · International Conference on Agents and Artificial Intelligence (ICAART) · doi:10.5220/0012449800003636
Entanglement Trajectory and its Boundary
Lin, R. (2024) · Quantum · doi:10.22331/q-2024-03-14-1282
On Rounding Errors in the Simulation of Quantum Circuits
Klamroth, J., & Beckert, B. (2024) · Lecture notes in computer science · doi:10.1007/978-981-97-0989-2_11
A short review on the maximum clique problem algorithms with classical, AI, and quantum methods
Marino, R., Buffoni, L., & Zaválnij, B. (2026) · Communications Physics · doi:10.1038/s42005-026-02606-7
Hull, I., Sattath, O., Diamanti, E., et al. (2024) · Contributions to economics · doi:10.1007/978-3-031-50780-9_2
Hull, I., Sattath, O., Diamanti, E., & Wendin, G. P. (2024) · Contributions to economics · doi:10.1007/978-3-031-50780-9_4
Solving QUBO problems with the methods of statistical physics and quantum mechanics
Veszeli, M. T. (2023) · Eötvös Loránd Tudományegyetem · doi:10.15476/elte.2022.241
Physics for secure and efficient societies
Barbato, F. C. T., Barthélemy, M., Beck, C., Biamonte, J., Cirac, J. I., Malz, D., Marino, A., Seskir, Z. C., & Ventura‐Traveset, J. (2024) · Institute of Physics eBooks · doi:10.1088/978-0-7503-6342-6ch7
A Fault Detection Approach for Smgf and Mmgf in Quantum CircuitsPreprint
Handique, M., Paul, S., & Sarma, H. K. D. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4770102
Secure Messaging Using Post-Quantum Key Sharing Based on CSIDH and Fujisaki-Okamoto Transform
Sitraka, R. R., Malalatiana, R. H., Emile, R. M., et al. (2024) · International Journal of Scientific Research in Computer Science Engineering and Information Technology · doi:10.32628/cseit2410213
Ulyanov, S. V., Ulyanov, S. V., Ulyanov, V. S., et al. (2023) · Международный журнал Программные продукты и системы · doi:10.15827/0236-235x.144.523-538
Grover on Chosen IV Related Key Attack Against GRAIN-128a
Maitra, A., Samanta, A., Kar, S., Garai, H. K., Mandal, M., & Dey, S. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-56232-7_14
3. The Quantum Threat to Cybersecurity and Privacy
Bindel, N., Mosca, M., & Munson, B. (2024) · Amsterdam University Press eBooks · doi:10.1515/9789048557998-003
(2024) · Amsterdam University Press eBooks · doi:10.1515/9789048557998 · Cited by 1
Haverly, A., Novotny, M. A., & Rahimi, S. (2023) · IEEE Asia-Pacific Conference on Computer Science and Data Engineering (CSDE) · doi:10.1109/csde59766.2023.10487751
Hmani, M. A., Petrovska‐Delacrétaz, D., & Dorizzi, B. (2024) · IntechOpen eBooks · doi:10.5772/intechopen.1003710
Explaining Grover's Quantum Algorithm to College Students
Deligiannidis, L. (2023) · doi:10.1109/csce60160.2023.00271
Namdeo, S., & Nene, M. J. (2024) · Research Square · doi:10.21203/rs.3.rs-4241406/v1
Efficient Bio-molecules Sequencing Using Multi-Objective Optimization and High-Performance Computing
Yadav, S. K., Jha, S. K., Singh, S., et al. (2024) · Wireless Personal Communications · doi:10.1007/s11277-024-10957-z
SFQ Circuits for Quantum Computing
Krylov, G., Jabbari, T., & Friedman, E. G. (2023) · Springer eBooks · doi:10.1007/978-3-031-47475-0_10
Quantum Cryptography: Advancements, Challenges, and Applications in Modern Communication
Malhotra, V., Yadav, S., & Vishal (2024) · International Journal of Advanced Research in Science Communication and Technology · doi:10.48175/ijarsct-17591
Correr, G. I. (2024) · Digital Library of Theses and Dissertations (Universidade de São Paulo) · doi:10.11606/d.76.2024.tde-24042024-083735
Bioinspired Quantum Oracle Circuits for Biomolecular Solutions of the Maximum Cut Problem
Chang, W.-L., Wong, R., Chen, Y. B., Chung, W., Chen, J.-C., & Vasilakos, A. V. (2024) · IEEE Transactions on NanoBioscience · doi:10.1109/tnb.2024.3395420 · Cited by 7
Transport distance between Grover walks on graphs and coarse Ricci curvature
Fujitani, Y., & Kiumi, C. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04373-2
Explicit decoders using fixed-point amplitude amplification based on QSVT
Utsumi, T., & Nakata, Y. (2026) · Quantum · doi:10.22331/q-2026-03-13-2024 · Cited by 6
Codeword Stabilized Codes From m -Uniform Graph States
Sudevan, S., Das, S., Aswanth, T., Patanker, N., & Kashyap, N. (2025) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2025.3602744
Quantum Resources in Harrow-Hassidim-Lloyd AlgorithmPreprint
De, A. S., Kumar, P., Konar, T. K., & Lakkaraju, L. G. C. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4834504
Potential Vulnerabilities of Cryptoalgorithms in the World of Ideal Quantum Annealers
Pakhomchik, A. I., & Vinokur, V. M. (2024) · IntechOpen eBooks · doi:10.5772/intechopen.114973
How Much Is the Cost of Implementing Arithmetic on a Quantum Computer?
Ghiglieno, F. G., Ferreira, P. H. D., Tribuzi, V., & Filho, O. L. D. S. (2024) · Industrial engineering and management. · doi:10.5772/intechopen.115048
Theorie des Quantum Computings
Warnke, M. (2024) · Springer eBooks · doi:10.1007/978-3-658-38128-8_15-1
Quantum Computing Winks at Statistics. Is It a Good Match?Preprint
Baldeschi, A., & Bruno, G. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4849930
Hou, K., Fu, S., Li, D., et al. (2024) · International Journal of Quantum Information · doi:10.1142/s0219749924500369
Lee, M. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04435-5
A machine learning ride in the physics theme park: from quantum to biophysics
Requena, B. (2024) · UPCommons institutional repository (Universitat Politècnica de Catalunya) · doi:10.5821/dissertation-2117-409132
(2024) · Advances in logistics, operations, and management science book series · doi:10.4018/979-8-3693-2695-4.ch009
Operationalize DNA technology for U.S. defense
Beshaj, L., & Crislip, S. J. (2024) · SPIE Unmanned Systems Technology · doi:10.1117/12.3013673
Pronin, C. B., & Volosova, A. V. (2023) · Computational nanotechnology · doi:10.33693/2313-223x-2023-10-4-11-15
Tomeo, I., Markopoulos, P., & Savakis, A. E. (2024) · doi:10.1117/12.3015944
Convergence Rate of Algorithm for Solving Linear Equations by Quantum Annealing
Tikhomirov, S. B., & Shalgin, V. S. (2024) · Computational Mathematics and Mathematical Physics · doi:10.1134/s0965542524700325
Oracle Quantum Algorithms: An OverviewPreprint
da Silva, R. P. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4862127
From Qubits To Bits Logic Conversion For Mixed Circuits Design
Rziga, F. O., & Besbes, K. (2024) · International Conference on Control, Automation and Diagnosis (ICCAD) · doi:10.1109/iccad60883.2024.10553817
Ayuso, F. P., Delgado, J. M. G., Gómez, J. A. G., Cañete, J. R., Díaz, A. D., Hernandez, R., Señor, J., Mujica, G., Otero, A., Portilla, J., et al. (2024) · Studies in computational intelligence · doi:10.1007/978-3-031-54049-3_19
ANÁLISE DE COMPORTAMENTO DO SVM QUÂNTICO
do Amaral, E. P., & Saqui, D. (2024) · Revista Eixos Tech · doi:10.18406/2359-1269v11n32024399
Performance Evaluation of Quantum Computing Processors Based on Quantum Assembly Language
Zhang, M., Wang, J., & Lai, J. (2024) · International Conference on Cloud Computing and Big Data Analytics (ICCCBDA) · doi:10.1109/icccbda61447.2024.10569330
Hybrid Approach to Public-Key Algorithms in the Near-Quantum Era
Cinal, A., Wechta, G., & Wroński, M. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-63778-0_27
Criptografía de los Cifrados de Bloque
Velasco-Barreras, E. (2024) · SAHUARUS REVISTA ELECTRÓNICA DE MATEMÁTICAS · doi:10.36788/sah.v8i1.100
Alasow, A., & Perkowski, M. A. (2024) · Journal of Quantum Information Science · doi:10.4236/jqis.2024.142005
QCCA Security of Fujisaki-Okamoto Transformation in the Quantum Random Oracle Model
Liu, X., & Wang, M. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-64381-1_11 · Cited by 1
Scalable Autograding for Quantum Programming Assignments
Beaumont, J., & Wakevainen, K. (2024) · doi:10.1145/3649217.3653619
Scheduling algorithm for fidelity of quantum gate circuits
Liu, X., Xu, J., & Lian, H. (2024) · International Conference on Electronic Information Engineering and Data Processing (EIEDP) · doi:10.1117/12.3032999
The serial and/or parallel execution of Grover's algorithmPreprint
Creemers, S. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4889509
Quantum Computing Applications in Cryptography: Enhancing Security and Identifying Vulnerabilities
Ganisetti, S. K. (2024) · International Journal of Science and Research (IJSR) · doi:10.21275/sr24605170901
Ferry, D. K. (2024) · Synthesis lectures on engineering, science, and technology · doi:10.1007/978-3-031-62925-9_1
The Offline Quantum Attack Against Modular Addition Variant of Even-Mansour Cipher
Liu, F., Zhu, X., Xu, R., Shi, D., & Wang, P. (2024) · Lecture notes in computer science · doi:10.1007/978-981-97-5025-2_1
Simple PKE schemes from the TSPEM problem
Zhou, L., & Wang, Q. (2024) · AIMS Mathematics · doi:10.3934/math.20241079
Quantum Software Engineering: Practical Challenges
Piattini, M. G., Hevia, J. L., & Peterssen, G. (2024) · International Journal of Software Engineering and Knowledge Engineering · doi:10.1142/s021819402441002x
QUANTUM COMPUTERS AND POST-QUANTUM CRYPTOGRAPHY
(2024) · International Research Journal of Modernization in Engineering Technology and Science · doi:10.56726/irjmets5569
An improved bit-plane representation of quantum imagePreprint
Mu, J., Li, X., Zhang, X.-H., et al. (2024) · Research Square · doi:10.21203/rs.3.rs-4665310/v1
Classical computation over quantum architectures
Schiava, A. D., Piazza, C., & Romanello, R. (2024) · Journal of Logic and Computation · doi:10.1093/logcom/exae040
Learning Asymmetric Cross-Layer Encryption for Wireless Communication
Mohammed, H. H. (2024) · IEEE International Conference on Communications workshops · doi:10.1109/iccworkshops59551.2024.10615816
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
