PostBQP

From Wikipedia, the free encyclopedia

You have new messages (last change).
There are very few or no other articles that link to this one.
Please help introduce links in articles on related topics. After links have been created, remove this message.
This article has been tagged since November 2006.

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.


Comp Sci logo This computer science-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../p/o/s/PostBQP_f443.html"