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.

翻译：斯托克马(StouqMA)是当地汉密尔顿人(汉密尔顿人的一个大家庭,没有标志问题)的计算硬性特征,虽然减少错误对于许多复杂类别(如BPP、BQP、MA、QMA等)来说是常见的,但这种财产仍然开放给斯托克马(StouqMA),因为Bravyi、Bessen和Terhal在2006年界定了这一类,我们在本照会中表明,减少StoqMA的错误意味着斯托克马(StoqMA)=MA(MA)。