The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index; none of the 8 sources its claims cite is checked for support yet.
A fast quantum mechanical algorithm for database search
Open accessAbstract
An unsorted database contains N records, of which just one satisfies a particular property.The problem is to identify that one record.Any classical algorithm, deterministic or probabilistic, will clearly take O (N) steps since on the average it will have to examine a large fraction of the N records.Quantum mechanical systems can do several operations simultaneously due to their wave like properties.This paper gives an O ( JN) step quantum mechanical algorithm for identifying that record.It is within a constant factor of the fastest possible quantum mechanical algorithm.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
19 No basis given · 8 Sources not found · 4 Own interpretation
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This paper gives an O ( JN) step quantum mechanical algorithm for identifying that record.”
§ A fast quantum mechanical algorithm for database search > Abstract
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- The authors state this as an assumption: There is a unique state that satisfies the condition C(S)=1.
- The authors state this as an assumption: For any state S, the condition C(S) can be evaluated in unit time.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Corollary 3.1-Let the state vector be as followsfor any one state the amplitude is k, for each of the remaining (N-1) states the amplitude is 1.Let k and 1 be real numbers (in general the amplitudes can be complex).Let k be negative and 1 be positive such that ~< ~N.Then after applying the diffusion transform both k and 1are positive numbers.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“First, it is proved that the system is a valid quantum mechanical system (theorems 1 & 2)”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
boosted- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“As mentioned in the introduction, the algorithm of this paper does not use any Imowledge about the problem.”
§ A fast quantum mechanical algorithm for database search > 114
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Theorem 1-The matix D is unitary.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The following sections prove that the system discussed in section 3 is indeed a valid quantum mechanical system and that it converges to the desired state with a probability O(l).”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- The authors state this as an assumption: There is a unique state that satisfies the condition C(S)=1.
- The authors state this as an assumption: For any state S, the condition C(S) can be evaluated in unit time.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Theorem 2 -D can be expressed as D = FRF, where F, the Fourier Transform Matrix and R, the rotation matrix are defined as follows”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Since the proba-& bility of the system being found in any particular state is proportional to the square of the amplitude, it follows that the probability of the system being in tlhe desired state when k is ~, 1 J2 is k2 = ~.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In case there is a unique state SV such that C(SV) = 1, the final state is SV with a probability of at least ~. 2”
§ A fast quantum mechanical algorithm for database search > T. Acknowledgments
plainconditional- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
- The authors state this as an assumption: There is a unique state that satisfies the condition C(S)=1.
- The authors state this as an assumption: For any state S, the condition C(S) can be evaluated in unit time.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“It can be easily modified to take care of the case when there are multiple states satisfying the condition C(S) = 1 and it is required to return one of these.”
§ A fast quantum mechanical algorithm for database search > 114
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Probably not a substantial claim. 8
- It may state two separate claims as one. 4
- The quote only partly states this claim. 1
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Theorem 5-Let the probability of a particular outcome in an experiment be &.Then if the experiment be repeated ~times, the probability that the outcome does not happen even once is less than or equal to e-K.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The change in k ( Ak) after steps (a) and (b) of the algorithm is lower bounded by Ak>~.Also after steps (a) and (b), 1>0.2fi”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Using this it immediately follows that there exists a number M less than EN, such that in M repetitions of the loop in step (ii), k wifl become ~.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The quote only partly states this claim.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The most efficient classical algorithm for this is to examine the items in the database one by one.”
§ A fast quantum mechanical algorithm for database search > ------------------------------------------------
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“Very recent results [Shor95] have shown the existence of quantum mechanical error corr~ting cod~which enable transmission of data even in the presence of noise”
§ A fast quantum mechanical algorithm for database search > 114
What the sources say
- Not matchedcites [Shor95]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
boosteddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This algorithm, by cleverly making use of some features of the structure of the problem, is the only known algorithm that solves the problem in O (logIV) steps.”
§ A fast quantum mechanical algorithm for database search > 114
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The phase does not have an analog in classical probabilistic algorithms.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This illustrates the point that, in quantum mechanics, the complete description of the system requires the amplitudes over all states, just the probabilities is not enough.”
§ A fast quantum mechanical algorithm for database search > 1.1 Search Problems in Computer Science
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
In the paper
“For example Shor's primality testing algorithm [Shor94] for a number N can be viewed as a search of the (N-l) numbers smaller than N to see if any of them is a factor of N.”
§ A fast quantum mechanical algorithm for database search > 114
What the sources say
- Not matchedcites [Shor94]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
In the paper
“There is also a scheme discussed in [VV86] by which it is possible to modify any algorithm that solves an NPsearch problem with a unique solution and use it to solve an NP-search problem in general.”
§ A fast quantum mechanical algorithm for database search > 114
What the sources say
- Not matchedcites [VV86]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
hedgeddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
In the paper
“This operation is one of the things that makes quantum mechanical algorithms more powerful than classical algorithms and forms the basis for most significant quantum mechanical algorithms.”
§ A fast quantum mechanical algorithm for database search > T. Acknowledgments
What the sources say
- Not matchedcites [DJ92]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
- Not matched
The authors state this as an assumption.
There is a unique state that satisfies the condition C(S)=1.
“Let there be a unique state, say Sv, that satisfies the condition C(SV) = 1, whereas for all other states S, C(S) = 0”
“The algorithm as discussed here assumes a unique state that satisfies the desired condition.”
The authors state this as an assumption.
For any state S, the condition C(S) can be evaluated in unit time.
“(assume that for any state S, the condition C(S) can be evaluated in unit time)”
The paper relies on this without support.
There does not exist any sorting on the database that would aid selection of the desired item.
“However, there does not exist any sorting on the database that would aid its selection.”
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Symmetric cryptography remains comparatively resilient, yet Grover's algorithm offers a quadratic speed-up for brute-force key search, effectively halving the security margin of symmetric ciphers [13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Similarly, for hash functions, Grover's algorithm [185] can facilitate quantum birthday attack to find collision, thereby necessitating an output of larger size.”
From Zero Trust Architecture (ZTA): A Comprehensive Survey (2022) · cites this paper as [185]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Similarly, Grover’s algorithm concedes a quadratic advantage for mining blocks in certain consensus protocols such as proof of work.”
From Quantum-resistance in blockchain networks (2023) · cites this paper as [71]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Quantum computers will be able to find these nonces quadratically faster using Grover’s algorithm71.”
From Quantum-resistance in blockchain networks (2023) · cites this paper as [71]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“This model is realistic given the falling cost of storage, the rise of large-scale surveillance infrastructures, and the expected disruption of quantum algorithms such as Shor's and Grover's [1,2,13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measured
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Grover's algorithm provides only a quadratic speedup, effectively halving brute-force resistance. Comparable security margins can be restored by doubling key sizes (for example, AES-128 to AES-256) [13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“This explains why AES-256 maintains post-quantum security margins, whereas AES-128 requires upgrading to maintain equivalent protection levels [13,14].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“At the same time, Grover's algorithm shows that symmetric cryptography, though more resilient, also demands doubled key sizes to maintain equivalent margins [13].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“In this sense, Grover-based optimization algorithms [184] such as Grover Adaptive Search [161] have been proposed.”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [184]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The former bound is tight since recent work of Grover [13] shows how to accept the class NP relative to any oracle on a quantum computer in time O (2 n/ 2 ).”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“In view of Grover's algorithm [13], we know that the constant '1 / 2' in the statement of Theorem 3.5 cannot be improved.”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The former bound is tight since recent work of Grover [13] shows how to accept the class NP relative to any oracle on a quantum computer in time O (2 n/ 2 ).”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“Grover’s algorithm [54] is a quantum algorithm for searching in a database, ofering quadratic speedup over classical searching methods.”
From QASMBench: A Low-Level Quantum Benchmark Suite for NISQ Evaluation and Simulation (2023) · cites this paper as [54]
The cited source says what the claim attributes to it.
In the citing paper
“However, quantum machines can recognize this language quadratically faster, in time O ( √ 2 n ), using Grover's algorithm [13].”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
The cited source says what the claim attributes to it.
In the citing paper
“That this was a real possibility is clear from Grover's [13] result, which gives a black-box approach to solving NP -complete problems in square-root as much time as is required classically.”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
The cited source says what the claim attributes to it.
In the citing paper
“Various strategies can be imagined, but a good one (called 'inversion about the average' by Grover [13]) is to perform an oracle-independent unitary transformation so as to change the phase difference into an amplitude difference, leaving the y term with the same sign as all the other terms but a magnitude approximately threefold larger.”
From Strengths and Weaknesses of Quantum Computing (1997) · cites this paper as [13]
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“The HNDL adversary departs from conventional cryptanalysis in its temporal asymmetry. Instead of attempting immediate decryption, the attacker passively collects encrypted traffic or stored archives and defers decryption until sufficient computational resources become available.”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredIn the citing paper
“This algorithm uses a single function evaluation to label the single state which satisfies the function, followed by a series of gates which drive the system into this particular state.”
From Implementation of a quantum search algorithm on a quantum computer (1998) · cites this paper as [9]
In the citing paper
“Here we show how such a computer can be used to implement a fast quantum search algorithm initially developed by Grover. 9, 10”
From Implementation of a quantum search algorithm on a quantum computer (1998) · cites this paper as [9]
In the citing paper
“Among other applications Grover's algorithms enable an extremely rapid search over the domain of a binary function to find elements for which this function is satisfied (that is, the function has the value 1).”
From Implementation of a quantum search algorithm on a quantum computer (1998) · cites this paper as [9]
In the citing paper
“the ability to efficiently perform Hamiltonian simulation is used in conjunction with another technique known as the quantum phase estimation algorithm (QPEA) 42 for efficiently obtaining the eigen-energies and eigenstates of a quantum system 38 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
In the citing paper
“The Quantum Phase Estimation (QPE) algorithm 38,99 is the natural translation of the FCI procedure to quantum computers 45 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
In the citing paper
“Abrams and Lloyd 38 focused on state preparation in more detail and described concrete initialization procedures.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
In the citing paper
“They pointed out that state preparation is conceptually easier in second quantization, where a Fock state is represented by a simple product state of qubits in {| 0 〉 , | 1 〉} states.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [38]
Citations
Cites
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Scheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
Rapid solution of problems by quantum computation
Deutsch, D., & Jozsa, R. (1992) · Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences · doi:10.1098/rspa.1992.0167 · Cited by 2,700
The Emperor's New Mind: Concerning Computers, Minds, and The Laws of Physics
Penrose, R., & Gardner, M. (1989) · doi:10.1093/oso/9780198519737.001.0001 · Cited by 2,007
Strengths and Weaknesses of Quantum Computing
Bennett, C. H., Bernstein, E., Brassard, G., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300933 · Cited by 1,470
On the Power of Quantum Computation
Simon, D. R. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796298637 · Cited by 1,295
Bernstein, E., & Vazirani, U. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167097 · Cited by 1,284
Benioff, P. (1980) · Journal of Statistical Physics · doi:10.1007/bf01011339 · Cited by 1,244
The Emperor's New Mind: Concerning Computers, Minds, and the Laws of Physics
Penrose, R., & Landauer, R. (1990) · Physics Today · doi:10.1063/1.2810599 · Cited by 1,110
Research works printed but not linked: 2
- [9]9. R. Penrose, Shadows of the mind,. Oxford University Press, 1994, pp. 348- 388.
- [14]14. Yao93J A. Yao, Quantum circuit complexip, Proceedings 34th Annual Symposium on Foundations of Computer Science (FOCS), 1993, pp. 352-361.
Cited by
Sorted by citations
Items 4,801–4,900 of 8,792
Efficient Quantum Circuit Synthesis for SAT-Oracle With Limited Ancillary Qubit
Yang, S., Zi, W., Wu, B., et al. (2023) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2023.3325974 · Cited by 3
Quantum Speedups for Linear Programming via Interior Point Methods
Apers, S., & Gribling, S. (2026) · SIAM Journal on Computing · doi:10.1137/25m1736098 · Cited by 35
Yefeng, 何. H., Zhi, 李. L., & Mengmei, 杨. Y. (2023) · Laser & Optoelectronics Progress · doi:10.3788/lop222701 · Cited by 3
Efficient Quantum Counting and Quantum Content-Addressable Memory for DNA Similarity
Balewski, J. T., Camps, D., Klymko, K., et al. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00050 · Cited by 3
Embedding All Feasible Solutions of Traveling Salesman Problem by Divide-and-Conquer Quantum Search
Sato, R., Saito, K., Nikuni, T., & Watabe, S. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.10238 · Cited by 3
QisDAX: An Open Source Bridge from Qiskit to Trapped-Ion Quantum Devices
Badrike, K., Dalvi, A. S., Mazurek, F., D’Onofrio, M., Whitlow, J., Chen, T., Phiri, S., Riesebos, L., Brown, K. R., & Mueller, F. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00097 · Cited by 3
Quantum Algorithm Cards: Streamlining the Development of Hybrid Classical-Quantum Applications
Stirbu, V., & Haghparast, M. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-49269-3_13 · Cited by 3
Predicting IoT Distributed Ledger Fraud Transactions With a Lightweight GAN Network
Rawlins, C. C., & Jagannathan, S. (2023) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2023.3339384 · Cited by 3
A Reputation System for Provably-Robust Decision Making in IoT Blockchain Networks
Rawlins, C. C., Jagannathan, S., & Nadendla, V. S. S. (2023) · IEEE Internet of Things Journal · doi:10.1109/jiot.2023.3340974 · Cited by 3
Current Challenge and Limitations in Quantum Computation
Saini, R., Sewada, R., & Arora, A. (2023) · Journal of Nonlinear Analysis and Optimization Theory & Applications (JNAO) · doi:10.36893/jnao.2022.v13i02.0026-035 · Cited by 2
Concrete Analysis of Quantum Lattice Enumeration
Bai, S., van Hoof, M.-I., Johnson, F. B., Lange, T., & Ngo, T. (2023) · Lecture notes in computer science · doi:10.1007/978-981-99-8727-6_5 · Cited by 4
Quantum Safe Construction of Authentication and Key Exchange Based on Module Lattices
Banerjee, S., Nikhilesh, M., Sharma, A., et al. (2023) · IEEE Global Conference for Advancement in Technology (GCAT) · doi:10.1109/gcat59970.2023.10353320 · Cited by 3
QuanPath: achieving one-step communication for distributed quantum circuit simulation
Song, Y., Sha, E. H. ‐., Zhuge, Q., et al. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04192-x · Cited by 3
Efficient Zero-Knowledge Arguments and Digital Signatures via Sharing Conversion in the Head
Maire, J., & Vergnaud, D. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-50594-2_22 · Cited by 3
Block Cipher Doubling for a Post-Quantum World
Bhaumik, R., Chailloux, A., Frixons, P., Mennink, B., & Naya‐Plasencia, M. (2024) · IACR Communications in Cryptology · doi:10.62056/av4fvua5v · Cited by 4
Crimmins, A., Alarcón, S. L., Klein, M., et al. (2023) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc60800.2023.10386449 · Cited by 3
Unary Quantum Finite State Automata with Control Language
Mereghetti, C., Palano, B., & Raucci, P. (2024) · Applied Sciences · doi:10.3390/app14041490 · Cited by 5
Future of Cryptography in the Era of Quantum Computing
Singh, B., Ahateshaam, M., Lahiri, A., & Sagar, A. K. (2024) · Lecture notes in electrical engineering · doi:10.1007/978-981-99-8661-3_2 · Cited by 3
Quantum computing applications
Giardina, C. R. (2024) · Elsevier eBooks · doi:10.1016/b978-0-443-13697-9.00002-3 · Cited by 3
Efficient representation of bit-planes for quantum image processing
Mir, M. S., Bhat, H. A., & Khanday, F. A. (2024) · Multimedia Tools and Applications · doi:10.1007/s11042-024-18552-x · Cited by 3
Quantum Attacks: A View of Data Complexity on Offline Simon’s Algorithm
Yu, B., Shi, T., Dong, X., et al. (2024) · Lecture notes in computer science · doi:10.1007/978-981-97-0945-8_19 · Cited by 3
Mathematical digital quantum computation by means of much more logical skills
Nagata, K., & Nakamura, T. (2024) · Quantum Studies Mathematics and Foundations · doi:10.1007/s40509-024-00326-7 · Cited by 3
Precise micromotion compensation of a tilted ion chain
Hogle, C., Burch, A. D., Sterk, J. D., Chow, M. N. H., Ivory, M., Lobser, D., Maunz, P., Wall, J. W. V. D., Yale, C. G., Clark, S., et al. (2024) · Frontiers in Quantum Science and Technology · doi:10.3389/frqst.2024.1352800 · Cited by 3
Basic quantum subroutines: finding multiple marked elements and summing numbers
van Apeldoorn, J., Gribling, S., & Nieuwboer, H. A. (2024) · Quantum · doi:10.22331/q-2024-03-14-1284 · Cited by 3
Quantum Circuit for Random Forest Prediction
Safina, L., Khadiev, K. R., Zinnatullin, I., & Khadieva, A. (2023) · Russian Microelectronics · doi:10.1134/s1063739723600619 · Cited by 3
An algorithm based on quantum phase estimation for the identification of patterns
Ntalaperas, D., Καλογερόπουλος, Α., & Konofaos, N. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04388-9 · Cited by 3
Mathews, M. M., & Panchami, V. (2024) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2024.103787 · Cited by 3
Quantum walk on simplicial complexes for simplicial community detection
Song, J.-S. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04415-9 · Cited by 3
An efficient quantum circuit implementation of ZUC-128 cipher with low T-depth
Jian, Z., SiMing, X., ChangZhong, Z., & Wu, W. (2024) · Zhongguo kexue. Wulixue Lixue Tianwenxue · doi:10.1360/sspma-2024-0147 · Cited by 3
Synthesis of quantum circuits based on supervised learning and correlations
Allende, C., de Olivera, A. F., & Buksman, E. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04426-6 · Cited by 3
The Power of Adaptivity in Quantum Query Algorithms
Girish, U., Sinha, M., Tal, A., et al. (2024) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3618260.3649621 · Cited by 3
𝐶𝑙𝑎𝑠𝑠𝑖|𝑄⟩: Towards a Translation Framework to Bridge the Classical-Quantum Programming Gap
Esposito, M., Sabzevari, M. T., Ye, B., Falessi, D., Khan, A. A., & Taibi, D. (2024) · doi:10.1145/3663531.3664752 · Cited by 3
Further improvements of the estimation of key enumeration with applications to solving LWE
Budroni, A., & Mårtensson, E. (2024) · Cryptography and Communications · doi:10.1007/s12095-024-00722-1 · Cited by 3
Quantum resource estimation of PRINCE and Midori Block Ciphers
Akhlaq, A. H., Allu, S. N., & Yerukala, N. (2024) · International Journal of Information Technology · doi:10.1007/s41870-024-01997-6 · Cited by 3
On the quantum circuit implementation of modus ponens
Dai, S. (2024) · Scientific Reports · doi:10.1038/s41598-024-65224-9 · Cited by 3
Towards Discovering Quantum-Threats for Applications Using Open-Source Libraries
Ye, X., Tan, T. G., & Zhou, J. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-61486-6_17 · Cited by 3
Spatio-Temporal Characterization of Qubit Routing in Connectivity-Constrained Quantum Processors
Rached, S. B., Almudéver, C. G., Alarcón, E., & Abadal, S. (2024) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas58744.2024.10558197 · Cited by 5
Efficient isochronous fixed-weight sampling with applications to NTRU
Filho, D. L. G., Silva, T. S. R., & López, J. (2024) · IACR Communications in Cryptology · doi:10.62056/a6n59qgxq · Cited by 3
Jeon, Y., Baek, S., & Kim, J. (2024) · Computer Modeling in Engineering & Sciences · doi:10.32604/cmes.2024.052374 · Cited by 3
Hybrid Quantum-Classical Computing via Dantzig-Wolfe Decomposition for Integer Linear Programming
Wei, X., Liu, J., Fan, L., Guo, Y., Han, Z., & Wang, Y. (2024) · International Conference on Computer Communications and Networks (ICCCN) · doi:10.1109/icccn61486.2024.10637633 · Cited by 3
Citizen science games on the timeline of quantum games
Piispanen, L. J. (2024) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-024-05553-w · Cited by 3
Quantum Truncated Differential and Boomerang Attack
Xie, H., & Yang, L. (2024) · Symmetry · doi:10.3390/sym16091124 · Cited by 3
Quantum Procedures for Nested Search Problems
Schrottenloher, A., & Stevens, M. (2024) · IACR Communications in Cryptology · doi:10.62056/aee0fhbmo · Cited by 5
Context-aware coupler reconfiguration for tunable coupler-based superconducting quantum computers
Hour, L., Heng, S., Heng, S., Go, M., & Han, Y. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad8510 · Cited by 3
qCLUE: a quantum clustering algorithm for multi-dimensional datasets
Gopalakrishnan, D., Dellantonio, L., Pilato, A. D., Redjeb, W., Pantaleo, F., & Mosca, M. (2024) · Frontiers in Quantum Science and Technology · doi:10.3389/frqst.2024.1462004 · Cited by 5
Benchmarking Quantum Computational Advantages on Supercomputers
Wu, J., & Liu, Y. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202400143 · Cited by 5
Quantum Network Applications in AI-Driven Risk Management
Tyagi, S., Pathak, S., Raj, V. H., et al. (2024) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-3693-9336-9.ch019 · Cited by 3
Quantum-Safe Authentication Protocol leveraging qPUF for Industrial Internet of Things
Prajwal, C. P., Mohan, A. S., Reddy, D., et al. (2024) · International Conference on Computing, Communication and Networking Technologies (ICCCNT) · doi:10.1109/icccnt61001.2024.10725580 · Cited by 3
Boolean Matching Reversible Circuits: Algorithm and Complexity
Chen, T.-F., & Jiang, J.-H. R. (2024) · Proceedings - ACM IEEE Design Automation Conference · doi:10.1145/3649329.3657312 · Cited by 3
On the Efficacy of Surface Codes in Compensating for Radiation Events in Superconducting Devices
Vallero, M., Casagranda, G., Vella, F., & Rech, P. (2024) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1109/sc41406.2024.00075 · Cited by 3
Mera: Memory Reduction and Acceleration for Quantum Circuit Simulation via Redundancy Exploration
Song, Y., Sha, E. H. ‐., Xu, L., et al. (2024) · Proceedings, IEEE International Conference on Computer Design/Proceedings - IEEE International Conference on Computer Design · doi:10.1109/iccd63220.2024.00087 · Cited by 3
Near‐Deterministic Quantum Search Algorithm Without Phase Design
Wang, Z., Zhang, K., & Korepin, V. E. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202400557 · Cited by 3
Entangled Meanings: Classification and Ambiguity Resolution in Near-Term QNLP
Zhang, C., Kumari, A., & Ćavar, D. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.10355 · Cited by 3
Quantum-Resistant Security Analysis of Blockchain Networks with PoS Consensus
Umar, A., & Kumar, D. (2024) · IEEE International Conference on Blockchain and Distributed Systems Security (ICBDS) · doi:10.1109/icbds61829.2024.10837168 · Cited by 5
Amplitude-Ensemble Quantum-Inspired Tabu Search Algorithm for Solving 0/1 Knapsack Problems
Tseng, K.-C., Lai, W.-C., Chen, I.-C., et al. (2024) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/smc54092.2024.10831250 · Cited by 3
Reformulating regression test suite optimization using quantum annealing - an empirical study
Trovato, A., Stefano, M. D., Pecorelli, F., Nucci, D. D., & Lucia, A. D. (2024) · International Journal on Software Tools for Technology Transfer · doi:10.1007/s10009-024-00775-w · Cited by 3
Circuit implementation and analysis of a quantum-walk based search complement algorithm
Wing-Bocanegra, A., Quintero-Narvaez, C. E., & Venegas-Andraca, S. E. (2025) · Scientific Reports · doi:10.1038/s41598-025-87304-0 · Cited by 3
Distributed Brute-Force Password Recovery with a Partitioned Quantum Grover's Algorithm
Bounceur, A. (2024) · doi:10.1109/cins63881.2024.10864420 · Cited by 3
Applying analog quantum computing to solve optimisation problems: case studies on Max-Cut and CVRP
Deleplanque, S., Yaagoubi, A. E., Gras, T., Descamps, F., Mourrier, J., & Lefebvre, I. (2025) · International Journal of Systems Science Operations & Logistics · doi:10.1080/23302674.2025.2463530 · Cited by 3
ASDF: A Compiler for Qwerty, a Basis-Oriented Quantum Programming Language
Adams, A. J., Khan, S., Bhamra, A. S., Abusaada, R. R., Cabrera, A. M., Hoechst, C. C., Humble, T. S., Young, J., & Conte, T. M. (2025) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1145/3696443.3708966 · Cited by 3
Integrating quantum algorithms into classical frameworks: a predictor–corrector approach using HHL
Rathore, O., Basden, A. G., Chancellor, N., & Kusumaatmaja, H. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/adbb14 · Cited by 3
Practical Quantum Circuit Implementation for Simulating Coupled Classical Oscillators
Luangsirapornchai, N., Sanglaor, P., Sornsaeng, A., Bressan, S., Chotibut, T., Suksen, K., & Chongstitvatana, P. (2025) · IEEE Access · doi:10.1109/access.2025.3551308 · Cited by 4
QbC: Quantum Correctness by Construction
Peduri, A., Schaefer, I., & Walter, M. (2025) · Proceedings of the ACM on Programming Languages · doi:10.1145/3720433 · Cited by 3
Pawar, A., Li, Y., Mo, Z., Guo, Y., Tang, X., Zhang, Y., & Yang, J. (2024) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3622781.3674179 · Cited by 16
Lower Bounds for Unitary Property Testing with Proofs and Advice
Weggemans, J. R. (2025) · Quantum · doi:10.22331/q-2025-04-18-1717 · Cited by 7
A Novel Two-Round Two-Party Quantum Private Comparison Protocol Based on Quantum Walks
Wang, J.-T., & Ye, T.-Y. (2025) · IEEE Transactions on Computers · doi:10.1109/tc.2025.3566897 · Cited by 3
Russo, E., Palesi, M., Patti, D., Ascia, G., & Catania, V. (2025) · Design, Automation, and Test in Europe · doi:10.23919/date64628.2025.10992725 · Cited by 5
qlbm – A quantum lattice Boltzmann software framework
Calin, G., Schalkers, M. A., & Möller, M. (2025) · Computer Physics Communications · doi:10.1016/j.cpc.2025.109699 · Cited by 8
Fundamental Limitations on the Recoverability of Quantum Processes
Sohail, S., Pandey, V., Singh, U., & Das, S. (2025) · Annales Henri Poincaré · doi:10.1007/s00023-025-01590-y · Cited by 11
CloudQC: A Network-aware Framework for Multi-tenant Distributed Quantum Computing
Zhou, R., Gan, Y., Liu, Y., & Qian, C. (2025) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs63083.2025.00024 · Cited by 4
Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs
Rosa, E. C. R., Marchi, J., Duzzioni, E. I., & de Santiago, R. (2025) · doi:10.5753/sblp.2025.10459 · Cited by 5
Kumar, P., Kar, B., & Shen, S.-H. (2025) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2025.104366 · Cited by 5
Missing Puzzle Pieces in the Performance Landscape of the Quantum Approximate Optimization Algorithm
Wybo, E., & Leib, M. (2025) · Quantum · doi:10.22331/q-2025-10-22-1892 · Cited by 15
Optimal Mechanisms for Quantum Local Differential Privacy
Guan, J. (2025) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3719027.3765178 · Cited by 3
Quantum Tree Generator Improves Qaoa State-of-the-Art for the Knapsack Problem
Christiansen, P. G., Binkowski, L., Ramacciotti, D., & Wilkening, S. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00011 · Cited by 3
Kumar, S. K., Ponnambalam, S. G., & Tiwari, M. (2011) · Adaptation, learning, and optimization · doi:10.1007/978-3-642-17390-5_12 · Cited by 3
Introduction to Quantum Information Processing
Uttam, S. (2012) · Elsevier eBooks · doi:10.1016/b978-0-12-385491-9.00004-6 · Cited by 3
Multi-Party Quantum Communication Complexity with Routed Messages
Tani, S., Nakanishi, M., & Yamashita, S. (2009) · IEICE Transactions on Information and Systems · doi:10.1587/transinf.e92.d.191 · Cited by 3
Characterizing error propagation in quantum circuits: the Isotropic Index
de Oliveira, A. L. F., Buksman, E., Cohn, I., & de Lacalle, J. G. L. (2017) · Quantum Information Processing · doi:10.1007/s11128-016-1507-5 · Cited by 5
Resonant transition-based quantum computation
Chiang, C.-F., & Hsieh, C. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1552-8 · Cited by 3
A New Quantum Proxy Signature Model Based on a Series of Genuine Entangled States
Zhang, H., Zhang, L., & Zhang, K. (2018) · International Journal of Theoretical Physics · doi:10.1007/s10773-018-3957-2 · Cited by 3
A QC-LDPC Code Based Digital Signature Algorithm
Ren, F., Yang, X., & Zheng, D. (2018) · International Conference on Networking and Network Applications (NaNA) · doi:10.1109/nana.2018.8648750 · Cited by 3
How Quantum Computing Can Help with (Continuous) Optimization
Ayub, C., Ceberio, M. C., & Крейнович, В. (2020) · Studies in systems, decision and control · doi:10.1007/978-3-030-40814-5_2 · Cited by 3
Li, P., Guo, J., Wang, B., & Hao, M. (2019) · International Journal of Quantum Information · doi:10.1142/s0219749919500436 · Cited by 3
Borromean states in discrete-time quantum walks
Markiewicz, M., Karczewski, M., & Kurzyński, P. (2021) · Quantum · doi:10.22331/q-2021-08-16-523 · Cited by 3
Implementing a Quantum Coin Scheme
Murray, H., Horgan, J., Santos, J. F., Malone, D., & Siljak, H. (2020) · Irish Signals and Systems Conference · doi:10.1109/issc49989.2020.9180218 · Cited by 4
On the continuity of quantum correlation quantifiers
Carrijo, T. M., & Avelar, A. T. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02709-2 · Cited by 3
An Improved Quantum Nearest-Neighbor Algorithm
Zhang, Y., Bao, F., Jia, W., & Xu, C. (2020) · Advances in intelligent systems and computing · doi:10.1007/978-981-15-3753-0_39 · Cited by 3
An Efficient Quantum Multi-Collision Search Algorithm
Zou, J. X., Liu, Y., & Dong, L. (2020) · IEEE Access · doi:10.1109/access.2020.3028736 · Cited by 3
Robust Cache-Aware Quantum Processor Layout
LeCompte, T., Qi, F., & Peng, L. (2020) · IEEE Symposium on Reliable Distributed Systems (SRDS) · doi:10.1109/srds51746.2020.00035 · Cited by 3
Optimization of $S$-boxes GOST R 34.12-2015 «Magma» quantum circuits without ancilla qubits
Денисенко, Д., & Nikitenkova, M. V. (2020) · Математические вопросы криптографии · doi:10.4213/mvk320 · Cited by 3
Quantum Software Engineering: Quantum Gate-Based Computational Intelligence Supremacy
В., И. О., Korenkov, V., Ryabov, N., et al. (2020) · Communications in computer and information science · doi:10.1007/978-3-030-64616-5_10 · Cited by 3
Xu, G., & Qiu, D. (2021) · Quantum Information Processing · doi:10.1007/s11128-020-02975-0 · Cited by 5
A Phase Estimation Algorithm for Quantum Speed-Up Multi-Party Computing
Yu, W., Feng, H., Xu, Y., et al. (2021) · Computers, materials & continua/Computers, materials & continua (Print) · doi:10.32604/cmc.2021.012649 · Cited by 3
A new efficient model of quantum image cryptography based on sampled GNEQR storage presentation
Rfifi, S., Maafiri, A., Chougdali, K., et al. (2021) · Journal of the Korean Physical Society · doi:10.1007/s40042-021-00065-7 · Cited by 3
Unified framework for quantum classification
Nghiem, N. A., Chen, S. Y.-C., & Wei, T.-C. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.033056 · Cited by 34
Quantum algorithm for online convex optimization
He, J., Yang, F., Zhang, J., & Li, L. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac5919 · Cited by 3
Memristor Crossbar Design Framework for Quantum Computing
Fyrigos, I.-A., Chatzinikolaou, T. P., Ntinas, V. G., Vasileiadis, N., Dimitrakis, P., Karafyllidis, I. G., & Sirakoulis, G. C. (2021) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas51556.2021.9401581 · Cited by 4
Pauli Half Spinning and Elliptic Curve Based Information Confidentiality Mechanism
Arshad, S., Khan, M., & Hussain, I. (2021) · International Journal of Theoretical Physics · doi:10.1007/s10773-021-04900-2 · Cited by 3
Experimental Evaluation of Adder Circuits on IBM QX Hardware
Singh, D., Jakhodia, S., & Jajodia, B. (2022) · Lecture notes in networks and systems · doi:10.1007/978-981-16-6723-7_25 · Cited by 3
Metadata
- Authors
- Grover, L. K.
- Affiliations
- AT&T (United States) (US)
- Corresponding author
- Grover, Lov K.
- Venue
- Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96
- Publisher
- ACM Press
- Published
- 1996
- Pages
- 212-219
- OpenAlex
- W2084652510
- Semantic Scholar
- 298d799da82395a64a3bda38ef9d2a4646828ccb
- Cited by
- 8,830
- References
- 24
- Citations by year
- 2026: 664 · 2025: 1066 · 2024: 896 · 2023: 841 · 2022: 674 · 2021: 655 · 2020: 529 · 2019: 423 · 2018: 288 · 2017: 283 · 2016: 219 · 2015: 221 · 2014: 184 · 2013: 161 · 2012: 158
- FWCI
- 36.24
- Type
- conference paper
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- ACM Symposium on Theory of Computing (STOC) (publishedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- quantum search, unsorted database search, Grover's algorithm, quantum algorithms, time complexity, quantum parallelism, lower bounds
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
A language model drew the claims from the paper on 2026-10-21, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-21 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
