A Multi-prover Interactive Proof for NEXP Sound against Entangled Provers

@article{Ito2012AMI,
  title={A Multi-prover Interactive Proof for NEXP Sound against Entangled Provers},
  author={Tsuyoshi Ito and Thomas Vidick},
  journal={2012 IEEE 53rd Annual Symposium on Foundations of Computer Science},
  year={2012},
  pages={243-252}
}
We prove a strong limitation on the ability of entangled provers to collude in a multiplayer game. Our main result is the first nontrivial lower bound on the class MIP* of languages having multi-prover interactive proofs with entangled provers, namely MIP* contains NEXP, the class of languages decidable in non-deterministic exponential time. While Babai, Fort now, and Lund (Computational Complexity 1991) proved the celebrated equality MIP = NEXP in the absence of entanglement, ever since the… CONTINUE READING
Highly Cited
This paper has 46 citations. REVIEW CITATIONS

Topics

Statistics

01020201620172018
Citations per Year

Citation Velocity: 9

Averaging 9 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.