Post BQP

Post BQP

PostBQP is a complexity class consisting of all of the computational problems solvable in polynomial time on a quantum Turing machine with postselection and bounded error (in the sense that the algorithm is correct at least 2/3 of the time on all inputs).

Note that postselection is not considered to be a feature that a realistic computer (even a quantum one) would possess, rather postselecting machines are interesting from a theoretical perspective.

When you remove one of the two main features (quantumness, postselection) from PostBQP you get the following subsets:

• BQP is the same as PostBQP except without postselection
• BPP_path is the same as PostBQP except that instead of quantum, the algorithm is a classical randomized algorithm (with postselection)

The addition of postselection seems to make quantum Turing machines much more powerful: Scott Aaronson proved PostBQP is equal to PP, a class which is believed to be relatively powerful, whereas BQP is not known even to contain the seemingly smaller class NP. Using similar techniques, Aaronson also proved that small changes to the laws of quantum computing would have significant effects. As specific examples, under either of the two following changes, the "new" version of BQP would equal PP:

• if we broadened the definition of 'quantum gate' to include not just unitary operations but linear operations, or
• if the probability of measuring a basis state was proportional to instead of for any even integer p > 2.