On the complexity of zero gap MIP

@inproceedings{Mousavi2020OnTC,
  title={On the complexity of zero gap MIP},
  author={Hamoon Mousavi and Seyed Sajjad Nezhadi and Henry S. Yuen},
  booktitle={ICALP},
  year={2020}
}
The class $\mathsf{MIP}^*$ is the set of languages decidable by multiprover interactive proofs with quantum entangled provers. It was recently shown by Ji, Natarajan, Vidick, Wright and Yuen that $\mathsf{MIP}^*$ is equal to $\mathsf{RE}$, the set of recursively enumerable languages. In particular this shows that the complexity of approximating the quantum value of a non-local game $G$ is equivalent to the complexity of the Halting problem. In this paper we investigate the complexity of… 

Figures from this paper

Nonlocal games, compression theorems, and the arithmetical hierarchy
TLDR
The Π2-completeness result is a new “gapless” compression theorem that holds for both quantum and commuting operator strategies, and explains how results about the complexity of nonlocal games all follow in a unified manner from a technique known as compression.
Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs
TLDR
This combinatorial proof leverages the quantum automorphism group of a graph, a notion from noncommutative mathematics, and shows that homomorphism counts from graphs of bounded treewidth do not determine a graph up to isomorphism.
The membership problem for constant-sized quantum correlations is undecidable
TLDR
There is a family of constant-sized correlations such that solving the quantum membership problem for this family is computationally impossible, and the undecidability that arises in understanding Bell experiments is not dependent on varying the number of measurements in the experiment.
MIP* = RE
TLDR
It is proved that every problem that is recursively enumerable, including the Halting problem, can be efficiently verified by a classical probabilistic polynomial-time verifier interacting with two all-powerful but noncommunicating provers sharing entanglement.
A negative resolution to Connes’ Embedding Problem and Tsirelson’s problem
Connes’ Embedding Problem is a deep question on approximability of certain tracial von Neumann algebras by finite-dimensional matrix algebras. We survey the connections between operator algebras,

References

SHOWING 1-10 OF 20 REFERENCES
NEEXP in MIP
TLDR
The main result of this work is the inclusion of NEEXP (nondeterministic doubly exponential time) in MIP*.
Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision
TLDR
Lower bounds are given on the complexity class PZK-MIPcoδ (2, 1,1, s) of perfect zero-knowledge multi-prover proofs with approximately-commuting operator strategies, as the gap 1 --- s gets arbitrarily small.
Compression of quantum multi-prover interactive proofs
TLDR
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.
Quantum proof systems for iterated exponential time, and beyond
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
The Quantum Moment Problem and Bounds on Entangled Multi-prover Games
TLDR
It is proved that a hierarchy of semidefinite programs similar to the one given by Navascues, Pironioand Acin converges to the entangled value of the game and it would follow that the languages recognized by a multi-prover interactive proof system where the provers share entanglement are recursive.
Multi-prover interactive proofs: how to remove intractability assumptions
TLDR
It is proved that all NP languages have perfect zero-knowledge proof-systems in this model, without making any intractability assumptions, and its properties and applicability to cryptography are examined.
HOW TO SHARE A QUANTUM SECRET
We investigate the concept of quantum secret sharing. In a (k,thinspn) threshold scheme, a secret quantum state is divided into n shares such that any k of those shares can be used to reconstruct the
MIP* = RE
TLDR
It is proved that every problem that is recursively enumerable, including the Halting problem, can be efficiently verified by a classical probabilistic polynomial-time verifier interacting with two all-powerful but noncommunicating provers sharing entanglement.
A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
TLDR
It is shown that in some cases it is possible to conclude that a given set of correlations is quantum after performing only a finite number of tests, and used in particular to bound the quantum violation of various Bell inequalities.
Toward a general theory of quantum games
TLDR
A representation of quantum strategies is focused on that generalizes the Choi-Jamiolkowski representations of quantum, with respect to which each strategy is described by a single operations.
...
...