arXiv:2610.06512
The right entanglement for perfect nonlocality and zero-error communication
Laura Mančinska
Abstract
We identify a structural mechanism by which perfect play in a nonlocal game requires and self-tests a specific non-maximally entangled state. To this end, we construct a Flagged Magic-Square game by extending the standard Magic-Square game with an additional ``flag'' outcome and two additional questions for each player. The game admits a perfect strategy using a state with Schmidt coefficients proportional to $(1,\sqrt{2},\sqrt{2},\sqrt{2},\sqrt{2})$. We give a direct algebraic proof that maximally entangled strategies have winning probability bounded away from one, independently of dimension. Moreover, the game self-tests this state, providing an example of a two-party pseudo-telepathy game that certifies a specific non-maximally entangled state. Our construction illustrates how adding suitable constraints to a rigid measurement geometry can enforce specific Schmidt ratios and provides a modular route to further self-tests based on other rigid pseudo-telepathy games. We establish a general game-to-channel reduction that transfers separations in the game model to one-shot zero-error communication over classical channels. Applied to the Flagged Magic-Square game, it yields a classical channel for which entanglement permits the zero-error transmission of ten messages in a single use, whereas any finite-dimensional maximally entangled resource permits at most nine. Thus, maximally entangled states are not a universally optimal entanglement resource for zero-error communication over classical noisy channels.
AI Summary
The paper asks how perfect nonlocal play can enforce a specific non-maximal Schmidt spectrum, and whether maximally entangled states suffice for optimal one-shot zero-error communication over classical channels. It builds on existing separations between maximal and non-maximal entanglement for pseudo-telepathy. The Flagged Magic-Square game adds a flag outcome and two questions per player to Magic-Square, giving five questions and five answers per player. A perfect strategy uses the Schmidt coefficients $(1,\sqrt2,\sqrt2,\sqrt2,\sqrt2)/3$. Calibration constraints couple a flag sector to selected Magic-Square directions; their overlaps of magnitude $1/\sqrt2$ force the Schmidt ratio $\sqrt2$ through cancellation of losing amplitudes. An algebraic proof excludes perfect tracial strategies; compactness then gives $\omega_{\mathrm{ME}}\leq\omega_{\mathrm{tr}}<1$, uniformly over dimension, without an explicit numerical gap. The game exactly self-tests the state and measurements for finite-dimensional pure strategies with arbitrary POVMs. A general game-to-channel reduction equates perfect play with transmitting $q=|X|+|Y|$ messages at zero error. It maps Schmidt coefficients to their normalized square roots and preserves maximal entanglement. Applied here, it produces a 50-input classical channel allowing ten messages with non-maximal entanglement but at most nine with any finite-dimensional maximally entangled resource. The flagging construction extends to suitable rigid base games, including a rank-four target proportional to $(2,5,5,5)$. The self-tests are exact, not robust. Open questions include attainable Schmidt spectra, whether rank three suffices for a perfect-play separation, and whether parallel repetition drives the maximally entangled value to zero.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.