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,001–7,100 of 8,792
Better algorithms for search by quantum walks on two-dimensional grid
Ambainis, A., Bačkurs, A., Nahimovs, N., et al. (2012)
QEDS: Um Simulador Clássico para Distinção de Elementos Quântico
Abreu, A., Ferreira, M. M., Kowada, L. A. B., & Marquezino, F. D. L. (2016) · Revista de Informática Teórica e Aplicada · doi:10.22456/2175-2745.65372
Quantum Primitives for Secure Two-party Computations and Entanglement Attacks
Dang, M.-D. (2008) · OpenGrey (Institut de l'Information Scientifique et Technique)
Towards post-quantum bitcoin:side-channel analysis of bimodal lattice signatures
Bruinderink, L. G. (2016)
COMPILING PROGRAMS FOR AN ADIABATIC QUANTUM COMPUTER
Snow-Kropla, E. (2014) · DalSpace (Dalhousie University)
A framework for instrument monitoring on the grid
Kenny, S. (2006)
The spectra of the unitary marix of a 2-tessellable staggered quantum walk on a graphPreprint
Konno, N., Sato, I., & Segawa, E. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1701.08274 · Cited by 1
More than restoring strings of symbols transmitted means transfer today
Ahlswede, R. (2006)
Accurate modeling of noise in quantum error correcting circuits
Arguedas, M. G. (2015) · SMARTech Repository (Georgia Institute of Technology)
Self-Testing of One-Qubit GatesPreprint
van Dam, W., Magniez, F., Mosca, M., & Sántha, M. (1999) · arXiv (Cornell University)
Circuit Synthesis of Marked Clique Problem using Quantum Walk
Sanyal, A., Saha, A., Gain, B., et al. (2017) · Advances in intelligent systems and computing · doi:10.1007/978-981-10-3409-1_3
Interplay between Quantumness, Randomness, and SelftestingPreprint
Yuan, X. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.00656
Theoretical description of strongly correlated ultracold atoms in external confinement
Schneider, P. (2013) · edoc Publication server (Humboldt University of Berlin) · doi:10.18452/16829
Time-Space Tradeoffs and Query Complexity in Statistics, Coding Theory, and Quantum Computing
Machmouchi, W. (2013) · ResearchWorks at the University of Washington (University of Washington)
Quantum Phase Transition and Quantum Entanglement in the Generalized Cluster-XY Model
Deger, A. (2016) · Academic Commons (Stony Brook University)
Seigneur, H. P. (2010) · Journal of International Crisis and Risk Communication Research
Towards Implementation of Quantum Algorithms Using Electron and Nuclear Spins in Single Crystals
Labruyère, S. (2014) · UWSpace (University of Waterloo)
Experimental Quantum Information Processing with Photons
Lavoie, J. (2013) · UWSpace (University of Waterloo)
Practical Test of a Quantum Key Distribution System
Manninen, T. (2017)
Quaternionic Grover Walks and Zeta Functions of Graphs with Loops
Konno, N., Mitsuhashi, H., & Sato, I. (2017) · Graphs and Combinatorics · doi:10.1007/s00373-017-1785-4
Photonic Integrated Circuits with Quantum Dots
Rengstl, U., Jetter, M., & Michler, P. (2017) · Nano-optics and nanophotonics · doi:10.1007/978-3-319-56378-7_13
Comparison of Dynamic Diffusion with an Explicit Difference Scheme for the Schrödinger Equation
Kukushkin, V., & Ozhigov, Y. (2013) · Complex Systems · doi:10.25088/complexsystems.22.4.423
Additive decomposition of iterative quantum search operations in the Grover-type algorithmPreprint
Toyama, F. M., & van Dijk, W. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1706.01519
Spin Coherence Excitation in Pr3+ :Y2SiO5
Vestin, F. (2003) · Lund University Publications Student Papers (Lund University)
Gazit, Y. (2017) · KTH Publication Database DiVA (KTH Royal Institute of Technology)
Measurement and Quantum State Transfer in Superconducting Qubits
Mlinar, E. (2016) · eScholarship (California Digital Library)
Spectral properties of finite groups
Bradford, H. M. (2015) · Oxford University Research Archive (ORA) (University of Oxford) · doi:10.5287/ora-n1rr8xqk4
Implementação eficiente em software do esquema de assinatura de Merkle e suas variantes
de Oliveira, A. K. D. S. (2017) · doi:10.47749/t/unicamp.2017.983576
Optical Quantum Teleportation over a Lossy Environment
김호용 (2017) · Seoul National University Open Repository (Seoul National University)
Introduction to CREST Crypto-Math Project
Takagi, T. (2017) · Mathematics for industry · doi:10.1007/978-981-10-5065-7_1
Whitaker, A. (2017) · Advanced information and knowledge processing · doi:10.1007/978-3-319-59090-5_3
Overview of Bit Commitment Schemes
Lulev, H. (2007)
Quantum min / max algorithms based on qubits {00, 11}
Odeh, A., & Abdelfattah, E. (2017) · IEEE Long Island Systems, Applications and Technology Conference (LISAT) · doi:10.1109/lisat.2017.8001972
Smith-Tone, D. (2012)
Bipartite entanglement in AJL's algorithm for three-strand braidsPreprint
Qu, R., Dong, W., Wang, J., Bao, Y.-R., Song, Y., & Song, D. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1708.06057
Bae, J. (2017) · Quantum Communications and Quantum Imaging · doi:10.1117/12.2273120
R�nyi Quantum Conditional Mutual Information and Parity Quantum Optical Metrology
Seshadreesan, K. P. (2015) · Louisiana State University · doi:10.31390/gradschool_dissertations.2590
The Power Of Quantum Walk Insights, Implementation, And Applications
Chiang, C. F. (2011) · Journal of International Crisis and Risk Communication Research
Chandrasekara, R., Bedington, R., Bai, X., et al. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1710.03907
On the probability of finding marked connected components using quantum walksPreprint
Nahimovs, N., Santos, R. A. M., & Khadiev, K. R. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1710.04046
Schöning, U., & Pruim, R. J. (1998) · Springer eBooks · doi:10.1007/978-3-642-60322-8_27 · Cited by 1
Practical Quantum Fingerprinting and Appointment Scheduling
Lovitz, B. (2017) · UWSpace (University of Waterloo)
Generation and characterization of spectrally factorable biphotons
Chen, C. (2017) · DSpace@MIT (Massachusetts Institute of Technology)
Gaussian Kernel in Quantum Paradigm.Preprint
Bishwas, A. K., Mani, A., & Palade, V. (2017) · arXiv (Cornell University)
Heisenberg-Langevin Formalism For Open Circuit-QED SystemsPreprint
Malekakhlagh, M. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1711.05699
Quantum speedup to some types of polynomial equationsPreprint
Shao, C. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1711.09546
Special session paper: efficient arithmetic for lattice-based cryptography
O’Sullivan, E., & Regazzoni, F. (2017)
Generalization of Quantum Fourier TransformationPreprint
Shao, C. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1712.01350
Unentangling Quantum Algorithms for Mathematicians and Engineers
Pieper, J. (2017) · CU Scholar (University of Colorado Boulder)
Quantum Learning Algorithms and Post-Quantum CryptographyPreprint
Poremba, A. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1712.09289
Quantum Cryptography Protocols for Information Security
Pulkkis, G., & Grahn, K. J. (2009) · IGI Global eBooks · doi:10.4018/978-1-60566-026-4.ch510
Design and implementation of quantum circuits for fault-tolerant architectures
Prousalis, K. P., & Konofaos, N. (2017) · doi:10.1109/pacet.2017.8259984
Telecom Wavelength Quantum Devices
Felle, M. (2017) · Apollo (University of Cambridge) · doi:10.17863/cam.16859
How to Store Tensors in Computer Memory: An Observation
Ceberio, M. C., & Крейнович, В. (2018) · Matematičeskie struktury i modelirovanie · doi:10.24147/2222-8772.2018.2.107-117
A Continuous - Time Quantum Walk for Attributed Graphs MatchingPreprint
Workneh, T. C. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1801.10339 · Cited by 1
A Note On Deutsch-Jozsa AlgorithmPreprint
Cao, Z., Uhlmann, J. K., & Liu, L. (2018) · viXra
Current Quantum Information Science and Technology
Pulkkis, G., & Grahn, K. J. (2014) · Advances in information quality and management · doi:10.4018/978-1-4666-5888-2.ch420
Studies of Small Systems in Quantum Information
Vinjanampathy, S. (2010) · doi:10.31390/gradschool_dissertations.1078
Thomas, N. K. (2015) · ResearchWorks at the University of Washington (University of Washington)
Melhorando o ataque de reação contra o QC-MDPC McEliece
Paiva, T. A. B. (2018) · doi:10.11606/d.45.2018.tde-07012018-212020
A Synoptic Study on Fault Testing in Reversible and Quantum Circuits
Dey, R., Bandyopadhyay, P., Chandra, S., & Majumdar, R. (2018) · Smart innovation, systems and technologies · doi:10.1007/978-981-10-8102-6_2
Collective micro-causality in homogeneous quantum ensemblesPreprint
Ozhigov, Y. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.03515
Biophysical Origins of Consciousness
Cooper, W. G. (2018) · Biomedical Journal of Scientific & Technical Research · doi:10.26717/bjstr.2018.03.000949
Fastest Quantum Search for Extreme PointPreprint
Ozhigov, Y. (1998) · arXiv (Cornell University)
Quantum recovery protocols for stabilizer codes: Deterministic Monte-Carlo simulation
Prousalis, K. P., Iliadis, A. A., & Konofaos, N. (2018) · AIP Advances · doi:10.1063/1.5024661
Validating IGE Mode of Block Cipher from Quantum Adversaries
Kim, S., Lee, J., Choi, R., & Kim, K. (2018)
Implementation of neareast neighbor quantum circuit with low quantum cost
Biswal, L., Bhattachaijee, A., Ghosh, S., et al. (2018) · International Symposium on Devices, Circuits and Systems (ISDCS) · doi:10.1109/isdcs.2018.8379674
Automatically solving NP-complete problems on a quantum computer
Hu, S., Liu, P., Chen, C.-F., et al. (2018) · doi:10.1145/3183440.3194959
Extensible Architecture for Superconducting Quantum Computing
McConkey, T. (2018) · UWSpace (University of Waterloo)
Kraus operator formalism using a reduced Hamiltonian approach on controlled-unitary operations
Udayakumar, P. (2017) · Holmes Museum Of Anthropology (Wichita State University)
Representing and Probing Errors in Quantum Information Processing Devices
Lin, J. (2018) · UWSpace (University of Waterloo)
QC | pp >: A Behavioral Quantum Computing Simulation Library
Ardelean, S. M., & Udrescu, M. (2018) · IEEE International Symposium on Applied Computational Intelligence and Informatics (SACI) · doi:10.1109/saci.2018.8440993
Evolutionary- and Quantum-Inspired Computation. Applications for SNN Optimisation
Kasabov, N. K. (2018) · Springer series on bio- and neurosystems · doi:10.1007/978-3-662-57715-8_7
Quantum algorithms for distinguishing unitary operators
Shanu, & Bera, D. (2018)
Experiments in Quantum Computing
Jones, P. W., Nicholls, C. A., & Prabhu, S. G. R. (2018) · Greenwich Academic Literature Archive (University of Greenwich)
Quantum Algorithm for Crowding Method
Kim, J. S., & Ahn, C. W. (2018) · Communications in computer and information science · doi:10.1007/978-981-13-2829-9_36
Sakashita, I. (2013) · Kyushu University Institutional Repository (QIR) (Kyushu University)
Evolutionary quantum origins of consciousness
Cooper, W. G. (2018) · Journal of Systems and Integrative Neuroscience · doi:10.15761/jsin.1000193
Improved Quantum Circuits with Qudits and Dirty Ancillae
Gokhale, P., Baker, J. M., & Chong, F. T. (2018)
On the quantum complexity of approximating median of continuous distributionPreprint
Goćwin, M. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1811.10017
Complexity: What, Why, and How
Lakshmikantham, V., & Sen, S. K. (2005) · Mathematics in Science and Engineering/Mathematics in science and engineering · doi:10.1016/s0076-5392(05)80054-2
User-Controlled Computations in Untrusted Computing Environments
Vinayagamurthy, D. (2019) · UWSpace (University of Waterloo)
Pair-Wise Classifications of Patterns in a Two-Qubits System
Rajput, B. S. (2017) · Open Access Journal of Physics · doi:10.22259/2637-5826.0101003
Making Quantum Computing Open: Lessons from Open-Source ProjectsPreprint
Shaydulin, R., Thomas, C., & Rodeghero, P. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1902.00991
On the physical limit of quantum computingPreprint
Ozhigov, Y. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1902.05426 · Cited by 1
Variational Quantum Circuit Model for Knowledge Graphs EmbeddingPreprint
Ma, Y., Tresp, V., Zhao, L., & Wang, Y. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.00556
Computing Wavefunctions of Silicon Donor Qubits with Density Functional Theory
Almulla, Y. W. (2018)
May a Dissipative Environment Be Beneficial for Quantum Annealing?
Passarelli, G., Filippis, G. D., Cataudella, V., et al. (2019) · doi:10.3390/proceedings2019012026
Hughes, R. (2003) · Encyclopedia of Computer Science
Power of photonic states: from computation to cosmology
Liu, N. (2016) · Oxford University Research Archive (ORA) (University of Oxford) · doi:10.5287/ora-2zw6qrbve
A novel quantum grid search algorithm and its applicationPreprint
Shukla, A., & Vedula, P. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.07268
A practicable guide to the quantum computation architecturesPreprint
Ian, H., Chen, B., & Zhao, W. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.10739
Franck, C. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.06473
Implementation of new technique for Face recognition based on quantum computing
Sahib, A. Y. (2018) · Wasit Journal of Engineering Sciences · doi:10.31185/ejuow.vol5.iss1.65
From Information Theory Puzzles in Deletion Channels to Deniability in Quantum CryptographyPreprint
Atashpendar, A. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.11663 · Cited by 1
Window Size Estimation for Nearest Neighbour Compliant Quantum Circuit Mapping
Rogers, L., & McAllister, J. (2019) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas.2019.8702089
Integrated Photonic Multiplexing for Quantum Information
Haylock, B. (2018) · Griffith Research Online · doi:10.25904/1912/465
z-NAF e clipping: two improvements for post-quantum hash-based digital signatures.
Zheng, A. Y. C. L. (2019) · Digital Library of Theses and Dissertations (Universidade de São Paulo) · doi:10.11606/d.3.2019.tde-15042019-141848
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
