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 4,201–4,300 of 8,792
Quantum speedup and limitations on matroid property problems
Huang, X., Luo, J., & Li, L. (2023) · Frontiers of Computer Science · doi:10.1007/s11704-023-3130-9 · Cited by 4
A thermodynamic approach to optimization in complex quantum systems
Imparato, A., Chancellor, N., & Chiara, G. D. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad26b3 · Cited by 4
Novel quantum solutions to privacy-preserving point-line relation determination
Peng, Z., Shi, R., Ding, R., et al. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad3028 · Cited by 4
Applying Grover’s algorithm to implement various numerical and comparison operations
Roy, A., Pachuau, J. L., Krishna, G., & Saha, A. K. (2024) · Quantum Studies Mathematics and Foundations · doi:10.1007/s40509-024-00323-w · Cited by 4
Quantum circuit optimization of an integer divider
Orts, F. J., Paulavičius, R., & Filatovas, E. (2024) · Journal of Systems and Software · doi:10.1016/j.jss.2024.112091 · Cited by 8
Quantum Assisted Architectures for Wireless Systems, the Case of Quantum 6G
Mohammed, A. A., Bounceur, A., & Hammoudeh, M. A. A. (2023) · International Conference on Future Networks and Distributed Systems (ICFNDS) · doi:10.1145/3644713.3644806 · Cited by 5
Physical Layer Security in a Private 5G Network for Industrial and Mobility Application
Gonde, S. H., Frisch, C., Duhovnikov, S., et al. (2023) · IEEE World Forum on Internet of Things (WF-IoT) · doi:10.1109/wf-iot58464.2023.10539393 · Cited by 4
Next-Generation Orchestration: Quantum Computing for Network Services
Zeydan, E., Blanco, L., Mangues‐Bafalluy, J., et al. (2024) · International Conference on Computer, Information and Telecommunication Systems · doi:10.1109/cits61189.2024.10608025 · Cited by 4
Nieman, K., Durand, H., Patel, S., Koch, D., & Alsing, P. M. (2024) · Digital Chemical Engineering · doi:10.1016/j.dche.2024.100179 · Cited by 4
A Novel Authenticated Quantum Anonymous Secret Sharing for Classical and Quantum Information
Wang, Q., Xu, Y., Li, G., Han, Y.-G., Zhou, Y., Li, X., & Cheng, L. F. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202400295 · Cited by 4
Wang, Y., Li, L., Zhou, Y., & Zhang, H. (2024) · Axioms · doi:10.3390/axioms13110741 · Cited by 6
Solving Max-3SAT Using QUBO Approximation
Zielinski, S., Nüßlein, J., Kölle, M., Gabor, T., Linnhoff–Popien, C., & Feld, S. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00085 · Cited by 5
Investigation of Quantum Machine Learning for Smart Eco System Focusing on Energy Optimization
Hussain, S. M., Malviya, N., & Pareek, P. (2025) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-031-77075-3_12 · Cited by 4
A fast quantum algorithm for solving partial differential equations
Farghadan, A., Farahani, M. M. M., & Akbari, M. (2025) · Scientific Reports · doi:10.1038/s41598-025-89302-8 · Cited by 4
Barletta, V. S., Caivano, D., Pal, A., Scalera, M., & Martin, M. A. S. (2025) · Journal of Software Evolution and Process · doi:10.1002/smr.70005 · Cited by 4
Mummadi, S., & Fathima, S. (2025) · IGI Global eBooks · doi:10.4018/979-8-3373-1370-2.ch022 · Cited by 4
Tighter lower bounds on quantum annealing times
García-Pintos, L. P., Sahasrabudhe, M., & Arenz, C. (2025) · SciPost Physics · doi:10.21468/scipostphys.18.5.159 · Cited by 4
Zenchuk, A. I., Bochkin, G. A., Qi, W., Kumar, A., & Wu, J. (2025) · Quantum Information and Computation · doi:10.2478/qic-2025-0010 · Cited by 4
Quantum representation and geometric transformation of 3D images
He, S.-P., Yang, J.-C., Bai, M.-Q., et al. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04842-2 · Cited by 4
A systematic review of strategic approaches and applications in quantum computing
Sharma, N. V., & Saxena, V. (2025) · Optical and Quantum Electronics · doi:10.1007/s11082-025-08364-0 · Cited by 5
Quantum approaches for inference and decision-making in quantum multi-agent frameworks
Shi, H. J., Zhang, M., Chen, H., Han, J., & Hu, D. (2025) · The European Physical Journal Special Topics · doi:10.1140/epjs/s11734-025-01874-8 · Cited by 4
Rahman, R., Azad, M. S., Hasan, M. R., Shubha, S. E. U., & Mahdy, M. R. C. (2025) · IET Quantum Communication · doi:10.1049/qtc2.70016 · Cited by 13
Bayesian Quantum Amplitude Estimation
Ramôa, A., & Santos, L. P. (2025) · Quantum · doi:10.22331/q-2025-09-11-1856 · Cited by 4
Koßmann, G., Binkowski, L., van Luijk, L., Ziegler, T., & Schwonnek, R. (2025) · Quantum · doi:10.22331/q-2025-10-13-1882 · Cited by 8
Measurement-Device-Independent Quantum Private Query With Weak Coherent Source
Liu, B., Yang, T., Huang, W., et al. (2025) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2025.3607259 · Cited by 4
Ballhysa, E., & Say, A. C. C. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30182-0_97 · Cited by 4
Multiuser Detection Based on Grover's Algorithm
Zhao, S., Yao, J., & Zheng, B. (2006) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas.2006.1693688 · Cited by 4
Integrated information storage and transfer with a coherent magnetic device
Jia, N., Banchi, L., Bayat, A., et al. (2015) · Scientific Reports · doi:10.1038/srep13665 · Cited by 4
Database Manipulation Operations on Quantum Systems
Younes, A. (2013) · Quantum Information Review · doi:10.12785/qir/010102 · Cited by 4
Some Charicteristics and Applications for Quantum Information
Qiao, B., Fang, J., & Ruda, H. E. (2012) · Journal of Modern Physics · doi:10.4236/jmp.2012.39141 · Cited by 4
Trapping and spreading properties of quantum walk in homological structure
Machida, T., & Segawa, E. (2014) · Quantum Information Processing · doi:10.1007/s11128-014-0819-6 · Cited by 4
Aspects of Reversible and Quantum Computing in a -Valued Domain
Moraga, C. (2016) · IEEE Journal on Emerging and Selected Topics in Circuits and Systems · doi:10.1109/jetcas.2016.2528658 · Cited by 4
Neurocomputing approach to matrix product state using quantum dynamics
Bhatia, A. S., & Kumar, A. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-2053-0 · Cited by 4
New mission and opportunity for mathematics researchers: cryptography in the quantum era
Chen, L., & Moody, D. (2019) · Advances in Mathematics of Communications · doi:10.3934/amc.2020013 · Cited by 4
P vs NP Solution – Advances in Computational Complexity, Status and Future Scope
Sharma, A. K., & Kr., S. (2019) · International Journal of Computer Applications · doi:10.5120/ijca2019919465 · Cited by 4
Discrete logarithm for nilpotent groups and cryptanalysis of polylinear cryptographic system
Романьков, В. А. (2019) · Prikladnaya diskretnaya matematika Prilozhenie · doi:10.17223/2226308x/12/44 · Cited by 4
Femtosecond laser direct writing of optical quantum logic gates
Zhang, Q., Li, M., Gong, Q., & Li, Y. (2019) · Acta Physica Sinica · doi:10.7498/aps.68.20190024 · Cited by 4
WalnutDSA™: a group theoretic digital signature algorithm
Anshel, I. L., Atkins, D., Goldfeld, D. M., & Gunnells, P. E. (2020) · International Journal of Computer Mathematics Computer Systems Theory · doi:10.1080/23799927.2020.1831613 · Cited by 4
Integrated information storage and transfer with a coherent magnetic device
Jia, N., Banchi, L., Bayat, A., et al. (2015) · UCL Discovery (University College London) · Cited by 4
Blockchain technology: Theory and practice
Cherukupally, S. (2020) · Handbook of statistics · doi:10.1016/bs.host.2020.10.001 · Cited by 4
Link prediction using discrete-time quantum walk
Qian, J., Yang, L., Yu, Z., & Liu, S. (2017) · Tehnicki vjesnik - Technical Gazette · doi:10.17559/tv-20160104014155 · Cited by 4
Complexity of Eccentricities and All-Pairs Shortest Paths in the Quantum CONGEST Model
Wang, C., Wu, X., & Yao, P. (2021) · SPIN · doi:10.1142/s2010324721400075 · Cited by 4
Quantum Computing for Dealing with Inaccurate Knowledge Related to the Certainty Factors Model
Moret‐Bonillo, V., Magaz-Romero, S., & Mosqueira-Rey, E. (2022) · Mathematics · doi:10.3390/math10020189 · Cited by 4
Post-Quantum Cryptography: A Solution to Quantum Computing on Security Approaches
Tandel, P., & Nasriwala, J. (2022) · Lecture notes in networks and systems · doi:10.1007/978-981-16-5640-8_46 · Cited by 4
Localization of space-inhomogeneous three-state quantum walks
Kiumi, C. (2022) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ac6998 · Cited by 4
An improved quantum algorithm for the quantum learning with errors problem
Wang, Y., Jiang, H., Ma, Z., et al. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03507-8 · Cited by 4
Quantum strategy of population initialization in genetic algorithm
Kim, J. S., & Ahn, C. W. (2022) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3520304.3529010 · Cited by 4
A Scrutiny Review of CPS 4.0-Based Blockchain With Quantum Resistance
Joshi, C., Bhole, C., & Vaswani, N. (2022) · Advances in data mining and database management book series · doi:10.4018/978-1-6684-5072-7.ch007 · Cited by 4
BCsRNG: A Secure Random Number Generator Based on Blockchain
Hsieh, C.-H., Yao, X., Zhang, Q., Lv, M., Wang, R., & Ni, B. (2022) · IEEE Access · doi:10.1109/access.2022.3206450 · Cited by 4
A QCNN Algorithm Deployed on A Quantum Computer
Chen, X., Jiang, B., Wu, Y., & Ye, Y. (2022) · International Conference on Computing, Communication, Perception and Quantum Technology (CCPQT) · doi:10.1109/ccpqt56151.2022.00074 · Cited by 4
Message Recovery Attack of Kyber Based on Information Leakage in Decoding Operation
Shi, M., Wang, Z., Peng, T., et al. (2023) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-031-25538-0_33 · Cited by 4
Ying, L., Gong, Y., Huang, W., Cai, J., Xu, N., & Li, K. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-28124-2_32 · Cited by 6
Quantum security analysis of Rocca
Anand, R., & Isobe, T. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03908-3 · Cited by 5
A Quantum-Safe Public-Key-Algorithms Approach with Lattice-Based Scheme
Eich, B., Grote, O., & Ahrens, A. (2023) · International Interdisciplinary PhD Workshop (IIPhDW) · doi:10.1109/iiphdw54739.2023.10124431 · Cited by 4
Classical and Quantum Processing in the Deep Physical Layer
Migliore, M. D. (2023) · IEEE Access · doi:10.1109/access.2023.3280452 · Cited by 4
A Quantum Annealing Solution to the Job Shop Scheduling Problem
Aggoune, R., & Deleplanque, S. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-37105-9_28 · Cited by 4
A universal quantum algorithm for weighted maximum cut and Ising problems
Meli, N. K., Mannel, F., & Lellmann, J. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04025-x · Cited by 4
Quantum-Inspired Network Optimization in 6G: Opportunities, Challenges and Open Research Directions
Bouchmal, O., Cimoli, B., Stabile, R., Olmos, J. J. V., & Monroy, I. T. (2023) · Lecture notes in networks and systems · doi:10.1007/978-3-031-38318-2_48 · Cited by 4
NISQ-Ready Community Detection Based on Separation-Node Identification
Stein, J., Ott, D., Nüßlein, J., Bucher, D., Schönfeld, M., & Feld, S. (2023) · Mathematics · doi:10.3390/math11153323 · Cited by 4
Classical and Quantum 3 and 4-Sieves to Solve SVP with Low Memory
Chailloux, A., & Loyer, J. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-40003-2_9 · Cited by 4
Improved Estimation of Key Enumeration with Applications to Solving LWE
Budroni, A., & Mårtensson, E. (2023) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit54713.2023.10206474 · Cited by 4
A Graph-Based Approach for Modelling Quantum Circuits
Alonso, D., Sánchez, P., & Álvarez, B. (2023) · Applied Sciences · doi:10.3390/app132111794 · Cited by 4
Analysis of Atom against quantum attacks
Anand, R., Nandi, R., & Isobe, T. (2023) · IET Quantum Communication · doi:10.1049/qtc2.12076 · Cited by 6
QPulseLib: Accelerating the Pulse Generation of Quantum Circuit with Reusable Patterns
Tian, W., Jia, X., Tan, S., Song, Z., Lu, L., & Yin, J. (2023) · doi:10.1109/iccad57390.2023.10323711 · Cited by 4
Ali, N. A. M., & Ali, F. A. M. (2023) · Journal of Applied Engineering and Technological Science (JAETS) · doi:10.37385/jaets.v5i1.3125 · Cited by 4
Yuan, P., & Zhang, S. (2025) · Quantum · doi:10.22331/q-2025-05-28-1757 · Cited by 15
Empowering complex-valued data classification with the variational quantum classifier
Chen, J., & Li, Y. (2024) · Frontiers in Quantum Science and Technology · doi:10.3389/frqst.2024.1282730 · Cited by 4
Introduction to quantum federated machine learning
Chen, S. Y.-C., & Yoo, S. (2024) · Elsevier eBooks · doi:10.1016/b978-0-44-319037-7.00027-2 · Cited by 5
Zérosdetect: Phishing URL Detection with Quantum-Driven Zero-shot Learning
Bangroo, I. S., & Kumar, R. (2023) · doi:10.1109/icsc60394.2023.10440725 · Cited by 4
Experience in teaching quantum computing with hands-on programming labs
Galetto, F., López, H. H., Rahmati, M., et al. (2024) · The Journal of Supercomputing · doi:10.1007/s11227-024-06001-3 · Cited by 4
Tonchev, H., & Danev, P. (2024) · Results in Physics · doi:10.1016/j.rinp.2024.107595 · Cited by 4
A Post-Quantum End-to-End Encryption Protocol
Sharma, S., Tripathi, M., Sahu, H. K., & Karan, A. (2023) · IEEE International Conference on Advanced Networks and Telecommunications Systems · doi:10.1109/ants59832.2023.10469296 · Cited by 5
Solving Confirmation Time in Sharded Blockchain with PFQN
Wu, J., Du, H., Chen, J., et al. (2024) · Electronics · doi:10.3390/electronics13071220 · Cited by 4
Quantum Implementation of AIM: Aiming for Low-Depth
Jang, K., Oh, Y., Kim, H., & Seo, H. (2024) · Applied Sciences · doi:10.3390/app14072824 · Cited by 5
VDOO: A Short, Fast, Post-quantum Multivariate Digital Signature Scheme
Ganguly, A., Karmakar, A., & Saxena, N. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-56235-8_10 · Cited by 4
Circuit Width Estimation via Effect Typing and Linear Dependency
Colledan, A., & Lago, U. D. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-57267-8_1 · Cited by 4
New simultaneous Diophantine attacks on generalized RSA key equations
Ruzai, W. N. A., Ariffin, M. R. K., Asbullah, M. A., & Ghafar, A. H. A. (2024) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2024.102074 · Cited by 4
Quantum Algorithm for Computing Distances between Subspaces
Nghiem, N. A. (2023) · Physics Letters A · doi:10.1016/j.physleta.2024.129610 · Cited by 5
Mixed-Dimensional Qudit State Preparation Using Edge-Weighted Decision Diagrams
Mato, K., Hillmich, S., & Wille, R. (2024) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/3649329.3656260 · Cited by 4
An ensemble variational quantum algorithm for non-Markovian quantum dynamics
Walters, P., Tsakanikas, J., & Wang, F. (2024) · Physical Chemistry Chemical Physics · doi:10.1039/d4cp01669f · Cited by 4
Quantum Computing for Supply Chain Optimization
Kaswan, K. S. (2024) · Advances in logistics, operations, and management science book series · doi:10.4018/979-8-3693-4107-0.ch001 · Cited by 4
Using Quantum Computers In Control: Interval Matrix Properties
Schneider, J., & Berberich, J. (2024) · European Control Conference (ECC) · doi:10.23919/ecc64448.2024.10591197 · Cited by 4
Quantum Revolution in Space: Enhancing Space Technology
Landers, V. S. (2024) · Space Law and Policy · doi:10.1007/978-3-031-64045-2_3 · Cited by 4
A Quantum Image Secret Sharing Scheme Based on Designated Multi‐Verifier Signature
Wang, Y., Xu, G., & Jiang, D. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202400267 · Cited by 4
Overview of Digital Quantum Simulator: Applications and Comparison with Latest Methods
Tang, H., Simancas-García, J. L., Mai, J., Cheng, M., Iqbal, I., & Por, L. Y. (2024) · SPIN · doi:10.1142/s2010324724400046 · Cited by 4
Recovering the Original Simplicity: Succinct and Exact Quantum Algorithm for the Welded Tree Problem
Li, G., Li, L., & Luo, J. (2024) · Algorithmica · doi:10.1007/s00453-024-01273-w · Cited by 5
Automated Reasoning in Quantum Circuit Compilation
Thanos, D., Villoria, A., Brand, S., Quist, A.-J., Mei, J., Coopmans, T. J., & Laarman, A. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-66149-5_6 · Cited by 4
Choi, S., & Lee, W. (2024) · AIMS Mathematics · doi:10.3934/math.20241493 · Cited by 4
Hierarchical Quantum Secret Sharing Based On Quantum Fourier Transform
Chen, K., Cai, B., Lin, S., et al. (2024) · International Journal of Theoretical Physics · doi:10.1007/s10773-024-05864-9 · Cited by 4
Introducing quantum computing to high school students with Grover's search algorithm
Hannum, M. (2024) · American Journal of Physics · doi:10.1119/5.0228847 · Cited by 4
Akrom, M., Herowati, W., & Setiadi, D. R. I. M. (2025) · Journal of Computing Theories and Applications · doi:10.62411/jcta.11779 · Cited by 13
Graph-Based Identification of Qubit Network (GidNET) for Qubit Reuse
Uchehara, G., Aamodt, T. M., & Matteo, O. D. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00131 · Cited by 4
Effective Embedding of Integer Linear Inequalities for Variational Quantum Algorithms
Hess, M., Palackal, L., Awasthi, A., & Wintersperger, K. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00035 · Cited by 4
A Quantum Framework for Combinatorial Optimization Problem over Graphs
Shi, M., Wu, S., Li, Y., et al. (2025) · Data Science and Engineering · doi:10.1007/s41019-024-00269-4 · Cited by 4
Tight Bounds on the Spooky Pebble Game: Recycling Qubits with Measurements
Kornerup, N., Sadun, J., & Soloveichik, D. (2025) · Quantum · doi:10.22331/q-2025-02-18-1636 · Cited by 8
Berberich, J., Kosut, R. L., & Schulte‐Herbrüggen, T. (2024) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc56724.2024.10886787 · Cited by 7
Classical and Quantum Generic Attacks on 6-Round Feistel Schemes
Chartouny, M., Cogliati, B., & Patarin, J. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-82841-6_4 · Cited by 4
Childs, A. M., Kothari, R., Kovacs-Deak, M., Sundaram, A., & Wang, D. (2025) · ACM Transactions on Quantum Computing · doi:10.1145/3723884 · Cited by 26
Design and optimization of the multi-valued quantum adder
Ai, J.-W., Zhang, T.-Y., Lu, S.-W., Bai, M.-Q., & Mo, Z. (2025) · Physica Scripta · doi:10.1088/1402-4896/adc2b6 · Cited by 4
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
