PostBQP
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 ( in the sense that the algorithm is correct at least 2/3 of the time on all inputs ) . 
<triplet> PostBQP <subj> complexity class <obj> instance of <subj> computational problem <obj> subclass of <triplet> complexity class <subj> computational complexity theory <obj> part of