StoqMA vs. MA：减少误差的能力

IF 5.1 2区物理与天体物理 Q1 PHYSICS, MULTIDISCIPLINARY

Quantum Pub Date : 2025-09-11 DOI:10.22331/q-2025-09-11-1853

Dorit Aharonov, Alex B. Grilo, Yupan Liu

{"title":"StoqMA vs. MA：减少误差的能力","authors":"Dorit Aharonov, Alex B. Grilo, Yupan Liu","doi":"10.22331/q-2025-09-11-1853","DOIUrl":null,"url":null,"abstract":"$\\sf{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 $\\sf{BPP, BQP, MA, QMA}$, etc.,this property remains open for $\\sf{StoqMA}$ since Bravyi, Bessen and Terhal defined this class in 2006. In this note, we show that error reduction for $\\sf{StoqMA}$ will imply that $\\sf{StoqMA = MA}$.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"42 1","pages":""},"PeriodicalIF":5.1000,"publicationDate":"2025-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"StoqMA vs. MA: the power of error reduction\",\"authors\":\"Dorit Aharonov, Alex B. Grilo, Yupan Liu\",\"doi\":\"10.22331/q-2025-09-11-1853\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"$\\\\sf{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 $\\\\sf{BPP, BQP, MA, QMA}$, etc.,this property remains open for $\\\\sf{StoqMA}$ since Bravyi, Bessen and Terhal defined this class in 2006. In this note, we show that error reduction for $\\\\sf{StoqMA}$ will imply that $\\\\sf{StoqMA = MA}$.\",\"PeriodicalId\":20807,\"journal\":{\"name\":\"Quantum\",\"volume\":\"42 1\",\"pages\":\"\"},\"PeriodicalIF\":5.1000,\"publicationDate\":\"2025-09-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Quantum\",\"FirstCategoryId\":\"101\",\"ListUrlMain\":\"https://doi.org/10.22331/q-2025-09-11-1853\",\"RegionNum\":2,\"RegionCategory\":\"物理与天体物理\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"PHYSICS, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Quantum","FirstCategoryId":"101","ListUrlMain":"https://doi.org/10.22331/q-2025-09-11-1853","RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"PHYSICS, MULTIDISCIPLINARY","Score":null,"Total":0}

引用次数: 0

摘要

$\sf{StoqMA}$表示随机局部哈密顿量的计算硬度，它是一类不受符号问题影响的哈密顿量。虽然减少错误对于许多复杂性类来说是很常见的，比如$\sf{BPP， BQP， MA, QMA}$等，但自从Bravyi， Bessen和Terhal在2006年定义了这个类以来，这个属性仍然对$\sf{StoqMA}$开放。在本文中，我们展示了$\sf{StoqMA}$的误差减少将意味着$\sf{StoqMA = MA}$。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

StoqMA vs. MA: the power of error reduction

$\sf{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 $\sf{BPP, BQP, MA, QMA}$, etc.,this property remains open for $\sf{StoqMA}$ since Bravyi, Bessen and Terhal defined this class in 2006. In this note, we show that error reduction for $\sf{StoqMA}$ will imply that $\sf{StoqMA = MA}$.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Quantum Physics and Astronomy-Physics and Astronomy (miscellaneous)

CiteScore

9.20

自引率

10.90%

发文量

241

审稿时长

16 weeks

期刊介绍： Quantum is an open-access peer-reviewed journal for quantum science and related fields. Quantum is non-profit and community-run: an effort by researchers and for researchers to make science more open and publishing more transparent and efficient.