Postselection

From testwiki
Revision as of 03:43, 5 July 2022 by imported>Darcyisverycute (added Category:Quantum complexity theory using HotCat)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

In probability theory, to postselect is to condition a probability space upon the occurrence of a given event. In symbols, once we postselect for an event E, the probability of some other event F changes from Pr[F] to the conditional probability Pr[F|E].

For a discrete probability space, Pr[F|E]=Pr[FE]Pr[E], and thus we require that Pr[E] be strictly positive in order for the postselection to be well-defined.

See also PostBQP, a complexity class defined with postselection. Using postselection it seems quantum Turing machines are much more powerful: Scott Aaronson proved[1][2] PostBQP is equal to PP.

Some quantum experiments[3] use post-selection after the experiment as a replacement for communication during the experiment, by post-selecting the communicated value into a constant.

References


Template:Comp-sci-theory-stub Template:Probability-stub