2012 IEEE 53rd Annual Symposium on Foundations of Computer Science

Format:

Book

Author/Creator:

IEEE Staff, author, issuing body.

Contributor:

IEEE Staff, Contributor.

Language:

English

Subjects (All):

Technology.

Physical Description:

1 online resource

Place of Publication:

[Place of publication not identified] IEEE 2012

Language Note:

English

Summary:

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.

Notes:

Bibliographic Level Mode of Issuance: Monograph

ISBN:

9780769548746

0769548741