Parallel Repetition for the GHZ Game: Exponential Decay

11/24/2022
by   Mark Braverman, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/14/2022

Parallel Repetition For All 3-Player Games Over Binary Alphabet

We prove that for every 3-player game with binary questions and answers ...
research
04/02/2022

Polynomial Bounds On Parallel Repetition For All 3-Player Games With Binary Inputs

We prove that for every 3-player (3-prover) game 𝒢 with value less than ...
research
08/12/2020

A Parallel Repetition Theorem for the GHZ Game

We prove that parallel repetition of the (3-player) GHZ game reduces the...
research
07/13/2021

Parallel Repetition for the GHZ Game: A Simpler Proof

We give a new proof of the fact that the parallel repetition of the (3-p...
research
08/16/2021

Expected Values for Variable Network Games

A network game assigns a level of collectively generated wealth to every...
research
12/04/2017

Replication Ethics

Suppose some future technology enables the same consciously experienced ...
research
11/23/2022

Improved Elekes-Szabó type estimates using proximity

We prove a new Elekes-Szabó type estimate on the size of the intersectio...

Please sign up or login with your details

Forgot password? Click here to reset