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.

中文翻译：

---

StoqMA 与 MA：减少错误的力量

StoqMA 表征了随机局部哈密顿量的计算难度，这是一个不受符号问题影响的哈密顿量族。尽管错误减少对于许多复杂性类（例如 BPP、BQP、MA、QMA 等）来说是司空见惯的，但是自从 Bravyi、Bessen 和 Terhal 在 2006 年定义了这个类以来，这个属性仍然对 StoqMA 开放。在这篇笔记中，我们展示了错误减少forStoqMA 将意味着 StoqMA = MA。