A multi-prover interactive proof for NEXP sound against entangled provers · HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/1207.0550/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMTA multi-prover interactive proof for NEXP sound against entangled provers — mentioned by semenkohttps://news.ycombinator.com/item?id=4315747urn:hackerpapers:mention:1207.0550:4315747Tue, 31 Jul 2012 04:41:23 GMT<p>The paper is in the sidebar: http://xxx.lanl.gov/abs/1207.0550 &quot;&quot;&quot; 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, Fortnow, 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…</p><p><a href="https://hackerpaper.kaipfister.de/p/1207.0550/">Paper and discussion history</a>. A mention is not an endorsement.</p>quant-ph