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 401–500 of 1,466
Benchmarking Adiabatic Quantum Optimization for Complex Network Analysis
Sandia National Laboratories (SNL), A., Parekh, O., Administration, U. A. S. F. H. R. A., Wendt, J., Shulenburger, L., Landahl, A. J., Moussa, J. E., & Aidun, J. B. (2015) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/1459086 · Cited by 33
Variational Quantum Circuit Model for Knowledge Graph Embedding
Ma, Y., Tresp, V., Zhao, L., & Wang, Y. (2019) · Advanced Quantum Technologies · doi:10.1002/qute.201800078 · Cited by 38
“uadratic speedup. More specically, Grover’s algorithm can identify the input to an unknown function in O( p N) steps from a N-item database. At the same time as Grover’s publication, it is proved in [27] that Grover’s algorithm is an almost optimal solution. Dierent from this quantum algorithm for the database search,…”
MethodQuantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems
Gall, F. L., & Seddighin, S. (2022) · Algorithmica · doi:10.1007/s00453-022-01066-z · Cited by 52
“, [16]).”
BackgroundThreshold-Based Quantum Optimization
Golden, J. K., Bärtschi, A., O’Malley, D., & Eidenbenz, S. (2021) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce52317.2021.00030 · Cited by 52
“Polynomial factor speed-ups over the best known classical alternatives are an active area of quantum algorithms research that – often as a side effect – expose new facets of the boundary between NP and BQP .”
BackgroundAn investigation of IBM quantum computing device performance on combinatorial optimisation problems
Khumalo, M. T., Chieza, H. A., Prag, K., & Woolway, M. (2022) · Neural Computing and Applications · doi:10.1007/s00521-022-07438-4 · Cited by 48
Challenges of post-quantum digital signing in real-world applications: a survey
Tan, T. G., Szałachowski, P., & Zhou, J. (2022) · International Journal of Information Security · doi:10.1007/s10207-022-00587-6 · Cited by 36
“For example, hash-based cryptography is quantum-resistant [12,40], but the limited number of signatures per private key using hash-based signatures [6] and the relatively large overheads in signing make it only suitable in some implementations (such as code signing) that require a long lifetime, are difficult to trans…”
BackgroundMethodUniversal Parity Quantum Computing
Fellner, M., Messinger, A., Ender, K., & Lechner, W. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.180503 · Cited by 42
Verifiable Quantum Advantage without Structure
Yamakawa, T., & Zhandry, M. (2024) · Journal of the ACM · doi:10.1145/3658665 · Cited by 106
Quantum and Approximate Privacy
Klauck, H. (2003) · Theory of Computing Systems · doi:10.1007/s00224-003-1113-7 · Cited by 29
“1 Actually it is quite possible that quantum one-way permutations exist, see, e.g., [ 6 ].”
BackgroundOzols, M., Roetteler, M., & Roland, J. (2012) · Conference on Innovations in Theoretical Computer Science · doi:10.1145/2090236.2090261 · Cited by 43
“By the hybrid argument [8, 48], we get the following upper bound:(2) ∥∥|ψT (x, u)〉 − |ψT (x′, u′)〉 ∥∥ 2 ≤ T · ‖Ox,u −Ox′,u′‖∞ , (6)”
Open Problems Related to Quantum Query Complexity
Aaronson, S. (2021) · ACM Transactions on Quantum Computing · doi:10.1145/3488559 · Cited by 69
A Stochastic Limit Approach to the SAT Problem
Accardi, L., & Ohya, M. (2004) · Open Systems & Information Dynamics · doi:10.1023/b:opsy.0000047567.88377.74 · Cited by 27
“It is argued in [13] that quantum computer can speed up NP problems quadratically but not exponentially.”
BackgroundQuantum time-space tradeoffs for sorting
Klauck, H. (2003) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/780542.780553 · Cited by 29
“Since the error of the algorithm is small enough this leads to an algorithm with overall error bounded by O(1/n), compare [4, 1] for details on how to run subroutines on a quantum computer.”
MethodFast Quantum Algorithm for Solving Multivariate Quadratic EquationsPreprint
Faugère, J., Horan, K., Kahrobaei, D., Kaplan, M. A., Kashefi, E., & Perret, L. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1712.07211 · Cited by 38
“In [4], the authors provide a theoretical upper limit on the speed-up that can be obtained in the quantum setting.”
BackgroundThe Physics of Quantum Information
Sevrin, A. (2023) · doi:10.1142/13369 · Cited by 29
Learning Shallow Quantum Circuits
Huang, H.-Y., Liu, Y., Broughton, M., Kim, I. H., Anshu, A., Landau, Z. A., & McClean, J. R. (2024) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3618260.3649722 · Cited by 101
Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search
Laarhoven, T., Mosca, M., & van de Pol, J. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38616-9_6 · Cited by 39
“This is optimal up to a constant factor, as any quantum algorithm needs at least Ω( √ N) evaluations of f [6].”
BackgroundGeneral framework for quantum search algorithms
Tulsi, A. (2012) · Physical Review A · doi:10.1103/physreva.86.042331 · Cited by 27
Guest Column: Adiabatic Quantum Computing Challenges
Calude, C. S., Calude, E., & Dinneen, M. J. (2015) · ACM SIGACT News · doi:10.1145/2744447.2744459 · Cited by 30
“Two years later Grover [31] discovered a quantum algorithm for searching an unsorted N -entry database in O( √ N) time and O(logN) space: this algorithm is optimal within the quantum computing model for black box oracles [7].”
BackgroundMethodOptimal Merging in Quantum $$k$$-xor and k-sum Algorithms
Naya‐Plasencia, M., & Schrottenloher, A. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-45724-2_11 · Cited by 39
Aaronson, S., Beigi, S., Drucker, A., Fefferman, B., & Shor, P. W. (2008) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.2008.5 · Cited by 43
Efficient algorithms in quantum query complexity
Kothari, R. (2014) · UWSpace (University of Waterloo) · Cited by 93
Limits on Efficient Computation in the Physical WorldPreprint
Aaronson, S. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0412143 · Cited by 38
“A fundamental result of Bennett, Bernstein, Brassard, and Vazirani [51] says that no brute-force quantum algorithm exists to solve NP-complete problems in polynomial time.”
InfluentialFixed-point adiabatic quantum search
Dalzell, A. M., Yoder, T. J., & Chuang, I. L. (2017) · Physical Review A · doi:10.1103/physreva.95.012311 · Cited by 28
“The O( √ N/M) scaling of Grover’s algorithm has been shown to be optimal [12], but this speedup is not restricted to the gate model; a similar speedup is found in continuous models.”
MethodTowards Optimal Separations between Quantum and Randomized Query Complexities
Tal, A. (2020) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs46700.2020.00030 · Cited by 44
Towards quantum computing based community detection
Akbar, S., & Saritha, S. K. (2020) · Computer Science Review · doi:10.1016/j.cosrev.2020.100313 · Cited by 27
Automatic generation of Grover quantum oracles for arbitrary data structures
Seidel, R., Becker, C. K., Bock, S., Tcholtchev, N., Gheorghe-Pop, I.-D., & Hauswirth, M. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/acaf9d · Cited by 39
“It is important to remark that in literature [15] there is a derived optimal number of Grover iterations (i.”
BackgroundHighlighting the Mechanism of the Quantum Speedup by Time-Symmetric and Relational Quantum Mechanics
Castagnoli, G. (2015) · Foundations of Physics · doi:10.1007/s10701-015-9968-4 · Cited by 26
“Reference [16], posterior of 16 years, shows that Grover/Long algorithm is exactly optimal. evaluating the function fb (a), which is one if a = b and zero otherwise—tells Alice whether the ball is in drawer a. Bob selects one of the functions fb (a) (ie a value of b) and gives Alice the black box that computes it.”
BackgroundAn overview of quantum computation models: quantum automata
Qiu, D., & Li, L. (2008) · Frontiers of Computer Science in China · doi:10.1007/s11704-008-0022-y · Cited by 26
On the role of dealing with quantum coherence in amplitude amplification
Rastegin, A. E. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-1946-2 · Cited by 27
“It was soon recognized that Grover’s algorithm is optimal for searching by queries to oracle [9, 10].”
BackgroundThe quantum query complexity of AC0
Beame, P. W., & Machmouchi, W. (2012) · Quantum Information and Computation · doi:10.26421/qic12.7-8-11 · Cited by 26
Characterization of non-deterministic quantum query and quantum communication complexity
de Wolf, R. (2002) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.2000.856758 · Cited by 30
“and fix the certificate for the all-0 input, we obtain a T-query algorithm that always outputs 1 on the all-0 input and that outputs 0 on all inputs of Hamming weight 1. The quantum search lower bounds [9, 6] immediately imply T = Ω( √ n). This shows that our definition of NQ(f) is strictly more powerful than the certific…”
MethodZalivako, I. V., Nikolaeva, A. S., Borisenko, A. S., Korolkov, A. E., Sidorov, P., Galstyan, K. P., Semenin, N. V., Smirnov, V. N., Aksenov, M. A., Makushin, K. M., et al. (2025) · Quantum Reports · doi:10.3390/quantum7020019 · Cited by 40
“Grover’s algorithm [122, 123] considers a black box function f ( x ) : { 0 , 1 } → { 0 , 1 } , which yields 0 for all bit strings except one ( s ), for which the output is 1 ( f ( s ) = 1).”
A Review of Quantum Computer Energy Efficiency
ElSayed, Z., Maida, A. S., & Bayoumi, M. (2019) · IEEE Green Technologies Conference (GreenTech) · doi:10.1109/greentech.2019.8767125 · Cited by 25
“Where |0〉 represents the 0 state and |1〉 represents the 1 state in quantum computing [21], [22], [28].”
BackgroundChang, W.-L., Chen, J.-C., Chung, W., Hsiao, C.-Y., Wong, R., & Vasilakos, A. V. (2021) · IEEE Transactions on NanoBioscience · doi:10.1109/tnb.2021.3075733 · Cited by 26
How significant are the known collision and element distinctness quantum algorithms?
Grover, L. K., & Rudolph, T. (2004) · Quantum Information and Computation · doi:10.26421/qic4.3-5 · Cited by 39
A universal quantum circuit scheme for finding complex eigenvalues
Daskin, A., Grama, A. Y., & Kais, S. (2013) · Quantum Information Processing · doi:10.1007/s11128-013-0654-1 · Cited by 28
Generalized Grover’s Algorithm for Multiple Phase Inversion States
Byrnes, T., Forster, G., & Tessler, L. (2018) · Physical Review Letters · doi:10.1103/physrevlett.120.060501 · Cited by 32
Approximating fractional time quantum evolution
Sheridan, L., Maslov, D. A., & Mosca, M. (2009) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/42/18/185302 · Cited by 38
Yamakami, T. (1999) · Lecture notes in computer science · doi:10.1007/3-540-46691-6_33 · Cited by 24
The Quantum Fourier Transform and Extensions of the Abelian Hidden Subgroup ProblemPreprint
Hales, L. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0212002 · Cited by 31
“We need the following definition and theorem from [5].”
InfluentialA Study of Parallel Self-Organizing MapPreprint
Weigang, L. (1998) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9808025 · Cited by 28
Nearly optimal separations between communication (or query) complexity and partitionsPreprint
Kothari, R. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1512.01210 · Cited by 24
Finding Structural Anomalies in Star Graphs Using Quantum Walks
Cottrell, S. S., & Hillery, M. S. (2014) · Physical Review Letters · doi:10.1103/physrevlett.112.030501 · Cited by 24
A survey of quantum computing hybrid applications with brain-computer interface
Huang, D., Wang, M., Wang, J., & Yan, J. (2022) · Cognitive Robotics · doi:10.1016/j.cogr.2022.07.002 · Cited by 32
Entanglement in the Grover search algorithm
Fang, Y., Kaszlikowski, D., Chin, C., Tay, K., Kwek, L. C., & Oh, C. H. (2005) · Physics Letters A · doi:10.1016/j.physleta.2005.07.017 · Cited by 25
Quantum computing and the chaotic amplifier
Ohya, M., & Volovich, I. V. (2003) · Journal of Optics B Quantum and Semiclassical Optics · doi:10.1088/1464-4266/5/6/015 · Cited by 23
Effects of dissipation on an adiabatic quantum search algorithm
de Vega, I., Bañuls, M. C., & Pérez, A. (2010) · New Journal of Physics · doi:10.1088/1367-2630/12/12/123010 · Cited by 30
“The cost of the quantum search for a given success probability is known to be lower bounded by √ N [17, 18].”
BackgroundKilin, S. Y. (2001) · Progress in optics · doi:10.1016/s0079-6638(01)80015-9 · Cited by 24
GENERALIZED QUANTUM TURING MACHINE AND ITS APPLICATION TO THE SAT CHAOS ALGORITHM
Iriyama, S., Ohya, M., & Volovich, I. V. (2006) · doi:10.1142/9789812774491_0017 · Cited by 23
“It is argued in [ 13 ] that quantum computer can speed up NP problems quadratically but not exponentially.”
BackgroundProduct formulas for exponentials of commutators
Childs, A. M., & Wiebe, N. (2013) · Journal of Mathematical Physics · doi:10.1063/1.4811386 · Cited by 32
“Here we show that such schemes are nearly optimal by demonstrating that a simulation using a sublinear number of exponentials would violate the lower bound for quantum search [21].”
BackgroundBeullens, W., Faugère, J., Koussa, E., Macario-Rat, G., Patarin, J., & Perret, L. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-35423-7_1 · Cited by 22
Thinking Too Classically: Research Topics in Human-Quantum Computer Interaction
Ashktorab, Z., Weisz, J. D., & Ashoori, M. (2019) · CHI Conference on Human Factors in Computing Systems · doi:10.1145/3290605.3300486 · Cited by 26
“Quantum computing has potential to tackle complex problems, such as those with exponential solution spaces, more efficiently than classical computers because it is theorized that the parallelism of quantum mechanics can solve NP-complete problems [5, 12].”
BackgroundNearly Optimal Separations Between Communication (or Query) Complexity and Partitions
Ambainis, A., Kokainis, M., & Kothari, R. (2016) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.ccc.2016.4 · Cited by 22
Optimal time schedule for adiabatic evolution
Avron, J. E., Fraas, M., Graf, G. M., & Grech, P. (2010) · Physical Review A · doi:10.1103/physreva.82.040304 · Cited by 23
Brassard, G., & Salvail, L. (2008) · International Conference on Quantum, Nano and Micro Technologies (ICQNM) · doi:10.1109/icqnm.2008.16 · Cited by 22
“There is no obvious proof that there cannot be a more efficient quantum cryptanalytic strategy because lower bounds such as those of [2] do not apply directly against this more complicated scenario, but we do not really care: In any case, Quantum Merkle Puzzles are no better than the quantum version of Merkle’s much s…”
BackgroundSelf-citationOracles and Query Lower Bounds in Generalised Probabilistic Theories
Barnum, H., Lee, C. M., & Selby, J. H. (2018) · Foundations of Physics · doi:10.1007/s10701-018-0198-4 · Cited by 31
Robust quantum control for adiabatic quantum computation
Quiroz, G. (2019) · Physical Review A · doi:10.1103/physreva.99.062306 · Cited by 26
Application of Pontryagin's minimum principle to Grover's quantum search problem
Lin, C., Wang, Y., Kolesov, G., & Kalabic, U. V. (2019) · Physical Review A · doi:10.1103/physreva.100.022327 · Cited by 26
“[8] C.”
BackgroundImpossibility of succinct quantum proofs for collision-freeness
Aaronson, S. (2012) · Quantum Information and Computation · doi:10.26421/qic12.1-2-3 · Cited by 30
Span-Program-Based Quantum Algorithm for Evaluating Unbalanced Formulas
Reichardt, B. W. (2014) · Lecture notes in computer science · doi:10.1007/978-3-642-54429-3_6 · Cited by 27
Classical versus quantum communication complexity
Ta‐Shma, A. (1999) · ACM SIGACT News · doi:10.1145/333623.333628 · Cited by 28
Spatial search using the discrete time quantum walk
Lovett, N. B., Everitt, M., Trevers, M., Mosby, D., Stockton, D., & Kendon, V. M. (2011) · Natural Computing · doi:10.1007/s11047-011-9279-4 · Cited by 25
Fenner, S., Fortnow, L., Kurtz, S. A., & Li, L. (2003) · Information and Computation · doi:10.1016/s0890-5401(03)00018-x · Cited by 24
Hybrid quantum-classical computing with applications to computer graphics
Lanzagorta, M. O., & Uhlmann, J. K. (2005) · ACM SIGGRAPH Conference (SIGGRAPH) · doi:10.1145/1198555.1198723 · Cited by 29
Certainty and Uncertainty in Quantum Information ProcessingPreprint
Rieffel, E. G. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0702121 · Cited by 22
“prove on the O( √ N) that Grover’s algorithm achieves for unstructured search (Bennett et al. 1997), and for many other problems it has been proven that quantum computation cannot provide any speed-up (Beals et al.”
BackgroundA Complete Characterization of Unitary Quantum Space
Fefferman, B., & Lin, C. Y.-Y. (2016) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.itcs.2018.4 · Cited by 41
Quantum lower bound for inverting a permutation with advice
Nayebi, A., Aaronson, S., Belovs, A., & Trevisan, L. (2015) · Quantum Information and Computation · doi:10.26421/qic15.11-12-1 · Cited by 26
“[3] in 1997 to prove a tight quantum lower bound on search of T = Ω( √ N) and a (suboptimal) quantum lower bound of T = Ω( 3 √ N) for inverting a random permutation on all inputs (with no advice).”
BackgroundImproving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision
Jeffery, S., Kothari, R., & Magniez, F. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-31594-7_44 · Cited by 25
Nested Quantum Search and NP-Hard Problems
Cerf, N. J., Grover, L. K., & Williams, C. P. (2000) · Applicable Algebra in Engineering Communication and Computing · doi:10.1007/s002000050134 · Cited by 24
“, the number of bits needed to represent that integer), while remarkable, does not lead to a polynomial-time quantum algorithm for NP-hard problems, the existence of which being considered as highly improbable [1].”
BackgroundA Globalized Newton Method for the Accurate Solution of a Dipole Quantum Control Problem
von Winckel, G., Borzı̀, A., & Volkwein, S. (2009) · SIAM Journal on Scientific Computing · doi:10.1137/09074961x · Cited by 21
“The control of quantum electronic states in physical systems has a host of applications such as quantum computers [6], control of photochemical processes [39], and semiconductor lasers [19, 33].”
BackgroundPanitz, S., Cortese, G., Neil, H. L., & Diekmann, B. (2014) · Marine Micropaleontology · doi:10.1016/j.marmicro.2014.12.003 · Cited by 21
Entanglement and deterministic quantum computing with one qubit
Boyer, M., Brodutch, A., & Mor, T. (2017) · Physical Review A · doi:10.1103/physreva.95.022330 · Cited by 22
Coherence Depletion in Quantum Algorithms
Liu, Y.-C., Shang, J., & Zhang, X. (2019) · Entropy · doi:10.3390/e21030260 · Cited by 24
“For this problem, Grover’s algorithm runs only quadratically faster compared to any classical algorithms, but it has been proven to be asymptotically optimal [6].”
MethodQuantum Simulation Logic, Oracles, and the Quantum Advantage
Johansson, N., & Larsson, J.-Å. (2019) · Entropy · doi:10.3390/e21080800 · Cited by 28
“[25].”
BackgroundMethodInfluentialBasic Properties of Quantum Automata
Gudder, S. (2000) · Foundations of Physics · doi:10.1023/a:1003649201735 · Cited by 22
The quadratic speedup in Grover's search algorithm from the entanglement perspective
Rungta, P. (2009) · Physics Letters A · doi:10.1016/j.physleta.2009.05.064 · Cited by 21
Spin-system dynamics and fault detection in threshold networks
Kirkland, S., & Simone Severini, B. (2011) · Physical Review A · doi:10.1103/physreva.83.012310 · Cited by 22
Lower bound for quantum phase estimation
Bessen, A. J. (2005) · Physical Review A · doi:10.1103/physreva.71.042313 · Cited by 28
On the Black-Box Complexity of Sperner’s Lemma
Friedl, K., Ivanyos, G., Sántha, M., & Verhoeven, Y. F. (2005) · Lecture notes in computer science · doi:10.1007/11537311_22 · Cited by 21
Quantum and classical query complexities of local search are polynomially related
Sántha, M., & Szegedy, M. (2004) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1007352.1007427 · Cited by 29
The lambda-q calculus can efficiently simulate quantum computersPreprint
Maymin, P. Z. (1997) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9702057 · Cited by 21
“[3]) that QTM cannot efficiently solve satisfiability.”
Bibliographic guide to the foundations of quantum mechanics and quantum informationPreprint
Cabello, A. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0012089 · Cited by 33
Post-quantum Cryptography in 6G
Partala, J. (2021) · Computer communications and networks · doi:10.1007/978-3-030-72777-2_20 · Cited by 31
Quantum Computing: Exploring Superposition and Entanglement for Cutting-Edge Applications
Parmar, S. J., Parmar, V. R., Verma, J. P. V., Roy, S., & Bhattacharya, P. (2023) · International Conference on Security of Information and Networks (SIN) · doi:10.1109/sin60469.2023.10474803 · Cited by 25
“Algorithms such as the Deautsch-Jozsa [1], Bernstein-Vazirani [2], Grover’s [3], Simon’s [4], and Shor’s [5], [6] not only illustrate this quantum superiority but also unveil a computational landscape hitherto unexplored.”
A quantum lower bound for distinguishing random functions from random permutations
Yuen, H. (2014) · Quantum Information and Computation · doi:10.26421/qic14.13-14-2 · Cited by 28
“C C ] 2 0 D ec”
Quest for Fast Partial Search Algorithm
Korepin, V. E., & Liao, J. (2006) · Quantum Information Processing · doi:10.1007/s11128-006-0024-3 · Cited by 24
Quantum algorithms: A survey of some recent results
Rötteler, M. (2006) · Informatik - Forschung und Entwicklung · doi:10.1007/s00450-006-0008-7 · Cited by 24
“An adversary argument was first used in [15, 17] in order to prove a lower bound for the search problem.”
BackgroundMethodQuantum Query Algorithms Are Completely Bounded Forms
Arunachalam, S., Briët, J., & Palazuelos, C. (2019) · SIAM Journal on Computing · doi:10.1137/18m117563x · Cited by 50
“ting the immediate question of how well that approximates Q#(f). The subsequent work showed, among other things, that 1The first quantum lower bound for the search problem was proven by Bennett et al. [BBBV97] using the so-called hybrid method. Beals et al. [BBC+01] reproved their result using the polynomial method. 2…”
MethodGrover search under localized dephasing
Reitzner, D., & Hillery, M. S. (2019) · Physical Review A · doi:10.1103/physreva.99.012339 · Cited by 22
“[2] C.”
BackgroundQuantum Attacks and Defenses for Proof-of-Stake
Khalifa, A. M., Bahaa-Eldin, A. M., & Sobh, M. (2019) · International Conference on Computer Engineering & Systems (ICCES) · doi:10.1109/icces48960.2019.9068181 · Cited by 24
“As N = 2 n in our case, it is proved [20] that the complexity class NP cannot be solved in o (2 n/ 3 ) time, or at least Ω(2 n/ 2 ) evaluations are required on a QTM.”
BackgroundQuantum computation speedup limits from quantum metrological precision bounds
Demkowicz-Dobrzański, R., & Markiewicz, M. (2015) · Physical Review A · doi:10.1103/physreva.91.062322 · Cited by 22
Faster quantum algorithm for evaluating game trees
Reichardt, B. W. (2011) · Symposium on Discrete Algorithms · doi:10.5555/2133036.2133079 · Cited by 20
Gudder, S. (1999) · International Journal of Theoretical Physics · doi:10.1023/a:1026663432352 · Cited by 20
“Most of the previous research in this field has involved quantum Turing machines [6, 17, 19, 23], quantum logic gates [2, 10, 12, 13], quantum complexity theory [1, 5 , 6, 21, 22], and quantum algorithms [9, 11, 20, 21].”
MethodQuantum Database Search by a Single Query
Chi, D. P., & Kim, J.-S. (1999) · Lecture notes in computer science · doi:10.1007/3-540-49208-9_11 · Cited by 20
“up to a multiplicative constant [4, 2, 1 ]. Especially when t = N/4 is known, the original Grover algorithm in [4] can search a solution only by a single query [2].”
BackgroundThe Complexity of the Consistency and N-representability Problems for Quantum StatesPreprint
Liu, Y.-K. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0712.3041 · Cited by 30
“) We do know that, relative to a random oracle, with probability 1, BQP does not contain NP [15].”
BackgroundMaking Existential-Unforgeable Signatures Strongly Unforgeable in the Quantum Random-Oracle ModelPreprint
Eaton, E., & Song, F. (2015) · arXiv (Cornell University) · doi:10.4230/lipics.tqc.2015.147 · Cited by 20
Strongly symmetric spectral convex bodies are Jordan algebra state spacesPreprint
Barnum, H., & Hilgert, J. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.03753 · Cited by 36
“earch problem, the number of queries must√ be at least (3/2− 2) p N/h, where h is the maximal “order of interference” of the GPT theory. A lower bound of Ω( √ N)was established in the quantum case in [9]; it is achieved by Grover’s algorithm. The bound in [6] is also Ω( √ N). This limits the potential gainfrom higher-…”
BackgroundManenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.005.0002 · Cited by 20
A quantum algorithm that deletes marked states from an arbitrary database
Liu, Y., & Ouyang, X. (2013) · Chinese Science Bulletin · doi:10.1007/s11434-013-5885-0 · Cited by 19
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.