NEEXP in MIP*

04/11/2019
by   Anand Natarajan, et al.
0

We study multiprover interactive proof systems. The power of classical multiprover interactive proof systems, in which the provers do not share entanglement, was characterized in a famous work by Babai, Fortnow, and Lund (Computational Complexity 1991), whose main result was the equality MIP = NEXP. The power of quantum multiprover interactive proof systems, in which the provers are allowed to share entanglement, has proven to be much more difficult to characterize. The best known lower-bound on MIP* is NEXP, due to Ito and Vidick (FOCS 2012). As for upper bounds, MIP* could be as large as RE, the class of recursively enumerable languages. The main result of this work is the inclusion of NEEXP (nondeterministic doubly epxonential time) in MIP*. This is an exponential improvement over the prior lower bound and shows that proof systems with entangled provers are at least exponentially more powerful than classical provers. In our protocol the verifier delegates a classical, exponentially large MIP protocol for NEEXP to two entangled provers: the provers obtain their exponentially large questions by measuring their shared state, and use a classical PCP to certify the correctness of their exponentially-long answers. For the soundness of our protocol, it is crucial that each player should not only sample its own question correctly but also avoid performing measurements that would reveal the other player's sampled question. We ensure this by commanding the players to perform a complementary measurement, relying on the Heisenberg uncertainty principle to prevent the forbidden measurements from being performed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/10/2022

Quantum space, ground space traversal, and how to embed multi-prover interactive proofs into unentanglement

Savitch's theorem states that NPSPACE computations can be simulated in P...
research
01/01/2023

Matching upper bounds on symmetric predicates in quantum communication complexity

In this paper, we focus on the quantum communication complexity of funct...
research
02/08/2023

Quantum free games

The complexity of free games with two or more classical players was esse...
research
06/14/2023

Quantum interactive proofs using quantum energy teleportation

We present a simple quantum interactive proof (QIP) protocol using the q...
research
06/10/2022

Tight Bounds for State Tomography with Incoherent Measurements

We consider the classic question of state tomography: given copies of an...
research
06/08/2021

A direct product theorem for quantum communication complexity with applications to device-independent QKD

We give a direct product theorem for the entanglement-assisted interacti...
research
09/02/2019

DRAT and Propagation Redundancy Proofs Without New Variables

We study the proof complexity of RAT proofs and related systems includin...

Please sign up or login with your details

Forgot password? Click here to reset