Reducing the number of inputs in nonlocal games
arXiv:1603.02581 · doi:10.1063/1.4965831
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 while preserving the quotient 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 () questions so that the quantum over the classical bias is .
References in corpus (10)
- Experimental loophole-free violation of a Bell inequality using entangled electron spins separated by 1.3 km
- Noncommutative vector valued -spaces and completely -summing maps
- Large violation of Bell inequalities with low entanglement
- Super-activation of quantum non-locality
- Operator Space theory: a natural framework for Bell inequalities
- Unbounded violations of bipartite Bell Inequalities via Operator Space theory
- Survey on Nonlocal Games and Operator Space Theory
- Local quasi hidden variable modelling and violations of Bell-type inequalities by a multipartite quantum state
- Near-Optimal and Explicit Bell Inequality Violations
- Large bipartite Bell violations with dichotomic measurements
Cited by in corpus (6)
- Entanglement in non-local games and the hyperlinear profile of groups
- Bell's nonlocality in a general nonsignaling case: quantitatively and conceptually
- Robust Bell inequalities from communication complexity
- Random constructions in Bell inequalities: A survey
- New concise upper bounds on quantum violation of general multipartite Bell inequalities
- Specifying nonlocality of a pure bipartite state and analytical relations between measures for bipartite nonlocality and entanglement