On perfect completeness for QMA

Author(s)
Aaronson, Scott
Thumbnail
DownloadAaronson_On Perfect Completeness.PDF (155.5Kb)
PUBLISHER_POLICY
Terms of use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Metadata
Show full item record
Abstract
Whether the class QMA (Quantum Merlin Arthur) is equal to QMA1, or QMA with onesided error, has been an open problem for years. This note helps to explain why the problem is difficult, by using ideas from real analysis to give a "quantum oracle" relative to which QMA ≠ QMA1. As a byproduct, we find that there are facts about quantum complexity classes that are classically relativizing but not quantumly relativizing, among them such "trivial" containments as BQP ⊆ ZQEXP.
Date issued
2009-01
URI
http://hdl.handle.net/1721.1/109480
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Journal
Quantum Information & Computation
Publisher
Association for Computing Machinery (ACM)
Citation
Aaronson, Scott. "On perfect completeness for QMA." Quantum Information & Computation 9:1 (January 2009), pp. 81-89.
Version: Author's final manuscript
ISSN
1533-7146
Collections