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 7,501–7,600 of 8,792
Niu, Y.-F., Zhang, S., Ding, C., et al. (2022) · SciPost Physics · doi:10.21468/scipost.report.6023
Niu, Y.-F., Zhang, S., Ding, C., et al. (2022) · SciPost Physics · doi:10.21468/scipost.report.5745
Arenstein, L. S. (2022) · Digital Library of Theses and Dissertations (Universidade de São Paulo) · doi:10.11606/d.45.2022.tde-19062023-143615
From Ramon Llull To Lov Grover: Towards A Universal Logic Machine
Opsahl, G., & Perkowski, M. A. (2023) · Proceedings/Proceedings - International Symposium on Multiple-Valued Logic · doi:10.1109/ismvl57333.2023.00042
Mission of Physics & Informatics Laboratories
Yamamoto, Y. (2019) · NTT technical review · doi:10.53829/ntr201912fa2
Gheorghica, R.-I. (2023) · IEEE International Symposium on Applied Computational Intelligence and Informatics (SACI) · doi:10.1109/saci58269.2023.10158547
Optimized Algorithms for Quantum Machine Learning Circuits
Palani, L., Singh, S. B., Rajendran, B., Bindhumadhava, B. S., & Sudarsan, S. D. (2023) · Lecture notes in networks and systems · doi:10.1007/978-981-99-1203-2_37
Designing a hybrid quantum controller for strongly eigenstate controllable systems
Azizpour, T., & Yarahmadi, M. (2022) · Journal of Control · doi:10.52547/joc.16.3.25
On post-quantum security of symmetric cryptosystems
Hosoyamada, A. (2023) · IEICE ESS FUNDAMENTALS REVIEW · doi:10.1587/essfr.17.1_59
Reducing the resources needed to implement quantum error correction codes using quantum multiplexing
Nishio, S., Piparo, N. L., Hanks, M., et al. (2022) · Conference on Lasers and Electro-Optics Pacific Rim (CLEO-PR) · doi:10.1364/cleopr.2022.cfa7h_03
Exponential Qubit Reduction in Optimization for Financial Transaction SettlementPreprint
Huber, E. X., Tan, B. Y. L., Griffin, P., & Angelakis, D. G. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2307.07193
Optimization of Hydrogen Injection Flow Rate for Hydrogen Internal Combustion Engines Based on IQGA
Guo, P., Xu, J., & Wang, M. (2023) · Journal of Energy Science and Technology · doi:10.57237/j.jest.2023.03.002
Quantum Security and Postquantum Cryptography
Porambage, P., Liyanage, M., Halunen, K., et al. (2023) · doi:10.1002/9781119875437.ch21
An Approach to the Classification of Finite Semifields by Quantum Computing
Cáceres, J. M. H., & Rúa, I. F. (2023) · Springer proceedings in mathematics & statistics · doi:10.1007/978-3-031-32707-0_16
(2020) · Oxford University Press eBooks · doi:10.1093/oso/9780198862840.002.0003
(2020) · Oxford University Press eBooks · doi:10.1093/oso/9780198862840.002.0006
(2020) · Oxford University Press eBooks · doi:10.1093/oso/9780198862840.002.0004
(2020) · Oxford University Press eBooks · doi:10.1093/oso/9780198862840.002.0007
TOÀN CẢNH VỀ MÁY TÍNH LƯỢNG TỬ - NHỮNG VẤN ĐỀ ĐẶT RA
Thi, B. D., Phonekeopaserth, S., & Bounsaveng, K. (2023) · TNU Journal of Science and Technology · doi:10.34238/tnu-jst.7523
Simulated environment for multiparty quantum digital signature across the network
Aguado, D. G., Cid, M. I. G., Martín, L. O., & Ayuso, V. M. (2023) · International Conference on Availability, Reliability and Security (ARES) · doi:10.1145/3600160.3605166
Fabrication and characterization of Al-based integrated MIS capacitors
Rocha-Aguilera, D., Ferrusca, D., & Reyes, J. M. (2023) · IEEE Latin American Electron Devices Conference (LAEDC) · doi:10.1109/laedc58183.2023.10209130
Baheri, B., Chaudhary, V., Li, A., et al. (2023) · doi:10.1145/3588983.3596688
Nghiem, N. A., Xianfeng, D., & Wei, T.-C. (2023) · SciPost Physics · doi:10.21468/scipost.report.6804
Nghiem, N. A., Xianfeng, D., & Wei, T.-C. (2023) · SciPost Physics · doi:10.21468/scipost.report.6441
Research on quantum computing and its development
Xie, Z. (2023) · Theoretical and Natural Science · doi:10.54254/2753-8818/5/20230555
Quantum Computing for Feature Model Analysis
Eichhorn, D., Pett, T., Osborne, T. J., & Schaefer, I. (2023) · International Software Product Line Conference (SPLC) · doi:10.1145/3579027.3608971
A family of unitaries for the quantum period finding algorithm
Francis, J. G., & Shaji, A. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04079-x
GEO-based Quantum Key Distribution for Secure Regional Services: A Feasibility Study
Goyal, S., & Gupta, P. K. (2022) · IEEE International Conference on Advanced Networks and Telecommunications Systems · doi:10.1109/ants56424.2022.10227803
Real-time hybrid quantum-classical computations for trapped ions with Python control-flow
Schmale, T., Temesi, B., Trittschanke, N., Pulido-Mateo, N., Elenskiy, I., Krinner, L., Dubielzig, T., Ospelkaus, C., Weimer, H., & Borcherding, D. (2023) · IEEE International Conference on Quantum Software (QSW) · doi:10.1109/qsw59989.2023.00031 · Cited by 1
Piispanen, L. J., Morrell, E., Park, S., Pfaffhauser, M., & Kultima, A. (2023) · Aaltodoc (Aalto University) · doi:10.48550/arxiv.2309.01525
Alguns Comentários sobre Transformadas Quânticas
Lula, B., Albert, B., & de Assis, F. (2005) · Anais do XXII Simpósio Brasileiro de Telecomunicações · doi:10.14209/sbrt.2005.403
Thu, B. T. M., & Thu, N. T. B. (2023) · Ho Chi Minh City Open University Journal of Science- Economics and Business Administration · doi:10.46223/hcmcoujs.econ.en.13.2.2250.2023
ขนตอนวธเชงพนธกรรมแบบกระชบชนดควอนตมสำหรบปญหายาก
สุขเสน, ก. (2021) · doi:10.58837/chula.the.2021.952
Accelerated Simulation of Master Equation for Open Quantum Systems
Yue, B., Wang, Y., & Xue, S. (2023) · Chinese Control Conference (CCC) · doi:10.23919/ccc58697.2023.10240232
Quantum algorithms for the simulation of perturbative QCD processes
Chawdhry, H. A., & Pellen, M. (2023) · International Symposium on Radiative Corrections (RADCOR) · doi:10.22323/1.432.0087 · Cited by 2
Quantum Distinguishing Attacks on Generalized Feistel Schemes
Fesenko, A., & Zvychaina, A. (2023) · Theoretical and Applied Cybersecurity · doi:10.20535/tacs.2664-29132023.1.279992
Quantum Algorithm for Computing Distances between SubspacesPreprint
Vu, N. A. N. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4579782
QUANTUM PATHFINDERS: NAVIGATE THE SHORTEST ROUTE
Sahil, M., Jain, S., & Hamdard, J. (2023) · International Journal of Engineering Applied Sciences and Technology · doi:10.33564/ijeast.2023.v07i12.020
Quantum Implementation of Core Operations in Classic McEliece
Oh, Y., Jang, K., Lim, S., Yang, Y., & Seo, H. (2023) · International Conference on Platform Technology and Service · doi:10.1109/platcon60102.2023.10255218
A Competent Memetic Algorithm for Error Mitigation in Quantum Measurement
Acampora, G., & Vitiello, A. (2023) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec53210.2023.10253998
Shah, A., & Pachisia, T. (2023) · doi:10.36227/techrxiv.24186825
Shah, A., & Pachisia, T. (2023) · doi:10.36227/techrxiv.24186825.v1
Quantum analysis of squiggle data
Nagy, N., Stuart-Edwards, M., Nagy, M., Mitchell, L. R., & Zovoilis, A. (2023) · BioData Mining · doi:10.1186/s13040-023-00343-z
On the Architecture-Aware Synthesis of Intermediate Representations for Quantum CompilersPreprint
van de Griend, R. A. M. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4595236
Chiral‐Quantum‐Optics‐Based Supervised Learning
Yan, W., Zhang, Y., Man, Z., Fan, H., & Xia, Y. (2023) · Annalen der Physik · doi:10.1002/andp.202300183
Трифонова, О. М., & Sadovyі, M. (2023) · Academic Notes Series Pedagogical Science · doi:10.36550/2415-7988-2022-1-209-373-379
Quantum cryptanalysis of Farfalle and (generalised) key-alternating Feistel networks
Hodžić, S., Roy, A., & Andreeva, E. (2023) · Designs Codes and Cryptography · doi:10.1007/s10623-023-01305-6 · Cited by 1
Experimental tools for quantum networking operations with single photons and sinlge ions
Huwer, J. (2014) · UPCommons institutional repository (Universitat Politècnica de Catalunya) · doi:10.5821/dissertation-2117-95282
Takeuchi, M. (2023) · Springer eBooks · doi:10.1007/978-981-99-5072-0_7
Design Method of Meta Operators Based on Equivalence Class Distribution
Shu, G., Fei, Y., Yi, Z., et al. (2023) · Journal of Physics Conference Series · doi:10.1088/1742-6596/2620/1/012009
A design method for efficient variational quantum models based on specific Pauli axis
Li, B., Li, T., & Li, F. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04127-6
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0006
Microwave resonators for superconducting devices
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0013
(2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.002.0003
The rotating wave approximation
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.005.0001
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0004
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0007
Quantum simulation of Hamiltonian eigenstates
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0012
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0002
Quantum simulation of Hamiltonian dynamics
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0011
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0009
The molecular Hamiltonian in second quantization
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.005.0004
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0005
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0008
Oblivious amplitude amplification lemma
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.005.0005
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.005.0006
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0003
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0001
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0014
(2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.002.0005
(2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.002.0004
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0010
\({\ell_0}\) Optimization with Robust Non-Oracular Quantum Search
Zhang, T., & Yuan, K. (2023) · Technologies · doi:10.3390/technologies11050148 · Cited by 1
Quantum Computing and Quantum Computing Optimization: An Introduction
Nannicini, G. (2023) · Springer eBooks · doi:10.1007/978-3-030-54621-2_848-1 · Cited by 1
An Efficient and Secure Mechanism for Ubiquitous Sustainable Computing System
Nithin, G. N. (2023) · IFIP advances in information and communication technology · doi:10.1007/978-3-031-45882-8_12
Comments on “Efficient classical simulation of the Deutsch–Jozsa and Simon’s algorithms”
Batista, C. A., Veras, T. M. L., da Silva, L. D., et al. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04134-7
Subject Experiments with a Learning Support System for Grover's Algorithm
Yasunaga, H., Sasakura, M., & Monden, A. (2023) · International Conference Information Visualisation (IV) · doi:10.1109/iv60283.2023.00030
Quantum Computing Research Lines in the Italian Center for Supercomputing
Barenghi, A., Cremonesi, P., & Pelosi, G. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-46077-7_28
ANALYSIS OF THE APPLICATION OF QUANTUM METHODS AND MODELS IN COMPUTATIONAL LINGUISTICS
Burlieiev, O. L., Штанько, Л. О., & Vasylenko, O. O. (2023) · Izdevniecība “Baltija Publishing” eBooks · doi:10.30525/978-9934-26-351-4-11
Cryptanalysis of the «Vershyna» digital signature algorithm
Fesenko, A., & Lytvynenko, Y. (2023) · Theoretical and Applied Cybersecurity · doi:10.20535/tacs.2664-29132023.2.288499
Bi, L., Wu, W., Yuan, X., et al. (2023) · Applied Sciences · doi:10.3390/app132212284
Mitigating Coupling Map Constrained Correlated Measurement Errors on Quantum Devices
Robertson, A., & Song, S. L. (2023) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1145/3581784.3607039
Tunable Quantum Neural Networks in the QPAC-Learning Framework
Ngoc, V. P., Tuckey, D., & Wiklicky, H. (2023) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.394.13
Robust system software for quantum computing
Patel, T. (2023) · doi:10.17760/d20487156
Wu, Q., Liu, W., & Liu, H. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4638956
Quantum and Classical Query Complexities for Determining Connectedness of MatroidsPreprint
Huang, X., Feng, S., & Li, L. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4641131
Robust LS-QSVM Implementation via Efficient Matrix Factorization and Eigenvalue Estimation
Shen, J., & Ying, J. (2023) · Communications in computer and information science · doi:10.1007/978-981-99-8126-7_40
Machine Learning Reliability Assessment from Application to Pulse Level
Saravanan, V., & Saeed, S. M. (2023) · Springer eBooks · doi:10.1007/978-3-031-37966-6_7
Chawdhry, H. A., & Pellen, M. (2023) · doi:10.21468/scipost.report.7216
Chawdhry, H. A., & Pellen, M. (2023) · doi:10.21468/scipost.report.7214
Ernst, H., Schmidt, J., & Beneken, G. (2023) · Springer eBooks · doi:10.1007/978-3-658-41779-6_4
Robustness of Quantum Algorithms Against Approximate Data Representations
Los, V., Maksymenko, M., Koch-Janusz, M., et al. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.10269
Problem Decomposition to Leverage Quantum Computing for Optimization Problems
Dayama, N. R., Haghparast, M., & Stirbu, V. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-49269-3_12
Loke, S. W. (2023) · doi:10.1002/9781394185542.ch1
Pronin, C. B., Ostroukh, A. V., Izmailova, D. K., et al. (2023) · Intelligent Technologies and Electronic Devices in Vehicle and Road Transport Complex (TIRVED) · doi:10.1109/tirved58506.2023.10332633
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
