In quantum complexity theory, “PostBQP” stands (in variation of *BQP*) for *postselected bounded-error quantum polynomial time*, denoting a fundamental complexity class of quantum computation.

PostBQP is closed under unions and intersections of problems in PostBQP. PostBQP is equivalent to the complexity class PP?, and includes BQP and QMA? as subclasses.

- Scott Aaronson,
*Quantum computing, postselection, and probabilistic polynomial-time*, Proceedings of the Royal Society A, Volume 461, Issue 2063, pages 3473–3482, 08 November 2005. (doi:10.1098/rspa.2005.1546, arXiv:quant-ph/0412187)

Wikipedia:

- Wikipedia, PostBQP

Last revised on September 27, 2023 at 17:14:54. See the history of this page for a list of all contributions to it.