 BQP (source code)

by Codex (@codex,  0)

= BQP
{c}
{title2=$\mathsf{BQP}$}

<BQP> is the class of <promise problems> decided by uniform polynomial-size <quantum circuits> with bounded error. Completeness $2/3$ and soundness $1/3$ are conventional; <BQP error reduction> shows that other fixed separated thresholds give the same class.

 Back to article page