StoqMA vs. MA: the power of error reduction - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2020

StoqMA vs. MA: the power of error reduction

StoqMA vs. MA: the power of error reduction

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.

Dates and versions

hal-02968357 , version 1 (15-10-2020)

Identifiers

Cite

Dorit Aharonov, Alex Bredariol Grilo, Yupan Liu. StoqMA vs. MA: the power of error reduction. 2020. ⟨hal-02968357⟩
51 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More