All reports by Author André Deutz:

__
TR19-131
| 11th September 2019
__

Lieuwe Vinkhuijzen, André Deutz#### A Simple Proof of Vyalyi's Theorem and some Generalizations

Lieuwe Vinkhuijzen, André Deutz

In quantum computational complexity theory, the class QMA models the set of problems efficiently verifiable by a quantum computer the same way that NP models this for classical computation. Vyalyi proved that if $\text{QMA}=\text{PP}$ then $\text{PH}\subseteq \text{QMA}$. In this note, we give a simple, self-contained proof of the theorem, using ... more >>>