BQP error reduction
= BQP error reduction
{c}
Independent runs of a <BQP> algorithm with fresh <ancilla qubits> can be combined by a classical threshold rule. If completeness exceeds soundness by $\gamma$, a <Hoeffding inequality> bounds the error after $r$ runs by $e^{-r\gamma^2/2}$. Polynomial repetition handles inverse-polynomial gaps. This does not automatically preserve the restricted gate and measurement rules of a <stoquastic circuit>.