Parallel Repetition for the GHZ Game: Exponential Decay
Mark Braverman, Subhash Khot, Dor Minzer
2023年份
2被引次数
4顶会引用
摘要
We show that the value of the n-fold repeated GHZ game is at most , 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
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper4
- Strong Bounds for 3-ProgressionsZander Kelley, Raghu MekaFOCS 2023 · 被引用 24 次
- On Approximability of Satisfiable k-CSPs: IVAmey Bhangale, Subhash Khot, Dor MinzerSTOC 2024 · 被引用 2 次
- An Analytical Approach to Parallel Repetition via CSP Inverse TheoremsAmey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu 等STOC 2026
- Parallel Repetition for 3-Player XOR GamesAmey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu 等STOC 2025
它引用的顶会 Paper2
相关 Paper
- Polynomial-Time Tolerant Testing Stabilizer StatesSrinivasan Arunachalam, Arkopal DuttSTOC 2025 · 被引用 4 次
- Quasipolynomial Bounds for the Corners TheoremMichael Jaber, Yang P. Liu, Shachar Lovett, Anthony Ostuni 等FOCS 2025 · 被引用 2 次
- Quadratic Lower Bounds on the Approximate Stabilizer Rank: A Probabilistic ApproachSaeed Mehraban, Mehrdad TahmasbiSTOC 2024 · 被引用 2 次
- Hedging in games: Faster convergence of external and swap regretsXi Chen, Binghui PengNeurIPS 2020 · 被引用 88 次
- A near-optimal quadratic Goldreich-Levin algorithm (extended abstract)Jop Briët, Davi Castro-SilvaSODA 2026 · 被引用 1 次
