Better Non-Local Games from Hidden Matching

TL;DR

This paper introduces a new non-locality game demonstrating a significant quantum advantage, where quantum strategies outperform classical ones in winning probability, using a logarithmic number of shared entangled pairs.

Contribution

The paper constructs a non-locality game that achieves perfect quantum winning with log n entangled pairs, surpassing previous classical bounds and improving upon recent results.

Findings

Quantum strategy wins with certainty using log n EPR-pairs.

Classical strategies have at most 1/2 + O(log n / sqrt{n}) winning probability.

The result advances understanding of quantum non-locality and entanglement advantages.

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.