Quantum multi prover interactive proofs with communicating provers

Michael Ben Or, Avinatan Hassidim, Haran Pilpel

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations

Abstract

We introduce another variant of Quantum MIP, where the provers do not share entanglement, the communication between the verifier and the provers is quantum, but the provers are unlimited in the classical communication between them. At first, this model may seem very weak, as provers who exchange information seem to be equivalent in power to a simple prover. This in fact is not the case -we show that any language in NEXP can be recognized in this model efficiently, with just two provers and two rounds of communication, with a constant completeness-soundness gap. Similar ideas and techniques may help help with other models of Quantum MIP, including the dual question, of non communicating provers with unlimited entanglement.

Original languageEnglish
Title of host publicationProceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008
Pages467-476
Number of pages10
DOIs
StatePublished - 2008
Event49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008 - Philadelphia, PA, United States
Duration: 25 Oct 200828 Oct 2008

Publication series

NameProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
ISSN (Print)0272-5428

Conference

Conference49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008
Country/TerritoryUnited States
CityPhiladelphia, PA
Period25/10/0828/10/08

Fingerprint

Dive into the research topics of 'Quantum multi prover interactive proofs with communicating provers'. Together they form a unique fingerprint.

Cite this