StoqMA vs. MA: the power of error reduction

by   Dorit Aharonov, et al.

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.



page 1

page 2

page 3

page 4


A note on Darwiche and Pearl

It is shown that Darwiche and Pearl's postulates imply an interesting pr...

Sign-curing local Hamiltonians: termwise versus global stoquasticity and the use of Clifford transformations

We elucidate the distinction between global and termwise stoquasticity f...

A Note on the Hardness of the Critical Tuple Problem

The notion of critical tuple was introduced by Miklau and Suciu (Gerome ...

Inapproximability for Local Correlation Clustering and Dissimilarity Hierarchical Clustering

We present hardness of approximation results for Correlation Clustering ...

StoqMA meets distribution testing

𝖲𝗍𝗈𝗊𝖬𝖠 captures the computational hardness of approximating the ground e...

Open Problem: Average-Case Hardness of Hypergraphic Planted Clique Detection

We note the significance of hypergraphic planted clique (HPC) detection ...

Application of the Method of Conditional Expectations for Reduction of PAPR and Cubic Metric of OFDM Signals

The OFDM waveform exhibits high fluctuation in the signal envelope, whic...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.