@inproceedings{3bea6274384045b78ba9c9ecf6107779,
title = "Parallel Repetition for the GHZ Game: Exponential Decay",
abstract = "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.",
keywords = "Abelian Embeddings, Additive Combinatorics, Analysis of Boolean functions, GHZ game, Parallel Repetition",
author = "Mark Braverman and Subhash Khot and Dor Minzer",
note = "Publisher Copyright: {\textcopyright} 2023 IEEE.; 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023 ; Conference date: 06-11-2023 Through 09-11-2023",
year = "2023",
doi = "10.1109/FOCS57990.2023.00080",
language = "English (US)",
series = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",
publisher = "IEEE Computer Society",
pages = "1337--1341",
booktitle = "Proceedings - 2023 IEEE 64th Annual Symposium on Foundations of Computer Science, FOCS 2023",
}