2000 character limit reached
Reducing the number of inputs in nonlocal games
Published 8 Mar 2016 in quant-ph | (1603.02581v1)
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 n8$) questions so that the quantum over the classical bias is $\Omega (n/\log2 n)$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.