We show that the value of the n-fold repeated GHZ game is at most 2−Ω(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.
Cite
@article{arxiv.2211.13741,
title = {Parallel Repetition for the GHZ Game: Exponential Decay},
author = {Mark Braverman and Subhash Khot and Dor Minzer},
journal= {arXiv preprint arXiv:2211.13741},
year = {2022}
}