Pith. sign in

REVIEW

Reducing the number of inputs in nonlocal games

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1603.02581 v1 pith:TUPY2UBR submitted 2016-03-08 quant-ph

Reducing the number of inputs in nonlocal games

classification quant-ph
keywords gamebetabiasclassicalinputsmanymethodnonlocal
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
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)$.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.