Nonlocal Games, Compression Theorems, and the Arithmetical Hierarchy

by   Hamoon Mousavi, et al.

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.


page 1

page 2

page 3

page 4

βˆ™ 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


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...
βˆ™ 07/13/2021

Parallel Repetition for the GHZ Game: A Simpler Proof

We give a new proof of the fact that the parallel repetition of the (3-p...
βˆ™ 02/22/2023

Quantum complexity of the Kronecker coefficients

Whether or not the Kronecker coefficients of the symmetric group count s...

Please sign up or login with your details

Forgot password? Click here to reset