DeepAI

# Nonlocal Games, Compression Theorems, and the Arithmetical Hierarchy

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 game is equal to 1 is complete for the class Π_1 (i.e., 𝖼𝗈𝖱𝖤). We prove that deciding whether the quantum value of a two-player nonlocal game is exactly equal to 1 is complete for Π_2; this class is in the second level of the arithmetical hierarchy and corresponds to formulas of the form "∀ x ∃ y ϕ(x,y)". This shows that exactly computing the quantum value is strictly harder than approximating it, and also strictly harder than computing the commuting operator value (either exactly or approximately). We explain how results about the complexity of nonlocal games all follow in a unified manner from a technique known as compression. At the core of our Π_2-completeness result is a new "gapless" compression theorem that holds for both quantum and commuting operator strategies. Our compression theorem yields as a byproduct an alternative proof of Slofstra's result that the set of quantum correlations is not closed. We also show how a "gap-preserving" compression theorem for commuting operator strategies would imply that approximating the commuting operator value is complete for Π_1.

02/24/2020

### On the complexity of zero gap MIP*

The class MIP^* is the set of languages decidable by multiprover interac...
01/13/2020

### MIP*=RE

We show that the class MIP* of languages that can be decided by a classi...
05/30/2018

### Quantum proof systems for iterated exponential time, and beyond

We show that any language in nondeterministic time ((...(n))), where the...
05/28/2019

### Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision

We study the problem of approximating the commuting-operator value of a ...
10/30/2020

### 3XOR Games with Perfect Commuting Operator Strategies Have Perfect Tensor Product Strategies and are Decidable in Polynomial Time

We consider 3XOR games with perfect commuting operator strategies. Given...
11/07/2020

### Quantum Combinatorial Games: Structures and Computational Complexity

Recently, a standardized framework was proposed for introducing quantum-...
05/05/2022

### Completeness of Sum-Over-Paths for Toffoli-Hadamard and the Clifford Hierarchy

The "Sum-Over-Paths" formalism is a way to symbolically manipulate linea...