claim: Uta Hagan has a middle name.
evidence: In computational complexity theory , 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 -LRB- in the sense that the algorithm is correct at least 2 / 3 of the time on all inputs -RRB- .. computational complexity theory. computational complexity theory. complexity class. complexity class. polynomial time. polynomial time. quantum Turing machine. quantum Turing machine. postselection. postselection. Postselection is not considered to be a feature that a realistic computer -LRB- even a quantum one -RRB- would possess , but nevertheless postselecting machines are interesting from a theoretical perspective .. Removing either one of the two main features -LRB- quantumness , postselection -RRB- from PostBQP gives the following two complexity classes , both of which are subsets of PostBQP  :. postselection. postselection. BQP is the same as PostBQP except without postselection. postselection. postselection. BQP. BQP. BPPpath is the same as PostBPP except that instead of quantum , the algorithm is a classical randomized algorithm -LRB- with postselection -RRB-. postselection. 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 .. postselection. postselection. BQP. BQP. Scott Aaronson. Scott Aaronson. NP ( complexity class ). PP ( complexity ). 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  :. BQP. BQP. PP ( complexity ). 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 .