  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.
