Summary: The Power of Unentanglement (Extended Abstract)
Scott Aaronson
MIT
Salman Beigi
MIT
Andrew Drucker
MIT
Bill Fefferman
University of Chicago
Peter Shor
MIT
Abstract
The class QMA (k), introduced by Kobayashi et al., con-
sists of all languages that can be verified using k unen-
tangled quantum proofs. Many of the simplest questions
about this class have remained embarrassingly open: for
example, can we give any evidence that k quantum proofs
are more powerful than one? Can we show any upper
bound on QMA (k), besides the trivial NEXP? Does
QMA (k) = QMA (2) for k 2? Can QMA (k) proto-

Source: Aaronson, Scott - Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (MIT)

Collections: Physics; Computer Technologies and Information Sciences