dc.contributor.author | Aaronson, Scott | |
dc.date.accessioned | 2017-05-31T20:37:34Z | |
dc.date.available | 2017-05-31T20:37:34Z | |
dc.date.issued | 2009-01 | |
dc.identifier.issn | 1533-7146 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/109480 | |
dc.description.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. | en_US |
dc.language.iso | en_US | |
dc.publisher | Association for Computing Machinery (ACM) | en_US |
dc.relation.isversionof | http://dl.acm.org/citation.cfm?id=2021261 | en_US |
dc.rights | 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. | en_US |
dc.source | S. Aaronson | en_US |
dc.title | On perfect completeness for QMA | en_US |
dc.type | Article | en_US |
dc.identifier.citation | Aaronson, Scott. "On perfect completeness for QMA." Quantum Information & Computation 9:1 (January 2009), pp. 81-89. | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
dc.contributor.approver | Aaronson, Scott | en_US |
dc.contributor.mitauthor | Aaronson, Scott | |
dc.relation.journal | Quantum Information & Computation | en_US |
dc.eprint.version | Author's final manuscript | en_US |
dc.type.uri | http://purl.org/eprint/type/SubmittedJournalArticle | en_US |
eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
dspace.orderedauthors | Aaronson, Scott | en_US |
dspace.embargo.terms | N | en_US |
dc.identifier.orcid | https://orcid.org/0000-0003-1333-4045 | |
mit.license | PUBLISHER_POLICY | en_US |
mit.metadata.status | Complete | |