Near-Optimal and Explicit Bell Inequality Violations

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

16 pages LaTeX. To appear in Proceedings of IEEE Complexity 2011. Supersedes arXiv:1007.2359

Scientific paper

Bell inequality violations correspond to behavior of entangled quantum systems that cannot be simulated classically. We give two new two-player games with Bell inequality violations that are stronger, fully explicit, and arguably simpler than earlier work. The first game is based on the Hidden Matching problem of quantum communication complexity, introduced by Bar-Yossef, Jayram, and Kerenidis. This game can be won with probability~1 by a quantum strategy using a maximally entangled state with local dimension $n$ (e.g., $\log n$ EPR-pairs), while we show that the winning probability of any classical strategy differs from 1/2 by at most $O(\log n/\sqrt{n})$. The second game is based on the integrality gap for Unique Games by Khot and Vishnoi and the quantum rounding procedure of Kempe, Regev, and Toner. Here $n$-dimensional entanglement allows to win the game with probability $1/(\log n)^2$, while the best winning probability without entanglement is $1/n$. This near-linear ratio ("Bell inequality violation") is near-optimal, both in terms of the local dimension of the entangled state, and in terms of the number of possible outputs of the two players.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Near-Optimal and Explicit Bell Inequality Violations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Near-Optimal and Explicit Bell Inequality Violations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Near-Optimal and Explicit Bell Inequality Violations will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-582552

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.