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 801–900 of 1,464
Clustering Structure and Quantum Computing
Wittek, P. (2014) · Elsevier eBooks · doi:10.1016/b978-0-12-800953-6.00010-4 · Cited by 6
Hayes, B. (1995) · American Scientist · Cited by 9
Fortnow, L., & Homer, S. T. (2014) · Handbook of the history of logic · doi:10.1016/b978-0-444-51624-4.50011-3 · Cited by 8
Gudder, S. (2000) · Springer eBooks · doi:10.1007/978-94-017-1201-9_12 · Cited by 6
SINGLE-STEP QUANTUM SEARCH USING PROBLEM STRUCTURE
Hogg, T. (2000) · International Journal of Modern Physics C · doi:10.1142/s0129183100000663 · Cited by 7
“However, extracting a definite answer from this simultaneous evaluation appears to still give an exponentially growing search cost in the worst case [4].”
BackgroundQuantum Algorithms for Continuous Problems and Their Applications
Papageorgiou, A., & Traub, J. F. (2014) · Advances in chemical physics · doi:10.1002/9781118742631.ch06 · Cited by 6
“The quantum model of computation is discussed in detail in [6, 7, 24, 38, 61].”
BackgroundKolmogorov Complexity and Formula Size Lower Bounds
Lee, T., Size, F., Bounds, L., Proefschrift, A., Lee, T., Dr, P. P., Buhrman, H., Dr, O. P., Fortnow, L., & Torenvliet, L. (2006) · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · Cited by 6
Matrix Product Operator Simulations of Quantum Algorithms
Woolfe, K. J. (2015) · Minerva Access (University of Melbourne) · Cited by 9
Efficient Quantum Walk on the Grid with Multiple Marked Elements
Høyer, P., & Komeili, M. (2016) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.stacs.2017.42 · Cited by 11
Quantum Versus Classical Proofs and AdvicePreprint
Aaronson, S., & Kuperberg, G. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0604056 · Cited by 32
Quantum Logspace Algorithm for Powering Matrices with Bounded Norm
Girish, U., Raz, R., & Zhan, W. (2020) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.icalp.2021.73 · Cited by 14
On the efficiency of Hamiltonian–based quantum computation for low–rank matricesPreprint
Cao, Z., & Elgart, A. (2012) · Cited by 6
Silicide-based Josephson field effect transistors for superconducting qubits
Vethaak, T. D. (2021) · theses.fr (ABES) · doi:10.70675/182d9d63zfd33z4091za9c2z840e3751fe66 · Cited by 9
The Philosophy of Quantum Computing
Cuffaro, M. E. (2022) · Springer eBooks · doi:10.1007/978-3-030-95538-0_3 · Cited by 6
The Parallel Reversible Pebbling Game: Analyzing the Post-quantum Security of iMHFs
Blocki, J., Holman, B., & Lee, S. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-22318-1_3 · Cited by 8
“In particular, Grover’s algorithm only requires O ( √ m ) black-box queries to the function f G,H evaluating the function f G,H and this is optimal — any quantum algorithm using f G,H as a black box must make at least Ω ( √ m ) queries [BBBV97].”
A quantum “black box” for entropy calculation
Koren, M., Koren, O., & Peretz, O. (2023) · Quantum Machine Intelligence · doi:10.1007/s42484-023-00127-y · Cited by 6
“However, there are some difficulties in building and maintaining the superposition of quantum computers due to the sensitivity of the computers to noise and decoherence (Bennett et al. 1997; De Wolf 2019).”
MorphQPV: Exploiting Isomorphism in Quantum Programs to Facilitate Confident Verification
Tan, S., Xiang, D., Lu, L., Lu, J., Jiang, Q., Chen, M., & Yin, J. (2024) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3620666.3651360 · Cited by 5
How (not) to Build Quantum PKE in Minicrypt
Li, L., Qian, L., Li, X., & Liu, Q. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-68394-7_6 · Cited by 15
On the theory of quantum and towards practical computation: A review
Kudelić, R. (2024) · Journal of Computational Science · doi:10.1016/j.jocs.2024.102454 · Cited by 7
Variational Shadow Quantum Circuits Assisted Quantum Convolutional Neural Network
Feng, Y., Li, Y., Li, J., Zhou, J., & Shi, J. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202400510 · Cited by 7
Aaronson, S. (2018) · Quantum Information and Computation · doi:10.26421/qic18.11-12-1 · Cited by 5
“But we’ve also known that the tools used to prove this don’t generalize, for example, to NP-complete problems [12].”
MethodOn the Quantum Complexity of Closest Pair and Related Problems
Aaronson, S., Chia, N.-H., Lin, H.-H., Wang, C., & Zhang, R. (2020) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.ccc.2020.16 · Cited by 40
Average-Case Verification of the Quantum Fourier Transform Enables Worst-Case Phase Estimation
Linden, N., & de Wolf, R. (2022) · Quantum · doi:10.22331/q-2022-12-07-872 · Cited by 22
Quantum query complexity of Boolean functions under indefinite causal order
Abbott, A. A., Mhalla, M., & Pocreau, P. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.l032020 · Cited by 12
“Notably, it has been used to prove various separations be-tween classical and quantum computations, and to provide non-trivial lower bounds on some important computational problems, such as the optimally of Grover’s al-gorithm or the complexity of graph problems [1–3].”
MethodConstraints on physical computers in holographic spacetimes
Kubicki, A. M., May, A., & Pérez-García, D. (2024) · SciPost Physics · doi:10.21468/scipostphys.16.1.024 · Cited by 6
“Using a quantum computer one can do no better than making √ Ns = Ω(2 2A) oracle calls [30].”
BackgroundQuFEM: Fast and Accurate Quantum Readout Calibration Using the Finite Element Method
Tan, S., Lu, L., Zhang, H., Yu, J. Y., Lang, C., Shang, Y., Zhao, X., Chen, M., Liang, Y. E., & Yin, J. (2024) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3620665.3640380 · Cited by 6
“We evaluate QuFEM over 7 well-known quantum algorithms, including GHZ [20], variational quantum classifier (VQC) [17], Bernstein-Vazirani (BV) [7], Simon’s [15], quantum support vector machines (QSVM) [51], Hamiltonian simulation (HS), and Deutsch-Jozsa (DJ) algorithms.”
MethodZeno-effect computation: Opportunities and challenges
Berwald, J., Chancellor, N., & Dridi, R. (2025) · Physical Review A · doi:10.1103/physreva.111.042623 · Cited by 8
“Grover’s algorithm represents the best possible performance for unstructured search on a quantum device [34].”
Quantum Lower Bounds by Sample-to-Query Lifting
Wang, Q., & Zhang, Z. (2025) · SIAM Journal on Computing · doi:10.1137/24m1638616 · Cited by 39
“Quantum Gibbs sampling is a task to prepare the Gibbs (thermal) state e − βH / Z of a given Hamiltonian H at inverse temperature β ≥ 0, where Z = tr( e − βH ) is the normalization factor.”
Two notes on Grover’s search: Programming and discriminating
Reitzner, D., & Ziman, M. (2014) · The European Physical Journal Plus · doi:10.1140/epjp/i2014-14128-9 · Cited by 5
On the Complexity of Searching for a Maximum of a Function on a Quantum Computer
Goćwin, M. (2006) · Quantum Information Processing · doi:10.1007/s11128-006-0011-8 · Cited by 6
“Due to (2) the cost of computing the maximum of numbers m̃1( f ), .”
BackgroundIntricacies of quantum computational paths
Tarrataca, L. D. T. J., & Wichert, A. (2012) · Quantum Information Processing · doi:10.1007/s11128-012-0475-7 · Cited by 5
“This result was first proven in [7], with earlier versions of the manuscript appearing before Grover’s algorithm [6].”
ResultTrusted Code Remote Execution through Trusted Computing and Virtualization
Zhang, L., Chen, L., Zhang, H., & Yan, F. (2007) · ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD) · doi:10.1109/snpd.2007.388 · Cited by 5
Computing with quanta—impacts of quantum theory on computation
Hirvensalo, M. (2002) · Theoretical Computer Science · doi:10.1016/s0304-3975(02)00096-8 · Cited by 5
Fourier Transforms and Quantum Computation
Vazirani, U. V. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45878-6_8 · Cited by 6
Self-citationQuantum key distribution and cryptography: a survey
Alléaume, R., Lütkenhaus, N., Renner, R., Grangier, P., Debuisschert, T., Ribordy, G., Gisin, N., Painchault, P., Pornin, T., Slavail, L., et al. (2010) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/dagsemproc.09311.3 · Cited by 7
Weak, strong, and uniform quantum simulations
Wang, D. (2015) · Physical Review A · doi:10.1103/physreva.91.012334 · Cited by 10
Search algorithm of structure anomalies in complete graph based on scattering quantum walk
Xue, X., Chen, H., Liu, Z., & Bin-Bin, Z. (2016) · Acta Physica Sinica · doi:10.7498/aps.65.080302 · Cited by 5
Castagnoli, G. (2018) · Foundations of Physics · doi:10.1007/s10701-018-0146-3 · Cited by 8
“As shown by Long [12 , 13], Grover’s problem can be solved quantumly with any number of function evaluations equal or above that required by the optimal Grover algorithm.”
MethodResultInfluentialHosoyamada, A., & Yamakawa, T. (2024) · Journal of Cryptology · doi:10.1007/s00145-024-09517-2 · Cited by 8
A Relational Time-Symmetric Framework for Analyzing the Quantum Computational Speedup
Castagnoli, G., Cohen, E., EKERT, A. K., & Elitzur, A. C. (2019) · Foundations of Physics · doi:10.1007/s10701-019-00300-z · Cited by 9
Microstate distinguishability, quantum complexity, and the eigenstate thermalization hypothesis
Bao, N., Pollack, J., Wakeham, D., & Wildenhain, E. (2020) · Classical and quantum gravity · doi:10.1088/1361-6382/ac0e17 · Cited by 5
“The BBBV result [6] still applies to the mixed-state amplification problem [41], as the difficulty of distinguishing the mixed states which are the generic output of the coarse-graining channel is lower-bounded by the difficulty of distinguishing pure states in the IR Hilbert space by the data…”
InfluentialString Matching with Wildcards in the Massively Parallel Computation Model
Hajiaghayi, M., Saleh, H., Seddighin, S., & Sun, X. (2021) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/3409964.3461793 · Cited by 5
“Since then, attention has been given to many variants and generalizations of pattern matching [1, 2, 5, 8, 10, 11, 13, 15, 16, 21, 23, 26, 27, 28, 33, 36, 37, 38, 40, 41, 42, 43].”
BackgroundVazirani, U. V. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44669-9_6 · Cited by 5
Self-citationQuantum and Post-Quantum Cybersecurity Challenges and Finance Organizations Readiness
Arshad, R., & Riaz, Q. (2022) · Advances in information security, privacy, and ethics book series · doi:10.4018/978-1-6684-5284-4.ch016 · Cited by 5
Recent Advances on Convolutional Architectures in Medical Applications: Classical or Quantum?
Al‐jumaili, S., Al-jumaili, A., Alyassri, S., Duru, A. D., & Uçan, O. N. (2022) · International Symposium on Multidisciplinary Studies and Innovative Technologies (ISMSIT) · doi:10.1109/ismsit56059.2022.9932857 · Cited by 7
Span program for non-binary functions
Beigi, S., & Taghavi, L. (2019) · Quantum Information and Computation · doi:10.26421/qic19.9-10-2 · Cited by 10
“k p (‘ 1) p n : Since kis arbitrary, we conclude that ADV (Max n) = O( p n). The Max function is a generalization of the OR function that is known to have the quantum query complexity equal to ( p n) [BBBV97]. Therefore ADV (Max n) = ( p n). This completes the proof. 19 A span program based quantum query algorithm for…”
BackgroundProblems and solutions from the fourth International Students’ Olympiad in Cryptography (NSUCRYPTO)
Gorodilova, A., Agievich, S., Carlet, C., Gorkunov, E., Idrisova, V., Kolomeec, N., Kutsenko, A., Nikova, S., Oblaukhov, A., Picek, S., et al. (2019) · Cryptologia · doi:10.1080/01611194.2018.1517834 · Cited by 5
“…the maximal possible Hamming distance from the set of all affine functions, one quantum query suffices to solve the problem exactly [21]; • for any delta function, i. e. f ( x ) = δ x,x 0 for some x 0 ∈ F n 2 , the quantum query complexity is Θ 2 n/ 2 , which is equivalent to Grover’s search [14, 3].”
BackgroundA Modified Quantum Search Algorithm
Mehri‐Dehnavi, H., Dashtianeh, H., Kuchaksaraei, H. Y., Khoshdareh, M. M., Movahhedian, H., & Rahimi, R. (2018) · International Journal of Theoretical Physics · doi:10.1007/s10773-018-3880-6 · Cited by 6
A classical limit of Grover’s algorithm induced by dephasing: Coherence versus entanglement
Fujikawa, K., Oh, C. H., & Umetsu, K. (2019) · Modern Physics Letters A · doi:10.1142/s0217732319501463 · Cited by 6
Intelligent pharmaceutical patent search on a near-term gate-based quantum computer
Wang, P., Chen, J., & Tseng, Y. J. (2022) · Scientific Reports · doi:10.1038/s41598-021-04031-y · Cited by 5
“Grover’s search algorithm is optimal regarding oracles, since it has been shown that given an oracle, any algorithm has to apply the oracle at least as many times as Grover’s algorithm does 33 .”
MethodQuantum bounds for 2D-grid and Dyck language
Ambainis, A., Balodis, K., Iraids, J., Khadiev, K. R., Kļevickis, V., Prūsis, K., Shen, Y., Smotrovs, J., & Vihrovs, J. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03910-9 · Cited by 5
“In the case of k = 2, the problem is equivalent to an unstructured search among n elements whose lower bound in classical case is linear [11].”
BackgroundA Hybrid Algorithm for the Shortest-Path Problem in the Graph
Aghaei, M. R. S., Zukarnain, Z. A., Mamat, A., & Zainuddin, H. (2008) · International Conference on Advanced Computer Theory and Engineering · doi:10.1109/icacte.2008.137 · Cited by 5
“[3,4,5, 6 ,15]. Quantum searching is a tool for speeding up these sorts of generic searches through a space of potential solutions.”
Analysis and Simulation of Grover’s Search Algorithm
Zhuang, J., Zhao, J., Xu, F., Hu, H., & Qiao, P. (2014) · International Journal of Machine Learning and Computing · doi:10.7763/ijmlc.2014.v4.380 · Cited by 7
“Grover's search algorithm dealt with a single object search in large unsorted database [7].”
BackgroundFast Discretized Gaussian Sampling and Post-quantum TLS Ciphersuite
Gao, X., Li, L., Ding, J., Liu, J., Rv, S., & Liu, Z. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-72359-4_33 · Cited by 5
Shared-Key Signature and Its Application to Anonymous Authentication in Ad Hoc Group
Wu, Q., Chen, X., Wang, C., & Wang, Y. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30144-8_28 · Cited by 5
“Bennett et al show that relative to an oracle chosen uniformly at random with probability 1, class NP cannot be solved in the computation model in time O(2n/2) [13].”
BackgroundGraph entropy and quantum sorting problems
Yao, A. C.-C. (2004) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1007352.1007377 · Cited by 5
Castagnoli, G. (1998) · International Journal of Theoretical Physics · doi:10.1023/a:1026660027595 · Cited by 5
A Polynomial Time Bounded-error Quantum Algorithm for Boolean SatisfiabilityPreprint
Younes, A., & Rowe, J. E. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1507.05061 · Cited by 5
“A long-standing open problem in quantum computing is the relationship between the classes NP and BQP [2, 4].”
BackgroundResultInfluentialQuantum Computational Number Theory
Yan, S. Y. (2012) · Wiley eBooks · doi:10.1002/9781118188606.ch10 · Cited by 5
Solving the quantum search problem in polynomial time on an NMR quantum computerPreprint
Miao, X. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0206102 · Cited by 7
Solving Random Satisfiability Problems with Quantum ComputersPreprint
Hogg, T. (2001) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0104048 · Cited by 6
“Unfortunately, the difficulty of extracting a solution from the superposition appears to preclude rapid solution of of at least some NP problems [2].”
BackgroundMethodUniversal construction for the unsorted quantum search algorithmsPreprint
Miao, X. (2001) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0101126 · Cited by 10
“be speeded up quadratically by quantum computation [ 12 ].”
BackgroundMethodInfluentialQuantum speedups for convex dynamic programmingPreprint
Sutter, D., Nannicini, G., Sutter, T., & Woerner, S. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2011.11654 · Cited by 7
“It is widely believed that quantum computers cannot achieve more than a quadratic speedup on #Phard problems [4, 5] (although we note that for the computation of the Jones polynomial, which is a #P-hard problem, there exists an efficient quantum approximation algorithm even if no classical polynomial-time approximatio…”
BackgroundNo Quantum Speedup over Gradient Descent for Non-Smooth Convex OptimizationPreprint
Garg, A., Kothari, R., Netrapalli, P., & Sherif, S. (2020) · arXiv (Cornell University) · doi:10.4230/lipics.itcs.2021.53 · Cited by 5
Variational Quantum Search with Shallow Depth for Unstructured Database SearchPreprint
Zhan, J. (2023) · Research Square · doi:10.21203/rs.3.rs-3769828/v1 · Cited by 8
Quantum complexity of graph and algebraic problems
Dörn, S. (2007) · OPen Access Repositorium der Universität Ulm (OPARU) (Ulm University) · doi:10.18725/oparu-976 · Cited by 7
“(see [BBBV97] or Section 4).”
Quantum Optimization Benchmarking Library - The Intractable Decathlon
Koch, T., Neira, D. E. B., Chen, Y., Cortiana, G., Egger, D. J., Heese, R., Hegade, N. N., Cadavid, A. G., Huang, R., Itoko, T., et al. (2025) · arXiv · doi:10.48550/arxiv.2504.03832 · Cited by 5
Separability criteria and entanglement witnesses from mutually unbiased equiangular tight frames
Rastegin, A. E. (2025) · Communications in Theoretical Physics · doi:10.1088/1572-9494/ae0abb · Cited by 6
“Although the power of quantum computing is certainly limited [ 10 ] , this concept seems to actualize in recent future.”
Post-quantum Security of Key-Alternating Feistel Ciphers
Basak, J., Bhaumik, R., Chauhan, A. K., Jejurikar, R., Jha, A., Roy, A., Schrottenloher, A., & Talnikar, S. (2025) · Lecture notes in computer science · doi:10.1007/978-981-95-5018-0_15 · Cited by 5
“The latter amounts to black-box quantum exhaustive search, where Grover’s algorithm gives a tight solution [BBBV97].”
Dicke State Quantum Search for Solving the Vertex Cover Problem
Jiang, J. (2025) · Mathematics · doi:10.3390/math13183005 · Cited by 4
The Grover Dilemma and Three Fundamental Barriers to Oracle-Based Quantum Search Algorithms
Liu, Y. (2026) · Journal of Quantum Information Science · doi:10.4236/jqis.2026.161002 · Cited by 5
Optimality conditions for spatial search with multiple marked vertices
Roget, M., Kadri, H., & Molfetta, G. D. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.033021 · Cited by 4
“The Grover algorithm could solve this problem in O √ N time, i.e. quadratically faster than what a classical computer needs to complete the same task, and it soon seemed to be extraordinary advantageous to speed-up many classical algorithms that use search heuristic [8–10].”
MethodLower bounds for adiabatic quantum algorithms by quantum speed limits
Chen, J.-H. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.033175 · Cited by 9
Quantum algorithm for unstructured search of ranked targets
Tani, K., Tsuchiya, S., Tani, S., & Takeuchi, Y. (2025) · Physica Scripta · doi:10.1088/1402-4896/ade377 · Cited by 5
“Grover’s algorithm finds a marked item from an unstructured database quadratically faster than any classical algorithm [9, 15] and is optimal in the sense that the dependence of its query complexity on the database size and the number of marked items cannot be improved any further [16–18].”
Fixed-point quantum continuous search algorithm with optimal query complexity
Jin, S., Huang, Y., Wu, S., Zhou, G., Zou, C., Sun, L., & Wang, X. (2025) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-024-2629-1 · Cited by 5
Simon’s Algorithm in the NISQ Cloud
Robertson, R., Doucet, E., Spicer, E., & Deffner, S. (2025) · Entropy · doi:10.3390/e27070658 · Cited by 13
“In other words, it was among the first to show that a quantum Turing machine can violate the Church–Turing thesis [33].”
Quantum search algorithm tailored to clause-satisfaction problems
Tulsi, A. (2015) · Physical Review A · doi:10.1103/physreva.91.052322 · Cited by 4
The Computational Complexity Column
Aaronson, S. (2004) · Cited by 4
On the solution of trivalent decision problems by quantum state identification
Svozil, K., & Tkadlec, J. (2009) · Natural Computing · doi:10.1007/s11047-009-9112-5 · Cited by 4
“One of the advantages of quantum computation (Gruska 1999; Nielsen and Chuang 2000; Mermin 2007; Bennett et al. 1997; Ozhigov 1998; Beals et al. 2001; Cleve 2000; Fortnow 2003) over classical algorithms (Rogers 1967; Odifreddi 1989) is due to the fact that throughout a quantum computation, some classically useful info…”
BackgroundTarrataca, L., & Wichert, A. (2011) · Quantum Information Processing · doi:10.1007/s11128-011-0241-2 · Cited by 4
“Subsequently, it was proved any procedure based on oracles employing total function evaluation will always require at least Ω( √ N ) time [5].”
MethodScalable quantum computation architecture using always-on Ising interactions via quantum feedforward
Satoh, T., Matsuzaki, Y., Kakuyanagi, K., Munro, W. J., Semba, K., Yamaguchi, H., & Saito, S. (2015) · Physical Review A · doi:10.1103/physreva.91.052329 · Cited by 5
Complementary-multiphase quantum search for all numbers of target items
Li, T., Bao, W., Huang, H.-L., Li, F., Fu, X.-Q., Zhang, S., Guo, C., Du, Y.-T., Wang, X., & Lin, J. (2018) · Physical Review A · doi:10.1103/physreva.98.062308 · Cited by 5
Entanglement measures of a pentapartite W-class state in the noninertial frame
Ocampo, D. M., Salgado-Ramírez, J. C., Yáñez-Márquéz, C., & Sun, G.-H. (2022) · Quantum Information Processing · doi:10.1007/s11128-021-03374-9 · Cited by 4
“The detailed understanding of entanglement is very important because of its special application in many branches such as quantum teleportation [1], quantum cryptography [2], quantum computer technology [3] and quantum algorithms [4,5].”
BackgroundA Review on Recent Trends in Quantum Computation Technology
Susindhar, A. V., Soni, G., & Tyagi, A. K. (2023) · Advances in systems analysis, software engineering, and high performance computing book series · doi:10.4018/978-1-6684-6697-1.ch003 · Cited by 4
A Brief Overview of Randomized Algorithms
Kudelić, R., Ivković, N., & Šmaguc, T. (2023) · Lecture notes in networks and systems · doi:10.1007/978-981-99-3761-5_57 · Cited by 5
Noisy Tree Data Structures and Quantum Applications
Khadiev, K. R., Savelyev, N. V., Ziatdinov, M., & Melnikov, D. (2023) · Mathematics · doi:10.3390/math11224707 · Cited by 4
On the (Im)possibility of Time-Lock Puzzles in the Quantum Random Oracle Model
Afshar, A., Chung, K.-M., Hsieh, Y.-C., Lin, Y.-T., & Mahmoody, M. (2023) · Lecture notes in computer science · doi:10.1007/978-981-99-8730-6_11 · Cited by 4
“Therefore, by a standard quantum hybrid technique 9 [BBBV97,AHU19], we have Pr In particular, we use the fact that any quantum algorithm that makes 1 k -parallel query can distinguish whether or not an oracle has been reprogrammed on at most S i.i.d uniform points with advantage O ( (cid:112) kS/ 2…”
BackgroundMethodInfluentialBisection Grover’s Search Algorithm and Its Application in Analyzing CITE-seq Data
Ma, P., Chen, Y., Lu, H., & Zhong, W. (2024) · Journal of the American Statistical Association · doi:10.1080/01621459.2024.2404259 · Cited by 7
Finding resource states of measurement-based quantum computing is harder than quantum computing
Morimae, T. (2017) · Physical Review A · doi:10.1103/physreva.96.052308 · Cited by 4
Quantifiable Simulation of Quantum Computation beyond Stochastic Ensemble Computation
Bang, J., Ryu, J., Lee, C., Yee, K. H., Lee, J., & Son, W. (2018) · Advanced Quantum Technologies · doi:10.1002/qute.201800037 · Cited by 4
Phase transitions in quantum annealing of an NP-hard problem detected by fidelity susceptibility
Takahashi, J., & Hukushima, K. (2019) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/ab0819 · Cited by 6
Lightweight Detection of a Small Number of Large Errors in a Quantum Circuit
Linden, N., & de Wolf, R. (2021) · Quantum · doi:10.22331/q-2021-04-20-436 · Cited by 9
The Promise and Challenges of Quantum Computing
Ritter, M. B. (2020) · International Symposium on VLSI Technology, Systems and Applications (VLSI-TSA) · doi:10.1109/vlsi-tsa48913.2020.9203596 · Cited by 4
“[14] However, there are some algorithms that take polynomial time (a polynomial in the size of the problem) which take exponential time on a conventional computer- such as the quantum Fourier transform (QFT).”
BackgroundGenc, H., Aydın, S., & Erdal, H. (2020) · Innovations in Intelligent Systems and Applications Conference (ASYU) · doi:10.1109/asyu50717.2020.9259850 · Cited by 4
Mereghetti, C., & Palano, B. (2021) · ACM SIGACT News · doi:10.1145/3494656.3494666 · Cited by 4
Schuld, M., & Petruccione, F. (2021) · Quantum science and technology · doi:10.1007/978-3-030-83098-4_3 · Cited by 5
Pentapartite Entanglement Measures of GHZ and W-Class State in the Noninertial Frame
Manríquez-Zepeda, J. L., Rueda-Paz, J., Ávila, M., & Dong, S. (2022) · Entropy · doi:10.3390/e24060754 · Cited by 4
Quantum‐Accelerated Algorithms for Generating Random Primitive Polynomials Over Finite Fields
Huang, S., Yin, H., Chen, Z., & Wu, S. (2023) · Advanced Quantum Technologies · doi:10.1002/qute.202300302 · Cited by 4
Quantum Robots Plus Environments
Benioff, P. A. (2005) · Kluwer Academic Publishers eBooks · doi:10.1007/0-306-47097-7_1 · Cited by 4
Knot Theory, Jones Polynomial and Quantum Computing
Freivalds, R. (2005) · Lecture notes in computer science · doi:10.1007/11549345_2 · 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.