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 5,501–5,600 of 8,792
Processes of applying of quantum genetic algorithm in function optimization
Toirov, S., & Narmuradov, U. (2021) · AIP conference proceedings · doi:10.1063/5.0057346 · Cited by 2
A parallel spatial quantum search algorithm applied to the 3-SAT problem
Barreto, M. A. H., Abal, G., & Nesmachnow, S. (2011) · Cited by 2
Quantum rebound attack to D-M structure based on ARIA algorithm
Dou, S., Mao, M., Li, Y., & Qiu, D. (2021) · Journal of Physics Conference Series · doi:10.1088/1742-6596/2078/1/012003 · Cited by 2
Stream Symmetric Cipher “Strumok”
Kuznetsov, A. A., Potii, O. V., Poluyanenko, N. A., et al. (2021) · Studies in systems, decision and control · doi:10.1007/978-3-030-79770-6_16 · Cited by 2
Quantum Computing: Some Percepts and Realms of Applications
Jayaram, M. A., & Adavi, G. (2021) · International Journal of Computer Applications · doi:10.5120/ijca2021921834 · Cited by 2
Quantum absentminded driver problem revisited
Frąckiewicz, P., Rycerz, K., & Szopa, M. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03377-6 · Cited by 2
Xiong, Y., Ng, S. X., & Hanzo, L. (2022) · IEEE Transactions on Communications · doi:10.1109/tcomm.2022.3144469 · Cited by 4
Managing Cyber Security with Quantum Techniques
Bishwas, A. K., & Advani, J. (2021) · International Conference on Electrical, Computer and Energy Technologies (ICECET) · doi:10.1109/icecet52533.2021.9698591 · Cited by 2
On the Security of the Dandelion Protocol
Goncalves, B., & Mashatan, A. (2022) · Mathematics · doi:10.3390/math10071054 · Cited by 4
Bishwas, A. K., Mani, A., & Palade, V. (2022) · International Conference for Advancement in Technology (ICONAT) · doi:10.1109/iconat53423.2022.9725821 · Cited by 2
Quantum image filtering and its reversible logic circuit design
Luo, G., Zong, L., & Jiang, S. (2021) · International Journal of Embedded Systems · doi:10.1504/ijes.2021.10039155 · Cited by 2
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.003.0006 · Cited by 2
Formal methods for emerging technologies
Wille, R., & Drechsler, R. (2015) · doi:10.1109/iccad.2015.7372551 · Cited by 2
Grover algorithm circuit optimization and noise analysis on integer factorization
Song, H.-C., Liu, X.-N., Jiang, D., & An, J. (2022) · International Conference on Intelligent Computing and Signal Processing (ICSP) · doi:10.1109/icsp54964.2022.9778669 · Cited by 2
Quantum information processing fundamentals
Djordjević, I. B. (2022) · Elsevier eBooks · doi:10.1016/b978-0-12-822942-2.00008-x · Cited by 2
Lattice based Ring Signature Scheme for Secure Cloud-based EMR Sharing
Hu, W., Chai, Y., Chen, X., & Zheng, C. (2022) · International Conference on Computer and Communication Systems (ICCCS) · doi:10.1109/icccs55155.2022.9845850 · Cited by 2
Applying a cryptographic metric to post-quantum lattice-based signature algorithms
Rautell, M., Latvala, O.-M., Vallivaara, V., & Halunen, K. (2022) · International Conference on Availability, Reliability and Security (ARES) · doi:10.1145/3538969.3544438 · Cited by 2
Computational complexity in high-dimensional quantum computing
Nagata, K., Diep, D. N., & Nakamura, T. (2022) · Quantum Machine Intelligence · doi:10.1007/s42484-022-00084-y · Cited by 2
Quantum Oblivious Transfer with Reusable Bell State
Kuo, S., Tseng, K.-C., Chou, Y., et al. (2022) · Computers, materials & continua/Computers, materials & continua (Print) · doi:10.32604/cmc.2023.032320 · Cited by 2
Entanglement universality of TGX states in qubit–qutrit systems
Hedemann, S. R. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03747-8 · Cited by 2
Physical constraint-aware CNOT quantum circuit synthesis and optimization
Zhu, M., Cheng, X., Zhu, P., Chen, L., & Guan, Z. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03716-1 · Cited by 2
Combarro, E. F. (2022) · Springer eBooks · doi:10.1007/978-3-031-05324-5_1 · Cited by 2
Progress and Prospects of Quantum Algorithms
Yang, H., Wu, B., Xuan, Y., Li, Q., & Wang, X. (2022) · World Symposium on Software Engineering (WSSE) · doi:10.1145/3568364.3568379 · Cited by 2
Universal Reductions: Reductions Relative to Stateful Oracles
Chan, B. Y., Freitag, C., & Pass, R. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-22368-6_6 · Cited by 2
Quantum Time Complexity and Algorithms for Pattern Matching on Labeled Graphs
Darbari, P., Gibney, D., & Thankachan, S. V. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-20643-6_22 · Cited by 2
Silq2Qiskit - Developing a quantum language source-to-source translator
Hans, J., & Groppe, S. (2022) · doi:10.1145/3569966.3570114 · Cited by 2
Research Questions in Applying Quantum Computing to Systems Design
Gopsill, J., Schiffmann, O., & Hicks, B. J. (2023) · Springer eBooks · doi:10.1007/978-3-031-20418-0_43 · Cited by 2
Quantum sealed-bid auction using the phases of quantum entangled states as bids
Mihara, T. (2023) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-023-03662-6 · Cited by 2
Quantum greedy algorithms for multi-armed bandits
Ohno, H. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03844-2 · Cited by 2
Goncharov, A. V., & Chibisov, A. N. (2023) · Advanced Theory and Simulations · doi:10.1002/adts.202200816 · Cited by 2
Sudoku Solving Using Quantum Computer
Singh, V., Sharma, V., & Bachchas, V. (2023) · International Journal for Research in Applied Science and Engineering Technology · doi:10.22214/ijraset.2023.49094 · Cited by 2
Hypercube quantum search: exact computation of the probability of success in polynomial time
Pillin, H., Burel, G., Baird, P., Baghious, E.-H., & Gautier, R. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03883-9 · Cited by 2
Sartore, L., Boryan, C. G., Dau, A., & Willis, P. (2023) · Journal of Data Science · doi:10.6339/23-jds1098 · Cited by 2
Quantum Pattern Classification in a Three-Qubit System
Elmasry, M., Younes, A., Elkabani, I., & Elsayed, A. (2023) · Symmetry · doi:10.3390/sym15040883 · Cited by 3
Architectures for Quantum Information Processing
Upadhyay, S., Alam, M., & Ghosh, S. (2023) · Springer eBooks · doi:10.1007/978-981-15-6401-7_64-1 · Cited by 4
Allocating rotational cryptanalysis-based preimage attack on 4-round Keccak-224 for quantum setting
Wang, R., Li, X., Gao, J., Li, H., & Wang, B. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03907-4 · Cited by 2
Tightly Secure Lattice Identity-Based Signature in the Quantum Random Oracle Model
Foo, E., & Li, Q. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-35486-1_17 · Cited by 2
Balicki, J. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-36030-5_20 · Cited by 2
Phase shift and multi-controlled Z-type gates
Novikov, A., & Zainulin, R. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04005-1 · Cited by 2
Quantum algorithm for twin extreme learning machine
Ning, T., Yang, Y., & Du, Z. (2023) · Physica Scripta · doi:10.1088/1402-4896/ace485 · Cited by 2
On Hitting Times for General Quantum Markov Processes
Laneve, L., Tacchino, F., & Tavernelli, I. (2023) · Quantum · doi:10.22331/q-2023-07-12-1056 · Cited by 4
A Cryo-CMOS, Low-Power, Low-Noise, Phase-Locked Loop Design for Quantum Computers
Xin, K., Lai, M., Lv, F., Guo, K., Pang, Z., Xu, C., Zhang, G., Wang, W., & Li, M. (2023) · Electronics · doi:10.3390/electronics12153237 · Cited by 2
Wagner, U., & Lugrin, T. (2023) · Springer eBooks · doi:10.1007/978-3-031-33386-6_5 · Cited by 3
Norimoto, M., & Ishikawa, N. (2023) · IEEE Vehicular Technology Conference · doi:10.1109/vtc2023-spring57618.2023.10200430 · Cited by 2
Optimized Quantum Circuit for Quantum Security Strength Analysis of Argon2
Song, G., Eum, S., Kwon, H., Sim, M., Lee, M., & Seo, H. (2023) · Electronics · doi:10.3390/electronics12214485 · Cited by 2
A user-centric quantum benchmarking test suite and evaluation framework
Liu, W., Wang, F., Lin, H., & Shang, J. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04154-3 · Cited by 2
Laskar, M. R., & Dutta, A. K. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3329213 · Cited by 2
Complement Grover's Search Algorithm: An Amplitude Suppression Implementation
Vlasic, A., Certo, S., & Pham, A. T. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.10277 · Cited by 2
Quantum Algorithm for the Linear Vlasov Equation with Collisions
Ameri, A., Ye, E., Cappellaro, P., Krovi, H., & Loureiro, N. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.10185 · Cited by 3
Wafer-Scale Electrical Characterization of Silicon Quantum Dots from Room to Low Temperatures
Lorenzelli, F., Elsayed, A., Godfrin, C., et al. (2023) · Proceedings/Proceedings - International Test Conference · doi:10.1109/itc51656.2023.00031 · Cited by 2
Quantum Computing on Memristor Crossbars
Fyrigos, I.-A., Dimitrakis, P., & Sirakoulis, G. C. (2023) · Springer eBooks · doi:10.1007/978-3-031-42478-6_23 · Cited by 2
Post Quantum Communication Over the Internet Infrastructure
Dolev, S. (2024) · International Conference on Distributed Computing and Networking (ICDCN) · doi:10.1145/3631461.3632514 · Cited by 2
Quantum circuits for computing Hamming distance requiring fewer T gates
Orts, F. J., Ortega, G., Combarro, E. F., Rúa, I. F., & Garzón, E. M. (2024) · The Journal of Supercomputing · doi:10.1007/s11227-024-05916-1 · Cited by 2
Quantum dueling: an efficient solution for combinatorial optimization
Tang, L., Wang, H., Li, Z., Tang, H., Zhang, C., & Li, S. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad2e55 · Cited by 2
Quantum Computing: Principles of Breaking Encryption
Naqvi, G., Umar, M. B., & Ali, S. (2023) · JOURNAL OF NANOSCOPE (JN) · doi:10.52700/jn.v4i2.95 · Cited by 2
Time Complexity of the Oracle Phase in Grover’s Algorithm
Liu, Y. (2024) · American Journal of Computational Mathematics · doi:10.4236/ajcm.2024.141001 · Cited by 2
Efficient quantum algorithms for set operations
Elgendy, R., Younes, A., Abu-Donia, H. M., & Farouk, R. M. (2024) · Scientific Reports · doi:10.1038/s41598-024-56860-2 · Cited by 2
An Energy Estimation Benchmark for Quantum Computing Hardware
Woitzik, A. J. C., Hoffmann, L., Buchleitner, A., & Carnio, E. G. (2024) · Open Systems & Information Dynamics · doi:10.1142/s1230161224500069 · Cited by 4
Characterization of exact two-query quantum algorithms
Ye, S., Yang, W., & Huang, L. (2024) · Information and Computation · doi:10.1016/j.ic.2024.105166 · Cited by 3
Quantum Speed-Ups for String Synchronizing Sets, Longest Common Substring, and k -mismatch Matching
Jin, C., & Nogler, J. (2024) · ACM Transactions on Algorithms · doi:10.1145/3672395 · Cited by 8
That’s Not My Signature! Fail-Stop Signatures for a Post-quantum World
Boschini, C., Dahari, H., Naor, M., et al. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-68376-3_4 · Cited by 2
Periodicity of bipartite walk on biregular graphs with conditional spectra
Chen, Q. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad71ff · Cited by 2
Integrating Quantum Computing into Business Analytics: Opportunities and Challenges
Mudhol, A. C. (2024) · International Journal of Innovative Science and Research Technology (IJISRT) · doi:10.38124/ijisrt/ijisrt24aug1552 · Cited by 3
A quantum convolution and neighborhood pixel extraction scheme based on NEQR
Cai, S., & Zhou, R. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04562-z · Cited by 2
Trends in High Performance Computing and Quantum Computing
Pousa, A., Sanz, V. M., Naiouf, M., et al. (2024) · Journal of Computer Science and Technology · doi:10.24215/16666038.24.e11 · Cited by 2
Mathematics for Quantum Information Processing
Hirvensalo, M. (2012) · Springer eBooks · doi:10.1007/978-3-540-92910-9_41 · Cited by 2
Ulyanoy, S. V., Antoni, G. D., Yamafuji, K., Fukuda, T., Rizzotto, G., & Kurawaki, I. (2002) · International Symposium on Micro-NanoMechatronics and Human Science · doi:10.1109/mhs.1998.745785 · Cited by 3
Toward Intelligent Agents on Quantum Computers
Klusch, M. (2004) · Adaptive Agents and Multi-Agents Systems · doi:10.1109/aamas.2004.275 · Cited by 1
Structural Optimization of Planar Truss using Quantum-inspired Evolution Algorithm
Shon, S., & Lee, S. (2014) · Journal of the Korea institute for structural maintenance inspection · doi:10.11112/jksmi.2014.18.4.001 · Cited by 2
Study on Quantum Heuristic Search in an NP-hard problem
El-fiky, M., Ono, S., & Nakayama, S. (2009) · 2009 ICCAS-SICE · Cited by 2
Multi-agent reinforcement learning based on quantum andant colony algorithm theory
Tan, J., Meng, X., Wang, T., et al. (2009) · International Conference on Machine Learning and Cybernetics · doi:10.1109/icmlc.2009.5212291 · Cited by 2
Advances in quantum computational learning theory
Servedio, R. A., & Atıcı, A. (2006) · Cited by 2
Quantum information processing by NMR
Mahesh, T. S. (2015) · Resonance · doi:10.1007/s12045-015-0273-5 · Cited by 2
Wang, B., Li, Y., Meng, Y., et al. (2017) · Desalination and Water Treatment · doi:10.5004/dwt.2017.20228 · Cited by 2
Tools for Quantum and Reversible Circuit Compilation
Roetteler, M. (2017) · International Workshop on Reversible Computation · doi:10.1007/978-3-319-59936-6_1 · Cited by 1
Pattern Classifications Using Grover’s and Ventura’s Algorithms in a Two-qubits System
Singh, M. P., Radhey, K., & Rajput, B. S. (2017) · International Journal of Theoretical Physics · doi:10.1007/s10773-017-3601-6 · Cited by 2
Decision diagrams for the design of reversible and quantum circuits
Wille, R., Niemann, P., Zulehner, A., et al. (2018) · International Symposium on Devices, Circuits and Systems (ISDCS) · doi:10.1109/isdcs.2018.8379626 · Cited by 2
A high capacity quantum weak blind signature based on logistic chaotic maps
Lou, X., Tang, W., & Chen, X. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-2014-7 · Cited by 2
Creation of superposition of arbitrary states encoded in two high-Q cavities
Liu, T., Zhang, Y., Guo, B.-Q., Yu, C., & Zhang, W. (2019) · Optics Express · doi:10.1364/oe.27.027168 · Cited by 2
Processing Unstructured Databases Using a Quantum Approach
Amellal, H., Meslouhi, A., & Allati, A. E. (2019) · Lecture notes in intelligent transportation and infrastructure · doi:10.1007/978-3-030-11196-0_25 · Cited by 2
Access Control for Medical Devices: Tweaking LCap for Health Informatics
Buschsieweke, M., & Güneş, M. (2018) · IEEE Globecom Workshops (GC Wkshps) · doi:10.1109/glocomw.2018.8644137 · Cited by 2
Estudo preliminar da adoção de assinaturas baseadas em hash no blockchain do Bitcoin
de Lucena, A. U., & Henriques, M. A. A. (2018) · doi:10.5753/sbseg.2018.4271 · Cited by 2
Kureychik, V. M., & Logunova, Y. A. (2019) · International Seminar on Electron Devices Design and Production (SED) · doi:10.1109/sed.2019.8798461 · Cited by 2
Faster Quantum Alternative to Softmax Selection in Deep Learning and Deep Reinforcement Learning
Galindo, O., Ayub, C., Ceberio, M. C., et al. (2019) · IEEE Symposium Series on Computational Intelligence (SSCI) · doi:10.1109/ssci44817.2019.9003167 · Cited by 2
Different Fixed-Phases for Quantum Search Operators
Saleh, S. Q., & Younes, A. (2019) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.88.124002 · Cited by 2
Modeling of linear optical controlled-z quantum gate with dimensional errors of passive components
Kiselev, F. D., Samsonov, E. Y., & Gleim, A. V. (2019) · Nanosystems Physics Chemistry Mathematics · doi:10.17586/2220-8054-2019-10-6-627-631 · Cited by 2
Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products
Kowaluk, M., & Andrzej Lingas, B. (2023) · International Journal of Foundations of Computer Science · doi:10.1142/s0129054123500259 · Cited by 2
Towards Post-Quantum Cryptography Using Thermal Noise Theory and True Random Numbers Generation
Ndagijimana, P., Nahayo, F., Assogba, M. K., Ametepe, A. F.-X., & Shabani, J. (2020) · Journal of Information Security · doi:10.4236/jis.2020.113010 · Cited by 2
Combarro, E. F., Nicolás, A. P., Ranilla, J., & Rúa, I. F. (2020) · Computational and Mathematical Methods · doi:10.1002/cmm4.1120 · Cited by 2
Quantum Resource Counts for Operations Constructed from an Addition Circuit
Miller, S. (2020) · IEEE Computer Society Annual Symposium on VLSI · doi:10.1109/isvlsi49217.2020.00035 · Cited by 1
Testing of code-based pseudorandom number generators for post-quantum application
Kuznetsov, A. A., Кіян, А., Pushkar’ov, A., et al. (2020) · Radiotekhnika · doi:10.30837/rt.2020.1.200.06 · Cited by 2
Generalizing an exactly-1 SAT solver for arbitrary numbers of variables, clauses, and K
Piro, F., Askarpour, M., & Nitto, E. D. (2020) · Cited by 2
Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products
Kowaluk, M., & Andrzej Lingas, B. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-67899-9_35 · Cited by 2
Cho, J. Y., Patri, S. K., & Sergeev, A. (2020) · European Conference on Optical Communication · doi:10.1109/ecoc48923.2020.9333347 · Cited by 2
Three Quantum Machine Learning Approaches for Mobile User Indoor-Outdoor Detection
Phillipson, F., Wezeman, R. S., & Chiscop, I. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-70866-5_11 · Cited by 2
Modelling for Quantum Error Mitigation
Weber, T., Riebisch, M., Borras, K., Jansen, K., & Krücker, D. (2021) · IEEE International Conference on Software Architecture Companion (ICSA-C) · doi:10.1109/icsa-c52384.2021.00026 · Cited by 2
The Ihara expression for the generalized weighted zeta function of a finite simple graph
Ide, Y., Ishikawa, A., Morita, H., et al. (2021) · Linear Algebra and its Applications · doi:10.1016/j.laa.2021.06.008 · Cited by 2
The Quantum Computer and the Security of Information Systems
Nouioua, T., & Hafid, B. A. (2021) · International Conference on Recent Advances in Mathematics and Informatics (ICRAMI) · doi:10.1109/icrami52622.2021.9585929 · Cited by 2
Automata and quantum computing
Ambainis, A., & Yakaryılmaz, A. (2021) · doi:10.4171/automata-1/39 · Cited by 2
Villalba-Díez, J., Losada, J. C., Benito, R. M., & Schmidt, D. (2021) · Entropy · doi:10.3390/e23040426 · Cited by 2
Metadata
- Authors
- Grover, L. K.
- Affiliations
- AT&T (United States) (US)
- Corresponding author
- Grover, Lov K.
- Venue
- Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96
- Publisher
- ACM Press
- Published
- 1996
- Pages
- 212-219
- OpenAlex
- W2084652510
- Semantic Scholar
- 298d799da82395a64a3bda38ef9d2a4646828ccb
- Cited by
- 8,830
- References
- 24
- Citations by year
- 2026: 664 · 2025: 1066 · 2024: 896 · 2023: 841 · 2022: 674 · 2021: 655 · 2020: 529 · 2019: 423 · 2018: 288 · 2017: 283 · 2016: 219 · 2015: 221 · 2014: 184 · 2013: 161 · 2012: 158
- FWCI
- 36.24
- Type
- conference paper
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- ACM Symposium on Theory of Computing (STOC) (publishedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- quantum search, unsorted database search, Grover's algorithm, quantum algorithms, time complexity, quantum parallelism, lower bounds
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
A language model drew the claims from the paper on 2026-10-21, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-21 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
