StoqMA vs. MA: the power of error reduction [article]

Dorit Aharonov, Alex B. Grilo, Yupan Liu
<span title="2021-04-19">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
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.
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="">arXiv:2010.02835v3</a> <a target="_blank" rel="external noopener" href="">fatcat:xe7grx2ymbepvcsih5d7hijjja</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download [not primary version]" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <span style="color: #f43e3e;">&#10033;</span> <div class="menu fulltext-thumbnail"> <img src="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="" title=" access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> </button> </a>