Robust Bell inequalities from communication complexity

GABRIEL SENNO; MATHIEU LAURIÈRE; ALEXANDRE NOLIN; JÉRÉMIE ROLAND; SOPHIE LAPLANTE

Seattle

Conferencia; 20th Conference on Quantum Information Processing (QIP); 2017

In this work we show how to obtain large Bell violations for quantum distribu-tions, from any gap between quantum communication complexity and the classical partition bound. This applies to most of the usually studied functions in communication complexity (Disjointness, Vector in Subspace, Tribes, etc). The violations obtainable from our construction are resistant to the detection loophole and, at the expense of an increase in the number of outputs, can be also made resistant to uniform noise.