Show simple item record

dc.contributor.authorBeigi, Salman
dc.contributor.authorShor, Peter W.
dc.contributor.authorWatrous, John
dc.date.accessioned2020-04-22T15:06:59Z
dc.date.available2020-04-22T15:06:59Z
dc.date.issued2011
dc.identifier.issn1557-2862
dc.identifier.urihttps://hdl.handle.net/1721.1/124789
dc.description.abstractThis paper considers three variants of quantum interactive proof systems in which short (meaning logarithmic-length) messages are exchanged between the prover and verifier. The first variant is one in which the verifier sends a short message to the prover, and the prover responds with an ordinary, or polynomial-length, message; the second variant is one in which any number of messages can be exchanged, but where the combined length of all the messages is logarithmic; and the third variant is one in which the verifier sends polynomially many random bits to the prover, who responds with a short quantum message. We prove that in all of these cases the short messages can be eliminated without changing the power of the model, so the first variant has the expressive power of QMA and the second and third variants have the expressive power of BQP. These facts are proved through the use of quantum state tomography, along with the finite quantum de Finetti theorem for the first variant. ©2011en_US
dc.description.sponsorshipNSF (grant no. CCF-0829421)en_US
dc.language.isoen_US
dc.publisherTheory of Computingen_US
dc.relation.isversionofhttp://www.theoryofcomputing.org/articles/v007a007/en_US
dc.rightsCreative Commons Attribution 4.0 International licenseen_US
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/en_US
dc.sourceTheory of Computingen_US
dc.titleQuantum interactive proofs with short messagesen_US
dc.typeArticleen_US
dc.identifier.citationBeigi, Salman, Peter Shor, and John Watrous, "Quantum interactive proofs with short messages." Theory of computing 7 (2011): no. 7 url http://www.theoryofcomputing.org/articles/v007a007/ ©2011 Author(s)en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mathematicsen_US
dc.relation.journalTheory of computingen_US
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dspace.embargo.termsNen_US
dspace.date.submission2019-04-04T12:33:52Z
mit.journal.volume7en_US
mit.licensePUBLISHER_CCen_US
mit.metadata.statusComplete


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record