Quantum multiprover interactive proofs with communicating provers

Michael Ben-Or, Avinatan Hassidim, Haran Pilpel

Research output: Contribution to journalArticlepeer-review

Abstract

We introduce a new variant of quantum multiprover interactive proofs (QMIP) where the provers and the verifier are quantum. The verifier can exchange quantum messages with the provers. The provers cannot communicate quantumly between themselves and do not share entanglement, but are unlimited in the classical communication between them, even after receiving messages from the verifier. We show that any language in nondeterministic exponential time (NEXP) can be recognized in this model efficiently, with just two provers and two rounds of communication, and with a constant completeness/soundness gap. This is in contrast to the result of [R. Jain et al., Comm. ACM, 53 (2010), pp. 102-109], which shows that QIP = PSPACE, or equivalently that the set of languages that can be recognized by a quantum verifier communicating with a single quantum prover is equal to PSPACE. To analyze the cheating power of the provers, we give them more power and allow them to perform any separable operation. We then show a unique two-phase protocol in which the provers first commit to a superposition of correct answers to all possible questions, and then in the second phase the verifier opens up the committed answer and checks for correctness and consistency.

Original languageAmerican English
Pages (from-to)987-1011
Number of pages25
JournalSIAM Journal on Computing
Volume43
Issue number3
DOIs
StatePublished - 2014

Keywords

  • Complexity
  • Multiprover
  • Quantum

Fingerprint

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

Cite this