Article

Better Non-Local Games from Hidden Matching

07/2010;
Source: arXiv

ABSTRACT We construct a non-locality game that can be won with certainty by a quantum strategy using log n shared EPR-pairs, while any classical strategy has winning probability at most 1/2+O(log n/sqrt{n}). This improves upon a recent result of Junge et al. in a number of ways. Comment: 11 pages, latex

0 Bookmarks
 · 
64 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper we obtain violations of general bipartite Bell inequalities of order $\frac{\sqrt{n}}{\log n}$ with $n$ inputs, $n$ outputs and $n$-dimensional Hilbert spaces. Moreover, we construct explicitly, up to a random choice of signs, all the elements involved in such violations: the coefficients of the Bell inequalities, POVMs measurements and quantum states. Analyzing this construction we find that, even though entanglement is necessary to obtain violation of Bell inequalities, the Entropy of entanglement of the underlying state is essentially irrelevant in obtaining large violation. We also indicate why the maximally entangled state is a rather poor candidate in producing large violations with arbitrary coefficients. However, we also show that for Bell inequalities with positive coefficients (in particular, games) the maximally entangled state achieves the largest violation up to a logarithmic factor.
    Communications in Mathematical Physics 07/2010; 306. · 1.97 Impact Factor

Full-text (2 Sources)

Download
32 Downloads
Available from
May 20, 2014