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 5,101–5,200 of 8,792
Classical and Quantum Algorithms for Finding Cycles
Cirasella, J. (2006) · CUNY Academic Works (City University of New York) · Cited by 4
Structuring general and complete quantum computations in Haskell : the arrows approach
Vizzotto, J. K. (2006) · Americanae (AECID Library) · Cited by 3
Design of Regular Reversible Quantum Circuits
Shah, D. (2000) · doi:10.15760/etd.129 · Cited by 4
Cyber Security Resilience in Industrial Control Systems using Defence-in-Depth and Zero Trust
Jadidi, Z., Pal, S., Li, Q., & Foo, E. (2023) · 2023 16th International Conference on Sensing Technology (ICST) · doi:10.1109/icst59744.2023.10460853 · Cited by 2
LESS is More: Code-Based Signatures Without Syndromes
Biasse, J., Micheli, G., Persichetti, E., & Santini, P. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-51938-4_3 · Cited by 79
VAQEM: A Variational Approach to Quantum Error Mitigation
Ravi, G. S., Smith, K. N., Gokhale, P., Mari, A., Earnest, N., Javadi-Abhari, A., & Chong, F. T. (2022) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca53966.2022.00029 · Cited by 19
Gårding, E. R., Schwaller, N., Chan, C. L., Chang, S. Y., Bosch, S., Gessler, F., Laborde, W. R., Hernández, J. N., Si, X., Dupertuis, M. ‐., et al. (2021) · Entropy · doi:10.3390/e23070797 · Cited by 30
Quantum Counterfeit Coin Problems
Iwama, K., Nishimura, H., Raymond, R., & Teruyama, J. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17517-6_10 · Cited by 4
Finite-Function-Encoding Quantum States
Appel, P., Heilman, A. J., Wertz, E. W., Lyons, D. W., Huber, M., Pivoluska, M., & Vitagliano, G. (2022) · Quantum · doi:10.22331/q-2022-05-09-708 · Cited by 2
Making Music Using Two Quantum Algorithms
Allen, E. J., Bulmer, J. F. F., & Small, S. D. (2022) · Springer eBooks · doi:10.1007/978-3-031-13909-3_4 · Cited by 2
DESIGN OF TECHNOLOGY FOR SECURE FILE STORAGE BASED ON HYBRID CRYPTOGRAPHY METHODS: SHORT OVERVIEW
Manap, A., Abitova, G., Uskenbayeva, G., & Shaikhanova, A. K. (2023) · Вестник КазАТК · doi:10.52167/1609-1817-2023-129-6-205-215 · Cited by 2
Quadratic Speed‐ups in Quantum Kernelized Binary Classification
Lee, J., & Park, D. K. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202400126 · Cited by 3
Cybersecurity trends in cooperative, connected and automated mobility
Campo, O. C., Martínez, V. G., Encinas, L. H., MuÑoz, A. M., & Fernández, R. Á. (2024) · Logic Journal of IGPL · doi:10.1093/jigpal/jzae072 · Cited by 2
Advanced Shuttle Strategies for Parallel QCCD Architectures
Dai, W., Brown, K. A., & Robertazzi, T. G. (2024) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2024.3408757 · Cited by 2
Quantum temporal logic and reachability problems of matrix semigroups
Yu, N. (2024) · Information and Computation · doi:10.1016/j.ic.2024.105197 · Cited by 2
Multi-participant quantum anonymous communication based on high-dimensional entangled states
Liu, J., Mu, Q.-X., Che, R., Wang, Q., Han, Y.-G., & Cheng, L. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad69d9 · Cited by 2
Quantum Attacks on MIBS Block Cipher Based on Bernstein–Vazirani Algorithm
Xie, H., Zhao, Z., Wang, K., et al. (2024) · Mathematics · doi:10.3390/math12172678 · Cited by 2
Exploiting the Extended Neighborhood of Hexagonal Qubit Architecture for Mapping Quantum Circuits
Kole, A., Datta, K., Sengupta, I., & Drechsler, R. (2024) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/3688391 · Cited by 2
On the theory of quantum and towards practical computation: A review
Kudelić, R. (2024) · Journal of Computational Science · doi:10.1016/j.jocs.2024.102454 · Cited by 5
A measurement-device-independent quantum secure digital payment
Wang, Q., Liu, J., Li, G., et al. (2024) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2024.130178 · Cited by 2
Emerging applications of measurement-based quantum computing
Qin, Z., Li, X., Zhou, Y., Zhang, S., Li, R., Du, C., & Xiao, Z. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04596-3 · Cited by 3
Semi-quantum voting protocol with decentralization of vote verification and traceability
Shujing, Q., Xin, X., Zheng, Q., et al. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04604-6 · Cited by 2
Two Novel Semi-Quantum Secure Direct Communication Protocols in IoT
Tian, Y., Zhang, N., & Li, J. (2024) · Sensors · doi:10.3390/s24247990 · Cited by 2
Noise suppression via coherent quantum feedback: A Schrödinger picture approach
Zhang, S., Zhang, G., & Zhang, G. (2024) · Automatica · doi:10.1016/j.automatica.2024.112076 · Cited by 2
An Overview of Quantum Circuit Design Focusing on Compression and Representation
Haque, M. E., Paul, M., Tohidi, F., & Ulhaq, A. (2024) · Electronics · doi:10.3390/electronics14010072 · Cited by 2
A Parallel Genetic Algorithm for Qubit Mapping on Noisy Intermediate-Scale Quantum Machines
Rouzé, J., Melab, N., & Tuyttens, D. (2025) · Communications in computer and information science · doi:10.1007/978-3-031-77941-1_24 · Cited by 2
DGMT: A Fully Dynamic Group Signature from Symmetric-Key Primitives
Fadavi, M., Karati, S., Erfanian, A., & Safavi–Naini, R. (2025) · Cryptography · doi:10.3390/cryptography9010012 · Cited by 2
Quantum claw-finding attacks on 5-round Feistel structure and generalized Feistel schemes
Feng, X., Wu, H., Zhang, K., et al. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04671-3 · Cited by 2
Quantum internet building blocks state of research and development
Meddeb, A. (2025) · Computer Networks · doi:10.1016/j.comnet.2025.111151 · Cited by 5
An improved quantum algorithm of the multislice method
Wang, Y., Yang, S. O., & Ding, Z. (2025) · iScience · doi:10.1016/j.isci.2025.112165 · Cited by 2
A 20-GHz Low-Noise RF Pulse Generator for Silicon Quantum Computer with 137.4-fs Jitter
Norimatsu, T., Wachi, Y., Miki, T., KANNO, Y., Takahashi, R., Ogawa, T., Utsugi, T., Sekiguchi, T., Nagata, M., & Mizuno, H. (2025) · IEICE Transactions on Electronics · doi:10.1587/transele.2024ctp0001 · Cited by 2
An Optimized Nearest Neighbor Compliant Quantum Circuit for 5-Qubit Code
Mondal, A., & Parhi, K. K. (2024) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/ieeeconf60004.2024.10943092 · Cited by 2
On Reducing the Execution Latency of Superconducting Quantum Processors via Quantum Job Scheduling
Wu, W., Wang, Y., Yan, G., Zhao, Y., Zhang, B., & Yan, J. (2024) · doi:10.1145/3676536.3676678 · Cited by 6
Liu, Y., Qian, Y., Wang, L., Zhang, Z., & Yu, X. (2025) · Physics Letters A · doi:10.1016/j.physleta.2025.130541 · Cited by 4
Constructing resource-efficient quantum circuits for AES
Jiang, L.-L., Cai, B.-B., Gao, F., Qin, S.-J., Jin, Z.-P., & Wen, Q.-Y. (2025) · Frontiers of Physics · doi:10.3389/fphy.2025.1582819 · Cited by 4
Robot localization aided by quantum algorithms
Antero, U., Sierra, B., Oñativia, J., Ruíz, A., & Osaba, E. (2025) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2025.105026 · Cited by 2
Implementing semiclassical Szegedy walks in classical-quantum circuits for homomorphic encryption
Ortega, S. A., Fernández, P., & Martin-Delgado, M. A. (2025) · Journal of Physics Complexity · doi:10.1088/2632-072x/add3aa · Cited by 3
Quantum Neural Networks: Bridging Topological Structures and Variational Quantum Circuits
Gushanskiy, S. M., Potapov, V., & Polenov, M. (2025) · International Russian Smart Industry Conference (SmartIndustryCon) · doi:10.1109/smartindustrycon65166.2025.10986184 · Cited by 2
Optimal entanglement distribution within a multi-ring topology
Ciobanu, B.-C., Calafeteanu, T. A., Popa, A.-B., et al. (2025) · Scientific Reports · doi:10.1038/s41598-025-00391-x · Cited by 2
Q-Gen: A Parameterized Quantum Circuit Generator
Mao, Y., Shresthamali, S., & Kondo, M. (2025) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2025.3572142 · Cited by 3
Applications of Quantum Computing in AI
Mummadi, S., Jambek, A. B., Siripuram, A., Vadla, S., & Mohammed, N. (2025) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-3373-1210-1.ch001 · Cited by 2
Post-Quantum Cryptography: A Comprehensive Review of Past Technologies and Current Advances
Jain, B., & Mittal, H. (2025) · Global Conference on AI Research and Emerging Developments (G-CARED) · doi:10.63169/gcared2025.p52 · Cited by 3
A Novel Data Representation Towards Efficient FPGA-based Quantum Computer Simulation
Hasegawa, H., Shimoda, M., Nakahara, H., et al. (2025) · Proceedings/Proceedings - International Symposium on Multiple-Valued Logic · doi:10.1109/ismvl64713.2025.00031 · Cited by 2
Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes
Lin, T., & Lai, C. (2025) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2025.3581810 · Cited by 2
Hybrid quantum and in-memory computing for accelerating solving Simon’s problem
Miao, Z., Li, Y., Wang, S., & Sun, Z. (2025) · APL Machine Learning · doi:10.1063/5.0268483 · Cited by 2
Don’t Cares in Quantum Circuits: A Security Perspective
Lushi, D., Rasmussen, C., & Saeed, S. M. (2025) · ACM Great Lakes Symposium on VLSI (GLSVLSI) · doi:10.1145/3716368.3735283 · Cited by 2
Trade-offs in Cryptosystems by Boolean and Quantum Circuits
Lavagna, L., Falco, F. D., Ceschini, A., Rosato, A., & Panella, M. (2025) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas56072.2025.11043205 · Cited by 2
Quantum Circuit Design for Finding k-Cliques via Quantum Amplitude Amplification Strategies
Perriello, S. (2025) · ACM International Conference on Computing Frontiers (CF) · doi:10.1145/3719276.3725200 · Cited by 2
Quantum Interference in Atomic Systems
Ahmadi, S., Akbari, M., Saeidian, S., & Motazedifard, A. (2025) · Annalen der Physik · doi:10.1002/andp.202500094 · Cited by 4
Publicly verifiable quantum homomorphic encryption based on quantum remote control
Zhang, X., & Xi, Y. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04835-1 · Cited by 2
Post-Quantum Cryptography for Big Data Security
Bajwa, M. T. T., Afzal, M. N., Afzal, M. H., et al. (2025) · The Asian Bulletin of Big Data Management · doi:10.62019/a2868463 · Cited by 2
Hybrid encryption in correlated randomness model and KEM combiners
Panja, S., Sharifian, S., Jiang, S., et al. (2025) · Theoretical Computer Science · doi:10.1016/j.tcs.2025.115518 · Cited by 2
Kourtis, M., Oikonomakis, G., Koufos, I., Xilouris, G. K., Kefaloukos, I., Markakis, E., Karcz, D., & Niemiec, M. (2025) · International Conference in Electronic Engineering & Information Technology (EEITE) · doi:10.1109/eeite65381.2025.11166257 · Cited by 4
Ralli, A., Weaving, T., Coveney, P. V., & Love, P. J. (2025) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.5c00948 · Cited by 3
An optimized exact multi-target search algorithm
Zhong, S., Zhao, Y., Dai, G., & Wu, D. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04932-1 · Cited by 2
Qukkos: Measurement-Based Quantum Compilation System
Dang, S., Son, Y., & Kim, B. (2025) · International Conference on Artificial Intelligence, Computer, Data Sciences and Applications (ACDSA) · doi:10.1109/acdsa65407.2025.11165960 · Cited by 2
Quantum Voice‐Based Cyber‐Attacks: Threats, Vulnerabilities, and Post‐Quantum Mitigation Strategies
Sihare, S. R. (2025) · Security and Privacy · doi:10.1002/spy2.70106 · Cited by 3
A tutorial on applying quantum multiple-valued decision diagrams to circuit simulation
Kydros, A., Prousalis, K. P., & Konofaos, N. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04917-0 · Cited by 2
Chen, T., & Hung, W.-H. (2025) · Electronics · doi:10.3390/electronics14193821 · Cited by 2
A Survey of Post-Quantum Oblivious Protocols
Khutsaeva, A. F., Георгиевич, Л. А., & Bezzateev, S. V. (2025) · Cryptography · doi:10.3390/cryptography9040062 · Cited by 2
A transferable quantum anonymous ranking protocol without third party
Mao, X., Sun, H., Wang, J., et al. (2025) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-025-00422-6 · Cited by 2
Unbounded quantum-classical separation in sample complexity for sphere center finding
Li, G., & Li, L. (2025) · Information and Computation · doi:10.1016/j.ic.2025.105361 · Cited by 3
Discrete-time quantum walk search on the cycle graph with weighted self-loop
Tiong, Y. Q., Ong, K. L., & Tan, I. K. T. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04945-w · Cited by 2
Embedding Quantum Program Verification into Dafny
Cheng, F., Vangeepuram, S. V., Allard, H., et al. (2025) · Proceedings of the ACM on Programming Languages · doi:10.1145/3763157 · Cited by 2
Cai, X., Yang, Y., Wang, T., et al. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202500600 · Cited by 2
Quantum entanglement resource utilization in quantum-classical networking
Njoku, B., Ghadimi, M., Nande, S. S., Rajabov, A., Ming, Y., Kim, J. E., Scholtz, E., Habibie, M. I., Arar, B., Hopfmann, C., et al. (2025) · Optical Switching and Networking · doi:10.1016/j.osn.2025.100829 · Cited by 4
Quantum Algorithm for Finding Minimum Values in a Quantum Random Access Memory
Albino, A. S., Galvão, L. Q., Neto, M. Q. N., Hansen, E., & Cruz, C. (2025) · Brazilian Journal of Physics · doi:10.1007/s13538-025-01924-5 · Cited by 2
Qudit low-density parity-check codes
Spencer, D. J., Tanggara, A., Haug, T., Khu, D., & Bharti, K. (2026) · Quantum · doi:10.22331/q-2026-03-13-2023 · Cited by 8
Implementation of Shor’s Algorithm: Factoring a 4096-Bit Integer Under Specific Constraints
Chen, A. C. H. (2025) · doi:10.1109/iccpct65132.2025.11176593 · Cited by 2
Effects of Post Quantum Cryptography on Financial Blockchains
Başol, A. E., Bahtıyar, Ş., & Sandıkkaya, M. T. (2025) · 2025 10th International Conference on Computer Science and Engineering (UBMK) · doi:10.1109/ubmk67458.2025.11206837 · Cited by 2
Improving Grover’s Algorithm with Dicke States
Jiang, J., & Lin, Q.-Y. (2025) · IEEE International Conference on Consumer Electronics - Taiwan (ICCE-Taiwan) · doi:10.1109/icce-taiwan66881.2025.11207978 · Cited by 2
Conditional Constant Function Problem and Its Quantum Solutions: Attacking Feistel Ciphers
Li, Z., Fan, S., Gao, F., Hao, Y., Hu, X.-C., Wan, L., Sun, H.-W., & Su, Q. (2025) · IEEE Internet of Things Journal · doi:10.1109/jiot.2025.3627427 · Cited by 2
NTT-LSU: Tightly Coupled Architecture for Efficient NTT Implementation on RISC-V Processor
Zhao, Y., Xie, Z., Zhan, R., et al. (2025) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2025.3627145 · Cited by 2
Quantum AI in Drug Discovery: Bridging Gaps and Future Advancements
Sinha, G., Harshini, B. S., & Madhumitha (2025) · International Conference on Engineering Innovations and Technologies (ICoEIT) · doi:10.1109/icoeit63558.2025.11211747 · Cited by 2
Asymptotic Improvements to Provable Algorithms for the Code Equivalence Problem
Bennett, H., Bhatia, D., Biasse, J., Durisheti, M., LaBuff, L., Lavorante, V. P., & Waitkevich, P. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3637683 · Cited by 2
Local Optimization of Quantum Circuits
Arora, J., Xu, M., Westrick, S., Liu, P., Li, D., Ding, Y., & Acar, U. A. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00069 · Cited by 4
A Survey of Quantum Machine Learning: Understanding the Current Landscape and Future Opportunities
Singh, K. R., Badhiye, S. S., Gupta, K., et al. (2025) · Operations Research Forum · doi:10.1007/s43069-025-00569-z · Cited by 2
GraphQWalk: Learning Structural Node Embeddings via Continuous Quantum Walk
Liu, G., Zhao, J., Wei, H., Zhou, Z., Song, Y., Zhou, X., & Qi, G. (2025) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2025.3644803 · Cited by 2
Photonic variational quantum eigensolver for NISQ-compatible quantum technology
Hu, K.-M., Namkung, M., & Lim, H. (2025) · Nano Convergence · doi:10.1186/s40580-025-00525-x · Cited by 2
Single engine architecture for hardware root of trust
Najork, D., Nešković, A., Lin, H.-K., et al. (2025) · Journal of Cryptographic Engineering · doi:10.1007/s13389-025-00381-9 · Cited by 2
Integrity verification scheme for distributed dynamic data in service ecosystems
Li, F., Wang, G., Liu, G., et al. (2025) · Computers & Security · doi:10.1016/j.cose.2025.104671 · Cited by 2
A Comprehensive Review on Classification of Quantum Image Representations
Alwan, N. A., Al-Saidi, N. M. G., Obaiys, S. J., Noor, N. F. B. M., & Ahmad, M. (2025) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-025-10369-7 · Cited by 2
Comprehensive Post-Quantum Cryptography Performance Evaluations for QUIC Protocol
Rigon, P., Fu, H., Cordeiro, W. L. D. C., & Fung, C. (2025) · IEEE Conference on Communications and Network Security · doi:10.1109/cns66487.2025.11195046 · Cited by 2
Improved Quantum Cryptanalysis on Generalized Feistel Structure
Wei, Y., Liu, Q., Li, B., et al. (2026) · Lecture notes in computer science · doi:10.1007/978-981-95-6206-0_15 · Cited by 2
Quantum Computing for a Sustainable Future: Transforming Energy Efficiency and Climate Solutions
Bellary, S., & Raghavendra, A. H. (2026) · Studies in big data · doi:10.1007/978-3-032-00586-1_3 · Cited by 2
Quantum and classical query complexities for determining connectedness of matroids
Huang, X., Feng, S., & Li, L. (2026) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2026.103758 · Cited by 2
Onion Routing Key Distribution for QKDN
Otero-García, P., Blanco-Romero, J., Vilas, A. F., et al. (2025) · Proceedings - IEEE Symposium on Computers and Communications/IEEE Symposium on Computers and Communications · doi:10.1109/iscc65549.2025.11325762 · Cited by 2
Neutral-atom quantum computation using multi-qubit geometric gates via adiabatic passage
Rej, S. S., & Deb, B. (2026) · New Journal of Physics · doi:10.1088/1367-2630/ae390c · Cited by 2
Quo Vadis, Quantum Machine Learning?: Quantum kernel methods meet Earth observation
Miroszewski, A., Nalepa, J., Wijata, A. M., B, J. M. A., Saux, B. L., & Sebastianelli, A. (2026) · IEEE Geoscience and Remote Sensing Magazine · doi:10.1109/mgrs.2025.3596291 · Cited by 2
A comprehensive review on quantum steganography techniques for data hiding
Patra, A., Barik, R. C., & Changder, S. (2026) · Computer Science Review · doi:10.1016/j.cosrev.2026.100911 · Cited by 2
Assad, D. B. N., da Costa, P. G. F., Spiegel, T., & Rocha, H. D. O. (2026) · Engineering Reports · doi:10.1002/eng2.70604 · Cited by 1
Olofin, I. (2026) · Discover Computing · doi:10.1007/s10791-026-09924-y · Cited by 2
Secure and Efficient Block Cipher Mode Design for Parallel Processing and Reliable Security
Vatsavayi, V. K., & Bommireddy, D. R. (2026) · Cryptography · doi:10.3390/cryptography10010013 · Cited by 2
Surrogate Quantum Circuit Design for the Lattice Boltzmann Collision Operator
Lăcătuş, M., & Möller, M. (2026) · International Journal for Numerical Methods in Engineering · doi:10.1002/nme.70286 · Cited by 2
Physics and computation: An insight from non-Hermitian quantum computing
Zhang, Q., & Wu, B. (2026) · Physical Review A · doi:10.1103/mywt-m86w · Cited by 2
PQC-LEO: An Evaluation Framework for Post-Quantum Cryptographic Algorithms
Turino, C., Buchanan, W. J., Lo, O., & Thümmler, C. (2025) · IEEE International Conference on Trust, Privacy and Security in Intelligent Systems and Applications (TPS-ISA) · doi:10.1109/tps-isa67132.2025.00033 · Cited by 2
Why Oracle-Based Quantum Search Cannot Use Deep Loops: Physical Limits on Sequential Operations
(18461), Y. L. (2026) · Journal of Quantum Information Science · doi:10.4236/jqis.2026.161003 · Cited by 2
Optimal T-depth Quantum Circuits for Implementing Arbitrary Boolean Functions
Dutta, S., Bhaumik, A., Chattopadhyay, A., & Maitra, S. (2025) · Quantum Information & Computation · doi:10.2478/qic-2025-0032 · Cited by 3
The Exponential Speedup Algorithm: O(logN) Amplitude Amplification via Geometric Series
Liu, Y. (2026) · Journal of Quantum Information Science · doi:10.4236/jqis.2026.161005 · Cited by 2
Post-quantum readiness and cryptographic transition planning for enterprise cloud
Gupta, A., & Mittal, S. (2026) · Cybersecurity · doi:10.1186/s42400-026-00579-2 · Cited by 2
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
