On perfect completeness for QMA
Name
Aaronson_On Perfect Completeness.PDF
Size
155.51 KB
Format
Adobe PDF
Checksum (MD5)
4b95efab21d9fec51ccd5eb19d80ce23
Author(s)
Aaronson, Scott
Date Issued
January 2009
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
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
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.
Persistent DSpace Link
DOI of Published Version
http://dl.acm.org/citation.cfm?id=2021261
