Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1805.08577 · Quantum Information and Computation

PDQP/qpoly=ALL

Scott Aaronson

Published Sep 1, 2018• 10 citations
arXivHTMLPDF

Abstract

We show that combining two different hypothetical enhancements to quantum computation---namely, quantum advice and non-collapsing measurements---would let a quantum computer solve any decision problem whatsoever in polynomial time, even though neither enhancement yields extravagant power by itself. This complements a related result due to Raz. The proof uses locally decodable codes.

DOI
10.26421/qic18.11-12-1

Related papers

PDQP/qpoly = ALL.

Scott Aaronson

We show that combining two different hypothetical enhancements to quantum computation---namely, quantum advice and non-collapsing measurements---would let a quantum computer solve any decision problem whatsoever in polynomial time, even though neither enhancement yields extravagant power by itself. This complements a related result due to Raz. The proof uses locally decodable codes.

Electronic colloquium on computational complexity•Jan 1, 2018•0 citations

A full characterization of quantum advice

Scott Aaronson, Andrew Drucker

We prove the following surprising result: given any quantum state rho on n qubits, there exists a local Hamiltonian H on poly(n) qubits (e.g., a sum of two-qubit interactions), such that any ground state of H can be used to simulate rho on all quantum circuits of fixed polynomial size. In terms of complexity classes, this implies that BQP/qpoly is contained in QMA/poly, which supersedes the previous result of Aaronson that BQP/qpoly is contained in PP/poly. Indeed, we can exactly characterize quantum advice, as equivalent in power to untrusted quantum advice combined with trusted classical advice.

ACM Symposium on Theory of Computing (STOC)•Jun 5, 2010•6 citations

A Qubit, a Coin, and an Advice String Walk Into a Relational Problem

Scott Aaronson, Harry Buhrman, William Kretschmer

Relational problems (those with many possible valid outputs) are different from decision problems, but it is easy to forget just how different. This paper initiates the study of FBQP/qpoly, the class of relational problems solvable in quantum polynomial-time with the help of polynomial-sized quantum advice, along with its analogues for deterministic and randomized computation (FP, FBPP) and advice (/poly, /rpoly). Our first result is that FBQP/qpoly ≠ FBQP/poly, unconditionally, with no oracle - a striking contrast with what we know about the analogous decision classes. The proof repurposes the separation between quantum and classical one-way communication complexities due to Bar-Yossef, Jayram, and Kerenidis. We discuss how this separation raises the prospect of near-term experiments to demonstrate "quantum information supremacy," a form of quantum supremacy that would not depend on unproved complexity assumptions. Our second result is that FBPP ̸ ⊂ FP/poly - that is, Adleman’s Theorem fails for relational problems - unless PSPACE ⊂ NP/poly. Our proof uses IP = PSPACE and time-bounded Kolmogorov complexity. On the other hand, we show that proving FBPP ̸ ⊂ FP/poly will be hard, as it implies a superpolynomial circuit lower bound for PromiseBPEXP. We prove the following further results: - Unconditionally, FP ≠ FBPP and FP/poly ≠ FBPP/poly (even when these classes are carefully defined). - FBPP/poly = FBPP/rpoly (and likewise for FBQP). For sampling problems, by contrast, SampBPP/poly ≠ SampBPP/rpoly (and likewise for SampBQP).

arXiv:2302.10332•Leibniz international proceedings in informatics•Feb 20, 2023•19 citations

Even quantum advice is unlikely to solve PP

Justin Yirka

