Parallel Repetition for $3$-Player XOR Games

TL;DR

It is shown that if G is a 3-XOR game with value strictly less than 1, whose underlying distribution over questions µ does not admit Abelian embeddings into (ℤ,+), then the value of the n-fold repetition of G is exponentially decaying.

Abstract

In a $3$-$\mathsf{XOR}$ game $\mathcal{G}$, the verifier samples a challenge $(x,y,z)\sim μ$ where $μ$ is a probability distribution over $Σ\timesΓ\timesΦ$, and a map $t\colon Σ\timesΓ\timesΦ\to\mathcal{A}$ for a finite Abelian group $\mathcal{A}$ defining a constraint. The verifier sends the questions $x$, $y$ and $z$ to the players Alice, Bob and Charlie respectively, receives answers $f(x)$, $g(y)$ and $h(z)$ that are elements in $\mathcal{A}$ and accepts if $f(x)+g(y)+h(z) = t(x,y,z)$. The value, $\mathsf{val}(\mathcal{G})$, of the game is defined to be the maximum probability the verifier accepts over all players' strategies. We show that if $\mathcal{G}$ is a $3$-$\mathsf{XOR}$ game with value strictly less than $1$, whose underlying distribution over questions $μ$ does not admit Abelian embeddings into $(\mathbb{Z},+)$, then the value of the $n$-fold repetition of $\mathcal{G}$ is exponentially decaying. That is, there exists $c=c(\mathcal{G})>0$ such that $\mathsf{val}(\mathcal{G}^{\otimes n})\leq 2^{-cn}$. This extends a previous result of [Braverman-Khot-Minzer, FOCS 2023] showing exponential decay for the GHZ game. Our proof combines tools from additive combinatorics and tools from discrete Fourier analysis.

Theorems & Definitions (104)

• Definition 1.1: Embeddings
• Definition 1.2: Pairwise-connected
• Lemma 1.3
• proof
• Theorem 1
• Lemma 2.1
• Lemma 2.2: Two-dimensional case
• proof
• Theorem 2
• Theorem 3