Quantum computing, postselection, and probabilistic polynomial-time

  title={Quantum computing, postselection, and probabilistic polynomial-time},
  author={Scott Aaronson},
  journal={Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences},
  pages={3473 - 3482}
  • S. Aaronson
  • Published 23 December 2004
  • Computer Science
  • Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
I study the class of problems efficiently solvable by a quantum computer, given the ability to ‘postselect’ on the outcomes of measurements. I prove that this class coincides with a classical complexity class called PP, or probabilistic polynomial-time. Using this result, I show that several simple changes to the axioms of quantum mechanics would let us solve PP-complete problems efficiently. The result also implies, as an easy corollary, a celebrated theorem of Beigel, Reingold and Spielman… 

Figures from this paper

Revisiting a limit on efficient quantum computation

This paper offers an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP is contained in the classical counting class PP (Probabilistic Polynomial time).

Computation in generalised probabilisitic theories

This work defines a circuit-based model of computation in a class of operationally-defined theories more general than quantum theory, and shows there exists a classical oracle relative to which efficient computation in any theory satisfying the causality assumption does not include .

Rewindable Quantum Computation and Its Equivalence to Cloning and Adaptive Postselection

Under the strongly believed assumption that BQP (cid:43) SZK, or the shortest independent vectors problem cannot be e-ciently solved with quantum computers, it is shown that a single rewinding operator is suficient to achieve tasks that are intractable for quantum computation.

On exact counting and quasi-quantum complexity

It is shown that the gap-definable counting classes which bound exact and zero-error quantum algorithms can be characterised in terms of "quantum-like" algorithms involving nonunitary gates, and that postselection and nonunitarity have equivalent power for exact quantum computation only if these classes collapse.

Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy

  • M. BremnerR. JozsaD. Shepherd
  • Computer Science, Mathematics
    Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
  • 2010
The class post-IQP of languages decided with bounded error by uniform families of IQP circuits with post-selection is introduced, and it is proved first that post- IQP equals the classical class PP, and that if the output distributions of uniform IQP circuit families could be classically efficiently sampled, then the infinite tower of classical complexity classes known as the polynomial hierarchy would collapse to its third level.

Computation in generalised probabilisitic theories

This work investigates limits on computational power that are imposed by simple physical, or information theoretic, principles, and extends the computational model by allowing post-selection on measurement outcomes, and considers whether one can obtain relativized complexity results for general theories.

Impossibility of succinct quantum proofs for collision-freeness

We show that any quantum algorithm to decide whether a function f : [n] → [n] is a permutation or far from a permutation must make Ω (n1/3/w) queries to f, even if the algorithm is given a w-qubit

Anti-concentration theorems for schemes showing a quantum computational supremacy

One of the main milestones in quantum information science is to realize quantum devices that exhibit an exponential computational advantage over classical ones without being universal quantum

On the complexity and verification of quantum random circuit sampling

Evidence is provided that quantum random circuit sampling, a near-term quantum computational task, is classically hard but verifiable, making it a leading proposal for achieving quantum supremacy.

The learnability of quantum states

  • S. Aaronson
  • Physics
    Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
  • 2007
This theorem has the conceptual implication that quantum states, despite being exponentially long vectors, are nevertheless ‘reasonable’ in a learning theory sense and has two applications to quantum computing: first, a new simulation of quantum one-way communication protocols and second, the use of trusted classical advice to verify untrusted quantum advice.



Quantum NP - A Survey

We describe Kitaev's result from 1999, in which he defines the complexity class QMA, the quantum analog of the class NP, and shows that a natural extension of 3-SAT, namely local Hamiltonians, is QMA

Complexity limitations on quantum computation

  • L. FortnowJ. Rogers
  • Computer Science
    Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247)
  • 1998
We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the probabilistic quantum

Quantum Computability

It is shown that when quantum Turing machines are restricted to have transition amplitudes which are algebraic numbers, BQP, EQP, and nondeterministic quantum polynomial time (NQP) are all contained in PP, hence in P and PSPACE.

Quantum complexity theory

This paper gives the first formal evidence that quantum Turing machines violate the modern (complexity theoretic) formulation of the Church--Turing thesis, and proves that bits of precision suffice to support a step computation.

Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy

It is shown that the complexity class NQP (a quantum analogue of NP) of Adleman, Demarrais and Huang, is equal to the counting class coC=P.

Succinct quantum proofs for properties of finite groups

  • J. Watrous
  • Mathematics, Computer Science
    Proceedings 41st Annual Symposium on Foundations of Computer Science
  • 2000
It is proved that for an arbitrary group oracle, there exist succinct (polynomial-length) quantum proofs for the Group Non-Membership problem that can be checked with small error in polynomial time on a quantum computer.

Limitations of quantum advice and one-way communication

  • S. Aaronson
  • Computer Science
    Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004.
  • 2004
It is shown in three settings that quantum messages have only limited advantages over classical ones, and the polynomial method is used to give the first correct proof of a direct product theorem for quantum search.

Limits on Efficient Computation in the Physical World

This thesis attacks the common belief that quantum computing resembles classical exponential parallelism, by showing that quantum computers would face serious limitations on a wider range of problems than was previously known, and studies the relationship of the quantum computing model to physical reality.


This work provides algorithms that solve NP-complete and #P oracle problems by exploiting nonlinear quantum logic gates, and it is argued that virtually any deterministic non linear quantum theory will include such gates.

Is Quantum Mechanics An Island in Theoryspace

This paper investigates what happens if we change quantum mechanics in several ways. The main results are as follows. First, if we replace the 2-norm by some other p-norm, then there are no