Use this tag for questions about the computational complexity class PostBQP (bounded-error quantum polynomial time with postselection). The PostBQP class encompasses computational problems which can be solved in polynomial time in a (bounded error) quantum Turing machine with the ability to condition on postselection. "Bounded error" implies that the algorithm is correct at least 2/3 of the time on all inputs.
Questions tagged [postbqp]
1 questions
5
votes
0 answers
Is PostBQP experimentally relevant?
Far from my expertise, but sheer curiosity. I've read that PostBQP ("a complexity class consisting of all of the computational problems solvable in polynomial time on a quantum Turing machine with postselection and bounded error") is very powerful. …
agaitaarino
- 3,917
- 2
- 14
- 42