PostBQP

From Wikipedia, the free encyclopedia

PostBQP is a complexity class consisting of all of the computational problems solvable in polynomial time on a quantum Turing machine with postselection. The addition of postselection makes quantum Turing machines much more powerful, and as a result PostBQP is equal to PP.

[edit] References

Aaronson, Scott (2004-01-11). Complexity Class of the Week: PP. Computational Complexity Weblog. Retrieved on 2008-05-02.


Comp Sci logo This computer science-related article is a stub. You can help Wikipedia by expanding it.