# Nonlocal games, compression theorems, and the arithmetical hierarchy

@article{Mousavi2022NonlocalGC, title={Nonlocal games, compression theorems, and the arithmetical hierarchy}, author={Hamoon Mousavi and Seyed Sajjad Nezhadi and Henry S. Yuen}, journal={Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing}, year={2022} }

We investigate the connection between the complexity of nonlocal games and the arithmetical hierarchy, a classification of languages according to the complexity of arithmetical formulas defining them. It was recently shown by Ji, Natarajan, Vidick, Wright and Yuen that deciding whether the (finite-dimensional) quantum value of a nonlocal game is 1 or at most 1/2 is complete for the class Σ1 (i.e., ). A result of Slofstra implies that deciding whether the commuting operator value of a nonlocal…

## References

SHOWING 1-10 OF 34 REFERENCES

NEEXP in MIP

- Computer ScienceFOCS 2019
- 2019

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

MIP* = RE

- Computer ScienceCommun. ACM
- 2021

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.

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…

THE SET OF QUANTUM CORRELATIONS IS NOT CLOSED

- MathematicsForum of Mathematics, Pi
- 2019

We construct a linear system nonlocal game which can be played perfectly using a limit of finite-dimensional quantum strategies, but which cannot be played perfectly on any finite-dimensional Hilbert…

Tsirelson’s problem and an embedding theorem for groups arising from non-local games

- MathematicsJournal of the American Mathematical Society
- 2019

Tsirelson’s problem asks whether the commuting operator model for two-party quantum correlations is equivalent to the tensor-product model. We give a negative answer to this question by showing that…

Quantum soundness of testing tensor codes

- Computer Science2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)
- 2022

This work analyzes the axis-parallel line vs. point test as a two-prover game and shows that the test is sound against quantum provers sharing entanglement, implying the quantum-soundness of the low individual degree test, which is an essential component of the MIP* = RE theorem.

Quantum soundness of the classical low individual degree test

- Mathematics, Computer ScienceArXiv
- 2020

A variant of the low degree test called the low individual degree test, initially shown to be sound against multiple quantum provers in [Vid16], is analyzed and the main result is that the two-player version of this test is sound against quantumProvers.

On the complexity of zero gap MIP

- Mathematics, Computer ScienceICALP
- 2020

This paper proves that $\mathsf{MIP}^*_0$ extends beyond the first level of the arithmetical hierarchy, and in fact is equal to $\Pi_2^0$, the class of languages that can be decided by quantified formulas of the form $\forall y \, \exists z \, R(x,y,z)$.

About the Connes embedding conjecture

- Mathematics
- 2013

In his celebrated paper in 1976, A. Connes casually remarked that any finite von Neumann algebra ought to be embedded into an ultraproduct of matrix algebras, which is now known as the Connes…