Information | |
---|---|
has gloss | eng: 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). |
lexicalization | eng: PostBQP |
instance of | c/Probabilistic complexity classes |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint