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-19 · 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 501–600 of 1,464
Corrigan-Gibbs, H., Wu, D. J., & Boneh, D. (2017) · Workshop on Hot Topics in Operating Systems · doi:10.1145/3102980.3102993 · Cited by 27
“Furthermore, we know that Grover’s algorithm is the best possible quantum algorithm for the Unstructured Search Problem (Problem 1) [10].”
BackgroundFactoring semi-primes with (quantum) SAT-solvers
Mosca, M., & Verschoor, S. R. (2022) · Scientific Reports · doi:10.1038/s41598-022-11687-7 · Cited by 27
“Note that even a classical computer with such speeds could 6it is known that any such speed-up must go beyond pure “black-box” search [7] as attempted by Farhi et al.”
BackgroundGrover Search and the No-Signaling Principle
Bao, N., Bouland, A., & Jordan, S. P. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.120501 · Cited by 34
“[7], if there is an algorithm to search an unordered list of N items with Q queries using m qubits, then”
BackgroundMethodInfluentialAverage-case quantum query complexity
Ambainis, A., & de Wolf, R. (2001) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/34/35/302 · Cited by 29
Quantum public-key cryptosystems based on induced trapdoor one-way transformationsPreprint
Yang, L., Liang, M., Li, B., Hu, L., & Feng, D. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1012.5249 · Cited by 19
“It is believed that there does not exist efficient quantum algorithm to solve NP-complete problems [2], therefore, cryptosystems based on NP-complete problems are regarded as good choices against quantum attacks.”
BackgroundNear-Optimal Quantum Algorithms for String Problems
Akmal, S., & Jin, C. (2022) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611977073.109 · Cited by 36
Quantum Communication Networks for Energy Applications: Review and Perspective
Paudel, H. P., Crawford, S. E., Lee, Y., Shugayev, R., Leuenberger, M. N., Syamlal, M., Ohodnicki, P. R., Lu, P., Mollot, D., & Duan, Y. (2023) · Advanced Quantum Technologies · doi:10.1002/qute.202300096 · Cited by 30
Ito, T., & Jeffery, S. (2018) · Algorithmica · doi:10.1007/s00453-018-0527-1 · Cited by 39
“These upper bounds do not have optimal scaling in ε, as the actual quantum query complexities of these problems are 1 1−λ √ n/t and 1 ε √ n/|x | [1,2,6], however, using Theorem 7, the optimal query complexities can be recovered.”
Strong and uniform convergence in the teleportation simulation of bosonic Gaussian channels
Wilde, M. M. (2018) · Physical Review A · doi:10.1103/physreva.97.062305 · Cited by 19
Khadiev, K. R., & Ilikaev, A. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-34500-6_17 · Cited by 18
The Quantum Query Complexity of Read-Many Formulas
Childs, A. M., Kimmel, S., & Kothari, R. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33090-2_30 · Cited by 20
Quantum Partial Search of a Database with Several Target Items
Choi, B.-S., & Korepin, V. E. (2007) · Quantum Information Processing · doi:10.1007/s11128-007-0056-3 · Cited by 22
The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems
Arvind, V., & Schuler, R. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-24587-2_19 · Cited by 21
“We use standard definitions from quantum computing from [3, 6].”
BackgroundMethodOptimal Quantum Adversary Lower Bounds for Ordered Search
Childs, A. M., & Lee, T. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-70575-8_71 · Cited by 21
“The adversary method was originally developed by Ambainis [2], with roots in the hybrid method of [6].”
BackgroundMethodYamakami, T. (2003) · International Journal of Foundations of Computer Science · doi:10.1142/s0129054103002047 · Cited by 24
Local Hamiltonians in Quantum ComputationPreprint
Nagaj, D. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0808.2117 · Cited by 37
Quantum Security of Cryptographic Primitives
Gagliardoni, T. (2017) · arXiv (Cornell University) · doi:10.26083/tuprints-00006019 · Cited by 30
On the obfuscatability of quantum point functions
Shang, T., Chen, R., & Liu, J. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2172-2 · Cited by 19
Yu, G., Wu, C., Liu, Y., Du, Z., Zhao, N., Jiao, Y., Xu, Z., & Shi, W. (2023) · Science China Earth Sciences · doi:10.1007/s11430-022-1144-7 · Cited by 20
A Short Path Quantum Algorithm for Exact Optimization
Hastings, M. B. (2018) · Quantum · doi:10.22331/q-2018-07-26-78 · Cited by 35
Tetrapartite entanglement measures of W-class in noninertial frames*
Torres-Arenas, A. J., López-Zúñiga, E. O., Saldaña-Herrera, J. A., Dong, Q., Sun, G.-H., & Dong, S. (2019) · Chinese Physics B · doi:10.1088/1674-1056/28/7/070301 · Cited by 17
Photonic realization of a quantum finite automaton
Mereghetti, C., Palano, B., Cialdi, S., Vento, V., Paris, M. G. A., & Olivares, S. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.013089 · Cited by 18
Quantum amplitude-amplification operators
Kwon, H., & Bae, J. (2021) · Physical Review A · doi:10.1103/physreva.104.062438 · Cited by 26
Quantum algorithms for search with wildcards and combinatorial group testing
Ambainis, A., & Montanaro, A. (2014) · Quantum Information and Computation · doi:10.26421/qic14.5-6-4 · Cited by 34
“This is therefore the same problem as standard unstructured search for a single marked element in a database of size k + 1, which is known to require Ω( √ k) quantum queries [24].”
BackgroundQuantum speedup in solving the maximal-clique problem
Chang, W.-L., Yu, Q., Li, Z., Chen, J., Peng, X., & Feng, M. (2018) · Physical Review A · doi:10.1103/physreva.97.032344 · Cited by 23
Random matrix model of adiabatic quantum computing
Mitchell, D. R., Adami, C., Lue, W., & Williams, C. P. (2005) · Physical Review A · doi:10.1103/physreva.71.052324 · Cited by 24
“Can quantum computers solve NP-complete prob lems using physical resources of time, space, and energy that are all bounded by polynomials in the size of the problem? Most computer scientists are skeptical of such a possibility [1].”
BackgroundQuantum statistical zero-knowledgePreprint
Watrous, J. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0202111 · Cited by 37
“Equally important for understanding the power of quantum models are upper bounds and impossibility proofs, such as the containment of BQP (bounded error quantum polynomial time) in PP [1, 14], the impossibility of quantum bit commitment [27], and the existence of oracles relative to which quantum computers have restri…”
BackgroundSPHINCS-Simpira: Fast Stateless Hash-based Signatures with Post-quantum SecurityPreprint
Gueron, S., & Mouha, N. (2017) · IACR Cryptology ePrint Archive · Cited by 17
Quantum Lower Bound for Approximate Counting Via Laurent Polynomials
Aaronson, S., Kothari, R., Kretschmer, W., & Thaler, J. (2018) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.ccc.2020.7 · Cited by 32
Using Quantum computers to speed up dynamic testing of software
Miranskyy, A. V. (2022) · doi:10.1145/3549036.3562061 · Cited by 24
“Grover’s algorithm requires only O( √ N) computations on a QC; it is known that Grover’s algorithm is optimal up to a sub-constant factor [7].”
MethodBit Flipping Key Encapsulation for the Post-Quantum Era
Nosouhi, M. R., Shah, S. W. A., Pan, L., & Doss, R. (2023) · IEEE Access · doi:10.1109/access.2023.3282928 · Cited by 25
“remain relatively secure in the post-quantum era [13], [14].”
BackgroundMuser, T., Zapusek, E., Belis, V., & Reiter, F. (2024) · Physical Review A · doi:10.1103/physreva.110.032434 · Cited by 22
The quantum walk search algorithm: factors affecting efficiency
Lovett, N. B., Everitt, M., Heath, R. M., & Kendon, V. M. (2018) · Mathematical Structures in Computer Science · doi:10.1017/s0960129518000051 · Cited by 17
“Grover’s algorithm has been shown to be both optimal and also one of the few quantum algorithms which is provably faster than any possible classical algorithm [Bernstein et al. 1997].”
MethodA SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY
Yamakami, T. (2020) · Journal of Symbolic Logic · doi:10.1017/jsl.2020.45 · Cited by 27
Optimal Quantum Spatial Search with One-Dimensional Long-Range Interactions
Lewis, D., Benhemou, A., Feinstein, N., Banchi, L., & Bose, S. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.240502 · Cited by 16
Chen, E., Zhu, Y., Zhu, G., Liang, K., & Feng, R. (2021) · Computers & Security · doi:10.1016/j.cose.2021.102318 · Cited by 17
Quantum algorithm for gravitational-wave matched filtering
Gao, S., Hayes, F. J., Croke, S., Messenger, C., & Veitch, J. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.023006 · Cited by 23
“…of this algorithm are beyond the scope of this paper but can be based on existing classical algorithms, such as those used for lattice-based template placement [71,81,90–92], as any classical algorithm can be performed on a quantum computer and made reversible with at most polynomial overhead [74].”
BackgroundMethodLe, X.-B. D., Lin, S., Sun, J., & Sanán, D. (2022) · Proceedings of the ACM on Programming Languages · doi:10.1145/3498697 · Cited by 27
“For Moreover, Grover’s algorithm is asymptotically optimal [Bennett et al. 1997 convenience, we assume that 𝑁 = 2 𝑛 and 𝑓 maps each basic vector in B 𝑛 to { 0 , 1 such that 𝑓 (| 𝑒 𝑖 ⟩) = 1 iff 𝑖 = 𝜔 and 0 otherwise.”
SIMULATION OF QUANTUM ADIABATIC SEARCH IN THE PRESENCE OF NOISE
Gaitan, F. (2006) · International Journal of Quantum Information · doi:10.1142/s0219749906002213 · Cited by 17
Limitations of quantum advice and one-way communication
Aaronson, S. (2004) · doi:10.1109/ccc.2004.16 · Cited by 16
There is more to quantum interferometry than entanglement
Bromley, T. R., Silva, I. A., Segura, C. O., Soares-Pinto, D. O., DeAzevedo, E. R., Tufarelli, T., & Adesso, G. (2017) · Physical Review A · doi:10.1103/physreva.95.052313 · Cited by 19
Quantum and classical tradeoffs
Shi, Y. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2005.03.053 · Cited by 25
“In fact, the tight lower bound for Grover’s Problem was known before Grover’s work due to Bennett, Bernstein, Brassard, and Vazirani [6], and was refined by Boyer, Brassard, Høyer, and Tapp [7], and by Zalka [13].”
BackgroundMethodQuantum computing – Facts and folklore
Hirvensalo, M. (2002) · Natural Computing · doi:10.1023/a:1015065426649 · Cited by 16
General SU(2) formulation for quantum searching with certainty
Hsieh, J.-Y., & Li, C. (2002) · Physical Review A · doi:10.1103/physreva.65.052322 · Cited by 18
Evolving blackbox quantum algorithms using genetic programming
Stadelhofer, R., Banzhaf, W., & Suter, D. (2008) · Artificial intelligence for engineering design analysis and manufacturing · doi:10.1017/s089006040800019x · Cited by 18
“More recent results have cooled expectations that proved to be too optimistic (Bennett et al., 1997; Bernstein & Vazirani, 1997; Beals et al., 2001), and it still remains unclear whether quantum computers (QCs) will provide an alternative superior to classical computation.”
BackgroundMethodHallgren, S., & Vollmer, U. (2009) · Springer eBooks · doi:10.1007/978-3-540-88702-7_2 · Cited by 16
Variations on Quantum AdversaryPreprint
Belovs, A. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1504.06943 · Cited by 50
“The adversary bound originates from the hybrid method, which was used by Bennett et al. [15] to show a tight Ω( √ n ) lower bound on quantum search.”
MethodComputational complexity of time-dependent density functional theory
Whitfield, J. D., Yung, M.-H., Tempel, D. G., Boixo, S., & Aspuru-Guzik, A. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/8/083035 · Cited by 15
“On the other hand, in the worst case, quantum computers are not expected to solve all NP (nondeterministic polynomial time) problems efficiently [8].”
BackgroundCombinatorial optimization with quantum computers
Chicano, F., Luque, G., Dahi, Z. A., & Gil-Merino, R. (2025) · Engineering Optimization · doi:10.1080/0305215x.2024.2435538 · Cited by 31
The Quantum Optimization Benchmarking Library
Koch, T., Neira, D. E. B., Chen, Y., Cortiana, G., Egger, D. J., Heese, R., Hegade, N. N., Cadavid, A. G., Huang, R. S., Itoko, T., et al. (2026) · Nature Computational Science · doi:10.1038/s43588-026-00991-1 · Cited by 82
“…suggests that the speed-up for finding provably optimal solutions to NP-hard problems with quantum algorithms can generally be at most quadratic 53–56 , better quantum approximation algorithms with up to an exponential speed-up 57 or quantum optimization heuristics that outperform classical…”
Aaronson, S., Bouland, A., Fitzsimons, J. F., & Lee, M. (2016) · Conference on Innovations in Theoretical Computer Science · doi:10.1145/2840728.2840739 · Cited by 31
“From the hybrid argument of [10], we have the following:”
BackgroundMethodInfluentialThe Future of Cryptography Under Quantum Computers
Barreno, M. A. (2002) · Cited by 15
A query‐based quantum eigensolver
Jin, S., Wu, S., Zhou, G., Li, Y., Li, L., Li, B., & Wang, X. (2020) · Quantum Engineering · doi:10.1002/que2.49 · Cited by 15
A Systematic Methodology to Compute the Quantum Vulnerability Factors for Quantum Circuits
Oliveira, D., Giusto, E., Baheri, B., Guan, Q., Montrucchio, B., & Rech, P. (2023) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2023.3313934 · Cited by 24
“…Bernstein-Vazirani [47] (4 qubits) is an extension of Deutsch-Josza that identifies a string encoded in a function, and Grover [1] (2 qubits) speeds up unstructured searches by performing just O ( √ N ) evaluations, which is the fastest a quantum algorithm can perform [48].”
BackgroundHybrid Quantum-classical Search Algorithms
Rosmanis, A. (2024) · ACM Transactions on Quantum Computing · doi:10.1145/3648573 · Cited by 25
“This latter group contains the so called “hybrid method” [ 7 ], which first showed the asymptotic optimality of Grover’s algorithm, various methods for proving exact optimality of Grover’s algorithm [ 11 , 20 ], the adversary method [ 3 ] and many of its generalizations, and other methods.”
MethodGroup IV solid state proposals for quantum computation
Fodor, P. S., & Levy, J. (2006) · Journal of Physics Condensed Matter · doi:10.1088/0953-8984/18/21/s03 · Cited by 19
Group Theoretical Formulation of a Quantum Partial Search Algorithm
Korepin, V. E., & Vallilo, B. C. (2006) · Progress of Theoretical Physics · doi:10.1143/ptp.116.783 · Cited by 18
Quantum adiabatic algorithms and large spin tunnelling
Boulatov, A., & Smelyanskiy, V. (2003) · Physical Review A · doi:10.1103/physreva.68.062321 · Cited by 19
Quantum NP and a Quantum Hierarchy
Yamakami, T. (2002) · Springer eBooks · doi:10.1007/978-0-387-35608-2_27 · Cited by 17
“Thus, the length of a computation path on inputx is regarded as therunning timeof the QTM onx.”
BackgroundExact quantum search by parallel unitary discrimination schemes
Wu, X., & Duan, R. (2008) · Physical Review A · doi:10.1103/physreva.78.012303 · Cited by 16
Public Key Cryptography based on Coding Theory
Informatik, V. F. (2007) · Cited by 15
Analysis of Grover’s quantum search algorithm as a dynamical system
Biham, O., Shapira, D., & Shimoni, Y. (2003) · Physical Review A · doi:10.1103/physreva.68.022326 · Cited by 19
One Complexity Theorist's View of Quantum Computing
Fortnow, L. (2000) · Electronic Notes in Theoretical Computer Science · doi:10.1016/s1571-0661(05)80330-5 · Cited by 15
“Bennett, Bernstein, Brassard and Vazirani [BBBV97] show an interesting way to get around this problem: Compute whether the quantum machine accepts.”
BackgroundInfluentialBuhrman, H., Fortnow, L., Newman, I., & Röhrig, H. (2003) · UvA-DARE (University of Amsterdam) · doi:10.5555/644108.644188 · Cited by 24
Carlini, A., & Hosoya, A. (2001) · Physics Letters A · doi:10.1016/s0375-9601(01)00025-1 · Cited by 17
Quantum Search on Structured Problems
Grover, L. K. (1999) · Lecture notes in computer science · doi:10.1007/3-540-49208-9_9 · Cited by 15
Quantum Mechanical Square Root Speedup in a Structured Search ProblemPreprint
Farhi, E., & Gutmann, S. (1997) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9711035 · Cited by 15
A Limit on the Speed of Quantum Computation for Insertion into an Ordered ListPreprint
Farhi, E., Goldstone, J., Gutmann, S., & Sipser, M. (1998) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9812057 · Cited by 21
“Classically, determining the insertion point requires log N comparisons.”
A Counterexample to the Generalized Linial-Nisan ConjecturePreprint
Aaronson, S. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1110.6126 · Cited by 15
Quantum Logic Locking for Security
Topaloglu, R. O. (2023) · J — Multidisciplinary Scientific Journal · doi:10.3390/j6030027 · Cited by 14
Guest column: an introduction to quantum information and quantum circuits 1
Watrous, J. (2011) · ACM SIGACT News · doi:10.1145/1998037.1998053 · Cited by 20
A fast algorithm for approximating the ground state energy on a quantum computer
Papageorgiou, A., Petras, I., Traub, J. F., & Zhang, C. (2013) · Mathematics of Computation · doi:10.1090/s0025-5718-2013-02714-7 · Cited by 15
“On the other hand, there are results about the limits of quantum computation [2], as well as results showing that certain problems are hard.”
BackgroundQuantum Linear Key-Recovery Attacks Using the QFT
Schrottenloher, A. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-38554-4_9 · Cited by 17
“While Shor’s algorithm provides an exponential speedup, at the other end of the spectrum, Grover’s quantum search algorithm [25] provides a quadratic acceleration for NP problems, which is optimal for black-box search [4].”
BackgroundVrana, P., Reeb, D., Reitzner, D., & Wolf, M. M. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/7/073033 · Cited by 24
Gupta, S., Sau, K., Pramanick, J., Pyne, S., Ahamed, R., & Biswas, R. (2017) · International Conference on Internet of Everything, Microwave Engineering, Communication and Networks (IEMECON) · doi:10.1109/iemecon.2017.8079582 · Cited by 15
Practical designs for permutation-symmetric problem Hamiltonians on hypercubes
Dodds, A. B., Kendon, V. M., Adams, C. S., & Chancellor, N. (2019) · Physical Review A · doi:10.1103/physreva.100.032320 · Cited by 17
Quantum search with a continuous-time quantum walk in momentum space
Delvecchio, M., Groiseau, C., Petiziol, F., Summy, G. S., & Wimberger, S. (2019) · Journal of Physics B Atomic Molecular and Optical Physics · doi:10.1088/1361-6455/ab63ad · Cited by 15
Complexity of Quantum State Verification in the Quantum Linear Systems Problem
Somma, R. D., & Subaşı, Y. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.010315 · Cited by 21
Parallel and Sequential Optical Computing
Woods, D., & Naughton, T. J. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85673-3_6 · Cited by 14
“[3] have shown the work of Grover is optimal up to a multiplicative constant, and that in fact any quantum mechanical system will require Ω( √ n) comparisons.”
BackgroundGeneral phase-matching condition for a quantum searching algorithm
Li, C., Hwang, C.-C., Hsieh, J.-Y., & Wang, K.-S. (2002) · Physical Review A · doi:10.1103/physreva.65.034305 · Cited by 17
Quantum search algorithms in science and engineering
Williams, C. P. (2001) · Computing in Science & Engineering · doi:10.1109/5992.909001 · Cited by 13
An Exact Quantum Search Algorithm with Arbitrary Database
Liu, Y. (2014) · International Journal of Theoretical Physics · doi:10.1007/s10773-014-2055-3 · Cited by 15
Language Classes Defined by Generalized Quantum Turing Machine
Iriyama, S., & Ohya, M. (2008) · Open Systems & Information Dynamics · doi:10.1142/s1230161208000262 · Cited by 14
Lower bounds for quantum computation and communication
Nayak, A., & Vazirani, U. V. (1999) · Cited by 20
Self-citationQuantum lower bound for the collision problem
Aaronson, S. (2002) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/509998.509999 · Cited by 16
Experimental quantum computation with nuclear spins in liquid solution
Harris, J. S., & Vandersypen, L. M. K. (2001) · Cited by 17
Irreconcilable difference between quantum walks and adiabatic quantum computing
Wong, T. G., & Meyer, D. A. (2016) · Physical Review A · doi:10.1103/physreva.93.062313 · Cited by 13
“4 to the marked center in one step, and the optimality of Grover’s algorithm is for yes/no oracles [3, 29], which Fenner’s is not.”
BackgroundRedeeming Reset Indifferentiability and Applications to Post-quantum Security
Zhandry, M. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92062-3_18 · Cited by 13
Quantum search with prior knowledge
He, X., Sun, X., & Zhang, J. (2024) · Science China Information Sciences · doi:10.1007/s11432-023-3972-y · Cited by 17
“uction Quantum searching is an important problem. Many computationallydifficult problem, includingdecipheringsome popularencryptionscheme[1, 2], Monte Carlo tree search for game [3] and NP-hard problem[4], can be reduced to searching problem. Grover’s quantumsearch algorithm[5, 6] shows a quadraticspeed-upoverclassical…”
BackgroundBenchasattabuse, N., Bärtschi, A., García-Pintos, L. P., Golden, J. K., Lemons, N., & Eidenbenz, S. (2025) · Physical Review A · doi:10.1103/physreva.111.062411 · Cited by 24
“This is consistent with the tight lower bound of an oracular unstructured search [35, 55, 57].”
Hosoyamada, A., & Yamakawa, T. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-64837-4_1 · Cited by 20
Quantum Algorithms for Some Strings Problems Based on Quantum String Comparator
Khadiev, K. R., Ilikaev, A., & Vihrovs, J. (2022) · Mathematics · doi:10.3390/math10030377 · Cited by 19
“According to [14], the quantum complexity of the unstructured search among nk/2 is Ω( √ nk).”
BackgroundInfluentialOn the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Round
Chia, N.-H., Chung, K.-M., Liu, Q., & Yamakawa, T. (2022) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs52979.2021.00015 · Cited by 13
On Quantum Speedups for Nonconvex Optimization via Quantum Tunneling Walks
Liu, Y., Su, W., & Li, T. (2023) · Quantum · doi:10.22331/q-2023-06-02-1030 · Cited by 37
Manenti, R., & Motta, M. (2023) · doi:10.1093/oso/9780198787488.001.0001 · Cited by 29
Exact quantum lower bound for Grover's problem
Dohotaru, C., & Høyer, P. (2009) · Quantum Information and Computation · doi:10.26421/qic10.5-6-12 · Cited by 26
Tree search and quantum computation
Tarrataca, L., & Wichert, A. (2010) · Quantum Information Processing · doi:10.1007/s11128-010-0212-z · Cited by 16
“This result was first shown in [9] and later revised on [10].”
BackgroundSeparating Quantum and Classical Learning
Servedio, R. A. (2001) · Lecture notes in computer science · doi:10.1007/3-540-48224-5_86 · Cited by 15
“This research has focused on understanding the relationship between the number of quantum versus classical black-box oracle queries required to determine whether or not a black-box function has some particular property such as ever taking a nonzero value [ 4 , 6, 11, 16, 31] or being evenly balanced between the output…”
BackgroundLower 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
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.