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 901–1,000 of 1,464
Postprocessing for speeding up general quantum search algorithms
Tulsi, A. (2015) · Physical Review A · doi:10.1103/physreva.92.022353 · Cited by 4
Mathematical models of quantum computation
Nishino, T. (2002) · New Generation Computing · doi:10.1007/bf03037370 · Cited by 6
ON THE GAP OF HAMILTONIANS FOR THE ADIABATIC SIMULATION OF QUANTUM CIRCUITS
Ganti, A., & Somma, R. D. (2013) · International Journal of Quantum Information · doi:10.1142/s0219749913500639 · Cited by 6
Lower bounds of a quantum search for an extreme point
Ozhigov, Y. (1999) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.1999.0397 · Cited by 7
The Landauer resistance and band spectra for the counting quantum turing machine
Benioff, P. A. (1998) · Physica D Nonlinear Phenomena · doi:10.1016/s0167-2789(98)00041-4 · Cited by 5
Small Private Key MQPKS on an Embedded Microprocessor
Seo, H., Kim, J., Choi, J., Park, T., Liu, Z., & Kim, H. (2014) · Sensors · doi:10.3390/s140305441 · Cited by 4
“Recently, the vulnerability of a symmetric cryptosystem toward a quantum system has been proven by applying Grover’s algorithm to break a symmetric algorithm by brute force, requiring 2 of time, where n is the security bit [21,22].”
MethodEntanglement, intractability and no-signaling
Srikanth, R. (2010) · Physica Scripta · doi:10.1088/0031-8949/81/06/065002 · Cited by 7
A Variant of Merkle Signature Scheme to Protect AODV Routing Protocol
Mandala, S., Ngadi, M. A., Abdullah, A. H., & Ismail, A. S. (2010) · Communications in computer and information science · doi:10.1007/978-3-642-14171-3_8 · Cited by 4
Average-Case Quantum Query Complexity
Ambainis, A., & de Wolf, R. (2000) · Lecture notes in computer science · doi:10.1007/3-540-46541-3_11 · Cited by 6
“It can compute the OR-function with bounded error using ( √ N) queries (which is optimal [4, 5, 27]).”
The P versus NP Problem in Quantum Physics
Song, D. (2014) · NeuroQuantology · doi:10.14704/nq.2014.12.4.789 · Cited by 4
On Passive Permutation Circuits
Šuch, O., Linn, E., Klimo, M., Jancovic, P., Frátrik, M., & Fröhlich, K. (2015) · IEEE Journal on Emerging and Selected Topics in Circuits and Systems · doi:10.1109/jetcas.2015.2426496 · Cited by 4
“Whereas classical digital designs excel in precise arithmetic as in linear algebra and analysis, quantum computing is expected to have unmatched performance in prime factorization and quantum simulation [3].”
BackgroundQuantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement
Kobayashi, H., & Matsumoto, K. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36136-7_11 · Cited by 4
The Need for Quantum-Resistant Cryptography in Classical Computers
Farik, M., & Ali, S. (2016) · Asia-Pacific World Congress on Computer Science and Engineering (APWC on CSE) · doi:10.1109/apwc-on-cse.2016.027 · Cited by 7
Coloring invariants of knots and links are often intractable
Kuperberg, G., & Samperton, E. (2021) · Algebraic & Geometric Topology · doi:10.2140/agt.2021.21.1479 · Cited by 4
“1, not even with the aid of a quantum computer [4].”
BackgroundGrover’s Algorithm applied to the Molecular Distance Geometry Problem
Lavor, C., Liberti, L., & Maculan, N. (2016) · Congresso Brasileiro de Redes Neurais (CBRN) · doi:10.21528/cbrn2005-234 · Cited by 4
“Both g as well as the map given by (2), denoted by h, can be efficiently computed using classical circuits, so we can also obtain their respective quantum versions [1].”
A quantum decoding algorithm of the simplex code
Barg, A., & Zhou, S. (2004) · Cited by 4
Small, J. (2006) · AIP conference proceedings · doi:10.1063/1.2216626 · Cited by 4
Quantum and Classical Query Complexities of Local Search Are Polynomially Related
Sántha, M., & Szegedy, M. (2008) · Algorithmica · doi:10.1007/s00453-008-9169-z · Cited by 4
“This bound is tight [5, 8, 9, 30], and although much better than the deterministic or randomized complexities, it is still exponential.”
BackgroundQuantum lower bounds for the Goldreich–Levin problem
Adcock, M., Cleve, R., Iwama, K., Putra, R., & Yamashita, S. (2006) · Information Processing Letters · doi:10.1016/j.ipl.2005.01.016 · Cited by 5
“Since there are (1/ε2) candidates for the actual solution—which must be found using EQ queries—the well-known lower bound for searching [2] implies that the number of EQ queries necessary (for constant success probability) is”
InfluentialA Quantum Algorithm for Software Engineering Search
Hall, R. J. (2009) · IEEE/ACM International Conference on Automated Software Engineering (ASE) · doi:10.1109/ase.2009.51 · Cited by 4
“It then computes the two quantum amplitudes by applying the grover iterate t times (body of the Do-loop) to evolve the quantum state in a way similar to how GS does it.”
MethodPost-quantum Cryptography and a (Qu)Bit More
Maimuţ, D., & Simion, E. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-12942-2_3 · Cited by 5
Quantized Alternate Current on Curved Graphene
Flouris, K., Succi, S., & Herrmann, H. J. (2019) · Condensed Matter · doi:10.3390/condmat4020039 · Cited by 6
“Besides their deep fundamental implications, such phenomena may also open up transformative scenarios for material science and related applications in quantum computing and telecommunications, [5, 6].”
BackgroundSpin-Torque-Based Quantum Fourier Transform
Kulkarni, A. A., & Kaushik, B. K. (2019) · IEEE Transactions on Magnetics · doi:10.1109/tmag.2019.2931278 · Cited by 4
“COMPLEX computing problems can be solved efficiently by quantum computing (QC) in comparison with classical computing [1].”
BackgroundSypher, D. R., Brereton, I. M., Wiseman, H. M., Hollis, B. L., & Travaglione, B. C. (2002) · Physical Review A · doi:10.1103/physreva.66.012306 · Cited by 5
Complexity Science for SimpletonsPreprint
Feinstein, C. A. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0507008 · Cited by 4
“A curious fact is that if one were to solve the SUBSETSUM problem on a quantum computer by brute force, the algorithm would have a running-time on the order of 2n=2 steps, which (by coincidence?) is the same asymptotic running-time of the fastest algorithm which solves SUBSET-SUM on a classical computer, the Meet-in-t…”
MethodAdversary Lower Bound for the Orthogonal Array ProblemPreprint
Špalek, R. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1304.0845 · Cited by 5
“[BBBV97, Gro97]) .”
MethodA common algebraic description for probabilistic and quantum computations
Beaudry, M., Fernandez, J. M., & Holzer, M. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2005.07.008 · Cited by 4
“The definitio n of BQP still holds if we restrict the gates to implement unitary operators with entr i s taken in a small set of rationals [1], and to determine acceptance or rejection by the value of a single qubit [6].”
BackgroundComputational problems of quadratic forms : complexity and cryptographic perspectives
Hartung, R. J. (2008) · Publication Server of Goethe University Frankfurt am Main (Goethe University Frankfurt) · Cited by 4
Computational Complexity of Some Quantum Theories in $1+1$ DimensionsPreprint
Mehraban, S. A. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1512.09243 · Cited by 4
Post-quantum Lattice-based Cryptography
Staffas, R. (2016) · KTH Publication Database DiVA (KTH Royal Institute of Technology) · Cited by 4
Bounds on computation from physical principles
Lee, C. M. (2017) · Oxford University Research Archive (ORA) (University of Oxford) · doi:10.5287/ora-r8yp08r54 · Cited by 4
Quantum-Assisted Graph Clustering and Quadratic Unconstrained D-ary OptimisationPreprint
Pramanik, S., & Chandra, M. G. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2004.02608 · Cited by 9
“Before quantum processors become scalable devices capable of error correction and universality [2], the current and nearterm devices, referred to as the Noisy Intermediate-Scale Quantum (NISQ) [3] devices are getting explored for solving certain hard problems to achieve significant speedups over the best known classic…”
BackgroundQuantum Accelerated Estimation of Algorithmic Information.Preprint
Sarkar, A., Al-Ars, Z., & Bertels, K. (2020) · arXiv (Cornell University) · Cited by 4
Криворізький державний педагогічний університет, К., & Державний університет, ". П. (2021) · doi:10.31812/123456789/4366 · Cited by 4
Discrete optimization: Limitations of existing quantum algorithmsPreprint
Creemers, S., & Armas, L. F. P. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4527268 · Cited by 4
A quantum procedure for estimating information gain in Boolean classification task
Koren, M., & Peretz, O. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00151-6 · Cited by 3
“However, the development and maintenance of quantum computers include formidable challenges due to their vulnerability to noise and anomalies (Bennett et al. 1997; De Wolf 2019).”
Investigating the Impact of p-Bit Non-Idealities on Solving Complex Optimization Problems
Kim, J., Choi, H., & Woo, J. (2025) · IEEE Access · doi:10.1109/access.2025.3598102 · Cited by 3
“To overcome these limitations, quantum computing has emerged [6], [7], [8], [9], [10].”
pLazyQML: a parallel package for efficient execution of QML models on classical computers
García-Vega, D., Plou, F., Castaño, A. L., Combarro, E. F., & Ranilla, J. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-025-07714-9 · Cited by 3
Zhandry, M. (2025) · Lecture notes in computer science · doi:10.1007/978-3-032-01878-6_8 · Cited by 21
“Lemma 18 ([BBBV97] Theorem 3.1) .”
InfluentialQUANTUM SEARCH ALGORITHM CAN BE IMPROVED
Grover, L. K. (2004) · International Journal of Quantum Information · doi:10.1142/s0219749905000402 · Cited by 5
A distribution testing oracle separation between QMA and QCMA
Natarajan, A., & Nirkhe, C. (2024) · Quantum · doi:10.22331/q-2024-06-17-1377 · Cited by 16
“In this sense, it emulates the original quantum adversary lower bound of [9] which showed that any BQP -algorithm for solving NP -complete problems must rely on some inherent structure of the NP -complete problem as BQP -algorithms cannot solve unconstrained search efficiently.”
BackgroundA TYPE OF POST–QUANTUM CRYPTOGRAPHIC ALGORITHM
Luu, H. D. (2024) · Journal of Science and Technique · doi:10.56651/lqdtu.jst.v13.n01.818.ict · Cited by 3
Quantum Cryptanalysis of Affine Cipher
Mathews, M. M., Panchami, V., & Ajith, V. (2024) · IEEE Journal on Emerging and Selected Topics in Circuits and Systems · doi:10.1109/jetcas.2024.3428436 · Cited by 4
“The bounds or the best that can be done under the quantum computation model for finding the target element is shown in [13] and [15].”
BackgroundQuantum Algorithm for the Multiple String Matching Problem
Khadiev, K. R., & Serov, D. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-82697-9_5 · Cited by 3
Real-Time Sign Language Translation System Using QCNN for Enhanced Accessibility
Venkatesh, B., Nagajyothi, D., Kumar, P. D., & Teja, K. R. (2025) · International Conference on Inventive Computation Technologies (ICICT) · doi:10.1109/icict64420.2025.11004846 · Cited by 3
“Colour-based segmentation together with geometric features became major limitations for this system because they required consistent lighting and simple backgrounds to function [6].”
QMA vs QCMA and Pseudorandomness
Liu, J., Mutreja, S., & Yuen, H. (2025) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3717823.3718296 · Cited by 9
“chosen random matchings on [ 𝑁 ] .”
Distributed Multi-objective Quantum Search Algorithm
Li, H., & Qiu, D. (2025) · Lecture notes in computer science · doi:10.1007/978-981-96-9894-3_36 · Cited by 4
Quantum Branch-and-Bound Algorithm and its Application to the Travelling Salesman Problem
Markevich, E. A., & Trushechkin, A. S. (2019) · Journal of Mathematical Sciences · doi:10.1007/s10958-019-04415-6 · Cited by 4
Aaronson, S., Ambainis, A., Balodis, K., & Bavarian, M. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-43948-7_3 · Cited by 4
“But searching a list of N elements is well-known to require Ω(N) randomized or Ω( √ N) quantum queries [6].”
BackgroundA geometric approach to quantum state separation
Bagán, E., Yerokhin, V., Shehu, A., Feldman, E., & Bergou, J. A. (2015) · New Journal of Physics · doi:10.1088/1367-2630/17/12/123015 · Cited by 3
Quantum algorithms for simulation of quantum chemistry problems by quantum computers: an appraisal
Sharma, S. (2022) · Foundations of Chemistry · doi:10.1007/s10698-022-09428-9 · Cited by 4
Learning High Dimensional Multi-response Linear Models with Non-oracular Quantum Search
Chen, J., Park, C., & Ke, Y. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00018 · Cited by 3
“√ The complexity of NQS is upper bounded by the order O ( D log 2 D ) which is only a log 2 D factor larger than the theoretical lower bound for oracular quantum search [27].”
BackgroundWang, C., Harraz, S., Zhang, J., & Cong, S. (2023) · Chinese Physics B · doi:10.1088/1674-1056/acbd2a · Cited by 3
Quantum Computing-Enabled Machine Learning for an Enhanced Model Training Approach
Soni, J., Prabakar, N., & Upadhyay, H. (2023) · Studies in computational intelligence · doi:10.1007/978-981-19-9530-9_12 · Cited by 3
岳, 天., 吴, 晨., 刘, 熠., 杜, 正., 赵, 娜., 焦, 毅., 徐, 喆., & 史, 文. (2023) · SCIENTIA SINICA Terrae · doi:10.1360/sste-2022-0319 · Cited by 3
Wang, Y., & Liu, L. (2023) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2023.115504 · Cited by 4
Quantum computing applications
Giardina, C. R. (2024) · Elsevier eBooks · doi:10.1016/b978-0-443-13697-9.00002-3 · Cited by 3
Entanglement spectrum of matchgate circuits with universal and non-universal resources
Projansky, A. M., Heath, J. T., & Whitfield, J. D. (2024) · Quantum · doi:10.22331/q-2024-08-07-1432 · Cited by 5
“(and NP ) are both believed to contain problems that are not in BQP [42, 43].”
BackgroundSpREM: Exploiting Hamming Sparsity for Fast Quantum Readout Error Mitigation
Zhang, H., Lu, L., Tan, S., Zheng, S., Yu, J. Y., & Yin, J. (2024) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/3649329.3655675 · Cited by 4
Lower Bounds for Unitary Property Testing with Proofs and Advice
Weggemans, J. R. (2025) · Quantum · doi:10.22331/q-2025-04-18-1717 · Cited by 8
“However, given a string by an untrusted prover, the query complexity of the search problem is just 1 in both cases.”
Inverting a permutation is as hard as unordered search
Nayak, A. (2011) · Theory of Computing · doi:10.4086/toc.2011.v007a002 · Cited by 3
Adiabatic Quantum Computing on Molecular Spin Quantum Computers
Yamamoto, S., Nakazawa, S., Sugisaki, K., Sato, K., Toyota, K., Shiomi, D., & Takeji, T. (2016) · Biological magnetic resonance · doi:10.1007/978-1-4939-3658-8_4 · Cited by 5
Super-quantum discord in ferromagnetic and antiferromagnetic materials
Fedorova, A. V., Byrnes, T., & Pyrkov, A. N. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2462-8 · Cited by 3
Gaussian Amplitude Amplification for Quantum Pathfinding
Koch, D., Cutugno, M., Karlson, S., Patel, S., Wessing, L., & Alsing, P. M. (2022) · Entropy · doi:10.3390/e24070963 · Cited by 23
“In 1996, Grover demonstrated one of the first mechanisms overcoming this weakness [1], later shown to be optimal [2, 3], and has since been refined into a broader technique in quantum algorithms known as ‘amplitude amplification’ [4–9].”
MethodQuantum Distributed Computing Applied to Grover’s Search Algorithm
Goswami, D. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-13350-8_14 · Cited by 5
Reduction from non-injective hidden shift problem to injective hidden shift problem
Gharibi, M. (2013) · Quantum Information and Computation · doi:10.26421/qic13.3-4-4 · Cited by 7
An Open-Source, Efficient, and Parameterizable Hardware Implementation of the AES Algorithm
Nacci, A. A., Rana, V., Sciuto, D., & Santambrogio, M. D. (2014) · IEEE International Symposium on Parallel and Distributed Processing with Applications (ISPA) · doi:10.1109/ispa.2014.20 · Cited by 3
“In addition to this, as described in Section I and II-B, recent research results and technology advancements [4] [5] [7] [1] are rising serious concerns about the solidity of the AES algorithm in the (quite) near future.”
BackgroundMethodInfluentialOrthogonal Vector Computations
Svozil, K. (2016) · Entropy · doi:10.3390/e18050156 · Cited by 4
An information-theoretic analysis of Grover's algorithm
Arıkan, E. (2003) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2003.1228418 · Cited by 5
“It has been proven that this squareroot speed-up is the best attainable performance gain by any quantum algorithm [ 2 ], [3], [4].”
Progress in Quantum Algorithms
Shor, P. W. (2007) · Springer eBooks · doi:10.1007/0-387-27732-3_2 · Cited by 3
Eisert, J., & Wolf, M. M. (2006) · Kluwer Academic Publishers eBooks · doi:10.1007/0-387-27705-6_8 · Cited by 7
Proposal for founding mistrustful quantum cryptography on coin tossing
Kent, A. (2003) · Physical Review A · doi:10.1103/physreva.68.012312 · Cited by 3
On the Black-Box Complexity of Sperner’s Lemma
Friedl, K., Ivanyos, G., Sántha, M., & Verhoeven, Y. F. (2008) · Theory of Computing Systems · doi:10.1007/s00224-008-9121-2 · Cited by 4
“Observe that for some general instances of the 2 -SPM over the same pseudo 2-manifold we can easily derive exact lower bounds from the known complexity of Grover’s search problem [6].”
BackgroundQuantum Computation: Theory and Implementation
Boyden, E. S. (1999) · Cited by 3
A Common Algebraic Description for Probabilistic and Quantum Computations
Beaudry, M., Fernandez, J. M., & Holzer, M. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-28629-5_67 · Cited by 5
On Basing One-way Permutations on NP-hard Problems under Quantum Reductions
Chia, N.-H., Hallgren, S., & Song, F. (2020) · Quantum · doi:10.22331/q-2020-08-27-312 · Cited by 3
Barnum, H. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0611110 · Cited by 5
“(This result is due, for the quantum case, to [13].”
BackgroundEntanglement, quantum phase transitions and quantum algorithmsPreprint
Orús, R. (2006) · arXiv (Cornell University) · Cited by 3
Bounds on quantum ordered searchingPreprint
Høyer, P., & Neerbek, J. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0009032 · Cited by 6
Quantum search processes in the cyclic group state spacesPreprint
Miao, X. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0507236 · Cited by 5
“Therefore, the quantum search algorithms based on the quantum dynamics have an important difference from the conventional ones [ 2-13 ] that it is not necessary to measure directly the marked state to output the complete information of the marked state in algorithm.”
BackgroundMethodInfluentialAdversary lower bounds in the Hamiltonian oracle modelPreprint
Yonge-Mallo, D. L. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1108.2479 · Cited by 3
Structured Adiabatic Quantum SearchPreprint
Ahrensmeier, D., Das, S., Kobes, R., Kunstatter, G., & Zaraket, H. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0208065 · Cited by 3
“N= 2n corresponds to the size of the complete Hilbert space for the system. Classically a random search of Nobjects requires on average Noperations to pick out the marked object. It was shown by BBBV [7] that for SQC, the lower bound on the corresponding number of steps is of order √ N. Grover was the first to construc…”
Stochastic Simulation of Grover's AlgorithmPreprint
MANSSUR, L. R. U., & Portugal, R. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0301077 · Cited by 3
“Grover’s algorithm is optimal using oracle searching [8, 9], therefore the quadratic speed up is the best one can achieve in this case.”
MethodQuantum Algorithms, Lower Bounds, and Time-Space Tradeoffs
Špalek, R. (2006) · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · Cited by 3
Kim, J.-S., Lee, S., & Chi, D. P. (2002) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/35/32/310 · Cited by 3
Quantum Neural Network Application for Weather Forecasting
Singh, G., & Singh, V. (2009) · Cited by 4
Quantum walks and ground state problems
Richter, P. C. (2007) · Rutgers University Community Repository (Rutgers University) · doi:10.7282/t3w37wq1 · Cited by 4
“[25], which is typically beaten handily by the standard classical mixing procedure.”
MethodQuantum Encryption Algorithm Based on Modified BB84 and Authentication DH Algorithm
Khalaf, R. Z. (2015) · Eastern Mediterranean University Institutional Repository (Eastern Mediterranean University) · Cited by 4
SurvSec Security Architecture for Reliable Surveillance WSN Recovery from Base Station Failure
Megahed, M. H. M. (2014) · uO Research (University of Ottawa) · doi:10.20381/ruor-3718 · Cited by 4
Kayawood, a Key Agreement Protocol.Preprint
Anshel, I. L., Atkins, D., Goldfeld, D. M., & Gunnells, P. E. (2017) · IACR Cryptology ePrint Archive · Cited by 3
A note on the quantum query complexity of permutation symmetric functionsPreprint
Chailloux, A. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.01790 · Cited by 7
Quantum Algorithms for Evaluating MIN-MAX TreesPreprint
Cleve, R., Gavinsky, D., & Yonge-Mallo, D. L. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0710.5794 · Cited by 4
“What is noteworthy about this simple approach is that it does not work efficiently in the classical case: given an interval [xj , xk], finding an interior point is as hard as searching, which can cost Ω(N) queries to do even once [4].”
BackgroundOn the Quantum Complexity of Closest Pair and Related ProblemsPreprint
Aaronson, S., Chia, N.-H., Lin, H.-H., Wang, C., & Zhang, R. (2019) · arXiv (Cornell University) · doi:10.4230/lipics.tqc.2020.9 · Cited by 11
Notes on Randomized AlgorithmsPreprint
Aspnes, J. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.01902 · Cited by 3
New Approaches for Quantum Copy-ProtectionPreprint
Aaronson, S., Liu, J., Liu, Q., Zhandry, M., & Zhang, R. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2004.09674 · Cited by 10
Quadratic speedup of global search using a biased crossover of two good solutionsPreprint
Isomura, T. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.07680 · Cited by 3
“Finally, it is noteworthy that the quadratic speedup presented here has the same efficacy level as the Grover algorithm for quantum computers [54,55].”
BackgroundSoK: Challenges of Post-Quantum Digital Signing in Real-world ApplicationsPreprint
Tan, T. G., Szałachowski, P., & Zhou, J. (2019) · IACR Cryptology ePrint Archive · Cited by 3
Post‐Quantum Cryptography Methods
Kundalakesi, M., & Devi, M. R. (2025) · Wiley eBooks · doi:10.1002/9781394242399.ch2 · Cited by 4
Hasija, T., Ramkumar, K. R., Singh, B., Kaur, A., & Mittal, S. K. (2025) · Recent Advances in Computer Science and Communications · doi:10.2174/0126662558331360240924004351 · Cited by 2
End-to-end quantum algorithm for topology optimization in structural mechanics
Hölscher, L., Ahrend, O., Karch, L., L'Estocq, C., Marfany, M. A., Stollenwerk, T., Wilhelm, F. K., & Kowalski, J. (2026) · Quantum Science and Technology · doi:10.1088/2058-9565/ae4cfe · Cited by 6
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.