We give a corrected proof that if $\mathsf{PP} \subseteq \mathsf{BQP/qpoly}$ (probabilistic polynomial time can be efficiently simulated by quantum circuits with quantum advice), then the Counting Hierarchy collapses, as originally claimed by Aaronson (CCC'06). This recovers the related unconditional claim that $\mathsf{PP}$ does not have circuits of any fixed-polynomial size $n^k$ even with quantum advice. Our result is based on proving that $\mathsf{YQP^*}$, an oblivious version of $\mathsf{QMA}\cap\mathsf{coQMA}$, is contained in $\mathsf{APP}$, a $\mathsf{PP}$-low subclass of $\mathsf{PP}$ with an arbitrarily small but nonzero promise gap.

arXiv:2403.09994•Theory of Computing•Jan 1, 2025•2 citations

PDQMA = DQMA = NEXP: QMA With Hidden Variables and Non-collapsing Measurements

Scott Aaronson, Grewal, Sabee, Iyer, Vishnu +2 more

We define and study a variant of QMA (Quantum Merlin Arthur) in which Arthur can make multiple non-collapsing measurements to Merlin's witness state, in addition to ordinary collapsing measurements. By analogy to the class PDQP defined by Aaronson, Bouland, Fitzsimons, and Lee (2014), we call this class PDQMA. Our main result is that PDQMA = NEXP; this result builds on the PCP theorem and complements the result of Aaronson (2018) that PDQP/qpoly = ALL. While the result has little to do with quantum mechanics, we also show a more "quantum" result: namely, that QMA with the ability to inspect the entire history of a hidden variable is equal to NEXP, under mild assumptions on the hidden-variable theory. We also observe that a quantum computer, augmented with quantum advice and the ability to inspect the history of a hidden variable, can solve any decision problem in polynomial time.

arXiv:2403.02543•Leibniz international proceedings in informatics•Mar 4, 2024•7 citations

The complexity class PDQP SPUR Final Paper: Summer 2013

Mitchell Lee, Adam Bouland, Scott Aaronson

Quantum computers are believed to be strictly more computationally powerful than classical computers, but not so much more powerful that they can solve NP-complete problems eciently. This is because of the result that a quantum computer takes ( N 1=2 ) time to search an unstructured N-element list for a particular marked item, as opposed to poly(logN) time for a nondeterministic computer. On the other hand, many seemingly innocuous modications of quantum mechanics increase the power of quantum computers drastically enough that they can solve NP-complete problems eciently [3]. This paper denes a model of computation slightly more powerful than quantum computation, but only slightly so. In particular, we show that by allowing \non-collapsing measurements, we can solve eciently problems such as Graph Isomorphism and Approximate Shortest Vector which are believed to be intractable for quantum computers. We can also search an unstructured N-element list for a particular marked item in ~ O(N 1=3 ) time, but no faster than ( N 1=4 ).

•Jan 1, 2013•0 citations
We show that combining two different hypothetical enhancements to quantum computation---namely, quantum advice and non-collapsing measurements---would let a quantum computer solve any decision problem whatsoever in polynomial time, even though neither enhancement yields extravagant power by itself. This complements a related result due to Raz. The proof uses locally decodable codes.
We prove the following surprising result: given any quantum state rho on n qubits, there exists a local Hamiltonian H on poly(n) qubits (e.g., a sum of two-qubit interactions), such that any ground state of H can be used to simulate rho on all quantum circuits of fixed polynomial size. In terms of complexity classes, this implies that BQP/qpoly is contained in QMA/poly, which supersedes the previous result of Aaronson that BQP/qpoly is contained in PP/poly. Indeed, we can exactly characterize quantum advice, as equivalent in power to untrusted quantum advice combined with trusted classical advice.
Relational problems (those with many possible valid outputs) are different from decision problems, but it is easy to forget just how different. This paper initiates the study of FBQP/qpoly, the class of relational problems solvable in quantum polynomial-time with the help of polynomial-sized quantum advice, along with its analogues for deterministic and randomized computation (FP, FBPP) and advice (/poly, /rpoly). Our first result is that FBQP/qpoly ≠ FBQP/poly, unconditionally, with no oracle - a striking contrast with what we know about the analogous decision classes. The proof repurposes the separation between quantum and classical one-way communication complexities due to Bar-Yossef, Jayram, and Kerenidis. We discuss how this separation raises the prospect of near-term experiments to demonstrate "quantum information supremacy," a form of quantum supremacy that would not depend on unproved complexity assumptions. Our second result is that FBPP ̸ ⊂ FP/poly - that is, Adleman’s Theorem fails for relational problems - unless PSPACE ⊂ NP/poly. Our proof uses IP = PSPACE and time-bounded Kolmogorov complexity. On the other hand, we show that proving FBPP ̸ ⊂ FP/poly will be hard, as it implies a superpolynomial circuit lower bound for PromiseBPEXP. We prove the following further results: - Unconditionally, FP ≠ FBPP and FP/poly ≠ FBPP/poly (even when these classes are carefully defined). - FBPP/poly = FBPP/rpoly (and likewise for FBQP). For sampling problems, by contrast, SampBPP/poly ≠ SampBPP/rpoly (and likewise for SampBQP).
We give a corrected proof that if PP⊆BQP/qpoly\mathsf{PP} \subseteq \mathsf{BQP/qpoly}PP⊆BQP/qpoly (probabilistic polynomial time can be efficiently simulated by quantum circuits with quantum advice), then the Counting Hierarchy collapses, as originally claimed by Aaronson (CCC'06). This recovers the related unconditional claim that PP\mathsf{PP}PP does not have circuits of any fixed-polynomial size nkn^knk even with quantum advice. Our result is based on proving that YQP∗\mathsf{YQP^*}YQP∗, an oblivious version of QMA∩coQMA\mathsf{QMA}\cap\mathsf{coQMA}QMA∩coQMA, is contained in APP\mathsf{APP}APP, a PP\mathsf{PP}PP-low subclass of PP\mathsf{PP}PP with an arbitrarily small but nonzero promise gap.
We define and study a variant of QMA (Quantum Merlin Arthur) in which Arthur can make multiple non-collapsing measurements to Merlin's witness state, in addition to ordinary collapsing measurements. By analogy to the class PDQP defined by Aaronson, Bouland, Fitzsimons, and Lee (2014), we call this class PDQMA. Our main result is that PDQMA = NEXP; this result builds on the PCP theorem and complements the result of Aaronson (2018) that PDQP/qpoly = ALL. While the result has little to do with quantum mechanics, we also show a more "quantum" result: namely, that QMA with the ability to inspect the entire history of a hidden variable is equal to NEXP, under mild assumptions on the hidden-variable theory. We also observe that a quantum computer, augmented with quantum advice and the ability to inspect the history of a hidden variable, can solve any decision problem in polynomial time.
Quantum computers are believed to be strictly more computationally powerful than classical computers, but not so much more powerful that they can solve NP-complete problems eciently. This is because of the result that a quantum computer takes ( N 1=2 ) time to search an unstructured N-element list for a particular marked item, as opposed to poly(logN) time for a nondeterministic computer. On the other hand, many seemingly innocuous modications of quantum mechanics increase the power of quantum computers drastically enough that they can solve NP-complete problems eciently [3]. This paper denes a model of computation slightly more powerful than quantum computation, but only slightly so. In particular, we show that by allowing \non-collapsing measurements, we can solve eciently problems such as Graph Isomorphism and Approximate Shortest Vector which are believed to be intractable for quantum computers. We can also search an unstructured N-element list for a particular marked item in ~ O(N 1=3 ) time, but no faster than ( N 1=4 ).