Quantum Multi Prover Interactive Proofs with Communicating Provers

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.

Authors

• Michael Ben-Or
• Avinatan Hassidim
• Haran Pilpel

Keywords

• Quantum entanglement
• Quantum computing
• Computer science
• Polynomials
• Protocols
• Quantum mechanics
• Indium tin oxide
• Quantum
• Israel Science Foundation
• Communication Rounds
• Constant Gap
• Hilbert Space
• Types Of Games
• Classical Setting
• Set Of Languages
• multi prover
• interactive proofs