2000 character limit reached
Parallel Repetition for the GHZ Game: Exponential Decay
Published 24 Nov 2022 in cs.CC | (2211.13741v1)
Abstract: We show that the value of the $n$-fold repeated GHZ game is at most $2{-\Omega(n)}$, improving upon the polynomial bound established by Holmgren and Raz. Our result is established via a reduction to approximate subgroup type questions from additive combinatorics.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
