# 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…

## 78 Citations

NEEXP in MIP

- Computer ScienceFOCS 2019
- 2019

The main result of this work is the inclusion of NEEXP (nondeterministic doubly exponential time) in MIP*.

NEEXP is Contained in MIP*

- Computer Science2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)
- 2019

The main result of this work is the inclusion of NEEXP (nondeterministic doubly exponential time) in MIP*.

Interactive proof systems with multiple provers sharing entanglement

- Computer Science
- 2012

This paper gives an interactive protocol for a NEXP-complete language and outlines the proof that the protocol is sound even against entangled provers, and shows that NEXP ⊆ MIP.

Perfect Zero Knowledge for Quantum Multiprover Interactive Proofs

- Computer Science, Mathematics2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)
- 2019

The main result is that the two classes are equal, i.e., MIP* = PZK-MIP*.

Coherent state exchange in multi-prover quantum interactive proof systems

- Computer ScienceChic. J. Theor. Comput. Sci.
- 2013

It is proved that any number of parties can coherently exchange any one pure quantum state for another, without communication, given prior shared entanglement, and that multi-prover quantum interactive proof systems can be transformed to have near-perfect completeness by the addition of one round of communication.

A Multiprover Interactive Proof System for the Local Hamiltonian Problem

- Computer Science, MathematicsITCS
- 2015

This work gives a quantum interactive proof system for the local Hamiltonian problem on n qubits in which the verifier has a single round of interaction with five entangled provers and completeness and soundness are separated by an inverse polynomial in $n.

New Perspectives on Multi-Prover Interactive Proofs

- Computer Science, MathematicsIACR Cryptol. ePrint Arch.
- 2018

The locality hierarchy for multiparty (multi-round) interaction is introduced, and for the first time a complete definition of multi-round multiparty no-signalling distributions and strategies is introduced.

Compression of quantum multi-prover interactive proofs

- MathematicsSTOC
- 2017

It is established that non local games are provably harder than classical games without any complexity theory assumptions and gap amplification for nonlocal games may be impossible in general.

Low-Degree Testing for Quantum States, and a Quantum Entangled Games PCP for QMA

- Mathematics2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)
- 2018

We show that given an explicit description of a multiplayer game, with a classical verifier and a constant number of players, it is QMA-hard, under randomized reductions, to distinguish between the…

Quantum proof systems for iterated exponential time, and beyond

- Computer ScienceElectron. Colloquium Comput. Complex.
- 2018

We show that any language solvable in nondeterministic time exp( exp(⋯exp(n))), where the number of iterated exponentials is an arbitrary function R(n), can be decided by a multiprover interactive…

## References

SHOWING 1-10 OF 59 REFERENCES

QMIP = MIP*

- Computer Science
- 2010

The results show that the entire power of quantum information in multi-prover interactive proof systems is captured by the shared entanglement and not by the quantum communication.

Non-deterministic exponential time has two-prover interactive protocols

- Mathematics, Computer Sciencecomputational complexity
- 2005

It is shown that the class of languages having tow-prover interactive proof systems is nondeterministic exponential time and that to prove membership in languages inEXP, the honest provers need the power ofEXP only.

Quantum Multi Prover Interactive Proofs with Communicating Provers

- Computer Science2008 49th Annual IEEE Symposium on Foundations of Computer Science
- 2008

It is shown 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.

Quantum Multi Prover Interactive Proofs with Communicating Provers

- Computer ScienceFOCS
- 2008

It is shown 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.

Unique Games with Entangled Provers are Easy

- Computer Science2008 49th Annual IEEE Symposium on Foundations of Computer Science
- 2008

We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are `unique' constraints (i.e.,…

Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement

- MathematicsISAAC
- 2002

It is proved that the class of languages having quantum multi-prover interactive proof systems is necessarily contained in NEXP, under the assumption that provers are allowed to share at most polynomially many prior-entangled qubits.

Quantum multi-prover interactive proof systems with limited prior entanglement

- Mathematics, Computer ScienceJ. Comput. Syst. Sci.
- 2003

Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies

- Mathematics, Computer Science2009 24th Annual IEEE Conference on Computational Complexity
- 2009

It is proved that exponentially small completeness-soundness gaps are best achievable unless soundness analysis uses the structure of the underlying system with unentangled provers, and it is NP-hard to approximate within an inverse-polynomial the value of a classical two-prover one-round game against entangled provers.

Entanglement in Interactive Proof Systems with Binary Answers

- Computer ScienceSTACS
- 2006

It is shown that for the case where the verifier computes the XOR of two binary answers, the resulting proof system is in fact no more powerful than a system based on a single quantum prover: $\bigoplus MIP^*[2] \subseteq QIP(2)$.

Polynomial-Space Approximation of No-Signaling Provers

- Computer ScienceICALP
- 2010

MIPns(2, 1) = PSPACE is proved by constructing a fast parallel algorithm which approximates within an additive error the maximum winning probability of no-signaling players in a given cooperative two-player one-round game.