论文标题
STOQMA与MA：降低错误的力量
StoqMA vs. MA: the power of error reduction
论文作者
论文摘要
斯托克马（Stoqma）表征了当地哈密顿杂质的计算硬度，这是一个没有符号问题的汉密尔顿家族。尽管误差减少对于许多复杂性类别（例如BPP，BQP，MA，QMA等）都是司空见惯的，但由于Bravyi，Bessen和Terhal自2006年定义了该类别以来，此属性仍然对STOQMA开放。在此注释中，我们显示降低错误的Forstoqma将暗示STOQMA = MA。
StoqMA characterizes the computational hardness of stoquastic local Hamiltonians, which is a family of Hamiltonians that does not suffer from the sign problem. Although error reduction is commonplace for many complexity classes, such as BPP, BQP, MA, QMA, etc.,this property remains open for StoqMA since Bravyi, Bessen and Terhal defined this class in 2006. In this note, we show that error reduction forStoqMA will imply that StoqMA = MA.
