Strengths and Weaknesses of Quantum Computing
Open accessThe DOI matches its Crossref record; 22 of the 23 references it cites were found in a registry or an index, and 1 are not checked yet; 6 of the 16 sources its claims cite were checked for support.
Abstract
Recently a great deal of attention has been focused on quantum computation following a sequence of results [Bernstein and Vazirani, in Proc. 25th Annual ACM Symposium Theory Comput., 1993, pp. 11--20, SIAM J. Comput., 26 (1997), pp. 1277--1339], [Simon, in Proc. 35th Annual IEEE Symposium Foundations Comput. Sci., 1994, pp. 116--123, SIAM J. Comput., 26 (1997), pp. 1340--1349], [Shor, in Proc. 35th Annual IEEE Symposium Foundations Comput. Sci., 1994, pp. 124--134] suggesting that quantum computers are more powerful than classical probabilistic computers. Following Shor's result that factoring and the extraction of discrete logarithms are both solvable in quantum polynomial time, it is natural to ask whether all of $\NP$ can be efficiently solved in quantum polynomial time. In this paper, we address this question by proving that relative to an oracle chosen uniformly at random with probability 1 the class $\NP$ cannot be solved on a quantum Turing machine (QTM) in time $o(2^{n/2})$. We also show that relative to a permutation oracle chosen uniformly at random with probability 1 the class $\NP \cap \coNP$ cannot be solved on a QTM in time $o(2^{n/3})$. The former bound is tight since recent work of Grover [in {\it Proc.\ $28$th Annual ACM Symposium Theory Comput.}, 1996] shows how to accept the class $\NP$ relative to any oracle on a quantum computer in time $O(2^{n/2})$.
Verified 2026-11-22 · 1 reference not checked yet
Overview
CoChat Summary
TL;DR
The paper proves oracle-relative lower bounds showing that quantum computers cannot solve NP in time o(2^{n/2}) relative to a random oracle, nor NP ∩ co-NP in time o(2^{n/3}) relative to a random permutation oracle. It also shows that any BQP machine can be made “tidy” for safe subroutine use, yielding BQP^BQP = BQP.
Key findings
- Relative to a uniformly random oracle, with probability 1, NP cannot be solved on a quantum Turing machine in time o(2^{n/2}); this is tight because Grover’s algorithm accepts NP relative to any oracle in time O(2^{n/2}).
- Relative to a uniformly random permutation oracle, with probability 1, NP ∩ co-NP cannot be solved on a quantum Turing machine in time o(2^{n/3}).
- Any BQP machine can be modified into a tidy BQP machine whose final superposition consists almost entirely of the input and the single-bit answer, so BQP machines can be safely used as subroutines; consequently BQP^BQP = BQP.
- Relative to a random permutation oracle, with probability 1, there exists a quantum one-way permutation: computable efficiently even classically given the oracle, but requiring exponential time to invert even on a quantum machine.
Methods
- The paper defines oracle quantum Turing machines with a query tape, pre-query and post-query states, and unitary oracle calls, then proves lower bounds using random oracle and random permutation oracle arguments.
- It uses query-magnitude and Euclidean-distance bounds (Theorem 3.3 and Corollary 3.4) to show that changing a small number of oracle answers has limited effect on the final superposition.
- For the subroutine result, it borrows QTM programming primitives from Bernstein and Vazirani, boosts success probability by majority vote over independent runs, and constructs a tidy BQP machine by copying the answer and reversing the computation.
Limitations
- The paper states that the oracle results do not rule out NP ⊆ BQP; they only establish that there is no black-box approach to solving NP-complete problems using uniquely quantum-mechanical features.
- The paper notes that the constant “1/3” in the NP ∩ co-NP permutation-oracle bound is not known to be fundamental and might be replaceable by 1/2, though not by the current proof.
- Evident from the text: the main separations are relative to random oracles or random permutation oracles, not unrelativized; no explicit limitations section is otherwise provided.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
6 Valid · 2 Not valid · 10 Not checked · 48 Own results and interpretations
The cited sources support only part of this claim — read each source’s verdict below.
In the 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.”
What the sources say
- Partly supportedcites [13] [13] Grover, L., 'A fast quantum mechanical algorithm for database search', Proceedings of the 28th Annual ACM Symposium on Theory of Computing , 1996, pp. 212 - 219. - sourceExperimental — accuracy not yet measured
The introduction reports an O(√N)-step search algorithm, and section 6 describes a matching Ω(√N) lower bound. That supports the optimality of the one-half exponent for this search problem, but our copy does not state Theorem 3.5 or establish what its constant ‘1/2’ measures. (LLM, conf=0.75)
boosted- 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.
- Partly supported
Every source the paper cites for this claim was checked and supports it.
In the 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.”
What the sources say
- Supportedcites [13] [13] Grover, L., 'A fast quantum mechanical algorithm for database search', Proceedings of the 28th Annual ACM Symposium on Theory of Computing , 1996, pp. 212 - 219. - source
The Abstract gives an O(√N)-step quantum search algorithm versus O(N) steps for classical search. Section 1.1 explicitly uses the NP-complete SAT problem as an example of searching N possible assignments, while distinguishing this square-root speedup from a polynomial-time algorithm for NP-complete problems. (LLM, conf=0.88)
boostedstates a cause- 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.
- Supported
Every source the paper cites for this claim was checked and supports it.
In the paper
“However, quantum machines can recognize this language quadratically faster, in time O ( √ 2 n ), using Grover's algorithm [13].”
What the sources say
- Supportedcites [13] [13] Grover, L., 'A fast quantum mechanical algorithm for database search', Proceedings of the 28th Annual ACM Symposium on Theory of Computing , 1996, pp. 212 - 219. - source
Grover’s Abstract states that his quantum search algorithm takes O(√N) steps rather than the O(N) steps required classically. In “The Abstracted Problem,” the search space has N = 2^n states, giving O(√(2^n)); the citing authors’ application of that algorithm to their language L_A is their own framing. (LLM, conf=0.88)
plainstates a cause- 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.
- Supported
The cited sources support only part of this claim — read each source’s verdict below.
In the 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 ).”
What the sources say
- Partly supportedcites [13] [13] Grover, L., 'A fast quantum mechanical algorithm for database search', Proceedings of the 28th Annual ACM Symposium on Theory of Computing , 1996, pp. 212 - 219. - sourceExperimental — accuracy not yet measured
The Abstract gives an O(√N)-step quantum search algorithm, and §1.1 discusses NP-complete SAT as a search over 2^n assignments; together these support the 2^{n/2} search bound. The paper does not establish the stated bound for the whole class NP relative to any oracle. Its discussion of handling multiple satisfying states (p. 114) also describes a procedure with log N repetitions. (LLM, conf=0.83)
boostedstates a cause- 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.
- Partly supported
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“A direct quantum analog of the classical algorithm would start in an equally-weighted superposition of 2 n computation paths, query a different string on each path, and finally collapse the superposition by asking whether the query had found the nonempty location. This yields a success probability 1 / 2 n , the same as the classical computer.”
hedged- 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.
47 more claims
Create a free account to see all 66 claims and every source verdict.
- It may state two separate claims as one. 7
- The quote only partly states this claim. 1
- Probably not a substantial claim. 7
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
“Whereas polynomial-time quantum algorithms are not expected for NPhard problems, [196] like general optimization problems, more modest speedups, still significant in practice, might be achievable.”
From Quantum Computing for Molecular Biology** (2023) · cites this paper as [196]
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
“Interestingly, this particular output is optimal [48].”
From Quantum Computing in the Next-Generation Computational Biology Landscape: From Protein Folding to Molecular Dynamics (2024) · cites this paper as [48]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“Quantum computers can speed up exhaustive search [6], but only modestly [7]”
From Quantum Computing in the NISQ era and beyond (2018) · cites this paper as [7]
Citations
Cites
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830 · cited 6×
“Note: In view of Grover's algorithm [13], we know that the constant \1=2" in the statement of Theorem 3.”
BackgroundMethodInfluentialAlgorithms 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 · cited 4×
“Shor gave polynomial-time quantum algorithms for the factoring and discrete logarithm problems.”
BackgroundMethodInfluentialSimulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
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 · cited 1×
“Deutsch [9] de ned a general model of quantum computation | the quantum Turing machine.”
BackgroundLogical Reversibility of Computation
Bennett, C. H. (1973) · IBM Journal of Research and Development · doi:10.1147/rd.176.0525 · Cited by 3,679 · cited 1×
“In the special case where f can be e ciently computed deterministically, it is easy to design the subroutine so that it reversibly erases the scratch-work|simply compute f(x), copy f(x) into safe storage, and then uncompute f(x) to get rid of the scratch work [2].”
MethodSelf-citationRapid 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 · cited 1×
“Early work by Deutsch and Jozsa [11] showed how to exploit some inherently quantum mechanical features of QTMs.”
BackgroundBernstein, E., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300921 · Cited by 1,503
Self-citationOn 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 · cited 9×
“In this subsection, we present several de nitions, lemmas and theorems from [4].”
BackgroundMethodInfluentialSelf-citationQuantum computational networks
Deutsch, D. E. (1989) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1989.0099 · Cited by 1,270 · cited 3×
“Yao [17] extended this by proving that quantum circuits (introduced by Deutsch [10]) are polynomially equivalent to quantum Turing machines.”
Background
Research works printed but not linked: 1
- 1997, SIAM J. Comput., 26, 1340
Cited by
Items 601–700 of 1,466
Lower Bounds for Quantum Search and DerandomizationPreprint
Buhrman, H., & de Wolf, R. (1998) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9811046 · Cited by 19
“There exist several lower-bound proofs that show that the O ( √ N ) is optimal [BBBV97, BBHT98, Zal97, BBC + 98, Gro98a].”
BackgroundMethodInfluentialRelationships between quantum and classical space-bounded complexity classes
Watrous, J. (2002) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.1998.694607 · Cited by 14
On the Security of Proofs of Sequential Work in a Post-Quantum World
Blocki, J., Lee, S., & Zhou, S. (2020) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.itc.2021.22 · Cited by 19
Non-uniform attacks against one-way functions and PRGs.
De, A., Trevisan, L., & Tulsiani, M. (2009) · Cited by 12
Quantum partial search for uneven distribution of multiple target items
Zhang, K., & Korepin, V. E. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-1907-9 · Cited by 18
Quantifying computational advantage of Grover’s algorithm with the trace speed
Gebhart, V., Pezzè, L., & Smerzi, A. (2021) · Scientific Reports · doi:10.1038/s41598-020-80153-z · Cited by 14
Sihare, S. R. (2022) · International Journal of Theoretical Physics · doi:10.1007/s10773-022-05184-w · Cited by 12
Dynamic Multi-Party Quantum Key Agreement Protocol Based on Commutative Encryption
Sihare, S. R. (2022) · International Journal of Theoretical Physics · doi:10.1007/s10773-022-05203-w · Cited by 12
Near-Optimal Quantum Algorithms for String Problems
Akmal, S., & Jin, C. (2023) · Algorithmica · doi:10.1007/s00453-022-01092-x · Cited by 23
“On the lower bound side, it has been shown that Longest Common Substring requires ̃(n2/3)quantumquery complexity (by a reduction [12] from theElementDistinctness problem [18–20]), and that Exact StringMatching, Minimal String Rotation, and Longest Palindromic Substring all require ( √ n) quantum query complexity (by…”
BackgroundInfluentialFunctional completeness of planar Rydberg blockade structures
Stastny, S., Büchler, H. P., & Lang, N. (2023) · Physical review. B./Physical review. B · doi:10.1103/physrevb.108.085138 · Cited by 15
“[36] Of course one should not expect an exponential speedup by these mappings as it is widely believed [96] that NP ⊈ BQP.”
BackgroundQUCON: A fast Krylov–Newton code for dipole quantum control problems
von Winckel, G., & Borzı̀, A. (2010) · Computer Physics Communications · doi:10.1016/j.cpc.2010.08.023 · Cited by 12
A public key cryptosystem based on data complexity under quantum environment
Wu, W., Zhang, H., Wang, H., Mao, S., Jia, J., & Liu, J. (2015) · Science China Information Sciences · doi:10.1007/s11432-015-5408-5 · Cited by 13
Quantum Commitments from Complexity Assumptions
Chailloux, A., Kerenidis, I., & Rosgen, B. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22006-7_7 · Cited by 15
Non-Boolean quantum amplitude amplification and quantum mean estimation
Shyamsundar, P. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04146-3 · Cited by 26
“The quadratic speedup due to the amplitude amplification algorithm has been shown to be optimal for oracular quantum search algorithms [19].”
A hybrid algorithm for finding shortest path in network routing.
Aghaei, M. R. S., Zukarnain, Z. A., Mamat, A., Zainuddin, H., & Prof, A. (2009) · Universiti Putra Malaysia Institutional Repository (Universiti Putra Malaysia) · Cited by 14
Quantum Algorithms for Highly Structured Search Problems
Hunziker, M., & Meyer, D. (2002) · Quantum Information Processing · doi:10.1023/a:1019868924061 · Cited by 19
“Key Words: quantum search, query complexity.”
Runtime of unstructured search with a faulty Hamiltonian oracle
Temme, K. (2014) · Physical Review A · doi:10.1103/physreva.90.022310 · Cited by 12
“It can be shown that this quadratic speed-up is optimal [3].”
BackgroundQuantum advantage from energy measurements of many-body quantum systems
Novo, L., Bermejo-Vega, J., & García−Patrón, R. (2021) · Quantum · doi:10.22331/q-2021-06-02-465 · Cited by 25
“It is thus implausible that one can show that this problem is #P-hard, or even NP-hard, for then quantum computers would be able to solve such problems; which is, in turn, considered to be unlikely [77, 84].”
BackgroundEliminating intermediate measurements in space-bounded Quantum computation
Fefferman, B., & Remscrim, Z. (2021) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3406325.3451051 · Cited by 35
“The ability to “undo” a unitary subroutine, by running it in reverse, is routinely used in the design and analysis of quantum algorithms (see, for instance, [5,17,18,31,33,44,53]).”
MethodOn the power of quantum proofs
Raz, R., & Shpilka, A. (2004) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.2004.1313849 · Cited by 37
“On the other hand, as we already mentioned, the lower bound on the quantum black box complexity for the Grover search algorithm (see for example [8, 6]) shows that Q(G) = Ω( √ N).”
BackgroundQuantum optimization for combinatorial searches
Trugenberger, C. A. (2002) · New Journal of Physics · doi:10.1088/1367-2630/4/1/326 · Cited by 16
Engineering the success of quantum walk search using weighted graphs
Wong, T. G., & Philipp, P. (2016) · Physical Review A · doi:10.1103/physreva.94.022304 · Cited by 15
“Note that a constant-factor improvement in the expected runtime, which we achieved, is the greatest that one can expect for our problem given the optimality of Grover’s algorithm—one cannot search faster than O( √ M) [28].”
BackgroundModified Grover’s algorithm for an expectation-value quantum computer
Collins, D. C. (2002) · Physical Review A · doi:10.1103/physreva.65.052321 · Cited by 14
Quantum probabilistic subroutines and problems in number theory
Carlini, A., & Hosoya, A. (2000) · Physical Review A · doi:10.1103/physreva.62.032312 · Cited by 13
Dynamics of quantum adiabatic evolution algorithm for Number PartitioningPreprint
Smelyanskiy, V., von Toussaint, U., & Timuçin, D. A. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0202155 · Cited by 25
Alternative Computational Models: A Comparison of Biomolecular and Quantum Computation
Reif, J. H. (1998) · Lecture notes in computer science · doi:10.1007/978-3-540-49382-2_10 · Cited by 12
Simple example of definitions of truth, validity, consistency, and completeness in quantum mechanics
Benioff, P. A. (1999) · Physical Review A · doi:10.1103/physreva.59.4223 · Cited by 15
BQP and the Polynomial HierarchyPreprint
Aaronson, S. (2010) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 14
Designing a Nearly Optimal Quantum Algorithm for Linear Differential Equations via Lindbladians
Shang, Z.-X., Guo, N., An, D., & Zhao, Q. (2025) · Physical Review Letters · doi:10.1103/cvl9-97qg · Cited by 47
Faster quantum searching with almost any diffusion operator
Tulsi, A. (2015) · Physical Review A · doi:10.1103/physreva.91.052307 · Cited by 16
Computational complexity of nonequilibrium steady states of quantum spin chains
Marzolino, U., & Prosen, T. (2016) · Physical Review A · doi:10.1103/physreva.93.032306 · Cited by 12
Fast Quantum Subroutines for the Simplex Method
Nannicini, G. (2022) · Operations Research · doi:10.1287/opre.2022.2341 · Cited by 32
Robust three-qubit search algorithm in Rydberg atoms via geometric control
Liu, B., Shan, Z., Yun, M.-R., Wang, D.-Y., Liu, B.-J., Yan, L.-L., Feng, M., & Su, S. (2022) · Physical Review A · doi:10.1103/physreva.106.052610 · Cited by 12
Amplitude Amplification for Optimization via Subdivided Phase Oracle
Benchasattabuse, N., Satoh, T., Hajdušek, M., & Meter, R. V. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00020 · Cited by 20
Quantum search algorithm for binary constant weight codes
Yukiyoshi, K., & Ishikawa, N. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04573-w · Cited by 16
“Table I summarizes the important mathematical symbols used in this paper.”
Quantum Algorithms for Evaluating Min-Max Trees
Cleve, R., Gavinsky, D., & Yonge-Mallo, D. L. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-89304-2_2 · Cited by 10
“What is noteworthy about this simple approach is that it does not work efficiently in the classical case: given an interval [xj , xk], finding an interior point is as hard as searching, which can cost Ω(N) queries to do even once [4].”
BackgroundOn speeding up factoring with quantum SAT solvers
Mosca, M., Basso, J., & Verschoor, S. R. (2020) · Scientific Reports · doi:10.1038/s41598-020-71654-y · Cited by 11
Quantum Algorithm for Estimating Volumes of Convex Bodies
Chakrabarti, S., Childs, A. M., Hung, S.-H., Li, T., Wang, C., & Wu, X. (2023) · ACM Transactions on Quantum Computing · doi:10.1145/3588579 · Cited by 33
“It is well known that the bounded-error quantum query complexity of this problem is Ω( √ n) [8].”
BackgroundBeyond Factorization and Search
Grover, L. K. (1998) · Science · doi:10.1126/science.281.5378.792 · Cited by 13
Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision
Jeffery, S., Kothari, R., Gall, F. L., & Magniez, F. (2015) · Algorithmica · doi:10.1007/s00453-015-9985-x · Cited by 11
“Quantum query complexity has been of fundamental interest since the inception of the field of quantum algorithms [BBBV97, Gro96, Sho97].”
BackgroundAlgebraic analysis of quantum search with pure and mixed states
Shapira, D., Shimoni, Y., & Biham, O. (2005) · Physical Review A · doi:10.1103/physreva.71.042320 · Cited by 14
Prospects for Quantum Dot Implementation of Adiabatic Quantum Computers for Intractable Problems
Kastner, M. A. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2005.853542 · Cited by 11
“The answer is that there is at least one that cannot [2], [ 3 ].”
BackgroundHow to Compute Using Quantum Walks
Kendon, V. M. (2020) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.315.1 · Cited by 11
“For search in an unsorted database, quadratic is the best possible speed up, and has been proven to give an advantage over the bext possible classical algorithm [3].”
BackgroundDistribution of interference in random quantum algorithms
Arnaud, L., & Braun, D. (2007) · Physical Review A · doi:10.1103/physreva.75.062314 · Cited by 16
The Quantum Adversary Method and Classical Formula Size Lower Bounds
Laplante, S., Lee, T., & Szegedy, M. (2005) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.2005.29 · Cited by 11
Easy and Hard Functions for the Boolean Hidden Shift Problem
Childs, A. M., Kothari, R., Ozols, M., & Roetteler, M. (2013) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.tqc.2013.50 · Cited by 13
Quantum algorithms for subset finding
Childs, A. M., & Eisenberg, J. M. (2005) · Quantum Information and Computation · doi:10.26421/qic5.7 · Cited by 11
“This problem can be solved in O ( √ N ) queries [1], which is optimal [2].”
BackgroundUpper bounds on quantum query complexity inspired by the elitzur-vaidman bomb testerPreprint
Lin, C. Y.-Y., & Lin, H.-H. (2015) · arXiv (Cornell University) · doi:10.5555/2833227.2833254 · Cited by 21
A Formal Derivation of Grover's Quantum Search Algorithm
Zuliani, P. (2007) · International Symposium on Theoretical Aspects of Software Engineering (TASE) · doi:10.1109/tase.2007.3 · Cited by 10
“Remarkably, Grover’s algorithm cannot be improved: Ω(2) accesses are provably needed by any quantum algorithm [1].”
BackgroundQuantum and Classical Query Complexities of Functions of Matrices
Montanaro, A., & Shao, C. (2024) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3618260.3649665 · Cited by 31
“Quantum singular value transformation (QSVT) is a unified framework that encompasses many major quantum algorithms [22].”
BackgroundEdwards, D. J. (2025) · Frontiers in Computational Neuroscience · doi:10.3389/fncom.2025.1551960 · Cited by 13
Lee, T., Mittal, R., Reichardt, B. W., & Špalek, R. (2010) · Cited by 10
U.S. Security Policy: The Dual-Use Regulation of Cryptography and its Effects on Surveillance
Riebe, T., Kühn, P., Imperatori, P., & Reuter, C. (2022) · European Journal for Security Research · doi:10.1007/s41125-022-00080-0 · Cited by 10
“Use Regulation of Cryptography… computers also impact symmetric cryptographic algorithms due to their properties, which would require twice the key length for the same security (Bennett et al. 1997).”
BackgroundQuantum impossible differential attacks: applications to AES and SKINNY
David, N., Naya‐Plasencia, M., & Schrottenloher, A. (2023) · Designs Codes and Cryptography · doi:10.1007/s10623-023-01280-y · Cited by 13
“We will indicate whether this is the case.”
Variational Amplitude Amplification for Solving QUBO Problems
Koch, D., Cutugno, M., Patel, S., Wessing, L., & Alsing, P. M. (2023) · Quantum Reports · doi:10.3390/quantum5040041 · Cited by 12
“Optimal amplitude amplification occurs when the desired state for boosting is exactly π phase different with the mean [2, 3], which is very close to the situation seen in figure 5.”
BackgroundMethodResultPancreatic Cancer Data Classification with Quantum Machine Learning
Saxena, A. K., & Saxena, S. (2023) · Journal of quantum computing · doi:10.32604/jqc.2023.044555 · Cited by 10
“Quantum computers leverage the principles of quantum mechanics to conduct computations, capitalizing on the characteristics of quantum states at the atomic and subatomic tiers of matter such as superposition, interference, and entanglement [2].”
BackgroundGraph coloring with quantum heuristics
Fabrikant, A., & Hogg, T. (2002) · doi:10.5555/777092.777099 · Cited by 10
Faster quantum algorithm for evaluating game trees
Reichardt, B. W. (2011) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611973082.43 · Cited by 22
Classically Verifiable NIZK for QMA with Preprocessing
Morimae, T., & Yamakawa, T. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-22972-5_21 · Cited by 21
Quantum Circuit Based on Grover Algorithm to Solve Hamiltonian Cycle Problem
Jiang, J. (2022) · IEEE Eurasia Conference on IOT, Communication and Engineering (ECICE) · doi:10.1109/ecice55674.2022.10042919 · Cited by 10
Biomolecular and quantum algorithms for the dominating set problem in arbitrary networks
Wong, R., Chang, W.-L., Chung, W., & Vasilakos, A. V. (2023) · Scientific Reports · doi:10.1038/s41598-023-30600-4 · Cited by 10
“After completing the procedure the quantum state is given in (4).”
BackgroundMethodInfluentialQuantum bounded query complexity
Buhrman, H., & van Dam, W. (2003) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.1999.766273 · Cited by 11
“We model oracle computation as follows (see also [14]).”
MethodRelativized Worlds without Worst-Case to Average-Case Reductions for NP
Watson, T. W. (2012) · ACM Transactions on Computation Theory · doi:10.1145/2355580.2355583 · Cited by 10
Universal test for quantum one-way permutations
Kawachi, A., Kobayashi, H., Koshiba, T., & Putra, R. H. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2005.07.036 · Cited by 10
Hirsh, H. (1999) · IEEE Intelligent Systems · doi:10.1109/mis.1999.10014 · Cited by 14
Black holes as Andreev reflecting mirrors
Manikandan, S. K., & Jordan, A. N. (2020) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.102.064028 · Cited by 14
“This would suggest a boost over the query complexity lower bound for search algorithms [73] saturated by the Grover’s search protocol [33, 74].”
MethodQuantum Computer Can Not Speed Up Iterated Applications of a Black Box
Ozhigov, Y. (1999) · Lecture notes in computer science · doi:10.1007/3-540-49208-9_12 · Cited by 10
“simulation follows immediately from the lower bound for the time of quantum search established in the work [ BBBV ].”
MethodInfluentialOn the Quantum Query Complexity of Local Search in Two and Three Dimensions
Sun, X., & Yao, A. C.-C. (2006) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2006.57 · Cited by 10
Upper Bounds on Quantum Query Complexity Inspired by the Elitzur-Vaidman Bomb Tester
Lin, C. Y.-Y., & Lin, H.-H. (2014) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.ccc.2015.537 · Cited by 18
Quantum Domain Theory - Definitions and ApplicationsPreprint
Kashefi, E. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0306077 · Cited by 10
“The latter is more suitable for the study of formal methods and functional programming languages.”
BackgroundOn The Power of Exact Quantum Polynomial TimePreprint
Brassard, G., & Høyer, P. (1996) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9612017 · Cited by 10
“lished in polynomial expected time by a classical Las Vegas algorithm. Moreover, with appropriate oracles, it is known that QP⊆ NP [7] (and therefore QP⊆ ZPP [6]), BQP⊆ BPP [4, 12] and NP∩ co–NP⊆ BQP [3]. 2 A major open question concerns the power of the weakest of all polynomial-time quantum classes, QP, compared to…”
BackgroundSelf-citationApplications of the Adversary Method in Quantum Query AlgorithmsPreprint
Belovs, A. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1402.3858 · Cited by 20
“The first lower bound is for the OR function and it is due to Bennett, Bernstein, Brassard and Vazirani [30].”
BackgroundA quantum query algorithm for the graph collision problemPreprint
Gavinsky, D., & Ito, T. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1204.1527 · Cited by 11
Oracle Separations for Quantum Statistical Zero-KnowledgePreprint
Menda, S., & Watrous, J. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1801.08967 · Cited by 10
Quantum Complexity: restrictions on algorithms and architecturesPreprint
Shepherd, D. J. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1005.1425 · Cited by 22
Jiang, J., & Wang, Y. (2024) · Mathematics · doi:10.3390/math13010090 · Cited by 9
Entropy computing, a paradigm for optimization in open photonic systems
Nguyen, L., Miri, M., Rupert, R. J., Dyk, W., Wu, S. B., Vrahoretis, N., Huang, I., Begliarbekov, M., Chancellor, N., Chukwu, U., et al. (2025) · Communications Physics · doi:10.1038/s42005-025-02324-6 · Cited by 23
“Furthermore,amoregeneralclassofcontinuous-time algorithms can obtain the same speedup, including continuous-time quantum walks 11 and interpolations between adiabatic and quantum walk protocols 12 .”
Dynamical analysis of Grover’s search algorithm in arbitrarily high-dimensional search spaces
Jin, W. (2015) · Quantum Information Processing · doi:10.1007/s11128-015-1164-0 · Cited by 9
Can quantum search accelerate evolutionary algorithms?
Johannsen, D., Kurur, P. P., & Lengler, J. (2010) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1830483.1830746 · Cited by 11
“This is similar to other general settings like unordered search [4, 22] or query complexity of local search on a graph [1], in which it is proven or conjectured that quantum computers can give at most a quadratic speedup.”
BackgroundUnstructured search by random and quantum walk
Wong, T. G. (2021) · Quantum Information and Computation · doi:10.26421/qic22.1-2-4 · Cited by 13
“The runtime, or number of queries, is O( √ N), and this scaling is optimal [2].”
BackgroundSolving generalized eigenvalue problems by ordinary differential equations on a quantum computer
Shao, C., & Liu, J.-P. (2022) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2021.0797 · Cited by 18
“By the optimality of Grover’s algorithm [5], distinguishing these two types of functions requires at least Ω( √ n) queries.”
BackgroundMethodExponential qubit reduction in optimization for financial transaction settlement
Huber, E. X., Tan, B. Y. L., Griffin, P., & Angelakis, D. G. (2024) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-024-00262-w · Cited by 20
“[56, 57] and the lack of any polynomial time quantum algorithm for an NP-hard problem) and it is often justified to regard quantum approaches to QUBO as heuristics hoped to provide practical advantages rather than general purpose solvers with rigorous runtime and optimality guarantees.”
BackgroundDiscrete optimization: A quantum revolution?
Creemers, S., & Armas, L. F. P. (2024) · European Journal of Operational Research · doi:10.1016/j.ejor.2024.12.016 · Cited by 12
Liu, Y., & Zhang, F. (2015) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-015-5661-z · Cited by 10
Quantum algorithms for computational nuclear physics
Višňák, J. (2015) · EPJ Web of Conferences · doi:10.1051/epjconf/201510001008 · Cited by 10
Hybrid quantum computing with ancillas
Proctor, T. J., & Kendon, V. M. (2016) · Contemporary Physics · doi:10.1080/00107514.2016.1152700 · Cited by 11
Degradation of Grover’s search under collective phase flips in queries to the oracle
Rastegin, A. E. (2018) · Frontiers of Physics · doi:10.1007/s11467-018-0825-8 · Cited by 11
Quantum Algorithm for Lexicographically Minimal String Rotation
Wang, Q., & Ying, M. (2023) · Theory of Computing Systems · doi:10.1007/s00224-023-10146-8 · Cited by 20
“:3) quantum algorithm, which was found after the discovery of the (cid:2)( √ n ) lower bound [12] (see also [15, 79]).”
Secure digital archiving in post-quantum era
Člupek, V., Malina, L., & Zeman, V. (2015) · International Conference on Telecommunications and Signal Processing (TSP) · doi:10.1109/tsp.2015.7296338 · Cited by 9
“In section 4, we present our security solution of long-term electronic archiving that is also resistant to quantum computer algorithms.”
BackgroundQuantum search with interacting Bose-Einstein condensates
Kahou, M. E., & Feder, D. L. (2013) · Physical Review A · doi:10.1103/physreva.88.032310 · Cited by 13
The quantum query complexity of certification
Ambainis, A., Childs, A. M., Gall, F. L., & Tani, S. (2010) · Quantum Information and Computation · doi:10.26421/qic10.3-4-1 · Cited by 13
Classical and quantum algorithms for constructing text from dictionary problem
Khadiev, K. R., & Remidovskii, V. (2021) · Natural Computing · doi:10.1007/s11047-021-09863-1 · Cited by 9
“The randomized complexity of this problem is Ω(L) due to [4].”
BackgroundAn Information-Theoretic Analysis of Grover’s Algorithm
Arıkan, E. (2003) · Springer eBooks · doi:10.1007/978-94-010-0171-7_15 · Cited by 9
A new connection between quantum circuits, graphs and the Ising partition function
Geraci, J. (2008) · Quantum Information Processing · doi:10.1007/s11128-008-0084-7 · Cited by 11
“This is of no matter as a similar argument can be made for a circuit which outputs the correct answer with some constant probability above a half [5].”
BackgroundA quantum algorithm for minimal spanning tree
Aghaei, M. R. S., Zukarnain, Z. A., Mamat, A., & Zainuddin, H. (2008) · International Symposium on Information Technology · doi:10.1109/itsim.2008.4632038 · Cited by 10
Comments on adiabatic quantum algorithms
Ruskai, M. B. (2002) · Contemporary mathematics - American Mathematical Society · doi:10.1090/conm/307/05288 · Cited by 10
Introduction to Quantum Computers
Grimes, R. A. (2019) · Wiley eBooks · doi:10.1002/9781119618232.ch2 · Cited by 9
“Furthermore it can be shown that for this problem no better quantum algorithm exists [ 5 , 6]. To prove this, the unstructured search is formalized with a so-called “oracle”, a black-box subroutine which gives output 1 only for one out of all possible inputs.”
BackgroundA Note on Oracle Separations for BQPPreprint
Chen, L. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.00619 · Cited by 13
“discussed above, with probability 1/2, we have kξi(z) − ξi(z′)ktr ≥ 1/3, in which z′ is obtained by changing the ℓth bit to 1 in the check-bit part of z. Using these facts and the hybrid argument in [BBBV97], it follows that XT t=1 √ mi,ℓ,t ≥ Ω(1). Then by Cauchy-Schwarz inequality, we have XT t=1 mi,ℓ,t ≥ Ω 1 T . Thi…”
Quantum Implications of Huang's Sensitivity TheoremPreprint
Aaronson, S., Ben-David, S., Kothari, R., & Tal, A. (2020) · arXiv (Cornell University) · doi:10.4230/lipics.ccc.2021.36 · Cited by 13
A Review on Models and Applications of Quantum Computing
Grigoryan, E., Kumar, S., & Pinheiro, P. R. (2025) · Quantum Reports · doi:10.3390/quantum7030039 · Cited by 14
“√ Moreover, it was proven that any quantum algorithm needs at least Ω ( N ) queries to solve the unstructured search problem, with N elements [60].”
Metadata
- Authors
- Bennett, C. H., Bernstein, E., Brassard, G., & Vazirani, U.
- Affiliations
- Microsoft (United States) (US)
- ORCID
- Bennett, Charles H.
- Venue
- SIAM Journal on Computing
- Published
- 1997-10
- Volume
- 26
- Issue
- 5
- Pages
- 1510-1523
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2006290558
- Semantic Scholar
- 76ba917d0b172593b20bbb1acefc64a6fb0682f5
- Cited by
- 1,470
- References
- 18
- Citations by year
- 2026: 44 · 2025: 65 · 2024: 78 · 2023: 94 · 2022: 64 · 2021: 84 · 2020: 61 · 2019: 74 · 2018: 56 · 2017: 34 · 2016: 55 · 2015: 50 · 2014: 46 · 2013: 40 · 2012: 43
- FWCI
- 45.78
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- SIAM Journal on Computing (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- arXiv (Cornell University)
- SIAM Journal on Scientific and Statistical Computing
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Keywords
- quantum computing, quantum Turing machines, oracle separation, NP, coNP, quantum algorithms, Grover's algorithm, Shor's algorithm, factoring, discrete logarithm problem, quantum vs classical computation
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.
The claim verdicts this report counts are experimental: their accuracy is not yet measured.
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).
Cited sources are checked with a language model’s help (gpt-6-sol).
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.