Paper Info
Title
A Multi-prover Interactive Proof for NEXP Sound against Entangled Provers
Abstract
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 introduction of the class MIP* it was open whether shared entanglement between the provers could weaken or strengthen the computational power of multi-prover interactive proofs. Our result shows that it does not weaken their computational power: MIP* contains MIP. At the heart of our result is a proof that Babai, Fort now, and Lund's multilinearity test is sound even in the presence of entanglement between the provers, and our analysis of this test could be of independent interest. As a byproduct we show that the correlations produced by any entangled strategy which succeeds in the multilinearity test with high probability can always be closely approximated using shared randomness alone.
Year
DOI
Venue
2012
10.1109/FOCS.2012.11
foundations of computer science
Keywords
DocType
Volume
main result,entangled strategy,class mip,entangled provers,shared entanglement,languages decidable,computational complexity,multi-prover interactive proof,computational power,multilinearity test,nexp sound,formal languages,decidability,entanglement,theorem proving,quantum entanglement,game theory,quantum physics,probability
Journal
abs/1207.0550
ISSN
ISBN
Citations 
0272-5428
978-1-4673-4383-1
30
PageRank 
References 
Authors
1.27
26
2
Name
Order
Citations
PageRank
Tsuyoshi Ito1301.27
Thomas Vidick237731.69