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 701–800 of 1,465
Quantum simulation from the bottom up: the case of rebits
Koh, D. E., Niu, M. Y., & Yoder, T. J. (2018) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/aab9c4 · Cited by 10
“Although the top-down version of this simulation has been noted many times in the past beginning with Bennett et al [6], the bottom-up viewpoint, while less often considered (with just a brief mention in McKague et al [7] and some special-case use in [8, 9]), reveals exciting new phenomena.”
BackgroundStochastic optimal control formalism for an open quantum system
Lin, C., Sels, D., Ma, Y., & Wang, Y. (2020) · Physical Review A · doi:10.1103/physreva.102.052605 · Cited by 10
Analytical results for the quantum alternating operator ansatz with Grover mixer
Bridi, G. A., & Marquezino, F. D. L. (2024) · Physical Review A · doi:10.1103/physreva.110.052409 · Cited by 17
Using quantum switches to mitigate noise in Grover’s search algorithm
Srivastava, S., Pati, A. K., Chakrabarty, I., & Bhattacharya, S. (2024) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ad9efc · Cited by 8
On the Quantum Query Complexity of Local Search in Two and Three Dimensions
Sun, X., & Yao, A. C.-C. (2008) · Algorithmica · doi:10.1007/s00453-008-9170-6 · Cited by 8
Quantum LLL with an Application to Mersenne Number Cryptosystems
Tiepelt, M., & Szepieniec, A. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-30530-7_1 · Cited by 11
Dejen, A., & Ridwan, M. (2022) · International Journal of Mathematical Sciences and Computing · doi:10.5815/ijmsc.2022.04.05 · Cited by 8
Topological obstructions to quantum computation with unitary oracles
Gavorová, Z., Seidel, M., & Touati, Y. (2024) · Physical Review A · doi:10.1103/physreva.109.032625 · Cited by 34
“Unlike factoring, oracle problems do have some lower bound proof methods: the polynomial [8], hybrid [9] and adversary [10, 11] methods.”
BackgroundQuantum Voting Scheme Based on Conjugate Coding
Okamoto, T., Suzuki, K., & Tokunaga, Y. (2008) · NTT technical review · doi:10.53829/ntr200801sp3 · Cited by 15
Classical Authenticated Key Exchange and Quantum Cryptography
Stebila, D. (2009) · UWSpace (University of Waterloo) · Cited by 11
Searching a database under decoherence
Chen, J., Kaszlikowski, D., Kwek, L. C., & Oh, C. H. (2003) · Physics Letters A · doi:10.1016/s0375-9601(02)01637-7 · Cited by 9
Quantum approaches to graph colouring
D’Hondt, E. (2008) · Theoretical Computer Science · doi:10.1016/j.tcs.2008.09.055 · Cited by 8
“The fact that NP * BQP holds relative to an oracle [3] is certainly the strongest indication, though it is by no means conclusive.”
BackgroundImproving the efficiency of Generalized Birthday Attacks against certain structured cryptosystems
Niebuhr, R., Cayrel, P.-L., & Buchmann, J. A. (2011) · Cited by 8
Cuffaro, M. E. (2018) · Philosophy of engineering and technology · doi:10.1007/978-3-319-93779-3_11 · Cited by 9
“It turns out that this is the best we can do (Bennett et al., 1997).”
BackgroundClassical Lower Bounds from Quantum Upper Bounds
Ben-David, S., Bouland, A., Garg, A., & Kothari, R. (2018) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2018.00040 · Cited by 17
The Power of Quantum Fourier Sampling
Fefferman, B., & Umans, C. (2016) · Conference on Theory of Quantum Computation, Communication and Cryptography · doi:10.7907/6hjb-mc69 · Cited by 8
Limitations of Hartree–Fock with quantum resources
Gulania, S., & Whitfield, J. D. (2021) · The Journal of Chemical Physics · doi:10.1063/5.0018415 · Cited by 10
Castagnoli, G. (2021) · Physical Review A · doi:10.1103/physreva.104.032203 · Cited by 11
Quantum search degeneration under amplitude noise in queries to the oracle
Rastegin, A. E., & Shemet, A. M. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03501-0 · Cited by 8
“The Grover algorithm is optimal for search by means of queries to the oracle [11, 12].”
MethodQuantum and classical complexity classes: Separations, collapses, and closure properties
Spakowski, H., Thakur, M., & Tripathi, R. S. (2005) · Information and Computation · doi:10.1016/j.ic.2004.10.009 · Cited by 8
“[3] show that relative to a random oracle, :6 is not contained in 35476 with probability one, and, relative to a permutation oracle chosen uniformly at random, :<6Å;)u ̧:6 is not contained in 35476 with probability one.”
On quantum one-way permutations
Kashefi, E., Nishimura, H., & Vedral, V. (2002) · Quantum Information and Computation · doi:10.26421/qic2.5-5 · Cited by 9
Quantum information processing: The good, the bad and the ugly
Brassard, G. (1997) · Lecture notes in computer science · doi:10.1007/bfb0052246 · Cited by 9
“Not even all of public-key cryptography is threatened by quantum computing: it has been argued [3] that strong one-way functions that can be computed efficiently with classical computers but cannot be inverted efficiently even with a quantum computer may well exist.”
Self-citationQuantum Computing and Hidden Variables II: The Complexity of Sampling HistoriesPreprint
Aaronson, S. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0408119 · Cited by 10
“[8] implies that, by simply changing the location of the marked item from x to x∗, we can ensure that ‖|ψt (x)〉 − |ψt (x)〉‖ = O ( Q(2)t N )”
BackgroundOn computation with 'probabilities' modulo kPreprint
de Beaudrap, N. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1405.7381 · Cited by 10
The quantum query complexity of certification
Ambainis, A., Childs, A. M., Gall, F. L., & Tani, S. (2010) · Quantum Information and Computation · doi:10.26421/qic10.3-4 · Cited by 8
“12 91 v1 [ qu an tph ] 6 M ar 2 00”
Cryptographic decoding of the Leech latticePreprint
van Poppelen, A. H. (2016) · IACR Cryptology ePrint Archive · Cited by 8
On the complexity of the Permuted Kernel Problem.Preprint
Koussa, E., Macario-Rat, G., & Patarin, J. (2019) · IACR Cryptology ePrint Archive · Cited by 8
The Second Quantum Revolution: Unexplored Facts and Latest News
Intonti, K., Viscardi, L., Lamberti, V., Matteucci, A., Micciola, B., Modestino, M. R., & Noce, C. (2024) · Encyclopedia · doi:10.3390/encyclopedia4020040 · Cited by 11
“Despite achieving quantum advantage in certain contexts, the practical implementations of quantum computers for widespread use are still in the early stages of development, and ongoing research has focused on refining the technology and exploring its full capabilities [9].”
BackgroundGrover Speedup from Many Forms of the Zeno Effect
Berwald, J., Chancellor, N., & Dridi, R. (2024) · Quantum · doi:10.22331/q-2024-11-20-1532 · Cited by 14
Unbounded Leakage-Resilience and Intrusion-Detection in a Quantum World
Çakan, A., Goyal, V., Liu-Zhang, C.-D., & Ribeiro, J. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-78017-2_6 · Cited by 10
Quantum Algorithms with Fixed Points: The Case of Database Search
Grover, L. K., Patel, A. D., & Tulsi, T. (2006) · NOT FOUND REPOSITORY (Indian Institute of Science Bangalore) · doi:10.48550/arxiv.quant-ph/0603132 · Cited by 15
Jin, W., & Chen, X. (2010) · Quantum Information Processing · doi:10.1007/s11128-010-0209-7 · Cited by 7
“[ 2 ,3]. The working of the Grover’s algorithm can be understood geometrically, as explained by Jozsa [4].”
MethodConsequences and Limitations of Conventional Computers and their Solutions through Quantum Computers
Barde, N. P., Thakur, D., Bardapurkar, P. P., Dalvi, S. N., Arts, S. N., & Sarda, B. N. (2011) · Cited by 7
Quintuple: A Tool for Introducing Quantum Computing Into the Classroom
Moran, C. C. (2018) · Frontiers in Physics · doi:10.3389/fphy.2018.00069 · Cited by 9
“Currently, the following syntax for use in class QuantumComputer ’s execute method encompasses all that a user is able to do on the 5-qubit IBM Quantum Experience hardware: available qubit list q [0], q [1], q [2], q [3], q [4] 1-qubit gate list h,t,tdg,s,sdg,x,y,z,id”
BackgroundMethodBlack-Box Separations for Non-interactive Classical Commitments in a Quantum World
Chung, K.-M., Lin, Y.-T., & Mahmoody, M. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-30545-0_6 · Cited by 11
Biswas, S., & Das, P. (2023) · Communications in computer and information science · doi:10.1007/978-3-031-48879-5_7 · Cited by 10
Innovative frontiers: Post-quantum perspectives in healthcare and medical imaging
Herzog, D. J., & Herzog, N. J. (2024) · Imaging and Radiation Research · doi:10.24294/irr.v6i1.3852 · Cited by 7
Quest for a quantum search algorithm for testing stuck-at faults in digital circuits
Venkatasubramanian, M., Agrawal, V. D., & Janaher, J. J. (2015) · Proceedings · doi:10.1109/dft.2015.7315149 · Cited by 7
“, [7] which have been extensively used to design testing algorithms (as highlighted above) can complete a query in only linear time, Grover’s algorithm can search through the database in sub-linear time (O √ N ) and can be deemed the fastest way possible to search theoretically [4].”
MethodSearches on star graphs and equivalent oracle problems
Lee, J., Lee, H.-W., & Hillery, M. S. (2011) · Physical Review A · doi:10.1103/physreva.83.022318 · Cited by 7
Cryptography in a Quantum World
Brassard, G. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-49192-8_1 · Cited by 11
“In the quantum setting, exhaustive search can be replaced by a celebrated algorithm due to Lov Grover, which offers a quadratic speedup [40], but no more [41].”
Self-citationCour, B. R. L., & Ostrove, C. I. (2016) · Quantum Information Processing · doi:10.1007/s11128-016-1464-z · Cited by 8
Quantum commitments from complexity assumptions
Chailloux, A., Kerenidis, I., & Rosgen, B. (2015) · Computational Complexity · doi:10.1007/s00037-015-0116-5 · Cited by 9
“We use the hybrid approach of Bennett et al. (1997). Let ρ0 be the initial state of the algorithm.”
MethodApplication of quantum search algorithms as a web search engine
Sihare, S. R., & Nath, V. V. (2016) · International Conference on Global Trends in Signal Processing, Information Computing and Communication · doi:10.1109/icgtspicc.2016.7955261 · Cited by 8
de Lacy, K., Noakes, L., Twamley, J., & Wang, J. B. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-2031-6 · Cited by 7
Ayukaryana, N. R., Fauzi, M. H., & Hasdeo, E. H. (2021) · AIP conference proceedings · doi:10.1063/5.0059974 · Cited by 8
Computação quântica: uma abordagem para a graduação usando o Qiskit
de Jesus, G. F., da Silva, M. H. F., Netto, T. G. D., Galvão, L. Q., Souza, F. G. D. O., & Cruz, C. (2021) · Revista Brasileira de Ensino de Física · doi:10.1590/1806-9126-rbef-2021-0033 · Cited by 15
Layering Quantum-Resistance into Classical Digital Signature Algorithms
Tan, T. G., & Zhou, J. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-91356-4_2 · Cited by 8
Mosca, M. (2011) · Springer eBooks · doi:10.1007/978-1-4614-1800-9_144 · Cited by 11
On Certified Randomness from Fourier Sampling or Random Circuit Sampling
Bassirian, R., Bouland, A., Fefferman, B., Gunn, S., & Tal, A. (2026) · Quantum · doi:10.22331/q-2026-02-10-2002 · Cited by 24
“The hybrid argument gives us a lower bound on the degree of any Good vertex in this graph.”
An R || C max Quantum Scheduling Algorithm
Lu, F., & Marinescu, D. C. (2006) · Quantum Information Processing · doi:10.1007/s11128-006-0048-8 · Cited by 8
Korepin, V. E., & XU, Y. (2009) · International Journal of Modern Physics B · doi:10.1142/s0217979209054922 · Cited by 8
A quantum no-reflection theorem and the speeding up of Grover's search algorithm
Kumar, K. S., & Paraoanu, G. S. (2011) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/93/20005 · Cited by 14
Hidden Symmetry Subgroup Problems
Decker, T., Ivanyos, G., Sántha, M., & Wocjan, P. (2013) · SIAM Journal on Computing · doi:10.1137/120864416 · Cited by 9
“c as symmetry subgroup. From any generator (b,a) of Hc one recovers c simply by computing (1 −a)−1b. Hence, the query complexity of the HSSPis at least the query complexity Ω(q1/2) of Grover’s search [2]. 3.2 A reduction scheme of the HSSP to the HSP In this section, we describe a rather natural framework for reducing…”
MethodInfluentialAn Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation
Nishimura, H., & Yamakami, T. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-28629-5_65 · Cited by 9
“Query complexity lower bounds on various quantum computational models have been studied for numerous problems, including ordered search [4, 18, 24, 27], unordered search [5, 8, 9, 11], element distinctness [6, 17, 36], and collision [1, 6, 36].”
BackgroundA Quantum Implementation Model for Artificial Neural Networks
Daskin, A. (2018) · Quanta · doi:10.12743/quanta.v7i1.65 · Cited by 8
Complexity bounds on quantum search algorithms in finite-dimensional networks
Boettcher, S., Li, S., Fernandes, T. D., & Portugal, R. (2018) · Physical Review A · doi:10.1103/physreva.98.012320 · Cited by 9
Accelerating subset sum and lattice based public-key cryptosystems with multi-core CPUs and GPUs
Badawi, A. A., Veeravalli, B., Aung, K. M. M., & Hamadicharef, B. (2018) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2018.04.014 · Cited by 9
Sublinear Classical and Quantum Algorithms for General Matrix Games
Li, T., Wang, C., Chakrabarti, S., & Wu, X. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i10.17028 · Cited by 26
VERIFIER-BASED ALGORITHM FOR UNSORTED DATABASE SEARCH PROBLEM
Wu, X., & LONG, G. L. (2007) · International Journal of Quantum Information · doi:10.1142/s0219749907003067 · Cited by 7
On the simulation of quantum turing machines
Carpentieri, M. (2003) · Theoretical Computer Science · doi:10.1016/s0304-3975(03)00054-9 · Cited by 9
A panoply of quantum algorithms
Furrow, B. (2008) · Quantum Information and Computation · doi:10.26421/qic8.8-9-11 · Cited by 11
Introduction to Recent Quantum Algorithms
Høyer, P. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44683-4_7 · Cited by 8
Some Issues in Quantum Information Theory
Duan, R., Ji, Z., Feng, Y., & Ying, M. (2006) · Journal of Computer Science and Technology · doi:10.1007/s11390-006-0776-3 · Cited by 8
The Sturm-Liouville Eigenvalue Problem and NP-Complete Problems in the Quantum Setting with Queries
Papageorgiou, A., & Woźniakowski, H. (2006) · Quantum Information Processing · doi:10.1007/s11128-006-0043-0 · Cited by 8
Qubit complexity of continuous problems
Papageorgiou, A., & Traub, J. F. (2009) · Journal of Fixed Point Theory and Applications · doi:10.1007/s11784-009-0132-7 · Cited by 8
“There are especially constructed problems such as Simon’s problem [15] for which the quantum speedup is known; see also [2].”
BackgroundFault-tolerant quantum computer architectures using hierarchies of quantum error-correcting codes
Chuang, I. L., & Cross, A. W. (2008) · Cited by 8
Speedup of iterated quantum search by parallel performancePreprint
Ozhigov, Y. (1999) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9904039 · Cited by 7
“Similar results for search problems were obtained in [7, 8, 36, 48].”
BackgroundResultBrassard, G., & Fernandez, J. M. (2004) · Cited by 7
Self-citationLow-Sensitivity Functions from Unambiguous Certificates
Ben-David, S., Hatami, P., & Tal, A. (2016) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.itcs.2017.28 · Cited by 30
Quantum Copy-Protection from Hidden Subspaces.Preprint
Aaronson, S., Liu, J., & Zhang, R. (2020) · arXiv (Cornell University) · Cited by 7
Quantum Speedups for Dynamic Programming on n-Dimensional Lattice Graphs
Glos, A., Kokainis, M., Mori, R., & Vihrovs, J. (2021) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.mfcs.2021.50 · Cited by 14
Aaronson, S., Ingram, D., & Kretschmer, W. (2021) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.ccc.2022.20 · Cited by 26
Wittek, P. (2014) · Elsevier eBooks · doi:10.1016/b978-0-12-800953-6.00001-3 · Cited by 7
A parameterized quantum circuit for estimating distribution measures
Peretz, O., & Koren, M. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00158-z · Cited by 10
“Due to the sensitivity of quantum computers to noise and decoherence (Bennett et al. 1997), it can be challenging to build and maintain a superposition of quantum comput‑ ers.”
Sigmoid Probabilistic Bits Using SiOₓ Threshold Switching Devices for Probabilistic Computing
Choi, H., Kim, J., Moon, J., Kang, S., & Woo, J. (2025) · IEEE Transactions on Electron Devices · doi:10.1109/ted.2025.3540029 · Cited by 6
“As an alternative to deterministic computing, quantum computing offers a transformative approach by leveraging quantum bits (qubits), which use spin states to represent data as “0” and “1,” or their superposition [5], [6], [7], [8].”
Speeding up Grover’s algorithm
Creemers, S. (2025) · European Journal of Operational Research · doi:10.1016/j.ejor.2025.02.034 · Cited by 7
Basic Research Perspective on Quantum Information Science for the Aerospace Community
Metcalfe, G. D., Tabakov, B., Nguyen, T., Lu, J., & Sayir, A. (2023) · AIAA Journal · doi:10.2514/1.j062978 · Cited by 6
Quantum One-Wayness of the Single-Round Sponge with Invertible Permutations
Carolan, J., & Poremba, A. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-68391-6_7 · Cited by 17
Quantum-Computable One-Way Functions without One-Way Functions
Kretschmer, W., Qian, L., & Tal, A. (2025) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3717823.3718144 · Cited by 6
“The proof idea is roughly the same as Theorem 26 but we instead perform a careful resampling of 𝐺 and 𝐼 at the same time.”
Coherence fraction in Grover's search algorithm
Zhou, S.-Q., Jin, H., Liang, J., Fei, S.-M., Xiao, Y., & Ma, Z. (2024) · Physical Review A · doi:10.1103/physreva.110.062429 · Cited by 10
Quantum smoothed particle hydrodynamics algorithm inspired by quantum walks
Au-Yeung, R., Kendon, V. M., & Lind, S. (2025) · Physics of Fluids · doi:10.1063/5.0268240 · Cited by 10
A new hybrid classical-quantum algorithm for continuous global optimization problems
Lara, P., Portugal, R., & Lavor, C. (2013) · Journal of Global Optimization · doi:10.1007/s10898-013-0112-8 · Cited by 9
Design of a Fault Tolerant Reversible Compact Unidirectional Barrel Shifter
Shamsujjoha, M., Babu, H. M. H., Jamal, L., & Chowdhury, A. R. (2013) · International Conference on VLSI Design · doi:10.1109/vlsid.2013.171 · Cited by 6
“Over the past few years, reversible circuitry gained remarkable interests in the field of optical computing [4], DNA-technology [5], nanotechnology [6], program debugging and testing [7], quantum dot cellular automata [8], discrete event simulation [9], modeling of biochemical systems and in the…”
BackgroundCompressed 3D Image Information and Communication Security
Yang, C., Ding, Y., Liang, J., Cao, F., Qi, D., Jia, T., Sun, Z., Zhang, S., Chen, W., Yin, Z., et al. (2018) · Advanced Quantum Technologies · doi:10.1002/qute.201800034 · Cited by 6
Quantum matching pursuit: A quantum algorithm for sparse representations
Bellante, A., & Zanero, S. (2022) · Physical Review A · doi:10.1103/physreva.105.022414 · Cited by 11
“While quantum computers are not expected to solve NP-hard problems in polynomial time (indeed, it is widely believed that NP * BQP [15]), they can still provide speed-ups of practical use on greedy algorithms that compute approximate solutions.”
BackgroundOn the Two-sided Permutation Inversion Problem
Alagic, G., Bai, C., Poremba, A., & Shi, K. (2024) · IACR Communications in Cryptology · doi:10.62056/a0qj89n4e · Cited by 13
“If quantum queries are allowed, then Grover’s algorithm can be used to solve both problems with 𝑇 = 𝑂 ( √ 𝑁 ) queries [Gro96, Amb02], which is worst-case asymptotically optimal [BBBV97, Amb02, Nay10].”
MethodQuantum search in a possible three-dimensional complex subspace
Jin, W. (2011) · Quantum Information Processing · doi:10.1007/s11128-011-0230-5 · Cited by 6
Simulated quantum computation of global minima
Zhu, J., Huang, Z., & Kais, S. (2009) · Molecular Physics · doi:10.1080/00268970903117126 · Cited by 8
On the efficiency of Hamiltonian-based quantum computation for low-rank matrices
Cao, Z., & Elgart, A. (2012) · Journal of Mathematical Physics · doi:10.1063/1.3690045 · Cited by 6
“This bound is indeed proven to be optimal for query type of quantum algorithms, see [7].”
BackgroundQuantum algorithm for SAT problem andquantum mutual entropy
Ohya, M. (2005) · Reports on Mathematical Physics · doi:10.1016/s0034-4877(05)80007-2 · Cited by 7
No-go theorem for iterations of unknown quantum gates
Soleimanifar, M., & Karimipour, V. (2016) · Physical Review A · doi:10.1103/physreva.93.012344 · Cited by 6
Tight Quantum Lower Bound for Approximate Counting with Quantum States
Belovs, A., & Rosmanis, A. (2026) · Computational Complexity · doi:10.1007/s00037-025-00282-7 · Cited by 11
“hip oracle suffice to count the number of elements in a set x⊆[n] with multiplicative precision ε[12, 11]. Also, it is known that Ω( p n/|x|) membership queries are necessary for this task when ε= O(1) [9]. However, the membership oracle is not the only way how to encode the input set x. Another possibility is to encode…”
A Quantum Parallel Markov Chain Monte Carlo
Holbrook, A. J. (2023) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.2023.2195890 · Cited by 10
“2 Quantum search and quantum minimization Grover (1996) demonstrates how use a quantum computer to find a single marked element within a finite set of N items with only O ( √ N ) queries, and a result from Bennett et al. (1997) shows that Grover’s algorithm is optimal up to a multiplicative constant.”
BackgroundFirst-order quantum phase transitions as condensations in the space of states
Ostilli, M., & Carlo Presilla, A. (2020) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/aba144 · Cited by 6
Optimal quantum-walk search on Kronecker graphs with dominant or fixed regular initiators
Glos, A., & Wong, T. G. (2018) · Physical Review A · doi:10.1103/physreva.98.062334 · Cited by 6
“If the graph is incomplete, however, it is generally unknown under what conditions a graph supports optimal quantum search [18], i.e., in O ( √ N ) time, although global symmetry [19], connectivity [20], and regularity [21] are some properties that have been explored.”
BackgroundRobust Diabatic Grover Search by Landau–Zener–Stückelberg Oscillations
Atia, Y., Oren, Y., & Katz, N. Y. (2019) · Entropy · doi:10.3390/e21100937 · Cited by 6
“In this work, we introduce a diabatic algorithm for the Grover problem, denoted algorithm A, whose performance matches the optimal adiabatic and circuit model algorithms [5,6,12], by setting s(t) = (1− A cos(ωt))/2 when ω ∆.”
MethodYan, S. Y. (2018) · Springer eBooks · doi:10.1007/978-3-319-72536-9_5 · Cited by 7
Yu, W., & Tie-hong, W. (2020) · Journal of Tourism and Cultural Change · doi:10.1080/14766825.2020.1849239 · Cited by 6
Bun, M., & Thaler, J. (2020) · ACM SIGACT News · doi:10.1145/3444815.3444825 · Cited by 8
“While this did not give the first tight quantum query lower bound proof for OR n —it was first proved by Bennett et al. [BBBV97] using different techniques—the proof via approximate degree has other consequences in quantum complexity.”
Method
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.