Quick Navigation

Overview Topics Abstract Importance Paper Tools References Reactions Discussion Publication Related

Topics

Quantum Optimization Open Quantum Systems Decoherence Quantum Simulation

StoqMA vs. MA: the power of error reduction

arXiv

Authors: Dorit Aharonov, Alex B. Grilo, Yupan Liu

Year

2020

Paper ID

20169

Status

Preprint

Abstract Read

~2 min

Abstract Words

Citations

N/A

Abstract

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.

Why This Paper Matters

This paper contributes to the Quantum Simulation research area in the Quantum Articles archive.
It adds a 2020 reference point for readers tracking recent quantum research.
StoqMA characterizes the computational hardness of stoquastic local Hamiltonians, which is a family of Hamiltonians that does not suffer from the sign problem.

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Become a member Sign in

Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

[1] DOI https://doi.org/arXiv:2010.02835 [2] arXiv https://arxiv.org/abs/2010.02835 [3] Publisher https://arxiv.org/abs/2010.02835

Local Citation Graph (Related-Paper Links)

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0

Likes: 0 Dislikes: 0

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.