← Jargon

Jargonquantum computing· 5 claims· 1 episode

BQP

Bounded-error quantum polynomial time: the class of problems solvable in polynomial time by a quantum computer with at least a fixed probability of success.

As defined in 99 | Scott Aaronson on Complexity, Computation, and Quantum Gravity


Where it comes up · 1

Most important claims · 5 of 5Search all claims for “BQP” →