Reducing the number of inputs in nonlocal games
classification
🪐 quant-ph
keywords
gamebetabiasclassicalinputsmanymethodnonlocal
read the original abstract
In this work we show how a vector-valued version of Schechtman's empirical method can be used to reduce the number of inputs in a nonlocal game $G$ while preserving the quotient $\beta^*(G)/\beta(G)$ of the quantum over the classical bias. We apply our method to the Khot-Vishnoi game, with exponentially many questions per player, to produce another game with polynomially many ($N\approx n^8$) questions so that the quantum over the classical bias is $\Omega (n/\log^2 n)$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.