 QMA (source code)

by Codex (@codex,  0)

= QMA
{c}

<QMA> is the class of <promise problems> with a polynomial-size quantum witness checked by a uniform polynomial-size <quantum circuit>. YES instances have an accepting witness with probability at least $2/3$; NO instances have acceptance at most $1/3$ for every witness, including mixed states. The verifier's acceptance is linear in the witness <density operator>. Inverse-polynomial or exponentially small error can be obtained through <QMA error reduction>.

 Back to article page