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 1,201–1,300 of 1,466
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.005.0003 · Cited by 1
Quantum Computing and Quantum Computing Optimization: An Introduction
Nannicini, G. (2023) · Springer eBooks · doi:10.1007/978-3-030-54621-2_848-1 · Cited by 1
Sanders, B. C. (2024) · Elsevier eBooks · doi:10.1016/b978-0-323-95703-8.00259-7 · Cited by 3
“…resultant quantum states are measured, with measurement of the marked state being highly likely: A high probability of determining the marked state is achieved with just O ( √ N ) queries to the quantum oracle [71] compared to the classical requirement of O ( N ) queries to the classical oracle f .”
Query Complexity of Quantum Biased Oracles
Iwama, K., Raymond, R., & Yamashita, S. (2006) · Springer eBooks · doi:10.1007/11683858_2 · Cited by 1
Two-player interaction in quantum computing : cryptographic primitives & query complexity
Magnin, L. (2011) · theses.fr (ABES) · doi:10.70675/7fd872caz151az4eadzb0f5zc53f4c46586d · Cited by 1
Advances in public-key cryptology and computer exploitation
Géraud, R. (2017) · theses.fr (ABES) · doi:10.70675/990b2e4ez19fcz4589z9730z1849d78815d4 · Cited by 1
Hidden Structures and Quantum Cryptanalysis
Bonnetain, X. (2019) · theses.fr (ABES) · doi:10.70675/376c5157z8acez485dzab89z9e1bfa697ee9 · Cited by 7
Grover’s Algorithm and Its Generalization
Portugal, R. (2013) · Springer eBooks · doi:10.1007/978-1-4614-6336-8_4
Hash Functions and Gröbner Bases Cryptanalysis
Ødegård, R. S. (2012) · BIBSYS Brage (BIBSYS (Norway))
An Algorithmic Argument for Query Complexity Lower Bounds of Advised Quantum ComputationPreprint
Nishimura, H., & Yamakami, T. (2003) · arXiv (Cornell University)
Structure, randomness and complexity in quantum computation
Montanaro, A. (2008) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 2
Optical investigations of low-dimensional semiconductor structures
Sercombe, D. (2013) · UPT. Syiah Kuala University Library (Syiah Kuala University)
Simulation de systèmes quantiques sur un ordinateur quantique réaliste
Levi, B. P. (2004) · HAL
At the intersection of quantum computing and quantum chemistry
Whitfield, J. D. (2011)
On Quantum Computation with Some Restricted Amplitudes
Nishimura, H. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45841-7_25 · Cited by 1
Algebra geometrica e o algoritmo de Grover
Alves, R. S. D. O. (2008) · doi:10.47749/t/unicamp.2008.426392
Quantum Algorithm for Finding Triangles
Jeffery, S., & Richter, P. C. (2016) · Springer eBooks · doi:10.1007/978-1-4939-2864-4_308
Zero-Knowledge Proof of Generalized Compact Knapsacks (or A Novel Identification/Signature Scheme)
Qin, B., Wu, Q., Susilo, W., Mu, Y., & Wang, Y. (2006) · Lecture notes in computer science · doi:10.1007/11839569_52
Quantum Computation: A Computer Science PerspectivePreprint
Bengtsson, A. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0511274 · Cited by 1
Physics and metaphysics looks at computationPreprint
Svozil, K. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.physics/0508207
BQP and PPADPreprint
Li, Y. D. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1108.0223
Complexity: A Language-Theoretic Point of View
Calude, C. S., & Hromkovic̆, J. (1997) · Springer eBooks · doi:10.1007/978-3-662-07675-0_1 · Cited by 2
Using Cloning to Solve NP Complete ProblemsPreprint
Drakopoulos, J. A., & Tomaras, T. N. (2001) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0112133
“[3] proved that relative to a random oracle, it is not true that NP ⊆ BQP.”
BackgroundA note on quantum one-way permutationsPreprint
Kashefi, E., Nishimura, H., & Vedral, V. (2001) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0109157 · Cited by 1
“an get f−1(1) with high probability. Thus, when fis given as an oracle, this algorithm works quadratically faster than any possible classical algorithm. However, this algorithm is shown to be optimal [4, 10, 11], so that we cannot solve this problem by using at most queries polynomial in n. This implies that even if t…”
BackgroundMethodFinding quantum algorithms via convex optimization
Childs, A. M., Landahl, A. J., & Parrilo, P. A. (2007) · European Control Conference (ECC) · doi:10.23919/ecc.2007.7069011
“In particular, this shows that the quantum query complexity of the OSP is strictly less than log2 √ N , which one might have naively guessed was the query complexity of ordered search by analogy with the unordered search problem, whose quantum query complexity is Θ( √ N) [4], [5].”
BackgroundQuantum eigenvalue estimation for irreducible non-negative matrices
Daskin, A. (2016) · International Journal of Quantum Information · doi:10.1142/s0219749916500052
Controlling quantum information
Landahl, A. J. (2002) · CERN Document Server (European Organization for Nuclear Research) · doi:10.7907/bj0q-c297
Computational/Algorithmic Number Theory
Yan, S. Y. (2002) · Springer eBooks · doi:10.1007/978-3-662-04773-6_2
Codigos convolucionais quanticos concatenados
de Almeida, A. C. A. (2004) · doi:10.47749/t/unicamp.2004.322954 · Cited by 3
Nuevos algoritmos cuánticos para tomografía de procesos y estados
Bendersky, A. (2011) · Repositorio Digital Institucional de la Universidad de Buenos Aires (Universidad de Buenos Aires)
Recovering Strings in Oracles: Quantum and Classic
Iwama, K. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-31653-1_3
Quantum Search in a Four-Complex-Dimensional SubspacePreprint
Jin, W. (2013) · viXra
Quantum subroutine problem and the robustness of quantum complexity classesPreprint
Nishimura, H., & Ozawa, M. (2001) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0107089
“BBBV [6] claimed that BQP is robust as the corollary of Theorem 4.2, since this theorem allows us to use a QTM recognizing an oracle language instead of the oracle itself.”
InfluentialQuantum neurocomputation and signal processing
Eghbalnia, H. R., & Assadi, A. (2002) · Machine learning for signal processing ... · doi:10.1109/nnsp.2000.889412
“A discussion of the ideas can be found in [1,2,3,4,6,8] and references therein.”
BackgroundPrecise Time Evolution of Superconductive Phase QubitsPreprint
Rad, A. I., Zandi, H., & Fardmanesh, M. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1411.7454
História da ciência, interdisciplinaridade e ensino de física: o problema do demônio de Maxwell
de Mattos, C. R., & Hamburger, A. I. (2004) · Ciência & Educação (Bauru) · doi:10.1590/s1516-73132004000300011
Stochastic simulation of quantum computation
MANSSUR, L. R. U., & Portugal, R. (2003) · Europhysics Letters (EPL) · doi:10.1209/epl/i2003-00560-3
Complexity of solving nonlinear equations in the deterministic, randomized and quantum settings
Goćwin, M., & Kacewicz, B. Z. (2013) · Applied Mathematics and Computation · doi:10.1016/j.amc.2013.09.008
Ting-Ting, R., Mang, F., Chang, W.-L., & Jun, L. (2009) · Chinese Physics B · doi:10.1088/1674-1056/18/12/013
Computational complexity in entanglement transformations
Chitambar, E. (2010) · Deep Blue (University of Michigan) · Cited by 1
Algebraic Problems in Computational Complexity
Sen, P. K. (2001) · University
New quantum algorithm solving the NP complete problem
Ohya, M. (2012) · P-Adic Numbers Ultrametric Analysis and Applications · doi:10.1134/s2070046612020082
Relative diffusion transform and quantum speedup of computations
Ozhigov, Y. I., & Victorova, N. B. (2000) · Journal of Experimental and Theoretical Physics Letters · doi:10.1134/1.568318
RECOVERING STRINGS IN ORACLES: QUANTUM AND CLASSIC
Iwama, K., & Nishimura, H. (2013) · International Journal of Foundations of Computer Science · doi:10.1142/s0129054113400261
Boolean Functions of Low Polynomial Degree for Quantum Query Complexity Theory
Freivalds, R., & Garkaje, L. (2007) · IEEE International Symposium on Multiple-Valued Logic (ISMVL) · doi:10.1109/ismvl.2007.11
“[7] shows that this is not possible and Grover’s algorithm is exactly optimal.”
BackgroundMethodComputational Power of the Quantum Turing Automata
Jafarpour, S., Ghodsi, M., Sadri, K., & Montazeri, Z. (2007) · doi:10.1109/itng.2007.56
Plummeting the Software Testing Time Complexity
Baig, M. M., & Khan, A. A. (2009) · World Congress on Software Engineering (WCSE) · doi:10.1109/wcse.2009.465
Quantum computing and quantum complexity theory
Vazirani, U. V. (2000) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas.2000.857201
Self-citationQuantum Algorithms of Bio-molecular Solutions for the Clique Problem on a Quantum ComputerPreprint
Chang, W.-L., Ren, T.-T., Feng, M., Luo, J. L., Lin, K. W., Guo, M., & Lu, L. C. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0905.2028
“Afterward, strengths and weaknesses of the quantum Turing machine for solving NP-complete problems were discussed [Bennett et al. 1997].”
Classic and Quantum Computation
Yan, S. Y. (2013) · Springer eBooks · doi:10.1007/978-1-4419-7722-9_1
Introduction to Quantum Information Processing
Kashefi, E. (2004)
Quantum algorithms for bio-molecular solutions to the satisfiability problem on a quantum computer
Chang, W.-L., Ren, T.-T., Luo, J., Feng, M., & Guo, M. (2008) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2008.4630931
Computing the Exit Complexity of Knowledge in Distributed Quantum Computers
A, M. (2012) · International Journal of Advanced Computer Science and Applications · doi:10.14569/ijacsa.2012.031215
Recursive quantum spatial search does not need ancilla qubitPreprint
Tulsi, A. (2015) · arXiv (Cornell University)
When Abandoned Bits Bite Back - Reversibility and Quantum Computing
Fitzpatrick, P. (2002)
Woods, D., Naughton, T. J., & Gibson, J. P. (2001)
Calculation and Minimisation of Garbage Bits in Quantum Reversible Circuits
Tanwar, R., & Singh, A. S. G. (2005)
On Quantum Computing and Pseudorandomness
Fefferman, W. J. (2011) · CaltechTHESIS (California Institute of Technology) · doi:10.7907/3q00-dd64
An Upper Bound on the Rate of Information Transfer by Grover’s Oracle
Arıkan, E. (2006) · Lecture notes in computer science · doi:10.1007/11889342_25
On fault-tolerance of Grover's algorithm
Nahimovs, N., Rivosh, A., & Kravchenko, D. (2012)
Optical Spectroscopy of an Erbium-Doped Crystal
Spektroskopie, O. (2013)
Whiteld, J. D. (2011)
The complexity class PDQP SPUR Final Paper: Summer 2013
Lee, M., Bouland, A., & Aaronson, S. (2013)
Impossibility of a Quantum Speed-up with a Faulty Oracle
Sackler, B. (2008)
A linear time quantum algorithm for 3SATPreprint
Walters, Z. B. (2015) · arXiv (Cornell University)
Quantum Universality, Computability, & Complexity
Williams, C. P. (2010) · Texts in computer science · doi:10.1007/978-1-84628-887-6_4 · Cited by 1
Mathlab Implementation of Quantum Computation in Searching an Unstructured Database
Awoyelu, I. O., & Okoh, P. (2012) · Informatica
Computação quântica e teoria de computação
Grilo, A. B. (2014) · doi:10.47749/t/unicamp.2014.931534 · Cited by 2
Application of SDP to product rules and quantum query complexity
Mittal, R. (2011) · Rutgers University Community Repository (Rutgers University) · doi:10.7282/t3b27tmj
Connectivity effects in the coined quantum walk search algorithm
Lovett, N. B., & Kendon, V. M. (2011) · International Conference on Quantum Information · doi:10.1364/icqi.2011.qmi16
MagnNuclear em Sistemas Quadrupolares.
Doutorado, T. D., & Auccaise, R. (2008)
Quantum Algorithms for Integer Factorization
Yan, S. Y. (2015) · Springer eBooks · doi:10.1007/978-3-319-25823-2_3 · Cited by 2
The Computational Complexity of Randomness
Watson, T. W. (2013) · eScholarship (California Digital Library) · Cited by 1
Quantum algorithms for finding extrema with unary predicates
Chan, M. H. (2011) · doi:10.14288/1.0052063
“(yfn) calls to the query/predicate (J(7) in our case) [13].”
Background(2009) · Chapman & Hall/CRC cryptography and network security · doi:10.1201/9781420070033.ch13
(2010) · Springer eBooks · doi:10.1007/978-3-642-03296-7_2
A Quantum Algorithm for the Ferromagnetic Ising Model (Manuscript in preparation)
Nayak, A., Waterloo, U., Schulman, L. J., & Vazirani, U. V. (2008)
Self-citationQuantum Computing Approach for Alignment-Free Sequence Search and Classification
Kotamarti, R. M., Thornton, M. A., & Dunham, M. H. (2012) · IGI Global eBooks · doi:10.4018/978-1-4666-1830-5.ch017
Pelzl, J., & Paar, C. (2016) · eXamen.press · doi:10.1007/978-3-662-49297-0_5
Search for dynamical origin of social networksPreprint
Zak, M. A. (2016) · Preprints.org · doi:10.20944/preprints201608.0184.v1
Castagnoli, G. (2017) · AIP conference proceedings · doi:10.1063/1.4982768
More Than Error Correction: Cryptography from Codes
Chen, Y. (2014) · UWSpace (University of Waterloo)
Novel Methods in Quantum Error Correction
Jochym-O’Connor, T. (2016) · UWSpace (University of Waterloo) · Cited by 2
Secure Communication via a Recycling of Attenuated Classical Signals
Smith, A. M. (2017) · Physical Review Applied · doi:10.1103/physrevapplied.7.014010
“This would make 128 bit keys breakable and 256 bit keys dubious with current classical computers [3].”
BackgroundMore than restoring strings of symbols transmitted means transfer today
Ahlswede, R. (2006)
Time-Space Tradeoffs and Query Complexity in Statistics, Coding Theory, and Quantum Computing
Machmouchi, W. (2013) · ResearchWorks at the University of Washington (University of Washington)
Métodos algebraicos para problemas discretos
Tobis, E. A. (2009) · Repositorio Digital Institucional de la Universidad de Buenos Aires (Universidad de Buenos Aires)
Faugère, J., & Perret, L. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-56549-1_22
Some Upper and Lower Bounds regarding Query Complexity
Liu, R. P. (2017) · UWSpace (University of Waterloo)
Fastest Quantum Search for Extreme PointPreprint
Ozhigov, Y. (1998) · arXiv (Cornell University)
Synthesis, Technology Mapping and Optimization for Emerging Technologies
Bhattacharjee, D., & Chattopadhyay, A. (2018) · IEEE Computer Society Annual Symposium on VLSI · doi:10.1109/isvlsi.2018.00074
“Quantum computing has garnered significant attention due its inherent capabilities to offer up to exponential speedup over the best known algorithms for classical computing [5].”
BackgroundQuantum Algorithms: Invited Talk
Vazirani, U. V. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45995-2_5
Self-citationQuantum Computation Beyond the Unitary Circuit Model
Usher, N. (2017) · UCL Discovery (University College London)
Vazirani, U. V. (2001) · Fundamentals of Computation Theory
Self-citationBłażewicz, J., Ecker, K., Hammer, B., Mokbel, B., Börger, W., & Hasenfuß, A. (2008)
Evaluation of exact quantum query complexities by semidefinite programming
Uyanık, K. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2297-3 · Cited by 1
Combinatorial Digital Signature Scheme.
Koussa, E., Faugère, J., Macario-Rat, G., Patarin, J., & Perret, L. (2018)
The Fiat-Shamir Transformation in a Quantum WorldPreprint
Dagdelen, Ö., & Fischlin, M. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1306.0315
“Using techniques from [6] we can show that changing the oracle in this case does not change the adversary’s success probability significantly.”
MethodQuantum algorithms and approximating polynomials for composed functions with shared inputs
Bun, M., Kothari, R., & Thaler, J. (2021) · Quantum · doi:10.22331/q-2021-09-16-543 · Cited by 7
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.