StoqMA vs. MA: the power of error reduction
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2020
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866915496150958080 |
|---|---|
| author | Aharonov, Dorit Grilo, Alex B. Liu, Yupan |
| author_facet | Aharonov, Dorit Grilo, Alex B. Liu, Yupan |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2010_02835 |
| institution | arXiv |
| publishDate | 2020 |
| record_format | arxiv |
| spellingShingle | StoqMA vs. MA: the power of error reduction Aharonov, Dorit Grilo, Alex B. Liu, Yupan Quantum Physics Computational Complexity 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. |
| title | StoqMA vs. MA: the power of error reduction |
| topic | Quantum Physics Computational Complexity |
| url | https://arxiv.org/abs/2010.02835 |