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,901–5,000 of 8,792
Formulation and Emulation of Quantum-Inspired Dynamical Systems With Classical Analog Circuits
Cressman, A. J., Wattanapanitch, W., Chuang, I. L., & Sarpeshkar, R. (2022) · Neural Computation · doi:10.1162/neco_a_01481 · Cited by 3
Nonnenmann, P., & Bogomolec, X. (2021) · Springer eBooks · doi:10.1007/978-3-030-78829-2_12 · Cited by 3
Quantum Information Processing
Majumdar, R. (2022) · Springer eBooks · doi:10.1007/978-3-030-89746-8_1 · Cited by 3
Quantum and Blockchain for Computing Paradigms Vision and Advancements
Gupta, N. (2022) · Advances in data mining and database management book series · doi:10.4018/978-1-6684-5072-7.ch008 · Cited by 3
Understanding the Impact of Cutting in Quantum Circuits Reliability to Transient Faults
Casciola, N., Giusto, E., Dri, E., Oliveira, D., Rech, P., & Montrucchio, B. (2022) · IEEE International On-Line Testing Symposium (IOLTS) · doi:10.1109/iolts56730.2022.9897308 · Cited by 3
On Certified Randomness from Fourier Sampling or Random Circuit Sampling
Bassirian, R., Bouland, A., Fefferman, B., Gunn, S., & Tal, A. (2026) · Quantum · doi:10.22331/q-2026-02-10-2002 · Cited by 18
Parametric Synthesis of Quantum Circuits for Training Perceptron Neural Networks
Ostroukh, A. V., Pronin, C. B., Volosova, A. V., et al. (2022) · Intelligent Technologies and Electronic Devices in Vehicle and Road Transport Complex (TIRVED) · doi:10.1109/tirved56496.2022.9965536 · Cited by 3
Quantum Computing: Non-deterministic controllers for Artificial Intelligent Agents
Bannikov, A., Egerton, S. J., Vic, C., et al. (2010) · Ambient intelligence and smart environments · doi:10.3233/978-1-60750-639-3-109 · Cited by 3
Localization of quantum walks on a deterministic recursive tree
Xu, X. P. (2011) · Quantum Information and Computation · doi:10.26421/qic11.3-4-5 · Cited by 3
Studying the Performance of Quantum Evolutionary Algorithm Based on Immune Theory
You, X., Liu, S., & Shuai, D. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-72590-9_161 · Cited by 3
Servín, C., & Крейнович, В. (2014) · Studies in systems, decision and control · doi:10.1007/978-3-319-12628-9 · Cited by 3
An Applied Research of Improved BB84 Protocol in Electric Power Secondary System Communication
Zhang, S., Liu, X., & Wang, B. (2012) · Lecture notes in electrical engineering · doi:10.1007/978-3-642-27287-5_87 · Cited by 3
Quantum Search in Structured Database
He, Y., & Sun, J. (2005) · Lecture notes in computer science · doi:10.1007/11539902_52 · Cited by 3
Quantum Information: The New Frontier
Svozil, K. (2001) · Springer eBooks · doi:10.1007/978-1-4471-0313-4_19 · Cited by 3
A Lower Bound for the Sturm-Liouville Eigenvalue Problem on a Quantum Computer
Bessen, A. J. (2005) · Cited by 3
Numerical estimation of the quantum factorization effectiveness
Zawadzki, P. (2010) · Theoretical and Applied Informatics · doi:10.2478/v10179-010-0019-8 · Cited by 3
Quantum Computing’s Classical Problem, Classical Computing’s Quantum Problem
Meter, R. V. (2014) · Foundations of Physics · doi:10.1007/s10701-014-9807-z · Cited by 3
Study on discrete adiabatic quantum computation in 3-SAT problems
El-fiky, M., Ono, S., & Nakayama, S. (2011) · Artificial Life and Robotics · doi:10.1007/s10015-011-0900-5 · Cited by 3
Wang, L., Wang, X., & Fei, M. (2009) · ACM/SIGEVO Summit on Genetic and Evolutionary Computation (GEC) · doi:10.1145/1543834.1543908 · Cited by 3
Quantum Iterative Deepening with an Application to the Halting Problem
Tarrataca, L. D. T. J., & Wichert, A. (2013) · PLoS ONE · doi:10.1371/journal.pone.0057309 · Cited by 4
Prospects of quantum-classical optimization for digital design
Gastaldo, P., Ridella, S., & Zunino, R. (2006) · Applied Mathematics and Computation · doi:10.1016/j.amc.2005.11.129 · Cited by 3
An efficient controlled bidirectional quantum secure direct communication by using only EPR pairs
Chou, Y., Lin, F.-J., Zeng, G.-J., et al. (2013) · IEEE International Conference on Nanotechnology (IEEE-NANO) · doi:10.1109/nano.2013.6720932 · Cited by 3
Reversible logic synthesis based on a modified tabulation method
Lu, C.-Y., & Wang, S.-A. (2011) · doi:10.1109/icmt.2011.6002229 · Cited by 3
Xu, J., & Song, F. (2008) · Frontiers of Computer Science in China · doi:10.1007/s11704-008-0013-z · Cited by 3
GA-based approach to find the stabilizers of a given sub-space
Houshmand, M., Zamani, M. S., Sedighi, M., & Houshmand, M. (2014) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-014-9219-z · Cited by 3
The Quantum Search Algorithms for All Solutions
Li, H.-S., Qingxin, Z., Lan, S., et al. (2012) · International Journal of Theoretical Physics · doi:10.1007/s10773-012-1305-5 · Cited by 3
Quantum Computation: Theory and Implementation
Boyden, E. S. (1999) · Cited by 3
Basic Quantum Algorithms and Applications
Rahmi, M., Shamanta, D., & Tasnim, A. (2012) · International Journal of Computer Applications · doi:10.5120/8880-2868 · Cited by 3
A Group Quantum Communication Network Using Quantum Secret Sharing
Ma, H., & Guo, Z. (2008) · doi:10.1109/npc.2008.42 · Cited by 3
Mapping Binary Functions to a Practical Adiabatic Quantum Computer
Rosenbaum, D. J., & Perkowski, M. A. (2010) · IEEE International Symposium on Multiple-Valued Logic (ISMVL) · doi:10.1109/ismvl.2010.57 · Cited by 3
Quantum Query Complexity for Searching Multiple Marked States from an Unsorted Database
Bin, S. (2007) · Communications in Theoretical Physics · doi:10.1088/0253-6102/48/2/013 · Cited by 3
How Low Can Approximate Degree and Quantum Query Complexity Be for Total Boolean Functions?
Ambainis, A., & de Wolf, R. (2013) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.2013.26 · Cited by 3
Quantum Algorithms and Complexity for Certain Continuous and Related Discrete Problems
Kwas, M. (2005) · doi:10.7916/d81264v5 · Cited by 3
Nan, D., & Zhang, Y. (2008) · World Congress on Intelligent Control and Automation · doi:10.1109/wcica.2008.4593019 · Cited by 3
An analytical optimization algorithm based on quantum computing embedded into evolutionary algorithm
Kumar, R., Ranjan, A., & Srivastava, P. (2010) · International Conference on Education Technology and Computer · doi:10.1109/icetc.2010.5529653 · Cited by 3
Optimizing quantum teleportation circuit using genetic algorithm
Peng, F., Xie, G., & Wu, T. (2009) · IEEE International Conference on Granular Computing (GrC) · doi:10.1109/grc.2009.5255076 · Cited by 3
Dellar, P. J. (2015) · ESAIM Proceedings and Surveys · doi:10.1051/proc/201552005 · Cited by 3
Chapter 11 Practical Lattice-Based Cryptography: NTRUEncrypt and NTRUSign
Hoffstein, J., Howgrave-Graham, N., Pipher, J. C., et al. (2010) · Cited by 3
Didactic tools for teaching quantum informatics
Gawron, P., & Miszczak, J. A. (2004) · Studia Iuridica Lublinensia (Uniwersytet Marii Curie-Skłodowskiej w Lublinie) · doi:10.17951/ai.2004.2.1.453-461 · Cited by 3
Geometry-based signal shifting of one-way quantum computation measurement patterns
Eslamy, M., Houshmand, M., Zamani, M. S., & Sedighi, M. (2016) · Iranian Conference on Electrical Engineering · doi:10.1109/iraniancee.2016.7585546 · Cited by 3
Separating Quantum Communication and Approximate Rank
Anshu, A., Ben-David, S., Garg, A., Jain, R., Kothari, R., & Lee, T. (2016) · DR-NTU (Nanyang Technological University) · doi:10.48550/arxiv.1611.05754 · Cited by 4
Verifiable Quantum Encryption and its Practical Applications
Shi, R. (2016) · International Journal of Theoretical Physics · doi:10.1007/s10773-016-3263-9 · Cited by 3
Reduction of Quantum Cost by Making Temporary Changes to the Function
Adnan, N. A. B., Yamashita, S., & Mishchenko, A. (2017) · IEICE Transactions on Information and Systems · doi:10.1587/transinf.2016edp7397 · Cited by 3
Efficient arithmetic for lattice-based cryptography
O’Sullivan, E., & Regazzoni, F. (2017) · doi:10.1145/3125502.3125543 · Cited by 3
Time-Space Complexity Advantages for Quantum Computing
Zheng, S., Qiu, D., & Gruska, J. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-71069-3_24 · Cited by 3
Dey, S., Bhattacharyya, S., & Maulik, U. (2016) · Elsevier eBooks · doi:10.1016/b978-0-12-804409-4.00006-1 · Cited by 3
Recent Developments in Post-Quantum Cryptography
Takagi, T. (2017) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1587/transfun.e101.a.3 · Cited by 3
Detection and localization of appearance faults in reversible circuits
Mondal, B., Bandyopadhyay, C., & Rahaman, H. (2017) · International Symposium on Embedded Computing and System Design (ISED) · doi:10.1109/ised.2017.8303946 · Cited by 3
Gombar, S., Mali, P. M., Pantić, M. R., Pavkov-Hrvojević, M. V., & Radošević, S. (2020) · Journal of Experimental and Theoretical Physics · doi:10.1134/s1063776120060114 · Cited by 3
Konar, D., & Kar, S. K. (2018) · Advances in computer and electrical engineering book series · doi:10.4018/978-1-5225-5219-2.ch008 · Cited by 3
Abbott, A. A., Calude, C. S., Dinneen, M. J., & Hua, R. (2018) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.273.1 · Cited by 3
The Learning with Rank Errors problem and an application to symmetric authentication
Bettaieb, S., Bidoux, L., Connan, Y., et al. (2018) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2018.8437529 · Cited by 3
Quantum Supervised Clustering Algorithm for Big Data
Bishwas, A. K., Mani, A., & Palade, V. (2018) · International Conference for Convergence in Technology (I2CT) · doi:10.1109/i2ct.2018.8529799 · Cited by 3
Kosheleva, O. M., & Крейнович, В. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-48006-6_13 · Cited by 3
Exploiting Preprocessing for Quantum Search to Break Parameters for $$\mathcal {MQ}$$ Cryptosystems
Pring, B. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-05153-2_17 · Cited by 3
Cryptanalysis of an ElGamal-Like Cryptosystem Based on Matrices Over Group Rings
Jia, J., Wang, H., Zhang, H., Wang, S., & Liu, J. (2019) · Communications in computer and information science · doi:10.1007/978-981-13-5913-2_16 · Cited by 3
Upper Bounds on Communication in Terms of Approximate Rank
Gál, A., & Syed, R. (2023) · Theory of Computing Systems · doi:10.1007/s00224-023-10158-4 · Cited by 3
Téllez, C., Pereira, D. A. B., & Borges, F. (2018) · doi:10.17648/wrac-2018-97122 · Cited by 3
Quantum cryptographic property testing of multi-output Boolean functions
Jingyi, C., & Guo, J. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2299-1 · Cited by 3
Proof-of-Forgery for Hash-based Signatures
Kiktenko, E. O., Kudinov, M., Bulychev, A., & Fedorov, A. K. (2021) · International Conference on Security and Cryptography · doi:10.5220/0010579600002998 · Cited by 4
Implementing NChooseK on IBM Q Quantum Computer Systems
Khetawat, H., Atrey, A., Li, G., Mueller, F., & Pakin, S. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-21500-2_13 · Cited by 3
Quantum advantage without entanglement
Kenigsberg, D., Mor, T., & Ratsaby, G. (2005) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.617175 · Cited by 3
Aysu, A., & Schaumont, P. R. (2015) · Cited by 3
Unruh, D. (2010) · Cited by 3
A lower bound for the Sturm–Liouville eigenvalue problem on a quantum computer
Bessen, A. J. (2006) · Journal of Complexity · doi:10.1016/j.jco.2006.03.006 · Cited by 3
Uwano, Y. (2016) · Mathematical Modelling and Geometry · doi:10.26456/mmg/2016-412 · Cited by 3
Realization of t -bit semiclassical quantum Fourier transform on IBM’s quantum cloud computer
Fu, X.-Q., Bao, W., Huang, H.-L., Li, T., Shi, J., Wang, X., Zhang, S., & Li, F. (2019) · Chinese Physics B · doi:10.1088/1674-1056/28/2/020302 · Cited by 3
Téllez, C., Pereira, D. A. B., & Borges, F. (2019) · IEEE International Workshop on Metrology for Industry 4.0 & IoT (MetroInd4.0&IoT) · doi:10.1109/metroi4.2019.8792913 · Cited by 3
Ульянов, С. В., Ulyanov, S. V., В., Р. Н., et al. (2019) · Международный журнал Программные продукты и системы · doi:10.15827/0236-235x.126.181-189 · Cited by 3
Крейнович, В., Ceberio, M. C., & Alvarez, R. O. D. A. (2019) · IEEE Symposium Series on Computational Intelligence (SSCI) · doi:10.1109/ssci44817.2019.9002709 · Cited by 3
Kobori, A., Takahashi, R., & Nakanishi, M. (2020) · CCF Transactions on High Performance Computing · doi:10.1007/s42514-020-00028-7 · Cited by 3
Quantum Solution for the 3-SAT Problem Based on IBM Q
Zhang, Y., Bian, Y., Fan, Q., et al. (2020) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-030-48513-9_33 · Cited by 3
Theory of Quantum Computation With Magnetic Clusters
Dorroh, D. D., Ölmez, S., & Wang, J. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.2975765 · Cited by 3
A Generic Variable Inputs Quantum Algorithm for 3-SAT Problem
Wang, P., Liu, G., & Liu, L. (2020) · IEEE International Conference on Advances in Electrical Engineering and Computer Applications (AEECA) · doi:10.1109/aeeca49918.2020.9213471 · Cited by 3
Introduction to Quantum Computing
Bolfing, A. (2020) · Oxford University Press eBooks · doi:10.1093/oso/9780198862840.003.0008 · Cited by 3
Novel Watermarking Scheme Using Boundary Pixels Least Significant Qubit Steganography
Luo, G., & Ling, M. (2019) · International Conference on Data Science and Business Analytics (ICDSBA) · doi:10.1109/icdsba48748.2019.00083 · Cited by 3
Assertion-based optimization of Quantum programs
Häner, T., Hoefler, T., & Troyer, M. (2020) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-b-000457964 · Cited by 5
A new type of spectral mapping theorem for quantum walks with a moving shift on graphs
Kubota, S., Saito, K., & Yoshie, Y. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03493-x · Cited by 4
Djordjević, I. B. (2021) · Elsevier eBooks · doi:10.1016/b978-0-12-821982-9.00007-1 · Cited by 4
Analysis of Client-Side Security for Long-Term Time-Stamping Services
Meng, L., & Chen, L. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-78372-3_2 · Cited by 3
Compilation flow for classically defined quantum operations
Schmitt, B. D. O., Javadi-Abhari, A., & Micheli, G. D. (2021) · Design, Automation, and Test in Europe · doi:10.23919/date51398.2021.9474163 · Cited by 3
Sequeira, A., Santos, L. P., & Barbosa, L. S. (2021) · IEEE Access · doi:10.1109/access.2021.3110652 · Cited by 3
Training Ensembles of Quantum Binary Neural Networks
Leal, D. V., Lima, T. D., & da Silva, A. J. (2021) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn52387.2021.9534253 · Cited by 3
Timing Analysis of Algorithm Substitution Attacks in a Post-Quantum TLS Protocol
Marchiori, D., Giron, A. A., do Nascimento, J. P. A., et al. (2021) · doi:10.5753/sbseg.2021.17311 · Cited by 3
Enhanced quantum signature scheme using quantum amplitude amplification operators
Elias, B., & Younes, A. (2021) · PLoS ONE · doi:10.1371/journal.pone.0258091 · Cited by 3
Post-Quantum Cryptography in MPSoC Environments
Sepúlveda, J., Winkler, D., Sepulveda, D., et al. (2021) · IFIP/IEEE International Conference on Very Large Scale Integration · doi:10.1109/vlsi-soc53125.2021.9606978 · Cited by 3
Mapping Constraint Problems onto Quantum Gate and Annealing Devices
Wilson, E., Mueller, F., & Pakin, S. (2021) · IEEE/ACM International Workshop on Quantum Computing Software (QCS) · doi:10.1109/qcs54837.2021.00016 · Cited by 3
T-PKI for Anonymous Attestation in TPM
Sedighi, A., Jacobson, D., & Daniels, T. (2021) · IEEE International Conference on Smart Cloud (SmartCloud) · doi:10.1109/smartcloud52277.2021.00024 · Cited by 3
On the use of code-based cryptography in automotive applications
Battaglioni, M., Cancellieri, G., & Santini, P. (2021) · doi:10.23919/aeitautomotive52815.2021.9662841 · Cited by 3
On subset-resilient hash function families
Yuan, Q., Tibouchi, M., & Abe, M. (2022) · Designs Codes and Cryptography · doi:10.1007/s10623-022-01008-4 · Cited by 8
Quantum Computing for Machine Learning
Niraula, D., Jamaluddin, J., Pakela, J. M., & Naqa, I. E. (2022) · Springer eBooks · doi:10.1007/978-3-030-83047-2_5 · Cited by 4
Eisert, J., & Wolf, M. M. (2006) · Kluwer Academic Publishers eBooks · doi:10.1007/0-387-27705-6_8 · Cited by 3
Compiler Management of Communication and Parallelism for Quantum Computation
Heckey, J., Patil, S. R., Javadi-Abhari, A., Holmes, A. A., Kudrow, D., Brown, K. R., Franklin, D. M., Chong, F. T., & Martonosi, M. (2015) · ACM SIGPLAN Notices · doi:10.1145/2775054.2694357 · Cited by 3
Dual-Level Template for Enhancing Resolution of Quantum Images
Zhao, S.-S., Yan, F., Iliyasu, A. M., et al. (2022) · Journal of Advanced Computational Intelligence and Intelligent Informatics · doi:10.20965/jaciii.2022.p0431 · Cited by 3
A High Performance SIKE Accelerator With High Frequency and Low Area-Time Product
Ni, Z., Kundi, D., O'Neill, M. P., & Liu, W. (2022) · IEEE Transactions on Circuits & Systems II Express Briefs · doi:10.1109/tcsii.2022.3181625 · Cited by 3
Pairwise classification using quantum support vector machine with Kronecker kernel
Nohara, T., Oyama, S., & Noda, I. (2022) · Quantum Machine Intelligence · doi:10.1007/s42484-022-00082-0 · Cited by 3
A QUBO formulation for the Tree Containment problem
Dinneen, M. J., Ghodla, P. S., & Linz, S. (2022) · Theoretical Computer Science · doi:10.1016/j.tcs.2022.09.012 · Cited by 3
Generalization Performance of Quantum Metric Learning Classifiers
Kim, J., & Bekiranov, S. (2022) · Biomolecules · doi:10.3390/biom12111576 · Cited by 3
Implementation and Viusalization of Quantum Walks
Jordon, A., Hawkins-Seagram, A., & Stege, U. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00122 · Cited by 3
Miyamoto, K., Morrás, G., Yamamoto, T. S., et al. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00119 · Cited by 3
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
