Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR03-021 | 4th April 2003 00:00

QMA=PP implies that PP contains PH

RSS-Feed




TR03-021
Authors: Mikhail Vyalyi
Publication: 8th April 2003 18:06
Downloads: 1775
Keywords: 


Abstract:

We consider possible equality QMA=PP and give an argument
against it. Namely, this equality implies that PP contains PH. The argument is based on the strong form of Toda's theorem and
the strengthening of the proof for inclusion $QMA\subseteq PP$ due to Kitaev and Watrous.



ISSN 1433-8092 | Imprint