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 6,101–6,200 of 8,792
Luo, G., Shi, L., Huang, T., et al. (2020) · Journal of Engineering Science and Technology Review · doi:10.25103/jestr.133.07 · Cited by 1
Design and realization of a quantum Controlled NOT gate using optical implementation
Biswas, K., & Sajeed, S. (2012) · Cited by 1
A Quantum Adiabatic Algorithm for Multiobjective Combinatorial Optimization
Barán, B., & Villagra, M. (2019) · Axioms · doi:10.3390/axioms8010032 · Cited by 1
Can Quantum Entanglement Detection Schemes Improve Search?
Wichert, A. (2016) · Cited by 1
Cryptographic Protection for Military Radio Communications
Białas, R., Grzonkowski, M., & Wicik, R. (2020) · International Journal of Electronics and Telecommunications · doi:10.24425/ijet.2020.134028 · Cited by 1
Balancing Security: A Moving Target
Voskobojnikov, A., Skwarek, V., Mashatan, A., Matsuo, S., Rowell, C., & Weingärtner, T. (2021) · Springer eBooks · doi:10.1007/978-3-030-54414-0_4 · Cited by 1
Park, Y., Seok, W., Lee, W., et al. (2020) · International Journal of Advanced Computer Science and Applications · doi:10.14569/ijacsa.2020.0111204 · Cited by 1
Quantum Information Processing Fundamentals
Djordjević, I. B. (2021) · Elsevier eBooks · doi:10.1016/b978-0-12-821982-9.00008-3 · Cited by 1
Faster quantum concentration via Grover's search
Unsal, C. M., & Oruç, A. Y. (2023) · International Journal of Parallel Emergent and Distributed Systems · doi:10.1080/17445760.2023.2231578 · Cited by 1
Quantum Algorithms for the Resiliency of Vectorial Boolean Functions
Li, H. (2021) · International Journal of Theoretical Physics · doi:10.1007/s10773-021-04779-z · Cited by 1
A Contemporary Study on Quantum-Computing Security Mechanisms in 5G Networks
Beri, E. A. R. (2021) · Türk bilgisayar ve matematik eğitimi dergisi · doi:10.17762/turcomat.v12i2.835 · Cited by 1
Reis, P. R., & Borges, F. (2019) · doi:10.5753/wrac.2019.14034 · Cited by 1
Quantum Processors in Silicon Photonics
Paesani, S., & Laing, A. (2021) · Topics in applied physics · doi:10.1007/978-3-030-68222-4_11 · Cited by 1
OnCall Operator Scheduling for Satellites with Grover’s Algorithm
Scherer, A., Guggemos, T., Grundner-Culemann, S., Pomplun, N., Prüfer, S., & Spörl, A. K. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-77980-1_2 · Cited by 1
Variational Quantum Eigensolver and Its Applications
Matsuo, A. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-79837-6_2 · Cited by 1
Heralded Quantum Random Access Memory in a Scalable Photonic Integrated Circuit Platform
Chen, K. C., Dai, W., Errando-Herranz, C., et al. (2021) · Conference on Lasers and Electro-Optics · doi:10.1364/cleo_qels.2021.fth1p.7 · Cited by 1
Small Circuits Imply Efficient Arthur-Merlin Protocols
Ezra, M., & Rothblum, R. D. (2022) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.itcs.2022.67 · Cited by 2
Is Merkle tree the best option to organize keys?
Guselev, A. M., & Lavrikov, I. V. (2021) · Journal of Computer Virology and Hacking Techniques · doi:10.1007/s11416-021-00400-3 · Cited by 1
Combinatorial and rotational quantum abstract detecting systems
Cáceres, J. M. H., Combarro, E. F., & Rúa, I. F. (2022) · Quantum Information Processing · doi:10.1007/s11128-021-03356-x · Cited by 1
Quantum algorithms to compute the neighbour list of N-body simulations
Combarro, E. F., Rúa, I. F., Orts, F. J., Ortega, G., Puertas, A. M., & Garzón, E. M. (2024) · Quantum Information Processing · doi:10.1007/s11128-023-04245-1 · Cited by 1
Geometry and causal flux in multi-loop Feynman diagrams
Sborlini, G. F. R. (2022) · Suplemento de la Revista Mexicana de Física · doi:10.31349/suplrevmexfis.3.020703 · Cited by 1
Interrelation of nonclassicality conditions through stabiliser group homomorphism
Asthana, S. (2022) · New Journal of Physics · doi:10.1088/1367-2630/ac6900 · Cited by 1
Exploring Quantum Engineering from Resource Perspective
Zenglin, T., Hongyi, D., & Zhang, M. (2021) · Chinese Control Conference (CCC) · doi:10.23919/ccc52363.2021.9549513 · Cited by 1
The performance impact of the graph topology in Ibm’s Quantum devices on Grover’s search algorithm
Prodan, A., Manta, V., & Tudorache, A. (2021) · International Conference on System Theory, Control and Computing (ICSTCC) · doi:10.1109/icstcc52150.2021.9607230 · Cited by 1
Armenakas, A. A., & Baker, O. K. (2021) · Scientific Reports · doi:10.1038/s41598-021-01552-4 · Cited by 1
Quantum-Assisted Decoding for Non-Binary Low-Density Parity-Check Codes
Jung, H.-W., Kang, J., & Ha, J. (2021) · International Conference on Information and Communication Technology Convergence (ICTC) · doi:10.1109/ictc52510.2021.9621026 · Cited by 1
(2021) · International Journal of Advanced Trends in Computer Science and Engineering · doi:10.30534/ijatcse/2021/121052021 · Cited by 1
Nearest Neighbor Synthesis of CNOT Circuit Based on Matrix Transformation
Cheng, X., Zhu, M., Li, X., et al. (2022) · Lecture notes on data engineering and communications technologies · doi:10.1007/978-3-030-89698-0_16 · Cited by 1
Naughton, T. J., & Woods, D. (2018) · Springer eBooks · doi:10.1007/978-1-4939-6883-1_377 · Cited by 1
Kendon, V. M. (2018) · Springer eBooks · doi:10.1007/978-1-4939-6883-1_429 · Cited by 1
Abdessaied, N., & Drechsler, R. (2016) · Springer eBooks · doi:10.1007/978-3-319-31937-7_2 · Cited by 1
A novel linear representation for evolving matrices
Gregor, C., Ashlock, D., Ruz, G. A., et al. (2022) · Soft Computing · doi:10.1007/s00500-022-07043-6 · Cited by 1
Quantum Approaches for WCET-Related Optimization Problems
Bettonte, G., Gilbert, V., Vert, D., Louise, S., & Sirdey, R. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-08760-8_18 · Cited by 1
Gaussian Amplitude Amplification for Quantum Pathfinding
Koch, D., Cutugno, M., Karlson, S., Patel, S., Wessing, L., & Alsing, P. M. (2022) · Entropy · doi:10.3390/e24070963 · Cited by 3
Semiclassical description of light–matter coupling
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.003.0004 · Cited by 1
Di, L., & Yu, G. (2021) · The urban book series · doi:10.1007/978-981-15-8983-6_37 · Cited by 1
Du, K.-L., & Swamy, M. N. S. (2016) · Springer eBooks · doi:10.1007/978-3-319-41192-7_17 · Cited by 1
Quantum Algorithms for Matrix Products over Semirings
Gall, F. L., & Nishimura, H. (2017) · Chicago Journal of Theoretical Computer Science · doi:10.4086/cjtcs.2017.001 · Cited by 1
Quantum Computing Based Technique for Cancer Disease Detection System
Chaturvedi, S. K., & Jain, M. (2015) · Advances in medical technologies and clinical practice book series · doi:10.4018/978-1-4666-9530-6.ch016 · Cited by 1
Lässig, J. (2020) · Informatik-Spektrum · doi:10.1007/s00287-020-01309-9 · Cited by 1
Modeling the effect of steering mirrors on polarization for free-space quantum key distribution
Arteaga-Díaz, P., Denisenko, N., & Fernández, V. (2022) · Optik · doi:10.1016/j.ijleo.2022.169434 · Cited by 1
A study on fitting SPHINCS+ to blockchain usage
de Lucena, A. U., & Henriques, M. A. A. (2020) · Simpósio Brasileiro de Cibersegurança (SBSeg) · doi:10.5753/sbseg.2020.19229 · Cited by 1
Phillipson, F. (2022) · doi:10.26481/spe.20220525fp · Cited by 1
Namkung, M., Kang, J., & Kwon, Y. (2022) · Journal of the Optical Society of America B · doi:10.1364/josab.449257 · Cited by 1
Quantum Technologies I: Information, Communication, and Computation
Peláez, E., Pham, M., & Utagi, S. (2022) · Lecture notes on data engineering and communications technologies · doi:10.1007/978-3-031-04613-1_1 · Cited by 2
Quantum measurement detection algorithms
Fernández, G. L., Combarro, E. F., & Rúa, I. F. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03614-6 · Cited by 1
Giron, A. A., Schardong, F., & Custódio, R. F. (2022) · doi:10.5753/sbseg_estendido.2022.226725 · Cited by 1
Security Analysis of One-step QSDC Protocol with Hyperentanglement
Kim, K., Kim, B., & Heo, J. (2022) · IEEE VTS Asia Pacific Wireless Communications Symposium (APWCS) · doi:10.1109/apwcs55727.2022.9906498 · Cited by 1
Mullor, T., Vigouroux, D., & Béthune, L. (2022) · IEEE/ACM Symposium on Edge Computing (SEC) · doi:10.1109/sec54971.2022.00066 · Cited by 2
State of the Art of Cybersecurity in Cooperative, Connected and Automated Mobility
Castillo, O., Martínez, V. G., Encinas, L. H., Martin, A., & Álvarez, R. (2022) · Lecture notes in networks and systems · doi:10.1007/978-3-031-18409-3_11 · Cited by 1
Strain Effects in a Double Dot Quantum Dot System
Mooy, B. C. H., & Lai, N. S. (2022) · International Conference on Edge Computing and Applications (ICECAA) · doi:10.1109/icecaa55415.2022.9936510 · Cited by 1
Optimized quantum leading zero detector circuits
Orts, F. J., Ortega, G., Combarro, E. F., Rúa, I. F., & Garzón, E. M. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03784-3 · Cited by 1
Background and Future of Multiple Valued Logic
Sandhie, Z. T., Ahmed, F. U., & Chowdhury, M. H. (2022) · Synthesis lectures on digital circuits and systems · doi:10.1007/978-3-031-16195-7_1 · Cited by 1
Training Quantum Boltzmann Machines with Coresets
Viszlai, J., Tomesh, T., Gokhale, P., Anschuetz, E. R., & Chong, F. T. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00049 · Cited by 1
A Multifunctional Modular Implementation of Grover’s Algorithm
Mina, M.-Z., & Simion, E. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-17510-7_16 · Cited by 1
Stable Toffoli Gate on Fixed-Frequency Superconducting Qutrits
Jang, W., Iiyama, Y., Kanazawa, N., Inada, T., Sawada, R., Onodera, T., & Terashi, K. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00148 · Cited by 1
SAT-based Exact Synthesis of Ternary Reversible Circuits using a Functionally Complete Gate Library
Kole, A., Datta, K., Sengupta, I., et al. (2022) · Euromicro Conference on Digital System Design (DSD) · doi:10.1109/dsd57027.2022.00108 · Cited by 1
FLC: A New Secure and Efficient SPN-Based Scheme for Block Ciphers
Nguyen, C., Nam, T. S., & Nguyen, L. (2022) · NAFOSTED Conference on Information and Computer Science (NICS) · doi:10.1109/nics56915.2022.10013379 · Cited by 1
Spatial search by continuous-time quantum walk on truncated simplex lattices
Zhu, X., Deng, Y., Zhang, D., et al. (2023) · Laser Physics Letters · doi:10.1088/1612-202x/acb594 · Cited by 1
Quantum Inference for Reliability Assessment
Silva, G. S. M., & Droguett, E. L. (2023) · Annual Reliability and Maintainability Symposium (RAMS) · doi:10.1109/rams51473.2023.10088259 · Cited by 1
Multi-Class Classification Using Quantum Kernel Methods
Mokhles, M., & Makarov, I. (2023) · International Russian Smart Industry Conference (SmartIndustryCon) · doi:10.1109/smartindustrycon57312.2023.10110752 · Cited by 1
Confidential Computing in the Post-Quantum Era
Puckett, S. C., & Crabtree, J. D. (2023) · Proceedings of IEEE Southeastcon · doi:10.1109/southeastcon51012.2023.10115130 · Cited by 1
Künnemann, H., & Phillipson, F. (2023) · Mathematics · doi:10.3390/math11122741 · Cited by 1
Grurl, T., Fuß, J., & Wille, R. (2023) · IEEE International Symposium on Multiple-Valued Logic · doi:10.1109/ismvl57333.2023.00036 · Cited by 1
Heimonen, H., Auer, A., Bergholm, V., de Vega, I., & Möttönen, M. (2023) · Computational methods in applied sciences · doi:10.1007/978-3-031-29082-4_22 · Cited by 1
Improved attacks against reduced-round Whirlwind
Wei, C., Dong, B., Hua, J., Dong, X., & Zhang, G. (2023) · Designs Codes and Cryptography · doi:10.1007/s10623-023-01254-0 · Cited by 1
Solving the Flow-Shop Scheduling problem using Grover's Algorithm
Saiem, M., Arbaoui, T., & Hnaien, F. (2023) · doi:10.1145/3583133.3596378 · Cited by 1
Constant-time quantum algorithm for homology detection in closed curves
Vu, N. A. N., Gu, X. D., & Wei, T.-C. (2023) · SciPost Physics · doi:10.21468/scipostphys.15.2.049 · Cited by 3
Describing and Animating Quantum Protocols
Bornat, R., & Nagarajan, R. (2023) · Outstanding contributions to logic · doi:10.1007/978-3-031-24117-8_12 · Cited by 1
Long-Term Analysis of the Dependability of Cloud-based NISQ Quantum Computers
Xu, C., & Szefer, J. M. (2023) · International Conference on Availability, Reliability and Security (ARES) · doi:10.1145/3600160.3600192 · Cited by 1
QRADCOM: Quantum Assisted Framework for Joint Detection and Estimation in Radar Communications
Laskar, M. R., Naskar, S., & Dutta, A. K. (2023) · IEEE Vehicular Technology Conference · doi:10.1109/vtc2023-spring57618.2023.10200135 · Cited by 2
Evaluating Quantum Algorithms for Linear Solver Workflows
Kolak, S., Mohammadbagherpoor, H., Daloukas, K., Kafousas, K., Rouet, F.-H., Koutsoyannopoulos, Y., Earnest, N., & Lucas, R. F. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-40843-4_47 · Cited by 1
Quantum-Walk-Inspired Dynamic Adiabatic Local Search
Chiang, C.-F., & Alsing, P. M. (2023) · Entropy · doi:10.3390/e25091287 · Cited by 3
Quantum Artificial Intelligence: A tutorial
Martín‐Guerrero, J. D., Lamata, L., & Villmann, T. (2023) · European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning (ESANN) · doi:10.14428/esann/2023.es2023-2 · Cited by 1
An Overview and Concerns Related to Quantum Cryptanalysis: Past, Present, and Future
Maitra, S., & Stănică, P. (2023) · Computer · doi:10.1109/mc.2023.3295611 · Cited by 1
Modularized and scalable compilation for double quantum dot quantum computing
He, R.-H., Xu, X., Byrd, M., & Wang, Z.-M. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/acfe38 · Cited by 3
Quantum Best Arm Identification
Wang, X., Chen, Y.-Z. J., de Andrade, M. G., et al. (2023) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/3626570.3626596 · Cited by 1
The fundamental theory of quantum computing, applications in practical fields, and future challenges
Hung, S. (2023) · Applied and Computational Engineering · doi:10.54254/2755-2721/18/20230976 · Cited by 1
Quantum Hacking: Challenges and Countermeasures
-, M. S., & -, M. K. (2023) · International Journal For Multidisciplinary Research · doi:10.36948/ijfmr.2023.v05i05.8046 · Cited by 1
Bakharev, A. O. (2023) · Journal of Applied and Industrial Mathematics · doi:10.1134/s1990478923030018 · Cited by 1
Experimenting with Hybrid Quantum Optimization in HPC Software Stack for CPU Register Allocation
Chichereau, B., Vialle, S., & Carribault, P. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.10197 · Cited by 1
D’Urbano, A., Catalano, C., & Corallo, A. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-49269-3_9 · Cited by 1
Lifting query complexity to time-space complexity for two-way finite automata
Zheng, S., Li, Y., Pan, M., et al. (2023) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2023.103494 · Cited by 1
Quantum Ray Marching: Reformulating Light Transport for Quantum Computers
Mosier, L., McGuire, M., & Hachisuka, T. (2023) · SIGGRAPH Asia Conference Papers · doi:10.1145/3610548.3618151 · Cited by 1
Efficient Syndrome Decoder for Heavy Hexagonal QECC via Machine Learning
Bhoumik, D., Majumdar, R., Madan, D., Vinayagamurthy, D., Raghunathan, S., & Sur‐Kolay, S. (2023) · ACM Transactions on Quantum Computing · doi:10.1145/3636516 · Cited by 1
Iterative Refinement Quantum Amplitude Estimation
Saito, Y., Xie, N., Shin, J., et al. (2023) · IEEE International Symposium on Embedded Multicore/Many-core Systems-on-Chip (MCSoC) · doi:10.1109/mcsoc60832.2023.00038 · Cited by 1
Euclidean time method in generalized eigenvalue equation
Hwang, M.-R., Jung, E., Kim, M., & Park, D. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04275-3 · Cited by 1
Discrete Models in Control Systems Theory : XI International Conference
(2023) · LCC MAKS Press eBooks · doi:10.29003/m3789.978-5-317-07114-1 · Cited by 1
Randomized decision tree complexity of Deutsch–Jozsa problem and a generalization
Xu, G., Qiu, D., Zhang, B., et al. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04292-2 · Cited by 1
Improving Parameter Training for VQEs by Sequential Hamiltonian Assembly
Stein, J., Roshani, N., Zorn, M., Altmann, P. J., Kölle, M., & Linnhoff–Popien, C. (2024) · International Conference on Agents and Artificial Intelligence (ICAART) · doi:10.5220/0012312500003636 · Cited by 2
Quantum Collision Resistance of Double-Block-Length Hashing
Hirose, S., & KUWAKADO, H. (2024) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1587/transfun.2023dmp0007 · Cited by 1
Quantum Computing Beyond Integer Factorization--Exploring the Potential of Quantum Search
Tani, S. (2014) · NTT technical review · doi:10.53829/ntr201411fa7 · Cited by 1
Optimized Quantum Implementation of SEED
Oh, Y., Jang, K., Yang, Y., & Seo, H. (2024) · Lecture notes in computer science · doi:10.1007/978-981-97-1235-9_4 · Cited by 1
High-Performance Hardware Implementation of MPCitH and Picnic3
Liu, G., Jia, K., Wei, P., & Ju, L. (2024) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2024.i2.190-214 · Cited by 2
AKQ: A Hybrid Quantum-Classical Image Encryption System
Nguyen, T. K., Truc, N. T. T., & Hai, V. T. (2023) · RIVF International Conference on Computing and Communication Technologies (RIVF) · doi:10.1109/rivf60135.2023.10471808 · Cited by 1
Quantum algorithms for SCS and text assembling problems
Khadiev, K. R., Machado, C. M. B., Chen, Z., & Wu, J. (2024) · Quantum Information and Computation · doi:10.26421/qic24.3-4-4 · Cited by 1
Degenerate perturbation theory to quantum search
Zhang, D., Zhu, X., Deng, Y., et al. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04340-x · Cited by 1
New Demiric–Selçuk meet-in-the-middle attacks on Misty and Feistel schemes
Zou, J. X., Huang, K., Zhu, M., et al. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04349-2 · Cited by 1
Programming Languages and Systems
Weirich, S. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-57267-8 · 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
