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,001–4,100 of 8,792
An Enhanced Quantum PageRank Algorithm Integrated with Quantum Search
Wang, H., Wu, J., Yang, X., Chen, P., & Yi, X. (2014) · International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS) · doi:10.1109/imis.2014.10 · Cited by 5
Quantum computing measurement and intelligence
Ezziane, Z. (2009) · International Journal of Quantum Chemistry · doi:10.1002/qua.22056 · Cited by 5
Computing with quanta—impacts of quantum theory on computation
Hirvensalo, M. (2002) · Theoretical Computer Science · doi:10.1016/s0304-3975(02)00096-8 · Cited by 5
On the Guidance of Reversible Logic Synthesis by Dynamic Variable Reordering
Feinstein, D. Y., & Thornton, M. A. (2009) · Proceedings/Proceedings - International Symposium on Multiple-Valued Logic · doi:10.1109/ismvl.2009.31 · Cited by 5
Chang, B. R., Young, C.-P., Tsai, H. F., et al. (2008) · International Conference on Intelligent Systems Design and Applications (ISDA) · doi:10.1109/isda.2008.271 · Cited by 5
QBIST: Quantum Built-in Self-Test for any Boolean Circuit
Chou, Y., Kuo, S., & Tsai, I.-M. (2008) · Proceedings - IEEE VLSI Test Symposium/Proceedings of the ... IEEE VLSI Test Symposium · doi:10.1109/vts.2008.49 · Cited by 5
On the Skipped Variables of Quantum Multiple-Valued Decision Diagrams
Feinstein, D. Y., & Thornton, M. A. (2011) · Proceedings/Proceedings - International Symposium on Multiple-Valued Logic · doi:10.1109/ismvl.2011.22 · Cited by 5
Quantum key distribution and cryptography: a survey
Alléaume, R., Lütkenhaus, N., Renner, R., Grangier, P., Debuisschert, T., Ribordy, G., Gisin, N., Painchault, P., Pornin, T., Slavail, L., et al. (2010) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/dagsemproc.09311.3 · Cited by 5
Quantum-Logic Synthesis of Hermitian Gates
Arabzadeh, M., Houshmand, M., Sedighi, M., & Zamani, M. S. (2015) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/2794263 · Cited by 5
Parallel Simulation of Quantum Search
Caraiman, S., & Manta, V. (2010) · International Journal of Computers Communications & Control · doi:10.15837/ijccc.2010.5.2219 · Cited by 5
Quantum circuit physical design flow for the multiplexed trap architecture
Mohammadzadeh, N., & Elaheh, T. (2016) · Microprocessors and Microsystems · doi:10.1016/j.micpro.2016.02.018 · Cited by 5
Optimization of One-Way Quantum Computation Measurement Patterns
Eslamy, M., Houshmand, M., Zamani, M. S., & Sedighi, M. (2018) · International Journal of Theoretical Physics · doi:10.1007/s10773-018-3844-x · Cited by 8
Ancilla-Assisted Measurement of Quantum Work
Chiara, G. D., Solinas, P., Cerisola, F., & Roncaglia, A. J. (2018) · Fundamental theories of physics · doi:10.1007/978-3-319-99046-0_14 · Cited by 9
Single-photon heralded two-qubit unitary gates for pairs of nitrogen-vacancy centers in diamond
Liu, C., Dutt, M. V. G., & Pekker, D. (2018) · Physical Review A · doi:10.1103/physreva.98.052342 · Cited by 5
A Modified Quantum Search Algorithm
Mehri‐Dehnavi, H., Dashtianeh, H., Kuchaksaraei, H. Y., Khoshdareh, M. M., Movahhedian, H., & Rahimi, R. (2018) · International Journal of Theoretical Physics · doi:10.1007/s10773-018-3880-6 · Cited by 5
Introducing Quantum Engineering
Long, G., Müeller, P. R., & Patterson, J. (2019) · Quantum Engineering · doi:10.1002/que2.6 · Cited by 5
Blockchain-Based Decentralized Key Management System with Quantum Resistance
An, H., Choi, R., & Kim, K. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-17982-3_18 · Cited by 5
One Additional Qubit is Enough: Encoded Embeddings for Boolean Components in Quantum Circuits
Zulehner, A., Niemann, P., Drechsler, R., & Wille, R. (2019) · IEEE International Symposium on Multiple-Valued Logic · doi:10.1109/ismvl.2019.00009 · Cited by 3
On the Probability of Finding Marked Connected Components Using Quantum Walks
Khadiev, K. R., Nahimovs, N., & Santos, R. A. M. (2018) · Lobachevskii Journal of Mathematics · doi:10.1134/s1995080218070144 · Cited by 5
Complete analysis of Simon’s quantum algorithm with additional collisions
Shi, T., Jin, C., Hu, B., Guan, J., Cui, J.-Y., & Wang, S. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2444-x · Cited by 5
Strong Privacy-preserving Two-party Scalar Product Quantum Protocol
Shi, R., & Zhang, M. (2019) · International Journal of Theoretical Physics · doi:10.1007/s10773-019-04296-0 · Cited by 5
Quantum search on Hanoi network
Giri, P. R., & Korepin, V. E. (2019) · International Journal of Quantum Information · doi:10.1142/s0219749919500606 · Cited by 5
Linke, N. M., & Müller, M. (2020) · Physik in unserer Zeit · doi:10.1002/piuz.202001571 · Cited by 5
Adder Circuit on IBM Universal Quantum Computers
Methachawalit, W., & Chongstitvatana, P. (2020) · International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON) · doi:10.1109/ecti-con49241.2020.9158064 · Cited by 5
Quantum algorithms of state estimators in classical control systems
Li, K., Dai, H., & Zhang, M. (2020) · Science China Information Sciences · doi:10.1007/s11432-019-2706-9 · Cited by 5
Microstate distinguishability, quantum complexity, and the eigenstate thermalization hypothesis
Bao, N., Pollack, J., Wakeham, D., & Wildenhain, E. (2021) · Classical and Quantum Gravity · doi:10.1088/1361-6382/ac0e17 · Cited by 5
Izdebski, A., & de Wolf, R. (2020) · UvA-DARE (University of Amsterdam) · doi:10.48550/arxiv.2009.08360 · Cited by 10
Chiang, C.-F. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02876-2 · Cited by 5
QDLC - THE QUANTUM DEVELOPMENT LIFE CYCLE
Dey, N., Ghosh, M., Chakrabarti, A., & Saha, R. (2026) · doi:10.34218/ijqc_04_01_002 · Cited by 5
Quantum Pliers Cutting the Blockchain
Giusto, E., Vakili, M. G., Gandino, F., Demartini, C. G., & Montrucchio, B. (2020) · IT Professional · doi:10.1109/mitp.2020.2974690 · Cited by 5
Quantum Ciphertext Dimension Reduction Scheme for Homomorphic Encrypted Data
Gong, C., Dong, Z., Gani, A., & Qi, H. (2021) · IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) · doi:10.1109/trustcom53373.2021.00127 · Cited by 5
Coherence and Entanglement Dynamics in Training Variational Quantum Perceptron
Namkung, M., & Kwon, Y. (2020) · Entropy · doi:10.3390/e22111277 · Cited by 5
Software Pipelining for Quantum Loop Programs
Guo, J., & Ying, M. (2022) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2022.3232623 · Cited by 5
QUANTUM ALGORITHMS FOR PROBLEMS IN NUMBER THEORY, ALGEBRAIC GEOMETRY, AND GROUP THEORY
van Dam, W., & Sasaki, Y. (2012) · doi:10.1142/9789814425988_0003 · Cited by 5
Recent progress in atomistic modelling and simulations of donor spin qubits in silicon
Usman, M. (2021) · Computational Materials Science · doi:10.1016/j.commatsci.2021.110280 · Cited by 5
Quantum neural networks with multi-qubit potentials
Ban, Y., Torrontegui, E., & Casanova, J. (2023) · Scientific Reports · doi:10.1038/s41598-023-35867-1 · Cited by 11
Quantum search of matching on signed graphs
Segawa, E., & Yoshie, Y. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03089-x · Cited by 6
Implementation Vulnerability Analysis: A case study on ChaCha of SPHINCS
Satheesh, V., & Shanmugam, D. (2020) · IEEE International Symposium on Smart Electronic Systems (iSES) · doi:10.1109/ises50453.2020.00032 · Cited by 5
Optimal quantum state transformations based on machine learning
Zhao, T.-H., Wang, M., & Zhou, B. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03148-3 · Cited by 5
A quantum search algorithm of two-dimensional convex hull
Wang, C., & Zhou, R. (2021) · Communications in Theoretical Physics · doi:10.1088/1572-9494/ac1da0 · Cited by 5
Towards Compact Modeling of Noisy Quantum Computers: A Molecular-Spin-Qubit Case of Study
Cignoni, M., Cirillo, G. A., Turvani, G., Graziano, M., & Zamboni, M. (2021) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/3474223 · Cited by 5
Cryptocurrencies and Blockchain: Potential Applications in Government and Business
Pestunov, A. I. (2020) · Problems of Economic Transition · doi:10.1080/10611991.2020.1968751 · Cited by 5
Utilizing Computational Complexity to Protect Cryptocurrency Against Quantum Threats: A Review
Gupta, K. D., Nag, A. K., Rahman, M. L., et al. (2021) · IT Professional · doi:10.1109/mitp.2021.3089494 · Cited by 5
Quantum Multi-factor Authentication
Murray, H., & Malone, D. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-93747-8_4 · Cited by 5
Classical and Quantum based Differential Cryptanalysis Methods
Jojan, P., Soni, K. K., & Rasool, A. (2021) · International Conference on Computing, Communication and Networking Technologies (ICCCNT) · doi:10.1109/icccnt51525.2021.9579513 · Cited by 5
Secure two-party integer comparison protocol without any third party
Shi, R., Liu, B., & Zhang, M. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03344-1 · Cited by 5
Quantum time/memory/data tradeoff attacks
Dunkelman, O., Keller, N., Ronen, E., & Adi Shamir, Z. (2023) · Designs Codes and Cryptography · doi:10.1007/s10623-023-01300-x · Cited by 6
Testing Boolean Functions Properties
Xie, Z., Daowen, Q., Cai, G., et al. (2021) · Fundamenta Informaticae · doi:10.3233/fi-2021-2076 · Cited by 5
Robust Quantum Search with Uncertain Number of Target States
Zhu, Y., Wang, Z., Yan, B., et al. (2021) · Entropy · doi:10.3390/e23121649 · Cited by 5
Quantum computations for disambiguation and question answering
Correia, A. D., Michael Moortgat, B., & Stoof, H. T. C. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03441-9 · Cited by 5
The Qubit Fidelity Under Different Error Mechanisms Based on Error Correction Threshold
Li, K. (2022) · Frontiers in Physics · doi:10.3389/fphy.2022.893507 · Cited by 5
Applications of a Quantum Linear System Algorithm to Linear MIMO Detections
Park, J., Seo, Y., & Heo, J. (2022) · IEEE Access · doi:10.1109/access.2022.3164071 · Cited by 5
Cryptographic Primitives in Blockchain Technology
Bolfing, A. (2020) · doi:10.1093/oso/9780198862840.001.0001 · Cited by 5
Controlled Quantum Secure Direct Communication with Authentication Based on Quantum Search Algorithm
Yang, Y.-F., Duan, L., Qiu, T., et al. (2022) · International Journal of Theoretical Physics · doi:10.1007/s10773-022-05138-2 · Cited by 5
Realization of Grover Search Algorithm on the Optical Cavities
Kulagin, A. V., & Ozhigov, Y. (2022) · Lobachevskii Journal of Mathematics · doi:10.1134/s1995080222070162 · Cited by 5
Quantum and Post-Quantum Cybersecurity Challenges and Finance Organizations Readiness
Arshad, R., & Riaz, Q. (2022) · Advances in information security, privacy, and ethics book series · doi:10.4018/978-1-6684-5284-4.ch016 · Cited by 5
Quantum Accelerated Pattern Matching for Genome Sequencing in Complex RNA Secondary Structures
De, R. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00139 · Cited by 5
Machine Learning for Quantum Hardware Performance Assessment
Saravanan, V., & Saeed, S. M. (2022) · IEEE International Conference on Computer Design: VLSI in Computers and Processors (ICCD) · doi:10.1109/iccd56317.2022.00030 · Cited by 5
Verification of Quantum Circuits
Wille, R., & Burgholzer, L. (2022) · Springer eBooks · doi:10.1007/978-981-15-6401-7_43-1 · Cited by 5
Symbolic Execution of Hadamard-Toffoli Quantum Circuits
Carette, J., Ortíz, G., & Sabry, A. (2023) · ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM) · doi:10.1145/3571786.3573018 · Cited by 5
Оценка возможностей классических компьютеров при реализации симуляторов квантовых алгоритмов
Zrelov, P., Zrelov, P. V., Ульянов, С. В., et al. (2022) · Международный журнал Программные продукты и системы · doi:10.15827/0236-235x.140.618-630 · Cited by 5
Evaluation of Quantum Key Distribution for Secure Satellite-integrated IoT Networks
Edwards, A., Law, Y. W., Mulinde, R., & Slay, J. (2023) · International Conference on Cyber Warfare and Security · doi:10.34190/iccws.18.1.982 · Cited by 5
Quantum circuit for implementing Camellia S-box with low costs
Li, Z., Fei, G., Su-Juan, Q., & Qiao-yan, W. (2023) · Zhongguo kexue. Wulixue Lixue Tianwenxue · doi:10.1360/sspma-2022-0485 · Cited by 7
Discrete-time semiclassical Szegedy quantum walks
Ortega, S. A., & Martin-Delgado, M. A. (2023) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2023.129021 · Cited by 6
Can Quantum Computing Improve Uniform Random Sampling of Large Configuration Spaces?
Ammermann, J., Bittner, T., Eichhorn, D., Schaefer, I., & Seidl, C. (2023) · IEEE/ACM International Workshop on Quantum Software Engineering (Q-SE) · doi:10.1109/q-se59154.2023.00012 · Cited by 5
Guest Column: The 7 faces of quantum NP
Gharibian, S. (2023) · ACM SIGACT News · doi:10.1145/3639528.3639535 · Cited by 5
NISQ-friendly measurement-based quantum clustering algorithms
Patil, S., Banerjee, S., & Panigrahi, P. K. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04553-0 · Cited by 5
Bridging Quantum Computing and Differential Privacy: Insights into Quantum Computing Privacy
Zhao, Y., Zhong, H., Zhang, X., Li, Y., Zhang, C., & Pan, M. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00012 · Cited by 5
An introduction to modern cryptology
Bart Preneel, A. (2007) · Elsevier eBooks · doi:10.1016/b978-044451608-4/50020-1 · Cited by 5
Two improvements in Grover's algorithm
Kang, K. (2015) · doi:10.1109/ccdc.2015.7162096 · Cited by 5
The quantum query complexity of the determinant
Dörn, S., & Thierauf, T. (2008) · Information Processing Letters · doi:10.1016/j.ipl.2008.11.006 · Cited by 8
Checking Reversibility of Boolean Functions
Wille, R., Lye, A., & Niemann, P. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-40578-0_23 · Cited by 5
Hash-Based TPM Signatures for the Quantum World
Ando, M., Guttman, J. D., Papaleo, A. R., & Scire, J. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-39555-5_5 · Cited by 5
Shang, R., Du, B., Dai, K., et al. (2017) · Natural Computing · doi:10.1007/s11047-016-9606-x · Cited by 5
Multiple Entities Search through Simon's Quantum Algorithm
Sihare, S. R., & Nath, V. V. (2017) · IEEE International Advance Computing Conference · doi:10.1109/iacc.2017.0162 · Cited by 5
Coherent versus Non-Coherent Quantum-Assisted Solutions in Wireless Systems
Botsinis, P., Alanis, D., Babar, Z., Ng, S. X., & Hanzo, L. (2017) · IEEE Wireless Communications · doi:10.1109/mwc.2017.1600125 · Cited by 5
Impact of quantum algorithms on time complexity of classical-data problems
Li, K., Yang, L., HongYi, D., & Zhang, M. (2019) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2019.8866303 · Cited by 5
Using Freivalds’ Algorithm to Accelerate Lattice-Based Signature Verifications
Sipasseuth, A., Plantard, T., & Susilo, W. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-34339-2_22 · Cited by 5
Discrete-Time Quantum Walk with Memory on the Cayley Graph of the Dihedral Group
Dai, W., Yuan, J., & Li, D. (2019) · International Journal of Theoretical Physics · doi:10.1007/s10773-019-04257-7 · Cited by 5
Grover's algorithm in natural settings
Patel, A. D. (2021) · Quantum Information and Computation · doi:10.26421/qic21.11-12-3 · Cited by 5
Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates
Kabanets, V., Koroth, S., Lu, Z., Myrisiotis, D., & Oliveira, I. C. L. (2021) · ACM Transactions on Computation Theory · doi:10.1145/3470861 · Cited by 7
6 Quantum computing and quantum algorithms
Müller, R., & Greinert, F. (2023) · De Gruyter eBooks · doi:10.1515/9783110717457-006 · Cited by 5
Khalid, M. F., Wu, J., Ali, T. M., Ameen, T., Moustafa, A. A., Zhu, Q., & Xiong, R. (2020) · Brain Sciences · doi:10.3390/brainsci10070431 · Cited by 5
A low failure rate quantum algorithm for searching maximum or minimum
Chen, Y., Wei, S., Gao, X., Wang, C., Tang, Y., Wu, J., & Guo, H. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02773-8 · Cited by 6
Saarinen, M.-J. O., Newell, G. R., & Marshall, B. (2020) · doi:10.1145/3411504.3421212 · Cited by 7
Quantum-Accelerated Global Constraint Filtering
Booth, K. E. C., O’Gorman, B., Marshall, J., Hadfield, S., & Rieffel, E. G. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-58475-7_5 · Cited by 5
Wang, S., Xu, P., Song, R., et al. (2020) · Entropy · doi:10.3390/e22111207 · Cited by 5
Quantum Minimum Searching Algorithm and Circuit Implementation
Kang, Y., & Heo, J. (2020) · International Conference on Information and Communication Technology Convergence (ICTC) · doi:10.1109/ictc49870.2020.9289455 · Cited by 5
The linear cyclic translation and two-point swapping transformations for quantum images
Fan, P., Hou, M., Yin, A., & Li, H.-S. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03044-w · Cited by 5
Alsindi, W. Z., & Lotti, L. (2021) · Internet Policy Review · doi:10.14763/2021.2.1551 · Cited by 5
A Chemical Model of Homeostasis
Zepik, H. H., Blöchliger, E., & Luisi, P. L. (2001) · Angewandte Chemie · doi:10.1002/1521-3757(20010105)113:1 · Cited by 28
Quantum set intersection and its application to associative memory
Salman, T., & Baram, Y. (2012) · Journal of Machine Learning Research · Cited by 5
Binary Neuro-Fuzzy Classifiers Trained by Nonlinear Quantum Circuits
Panella, M., & Martinelli, G. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-73400-0_29 · Cited by 5
An Efficient Reduction of Common Control Lines for Reversible Circuit Optimization
Deb, A., Wille, R., Drechsler, R., et al. (2015) · Proceedings/Proceedings - International Symposium on Multiple-Valued Logic · doi:10.1109/ismvl.2015.26 · Cited by 5
Quantum Physical Symbol Systems
Laskey, K. B. (2006) · Journal of Logic Language and Information · doi:10.1007/s10849-005-9009-3 · Cited by 5
History dependent quantum random walks as quantum lattice gas automata
Shakeel, A., Meyer, D. A., & Love, P. J. (2014) · Journal of Mathematical Physics · doi:10.1063/1.4903977 · Cited by 6
A New Parallel Quantum Genetic Algorithm with Probability-Gate and Its Probability Analysis
Shu-xia, M., & Jin, W. (2007) · doi:10.2991/iske.2007.260 · Cited by 5
Alternative Coins for Quantum Random Walk Search Optimized for a Hypercube
Tonchev, H. (2015) · Journal of Quantum Information Science · doi:10.4236/jqis.2015.51002 · Cited by 5
Optimality proofs of quantum weight decision algorithms
Choi, B.-S. (2011) · Quantum Information Processing · doi:10.1007/s11128-011-0233-2 · Cited by 4
Information in entangled dynamic quantum networks
Shafee, F. (2006) · Microelectronics Journal · doi:10.1016/j.mejo.2006.07.011 · Cited by 5
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
