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 101–200 of 1,466
An improved quantum Fourier transform algorithm and applications
Hales, L., & Hallgren, S. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892139 · Cited by 162
“Moreover, to produce a superpositionj i such that kj i Fpj ik the largest transform can be taken to be a power of 2 with justO (n+ log(1= )) bits.”
BackgroundQuantum Lower Bounds by Polynomials
Beals, R., Buhrman, H., Cleve, R., Mosca, M., & de Wolf, R. (1998) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9802049 · Cited by 164
Quantum Sensing for Energy Applications: Review and Perspective
Crawford, S. E., Shugayev, R., Paudel, H. P., Lu, P., Syamlal, M., Ohodnicki, P. R., Chorpening, B., Gentry, R. W., & Duan, Y. (2021) · Advanced Quantum Technologies · doi:10.1002/qute.202100049 · Cited by 192
Phase matching in quantum searching
Long, G. L., Li, Y. S., Zhang, W. L., & Niu, L. (1999) · Physics Letters A · doi:10.1016/s0375-9601(99)00631-3 · Cited by 186
Quantum computing challenges in the software industry. A fuzzy AHP-based approach
Awan, U., Hannola, L., Tandon, A., Goyal, R. K., & Dhir, A. (2022) · Information and Software Technology · doi:10.1016/j.infsof.2022.106896 · Cited by 186
Discrete Quantum Walks Hit Exponentially Faster
Kempe, J. (2005) · Probability Theory and Related Fields · doi:10.1007/s00440-004-0423-2 · Cited by 152
Guest Column: A Survey of Quantum Learning Theory
Arunachalam, S., & de Wolf, R. (2017) · ACM SIGACT News · doi:10.1145/3106700.3106710 · Cited by 152
“Grover [Gro96, BHMT02] came up with a quantum algorithm that finds a solution with high probability using O ( √ N ) queries (this is also known to be optimal [BBBV97]).”
Quantum Query Complexity of Some Graph Problems
Dürr, C., Heiligman, M., Høyer, P., & Mhalla, M. (2006) · SIAM Journal on Computing · doi:10.1137/050644719 · Cited by 246
Polynomial degree vs. quantum query complexity
Ambainis, A. (2005) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2005.06.006 · Cited by 173
Quantum information and physics: Some future directions
Preskill, J. (2000) · Journal of Modern Optics · doi:10.1080/09500340008244031 · Cited by 153
“In this Grover-Farhi-Gutmann problem, there is a sense in which an optimal measurement procedure is known: Just as the Grover iteration allows one to identify a marked state with a minimum number of queries to the oracle [17], the Grover perturbation allows us to”
MethodSpatial search and the Dirac equation
Childs, A. M., & Goldstone, J. (2004) · Physical Review A · doi:10.1103/physreva.70.042312 · Cited by 146
“Whereas a classical computer requires Θ(N) steps to solve this problem, Grover showed that a quantum computer can solve it using only O( √ N) steps [1], which is optimal [2].”
BackgroundQuantum algorithm for linear regression
Wang, G. (2017) · Physical Review A · doi:10.1103/physreva.96.012335 · Cited by 143
Near-optimal quantum circuit for Grover's unstructured search using a transverse field
Jiang, Z., Rieffel, E. G., & Wang, Z. (2017) · Physical Review A · doi:10.1103/physreva.95.062317 · Cited by 142
“Grover’s algorithm is optimal among quantum algorithms for such a task [10–12].”
MethodWhy Philosophers Should Care about Computational Complexity
Aaronson, S. (2013) · The MIT Press eBooks · doi:10.7551/mitpress/8009.003.0011 · Cited by 189
Quantum Computational Complexity
Watrous, J. (2013) · Springer eBooks · doi:10.1007/978-3-642-27737-5_428-3 · Cited by 143
Tang, E. (2018) · arXiv · doi:10.48550/arxiv.1811.00414 · Cited by 141
Tang, E. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.060503 · Cited by 140
“We previously established that Pr[Ei = 1] ≤ 29 , so by a Hoeffding-Chernoff bound [19],”
InfluentialSecure Identity-Based Encryption in the Quantum Random Oracle Model
Zhandry, M. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32009-5_44 · Cited by 140
Hybrid Key Encapsulation Mechanisms and Authenticated Key Exchange
Bindel, N., Brendel, J., Fischlin, M., Goncalves, B., & Stebila, D. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-25510-7_12 · Cited by 203
“[11], this cannot change the adversary’s output behavior significantly.”
BackgroundDense quantum coding and a lower bound for 1-way quantum automata
Ambainis, A., Nayak, A., Ta‐Shma, A., & Vazirani, U. V. (1999) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/301250.301347 · Cited by 149
Self-citationQuantum computation of Fourier transforms over symmetric groups
Beals, R. (1997) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/258533.258548 · Cited by 191
Quantum resistant public key cryptography: a survey
Perlner, R. A., & Cooper, D. A. (2009) · Proceedings of the 8th Symposium on Identity and Trust on the Internet · doi:10.1145/1527017.1527028 · Cited by 137
Limitations of Quantum Advice and One-Way Communication
Aaronson, S. (2005) · Theory of Computing · doi:10.4086/toc.2005.v001a001 · Cited by 157
“[8] gave an oracle relative to which NP∩ coNP 6⊂ BQP, while Aaronson [1] gave an oracle relative to which SZK 6⊂ BQP.”
BackgroundA Survey of Quantum Property Testing
Montanaro, A., & de Wolf, R. (2016) · Theory of Computing · doi:10.4086/toc.gs.2016.007 · Cited by 306
Quantum search of spatial regions
Aaronson, S., & Ambainis, A. (2004) · 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. · doi:10.1109/sfcs.2003.1238194 · Cited by 121
Quantum Entanglement and the Communication Complexity of the Inner Product Function
Cleve, R., van Dam, W., Nielsen, M., & Tapp, A. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49208-9_4 · Cited by 133
Quantum Computing and Simulations for Energy Applications: Review and Perspective
Paudel, H. P., Syamlal, M., Crawford, S. E., Lee, Y., Shugayev, R., Lu, P., Ohodnicki, P. R., Mollot, D., & Duan, Y. (2022) · ACS Engineering Au · doi:10.1021/acsengineeringau.1c00033 · Cited by 191
Quantum Public-Key Cryptosystems
Okamoto, T., Tanaka, K., & Uchiyama, S. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44598-6_9 · Cited by 156
“Bennett, Bernstein, Brassard, and Vazirani [5] show that relative to an oracle chosen uniformly at random, with probability 1, class NP cannot be solved on a QTM in time o(2n/2).”
BackgroundNoisy intermediate-scale quantum computers
Cheng, B., Deng, X., Gu, X. Q., He, Y., Hu, G., Huang, P., Li, J., Lin, B., Lu, D., Lu, Y., et al. (2023) · Frontiers of Physics · doi:10.1007/s11467-022-1249-z · Cited by 182
The geometry of quantum computation
Dowling, M. R., & Nielsen, M. A. (2008) · CERN Document Server (European Organization for Nuclear Research) · doi:10.5555/2016985.2016986 · Cited by 153
Quantum Computing 40 Years Later
Preskill, J. P. (2023) · CRC Press eBooks · doi:10.1201/9781003358817-7 · Cited by 190
Quantum money from hidden subspaces
Aaronson, S., & Christiano, P. F. (2012) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2213977.2213983 · Cited by 214
Quantum Search on Bounded-Error Inputs
Høyer, P., Mosca, M., & de Wolf, R. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-45061-0_25 · Cited by 134
“Clearly, the Ω( √ n) lower bound for the standard error-less search problem, due to Bennett, Bernstein, Brassard, and Vazirani [4], also applies to our more general setting.”
BackgroundBapst, V., Foini, L., Krzakala, F., Semerjian, G., & Zamponi, F. (2013) · Physics Reports · doi:10.1016/j.physrep.2012.10.002 · Cited by 127
“Grover’s algorithm is known to be optimal [67] and has been experimentally tested, see [68] and references therein.”
BackgroundQuantum computing: pro and con
Preskill, J. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0171 · Cited by 126
“In this connection, an important result was obtained by Bennett, Bernstein, Brassard, and Vazirani (1997a) , who showed that Grover’s algorithm for the database search problem is actually optimal; no quantum algorithm can solve the problem faster than time of order p N. This result suggests that quantum computers may…”
Quantum lower bounds by quantum arguments
Ambainis, A. (2000) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/335305.335394 · Cited by 142
“For two related problems -inverting a permutation (often used to model one-way permutation) and AND of ORs only *Supported by Berkeley Fellowship for Graduate Studies and, in part, by NSF grant CCR-9800024.”
BackgroundMethodResultInfluentialThe Python’s Lunch: geometric obstructions to decoding Hawking radiation
Brown, A. R., Gharibyan, H., Penington, G., & Susskind, L. (2020) · Journal of High Energy Physics · doi:10.1007/jhep08(2020)121 · Cited by 124
Bapst, V., Foini, L., Krząkała, F., Semerjian, G., & Zamponi, F. (2012) · HAL · Cited by 123
Magniez, F., Nayak, A., Roland, J., & Santha, M. (2007) · Proceedings of the thirty-ninth annual ACM symposium on Theory of computing · doi:10.1145/1250790.1250874 · Cited by 126
Mitigating Multi-target Attacks in Hash-Based Signatures
Hülsing, A., Rijneveld, J., & Song, F. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-49384-7_15 · Cited by 149
“It is well known that Grover’s search algorithm is also optimal [4].”
BackgroundBlack-box hamiltonian simulation and unitary implementation
Berry, D. W., & Childs, A. M. (2012) · doi:10.5555/2231036.2231040 · Cited by 90
Probabilistic computing using Cu0.1Te0.9/HfO2/Pt diffusive memristors
Woo, K. S., Kim, J., Han, J., Kim, W., Jang, Y. H., & Hwang, C. S. (2022) · Nature Communications · doi:10.1038/s41467-022-33455-x · Cited by 152
Grover’s quantum search algorithm for an arbitrary initial amplitude distribution
Biham, E., Biham, O., Biron, D., Grassl, M., & Lidar, D. A. (1999) · Physical Review A · doi:10.1103/physreva.60.2742 · Cited by 148
Simulating Ising spin glasses on a quantum computer
Lidar, D. A., & Biham, O. (1997) · Physical Review E · doi:10.1103/physreve.56.3661 · Cited by 120
Mitigating Measurement Errors in Quantum Computers by Exploiting State-Dependent Bias
Tannu, S. S., & Qureshi, M. K. (2019) · Proceedings of the 52nd Annual IEEE/ACM International Symposium on Microarchitecture · doi:10.1145/3352460.3358265 · Cited by 118
“The other kernel we use is Bernstein-Vazirani (BV)[1] which deduces a secret key hidden inside a quantum oracle.”
MethodEquivalences and Separations Between Quantum and Classical Learnability
Servedio, R. A., & Gortler, S. J. (2004) · SIAM Journal on Computing · doi:10.1137/s0097539704412910 · Cited by 121
“For each i = 1, . . . , A let ci ∈ C be a concept such that the d-bit string ci(x1) · · · ci(xd) is si (such a concept ci must exist since the set S is shattered by C).”
BackgroundInfluentialFast Quantum Algorithm for Numerical Gradient Estimation
Jordan, S. P. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.050501 · Cited by 117
Lower Bounds for Local Search by Quantum Arguments
Aaronson, S. (2004) · SIAM Journal on Computing · doi:10.1137/s0097539704447237 · Cited by 130
Preparing Ground States of Quantum Many-Body Systems on a Quantum Computer
Poulin, D., & Wocjan, P. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.130503 · Cited by 117
Extracting Success from IBM’s 20-Qubit Machines Using Error-Aware Compilation
Nishio, S., Pan, Y., Satoh, T., Amano, H., & Meter, R. V. (2020) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/3386162 · Cited by 114
“Quantum computers exist [1, 2, 3, 4, 5, 6, 7], and once mature, they will surpass classical computers on a range of important problems [8, 9, 10, 11, 12, 13, 14, 15, 16].”
BackgroundA Short History of Computational Complexity
Fortnow, L., & Homer, S. T. (2003) · OpenBU (Boston University) · Cited by 143
AHARONOV, D. (1999) · Annual Reviews of Computational Physics VI · doi:10.1142/9789812815569_0007 · Cited by 94
“al.[36] show that if the quantum algorithm is supposed to compute the OR of the oracle bits X1, .”
Quantum communication and complexity
de Wolf, R. (2002) · Theoretical Computer Science · doi:10.1016/s0304-3975(02)00377-8 · Cited by 133
“It has error probability 61=3 on each input and uses O( √ n) queries, which is optimal [10,15,66].”
BackgroundQuantum inference on Bayesian networks
Low, G. H., Yoder, T. J., & Chuang, I. L. (2014) · Physical Review A · doi:10.1103/physreva.89.062315 · Cited by 109
“Although exponential speedups on such roblems are precl ded by BBBV [21], one might hope for square root speedups, as we have found here, for variety of tasks.”
BackgroundInfluentialLimits on the power of quantum statistical zero-knowledge
Watrous, J. (2003) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2002.1181970 · Cited by 164
“Equally important for understanding the power of quantum models are upper bounds and impossibility proofs, such as the containment of BQP in PP [1, 8], the impossibility of quantum bit commitment [20], and the existence of oracles relative to which quantum computers have limited power [3, 8].”
BackgroundQuantum lower bound for the collision problem
Aaronson, S. (2002) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/509907.509999 · Cited by 135
Black-box Hamiltonian simulation and unitary implementation
Childs, A. M., & Berry, D. W. (2012) · Quantum Information and Computation · doi:10.26421/qic12.1-2-4 · Cited by 101
Quantum lower bounds for the collision and the element distinctness problems
Shi, Y. (2003) · The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. · doi:10.1109/sfcs.2002.1181975 · Cited by 98
Nested quantum search and structured problems
Cerf, N. J., Grover, L. K., & Williams, C. P. (2000) · Physical Review A · doi:10.1103/physreva.61.032303 · Cited by 104
Quantum query complexity and semi-definite programming
Barnum, H., Saks, M., & Szegedy, M. (2004) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.2003.1214419 · Cited by 146
“Quadratic speedups over the best probabilistic decision trees have been shown for some functions (notably OR of n variables with O( √ n) queries [9], [10], for which there is a matching lower bound [7]) and examples also exist where only a linear speedup is possible.”
BackgroundA Quantum Algorithm for the Hamiltonian NAND Tree
Farhi, E., Goldstone, J., & Gutmann, S. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0702144 · Cited by 70
Gentle measurement of quantum states and differential privacy
Aaronson, S., & Rothblum, G. N. (2019) · Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing · doi:10.1145/3313276.3316378 · Cited by 97
“[11] observed that a quantum algorithm can safely invoke other quantum algorithms for decision problems as subroutines inside of a superposition—or in terms of complexity classes, that BQP = BQP.”
BackgroundQuantum Algorithms for Element Distinctness
Buhrman, H., Dürr, C., Heiligman, M., Høyer, P., Magniez, F., Sántha, M., & de Wolf, R. (2005) · SIAM Journal on Computing · doi:10.1137/s0097539702402780 · Cited by 145
“Using known lower bounds for the OR-function [5, 3], this gives an (M) bound for exact quantum and an (pM) bound for bounded-error quantum algorithms.”
BackgroundEfficient Quantum TransformsPreprint
Høyer, P. (1997) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9702028 · Cited by 159
“All known relativized separation results for quantum computation are based on quantum algorithms that use the discrete Fourier transform [6, 4, 30, 3].”
MethodOptimizing quantum optimization algorithms via faster quantum gradient computation
Gilyén, A., Arunachalam, S., & Wiebe, N. (2019) · Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms · doi:10.1137/1.9781611975482.87 · Cited by 103
Quantum Computing: Lecture NotesPreprint
de Wolf, R. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.09415 · Cited by 222
“ng a hint in AppendixC, and removed citations from exercises to prevent students looking up the original papers when doing the exercises (which is neither necessary nor helpful). Those references are [23,53,59,34,58,69,40,18,24,16,46,10]. Thanks to Arjan Cornelissen, Sven Cornets de Groot, Gerrit Vos, and Harm de Vrie…”
BackgroundMaraveas, C., Konar, D., Michopoulos, D. K., Arvanitis, K. G., & Peppas, K. P. (2024) · Computers and Electronics in Agriculture · doi:10.1016/j.compag.2024.108680 · Cited by 115
Quantum Random Walks Hit Exponentially Faster
Kempe, J. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0205083 · Cited by 95
Quantum walk speedup of backtracking algorithms
Montanaro, A. (2018) · Theory of Computing · doi:10.4086/toc.2018.v014a015 · Cited by 154
Secure Identity-Based Encryption in the Quantum Random Oracle Model
Zhandry, M. (2012) · Cited by 95
Quantum algorithms for element distinctness
Buhrman, H., Durr, C., Heiligman, M., Hoyer, P., Magniez, F., Santha, M., & de Wolf, R. (2002) · Proceedings 16th Annual IEEE Conference on Computational Complexity · doi:10.1109/ccc.2001.933880 · Cited by 93
Quantum Computing for Molecular Biology**
Baiardi, A., Christandl, M., & Reiher, M. (2023) · ChemBioChem · doi:10.1002/cbic.202300120 · Cited by 93
Adiabatic quantum computing for random satisfiability problems
Hogg, T. (2003) · Physical Review A · doi:10.1103/physreva.67.022314 · Cited by 93
“Quantum computers [1, 2, 3, 4] can rapidly evaluate all search states of nondeterministic polynomial (NP) problems [5], but appear unlikely to give short worst-case solu-tion times [6].”
BackgroundWhy haven't more quantum algorithms been found?
Shor, P. W. (2003) · Journal of the ACM · doi:10.1145/602382.602408 · Cited by 112
“It has been proved that there is an oracle, relative to which NP-complete problems cannot be solved in polynomial time [Bennett et al. 1997], and while there are fewer reasons supporting the belief that quantum computers cannot solve NP-complete problems than there are supporting the nearly universal belief that class…”
BackgroundQuantum information processing in continuous time
Childs, A. M., & Farhi, E. (2004) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 166
Frixione, M. (2001) · Minds and Machines · doi:10.1023/a:1017503201702 · Cited by 102
“There are other results, however, that limit this possibility (see Bennett et al., 1997).”
ResultViamontes, G. F., Markov, I. L., & Hayes, J. P. (2005) · Computing in Science & Engineering · doi:10.1109/mcse.2005.53 · Cited by 90
“have shown in [2] that quantum algorithms are unlikely to solve NP-complete problems in polynomial time, although more modest speed-ups remain possible.”
BackgroundFinding shortest lattice vectors faster using quantum search
Laarhoven, T., Mosca, M., & van de Pol, J. (2015) · Designs Codes and Cryptography · doi:10.1007/s10623-015-0067-5 · Cited by 115
“This is optimal up to a constant factor, as any quantum algorithm needs at least Ω( √ N ) evaluations of f [10].”
Brief history of quantum cryptography: a personal perspective
Brassard, G. (2005) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itwtpi.2005.1543949 · Cited by 109
“This result was rejected from all major theoretical computer science conferences until, giving up on conferences, we published it in SIAM Journal on Computing [4].”
BackgroundSelf-citationA novel image encryption/decryption scheme based on chaotic neural networks
Bigdeli, N., Farid, Y., & Afshar, K. (2012) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2012.01.007 · Cited by 88
“In order to examine if the selected key size is enough, the suggestions in (Lian, 2009; Lenstra and Verheul, 2001; NIST Special Publication 800-133, 2011; Bennett et al., 1997; Ferguson and Schneier, 2003) has been considered, here.”
BackgroundQuantum robots and environments
Benioff, P. (1998) · Physical Review A · doi:10.1103/physreva.58.893 · Cited by 88
Quantum-walk approach to searching on fractal structures
Agliari, E., Blumen, A., & Mülken, O. (2010) · Physical Review A · doi:10.1103/physreva.82.012305 · Cited by 90
Generalized Grover Search Algorithm for Arbitrary Initial Amplitude Distribution
Biron, D., Biham, O., Biham, E., Grassl, M., & Lidar, D. A. (1999) · Lecture notes in computer science · doi:10.1007/3-540-49208-9_10 · Cited by 100
“Keywords: Quantum searching, Grover’s algorithm, exact solution.”
Biology and medicine in the landscape of quantum advantages
Cordier, B. A., Sawaya, N. P. D., Guerreschi, G. G., & McWeeney, S. K. (2022) · Journal of The Royal Society Interface · doi:10.1098/rsif.2022.0541 · Cited by 87
“For example, for the general problem of unstructured search, Grover’s algorithm [60, 61] yields a”
BackgroundAn introduction to quantum information processing: applications and realizations
Spiller, T. P., Munro, W. J., Barrett, S. D., & Kok, P. (2005) · Contemporary Physics · doi:10.1080/00107510500293261 · Cited by 90
Quantum multi-prover interactive proof systems with limited prior entanglement
Kobayashi, H., & Matsumoto, K. (2003) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(03)00035-7 · Cited by 109
Pal, S., Bhattacharya, M., Lee, S.-S., & Chakraborty, C. (2024) · Molecular Biotechnology · doi:10.1007/s12033-023-00765-4 · Cited by 103
“Interestingly, this particular output is optimal [48].”
Quantum Pattern Matching Fast on Average
Montanaro, A. (2017) · Algorithmica · doi:10.1007/s00453-015-0060-4 · Cited by 84
“nistic sampling [33]. It is easy to see that this complexity is optimal in the worst case up to logarithmic factors, using standard lower bounds on the quantum query complexity of unstructured search [4]. The algorithm of Ramesh and Vinay achieves a faster runtime than the algorithms described here in the case that mi…”
BackgroundMethodInfluentialA review on quantum search algorithms
Giri, P. R., & Korepin, V. E. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1768-7 · Cited by 106
An Introduction to Quantum Complexity Theory
Cleve, R. (2001) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789810248185_0004 · Cited by 109
“The efficiency of the above algorithm has been shown to be optimal [6, 8, 14, 53].”
BackgroundDiscrete Quantum Walks Hit Exponentially Faster
Kempe, J. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45198-3_30 · Cited by 91
Limitations of quantum coset states for graph isomorphism
Hallgren, S., Moore, C., Rötteler, M., Russell, A. C., & Sen, P. (2006) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1132516.1132603 · Cited by 87
Dominant gate imperfection in Grover’s quantum search algorithm
Long, G. L., Li, Y., Zhang, W. L., & Tu, C. C. (2000) · Physical Review A · doi:10.1103/physreva.61.042305 · Cited by 88
On the power of quantum computation
Vazirani, U. (1998) · Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rsta.1998.0247 · Cited by 77
Self-citationHOW TO MAKE THE QUANTUM ADIABATIC ALGORITHM FAIL
FARHI, E., GOLDSTONE, J., GUTMANN, S., & NAGAJ, D. (2008) · International Journal of Quantum Information · doi:10.1142/s021974990800358x · Cited by 81
“A 57, 2403 (1998), quant-ph/9612026 [3] C.”
BackgroundSeparations in query complexity using cheat sheets
Aaronson, S., Ben-David, S., & Kothari, R. (2016) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2897518.2897644 · Cited by 133
“The best known separation between D(f) or R(f) versus Q(f) was only quadratic, achieved by the Or function: D(Or) ≥ R(Or) = Ω(n) and Q(Or) = Θ( √ n) [18, 11].”
BackgroundMethodInfluentialIntroduction to Quantum AlgorithmsPreprint
Shor, P. W. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0005003 · Cited by 105
“If you are searching an unordered database, this square root speed-up is as good as a quantum computer can do; this is proved using techniques developed in [7].”
Adversarial quantum circuit learning for pure state approximation
Benedetti, M., Grant, E., Wossnig, L., & Severini, S. (2019) · New Journal of Physics · doi:10.1088/1367-2630/ab14b5 · Cited by 81
“[31] Charles H Bennett, Ethan Bernstein, Gilles Brassard, and Umesh Vazirani, “Strengths and weaknesses of quantum computing,” SIAM journal on Computing 26, 1510–1523 (1997).”
BackgroundMethodTime Space Tradeoffs for Attacks against One-Way Functions and PRGs
De, A., Trevisan, L., & Tulsiani, M. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14623-7_35 · Cited by 113
“A quantum computer, however, can achieve T = √ N [11], which is optimal [5].”
BackgroundQuantum Computing and Communication Complexity
de Wolf, R. (2001) · Cited by 88
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.