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 3,701–3,800 of 8,792
A (k, n)-threshold dynamic quantum secure multiparty multiplication protocol
Li, F., Hu, H., & Zhu, S. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03743-y · Cited by 6
A quantum algorithm for syndrome decoding of classical error-correcting linear block codes
Bhattacharyya, M., & Raina, A. (2022) · IEEE/ACM Symposium on Edge Computing (SEC) · doi:10.1109/sec54971.2022.00069 · Cited by 6
Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks
Mironowicz, P. (2023) · New Journal of Physics · doi:10.1088/1367-2630/acb22d · Cited by 7
Combating errors in quantum communication: an integrated approach
Bala, R., Asthana, S., & Ravishankar, V. (2023) · Scientific Reports · doi:10.1038/s41598-023-30178-x · Cited by 7
Hardness of Braided Quantum Circuit Optimization in the Surface Code
Wasa, K., Nishio, S., Suetsugu, K., Hanks, M., Stephens, A. M., Yokoi, Y., & Nemoto, K. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3251358 · Cited by 7
Recent Trends and Open Challenges in Blind Quantum Computation
Joshi, M., Karthikeyan, S., & Mishra, M. K. (2023) · Communications in computer and information science · doi:10.1007/978-3-031-28183-9_34 · Cited by 7
Burst error-correcting quantum stabilizer codes designed from idempotents
Ong, K. L. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03904-7 · Cited by 6
Research on Key Technologies of Controlled Bidirectional Quantum Teleportation
Yang, X., Li, D., Zhou, J., et al. (2023) · International Journal of Theoretical Physics · doi:10.1007/s10773-022-05256-x · Cited by 6
Multilayered logical qubits and synthesized quantum bits
Jin, K., & Cha, G. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/accec5 · Cited by 6
Parameter-parallel distributed variational quantum algorithm
Niu, Y.-F., Zhang, S., Ding, C., Bao, W., & Huang, H.-L. (2023) · SciPost Physics · doi:10.21468/scipostphys.14.5.132 · Cited by 10
Post-quantum Techniques in Wireless Network Security: An Overview
Fakhruldeen, H. F., Al-Kaabi, R. A., Jabbar, F. I., et al. (2023) · Malaysian Journal of Fundamental and Applied Sciences · doi:10.11113/mjfas.v19n3.2905 · Cited by 6
Depth Optimization of FLT-Based Quantum Inversion Circuit
Larasati, H. T., Putranto, D. S. C., Wardhani, R. W., Park, J., & Kim, H. (2023) · IEEE Access · doi:10.1109/access.2023.3280632 · Cited by 8
Maintaining Secure Level on Symmetric Encryption under Quantum Attack
Shiu, H.-J., Yang, C., Tsai, Y.-R., Lin, W., & Lai, C.-M. (2023) · Applied Sciences · doi:10.3390/app13116734 · Cited by 6
Datta, K., Kole, A., Sengupta, I., & Drechsler, R. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-38100-3_14 · Cited by 6
Optimizing Quantum Space Using Spooky Pebble Games
Quist, A.-J., & Laarman, A. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-38100-3_10 · Cited by 6
Ulitzsch, V. Q., & Seifert, J. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-40003-2_18 · Cited by 6
Matrix Encryption Walks for Lightweight Cryptography
Dunmore, A., Samandari, J., & Jang‐Jaccard, J. (2023) · Cryptography · doi:10.3390/cryptography7030041 · Cited by 6
Sim, M., Eum, S., Song, G., et al. (2023) · Sensors · doi:10.3390/s23177558 · Cited by 6
Quantum-inspired Computing: Entanglement-enhanced Technique for Short Portfolio in Global Markets
Jiang, Y.-C., Lai, Y.-T., Chen, P.-C., et al. (2023) · IEEE International Conference on Nanotechnology (IEEE-NANO) · doi:10.1109/nano58406.2023.10231234 · Cited by 6
Modelling and verification of post-quantum key encapsulation mechanisms using Maude
García, V. M., Escobar, S., Ogata, K., et al. (2023) · PeerJ Computer Science · doi:10.7717/peerj-cs.1547 · Cited by 6
Experimental simulation of the quantum secure direct communication using MATLAB and Simulink
Gupta, S. (2023) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-023-04532-x · Cited by 6
MPMCT gate decomposition method reducing T-depth quickly in proportion to the number of work qubits
Lee, J., Kang, Y., Lee, Y.-S., Chung, B., & Choi, D. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04142-7 · Cited by 7
Determination of the number of shots for Grover’s search algorithm
Kessler, M., Alonso, D., & Sánchez, P. (2023) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-023-00204-y · Cited by 9
Training and meta-training an ensemble of binary neural networks with quantum computing
Leal, D. V., Araujo, I. F., & da Silva, A. J. (2023) · Neurocomputing · doi:10.1016/j.neucom.2023.127169 · Cited by 6
Integer multiple quantum image scaling based on NEQR and bicubic interpolation
蔡, S. 硕. C., 周, R.-G. 日. Z., 罗, J. 佳. L., et al. (2024) · Chinese Physics B · doi:10.1088/1674-1056/ad1b40 · Cited by 6
Important Quantum Gates for Quantum Algorithms of Travelling Salesman Problem
Sinaga, T. J. H., Anwar, K., Amalia, N., Sunnardianto, G. K., & Budiman, G. (2023) · International Conference on Artificial Intelligence, Blockchain, Cloud Computing, and Data Analytics (ICoABCD) · doi:10.1109/icoabcd59879.2023.10390921 · Cited by 6
Securing Synchrophasors Using Data Provenance in the Quantum Era
Javed, K., Khan, M. A., Ullah, M., Aman, M. N., & Sikdar, B. (2024) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2024.3372524 · Cited by 6
MiRitH: Efficient Post-Quantum Signatures from MinRank in the Head
Adj, G., Barbero, S., Bellini, E., et al. (2024) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2024.i2.304-328 · Cited by 6
An introduction to quantum computing for statisticians and data scientists
Lopatnikova, A., Tran, M., & Sisson, S. A. (2024) · Foundations of Data Science · doi:10.3934/fods.2024013 · Cited by 13
On the Two-sided Permutation Inversion Problem
Alagic, G., Bai, C., Poremba, A., & Shi, K. (2024) · IACR Communications in Cryptology · doi:10.62056/a0qj89n4e · Cited by 12
Qubit Mapping Based on Tabu Search
Jiang, H., Deng, Y., & Xu, M. Q. (2024) · Journal of Computer Science and Technology · doi:10.1007/s11390-023-2121-5 · Cited by 7
Dynamic Realization of Multiple Control Toffoli Gate
Kole, A., Deb, A., Datta, K., et al. (2024) · doi:10.23919/date58400.2024.10546695 · Cited by 6
An introduction to variational quantum algorithms for combinatorial optimization problems
Grange, C., Poss, M., & Bourreau, E. (2024) · Annals of Operations Research · doi:10.1007/s10479-024-06253-5 · Cited by 9
de Griend, A. M.-V. (2024) · Journal of Systems and Software · doi:10.1016/j.jss.2024.112224 · Cited by 13
Protección de datos personales en la era de la computación cuántica y sus desafíos legales
Barzola-Plúas, Y. G., Samaniego-Quiguiri, D. P., Núñez-Ribadeneyra, R. A., et al. (2023) · Revista Científica Ciencia y Método · doi:10.55813/gaea/rcym/v1/n3/19 · Cited by 6
Classical and quantum-inspired electromagnetism-like mechanism for solving 0/1 knapsack problems
Chou, Y., Chang, C.-C., Chiu, C.-H., Lin, F.-J., Yang, Y.-J., & Peng, Z.-Y. (2010) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/icsmc.2010.5642288 · Cited by 6
Workflow of the Grover algorithm simulation incorporating CUDA and GPGPU
Lu, X., Yuan, J., & Zhang, W. (2013) · Computer Physics Communications · doi:10.1016/j.cpc.2013.03.017 · Cited by 6
From classical computing to quantum computing
Barila, A. (2014) · International Conference on Development and Application Systems (DAS) · doi:10.1109/daas.2014.6842455 · Cited by 6
On the efficiency of Hamiltonian-based quantum computation for low-rank matrices
Cao, Z., & Elgart, A. (2012) · Journal of Mathematical Physics · doi:10.1063/1.3690045 · Cited by 6
Quantum Gates and Quantum Algorithms with Clifford Algebra Technique
Gregorič, M., & Borštnik, N. S. M. (2008) · International Journal of Theoretical Physics · doi:10.1007/s10773-008-9826-7 · Cited by 6
Transparallel mind: classical computing with quantum power
van der Helm, P. A. (2015) · Artificial Intelligence Review · doi:10.1007/s10462-015-9429-7 · Cited by 6
Problem-Solution Symmetry in Grover’s Quantum Search Algorithm
Morikoshi, F. (2011) · International Journal of Theoretical Physics · doi:10.1007/s10773-011-0701-6 · Cited by 6
Self-Tuning PID Controller Based on Quantum Swarm Evolution Algorithm
Huang, Y., Qu, L., & Tian, Y. (2008) · International Conference on Natural Computation (ICNC) · doi:10.1109/icnc.2008.458 · Cited by 6
Simulation Research of the QoS Multicast Routing in WSN Based on QPSO Algorithm
You-rui, H., Tian, Y., & Chaoli, T. (2009) · doi:10.1109/iita.2009.364 · Cited by 6
A novel Real-coded Quantum Genetic Algorithm in radiation pattern synthesis for smart antenna
Liu, M., Yuan, C., & Huang, T. (2007) · IEEE International Conference on Robotics and Biomimetics (ROBIO) · doi:10.1109/robio.2007.4522478 · Cited by 6
Brańczyk, A. M. (2010) · Cited by 6
Simmons, M. Y. (2015) · Technical digest - International Electron Devices Meeting/Technical digest · doi:10.1109/iedm.2015.7409608 · Cited by 6
Johnston, E. R. (2016) · ACM SIGGRAPH Talks · doi:10.1145/2897839.2927422 · Cited by 7
Geometric entanglement and quantum phase transition in generalized cluster-XY models
Deger, A., & Wei, T.-C. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2439-7 · Cited by 7
Quantum Collision-Finding in Non-uniform Random Functions
Balogh, M., Eaton, E., & Song, F. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-79063-3_22 · Cited by 7
Castagnoli, G. (2018) · Foundations of Physics · doi:10.1007/s10701-018-0146-3 · Cited by 5
Remote Attestation for Low-End Prover Devices with Post-Quantum Capabilities
Liu, X., Misoczki, R., & Sastry, M. R. (2018) · ACM Conference on Data and Application Security and Privacy (CODASPY) · doi:10.1145/3176258.3176324 · Cited by 6
Efficient Quantum Algorithms of Finding the Roots of a Polynomial Function
Nagata, K., Nakamura, T., Geurdes, H. J. F., Batle, J. A. I., Farouk, A., Diep, D. N., & Patro, S. K. (2018) · International Journal of Theoretical Physics · doi:10.1007/s10773-018-3776-5 · Cited by 7
Rossi, M. A. C., Cattaneo, M., Paris, M. G. A., & Maniscalco, S. (2018) · Quantum Measurements and Quantum Metrology · doi:10.1515/qmetro-2018-0003 · Cited by 7
A quantum solution for efficient use of symmetries in the simulation of many-body systems
Schmitz, A. T., & Johri, S. (2020) · npj Quantum Information · doi:10.1038/s41534-019-0232-1 · Cited by 6
A novel quantum steganography scheme based on ASCII
Luo, J., Zhou, R., Liu, X., et al. (2019) · International Journal of Quantum Information · doi:10.1142/s0219749919500333 · Cited by 6
MapEff: An Effective Graph Isomorphism Agorithm Based on the Discrete-Time Quantum Walk
Liu, K., Zhang, Y., Lü, K., Wang, X., Wang, X., & Tian, G. (2019) · Entropy · doi:10.3390/e21060569 · Cited by 6
Wicik, R., & Borowski, M. (2020) · doi:10.1117/12.2565467 · Cited by 6
A quantum algorithm for automata encoding
Tsai, E., & Perkowski, M. A. (2020) · Facta universitatis - series Electronics and Energetics · doi:10.2298/fuee2002169t · Cited by 6
The Power of Few Qubits and Collisions – Subset Sum Below Grover’s Bound
Helm, A., & May, A. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-44223-1_24 · Cited by 8
Non-invertible key exchange protocol
Lizama-Pérez, L. A. (2020) · SN Applied Sciences · doi:10.1007/s42452-020-2791-3 · Cited by 6
Partial Boolean Functions With Exact Quantum Query Complexity One
Xu, G., & Qiu, D. (2021) · Entropy · doi:10.3390/e23020189 · Cited by 9
Quantum Attacks on HCTR and Its Variants
Rahman, M., & Paul, G. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.3041426 · Cited by 6
Improving the Designs of Nearest Neighbour Quantum Circuits for 1D and 2D Architectures
Bandyopadhyay, C., Bhattacharjee, A., Wille, R., et al. (2020) · IETE Journal of Research · doi:10.1080/03772063.2020.1822215 · Cited by 6
Computation and Dynamics: Classical and Quantum
Kisil, V. (2010) · White Rose Research Online (University of Leeds, The University of Sheffield, University of York) · Cited by 6
Implicit Authentication in Neural Key Exchange Based on the Randomization of the Public Blockchain
Noh, S., & Rhee, K.-H. (2020) · IEEE International Conference on Blockchain (Blockchain) · doi:10.1109/blockchain50366.2020.00079 · Cited by 6
Quantum Algorithms for Solving Linear Regression Equation
Li, K., Dai, H., Feng, J., Gao, M., Xue, B., Wang, P. P., & Zhang, M. (2021) · Journal of Physics Conference Series · doi:10.1088/1742-6596/1738/1/012063 · Cited by 6
Blockchain-Empowered Mobile Edge Intelligence, Machine Learning and Secure Data Sharing
Du, Y., Miao, S., Tong, Z., Lemieux, V. L., & Wang, Z. (2021) · IntechOpen eBooks · doi:10.5772/intechopen.96618 · Cited by 6
Breaking LWC candidates: sESTATE and Elephant in quantum setting
Shi, T., Wu, W., Hu, B., Guan, J., & Wang, S. (2021) · Designs Codes and Cryptography · doi:10.1007/s10623-021-00875-7 · Cited by 6
(Quantum) Collision Attacks on Reduced Simpira v2
Ni, B., Dong, X., Jia, K., et al. (2021) · IACR Transactions on Symmetric Cryptology · doi:10.46586/tosc.v2021.i2.222-248 · Cited by 6
Buhrman, H., Loff, B., Patro, S., & Speelman, F. (2021) · arXiv (Cornell University) · doi:10.4230/lipics.itcs.2022.31 · Cited by 9
From Boolean functions to quantum circuits: A scalable quantum compilation flow in C++
Schmitt, B. D. O., Mozafari, F., Meuli, G., Riener, H., & Micheli, G. D. (2021) · Design, Automation, and Test in Europe · doi:10.23919/date51398.2021.9474237 · Cited by 6
PQ-FLAT: A New Quantum-Resistant And Lightweight Authentication Approach for M2M Devices
Karacan, E., Akleylek, S., & Karakaya, A. (2021) · International Symposium on Digital Forensics and Security (ISDFS) · doi:10.1109/isdfs52919.2021.9486341 · Cited by 6
Preparation of Quantum Superposition Using Partial Negation
Anwer, S., Younes, A., Elkabani, I., & Elsayed, A. (2022) · IEEE Access · doi:10.1109/access.2022.3151196 · Cited by 6
Classical and Quantum Algorithms for Assembling a Text from a Dictionary
Khadiev, K. R., & Remidovskii, V. (2021) · Nonlinear Phenomena in Complex Systems · doi:10.33581/1561-4085-2021-24-3-207-221 · Cited by 6
Optimizing Link-Level Entanglement Generation in Quantum Networks with Unequal Link Lengths
Pathumsoot, P., Benchasattabuse, N., Satoh, R., et al. (2021) · International Computer Science and Engineering Conference · doi:10.1109/icsec53205.2021.9684634 · Cited by 6
Qiskit As a Simulation Platform for Measurement-based Quantum Computation
Kashif, M., & Al-Kuwari, S. M. (2022) · IEEE International Conference on Software Architecture Companion (ICSA-C) · doi:10.1109/icsa-c54293.2022.00037 · Cited by 7
Progress of quantum entanglement in a trapped-ion based quantum computer
Yum, D., & Choi, T. (2022) · Current Applied Physics · doi:10.1016/j.cap.2022.06.011 · Cited by 6
Public key cryptography based on twisted dihedral group algebras
de la Cruz, J., & Villanueva-Polanco, R. (2022) · Advances in Mathematics of Communications · doi:10.3934/amc.2022031 · Cited by 10
Quantum secure two-party Euclidean distance computation based on mutually unbiased bases
Cao, Y. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03611-9 · Cited by 6
A Parallel Quantum Circuit Implementations of LSH Hash Function for Use with Grover’s Algorithm
Song, G., Jang, K., Kim, H., & Seo, H. (2022) · Applied Sciences · doi:10.3390/app122110891 · Cited by 6
Graph Neural Networks for Idling Error Mitigation
Saravanan, V., & Saeed, S. M. (2022) · International Conference on Computer Aided Design · doi:10.1145/3508352.3549444 · Cited by 6
EQUAL: Improving the Fidelity of Quantum Annealers by Injecting Controlled Perturbations
Ayanzadeh, R., Das, P., Tannu, S., & Qureshi, M. K. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00074 · Cited by 8
The Optimization and Application of 3-Bit Hermitian Gates and Multiple Control Toffoli Gates
Li, H.-S. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2022.3210705 · Cited by 6
Modified Iterative Quantum Amplitude Estimation is Asymptotically Optimal
Fukuzawa, S., Ho, C., Irani, S., et al. (2023) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611977561.ch12 · Cited by 6
Quantum discriminative canonical correlation analysis
Li, Y., Liu, H., Pan, S., Qin, S., Gao, F., & Wen, Q. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03909-2 · Cited by 6
An Entanglement-Based Protocol for Simultaneous Reciprocal Information Exchange between 2 Players
Andronikos, T., & Sirokofskich, A. (2023) · Electronics · doi:10.3390/electronics12112506 · Cited by 9
Quantum speedup for solving the minimum vertex cover problem based on Grover search algorithm
Wang, Z., Liang, K., Bao, X., & Wu, T. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04010-4 · Cited by 6
Breaking symmetric cryptosystems using the offline distributed Grover-meets-Simon algorithm
Zhou, B.-M., & Yuan, Z. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04089-9 · Cited by 6
Verification and Validation of Complex Systems
Youssef, H. M. (2011) · SAE technical papers on CD-ROM/SAE technical paper series · doi:10.4271/2011-01-2530 · Cited by 7
Evolving cellular automata by parallel quantum genetic algorithm
Laboudi, Z., & Chıkhı, S. (2009) · doi:10.1109/ndt.2009.5272212 · Cited by 6
Adame, J. I., & Warzel, S. (2015) · Journal of Mathematical Physics · doi:10.1063/1.4934723 · Cited by 6
A Quantum Implementation Model for Artificial Neural Networks
Daskin, A. (2018) · Quanta · doi:10.12743/quanta.v7i1.65 · Cited by 7
Yalouz, S., Falvo, C., & Pouthier, V. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1592-0 · Cited by 6
Automated Quantum Circuit Synthesis and Cost Estimation for the Binary Welded Tree Oracle
Ghosh, M., Chakrabarti, A., & Jha, N. K. (2017) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/3060582 · Cited by 6
First-order quantum phase transitions as condensations in the space of states
Ostilli, M., & Presilla, C. (2020) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/aba144 · Cited by 6
Paramos sistema investuotojui valiutų rinkoje
Maknickienė, N. (2015) · doi:10.20334/2310-m · Cited by 6
Optimal quantum-walk search on Kronecker graphs with dominant or fixed regular initiators
Glos, A., & Wong, T. G. (2018) · Physical Review A · doi:10.1103/physreva.98.062334 · Cited by 6
Robust Diabatic Grover Search by Landau–Zener–Stückelberg Oscillations
Atia, Y., Oren, Y., & Katz, N. (2019) · Entropy · doi:10.3390/e21100937 · Cited by 6
Forecasting Financial Risk using Quantum Neural Networks
Bouchti, A. E., Tribis, Y., Nahhal, T., et al. (2019) · Journal of Information Security Research · doi:10.6025/jisr/2019/10/3/97-104 · Cited by 6
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
