arXiv:2609.24349
Robust self-testing of nonmaximal entanglement from a reduced inner product game
Ranyiliu Chen
Abstract
We reduce Lalonde's pseudo-telepathy inner product game from six to five dimensions, keeping its four Alice questions and three Bob questions and reducing each answer alphabet to five. We prove that the reduced game self-tests its nonmaximally entangled state and all 35 measurement effects. The self-test is also robust: for a strategy winning with probability at least $1-\varepsilon$ we obtain $d_{\mathrm{ext}}\le\min\{1,2^{21}\sqrt{\varepsilon}\}$, where $d_{\mathrm{ext}}=\sqrt{1-Ξ}$ and $Ξ$ is the optimal squared fidelity with the reference state under local extraction channels. A compactness argument then gives simultaneous qualitative robustness for all measurement actions on the state under common local isometries. As a consequence of the self-test, no maximally entangled state of any finite dimension can win the game perfectly.
AI Summary
Can perfect winning in a nonlocal game certify a specific nonmaximally entangled state and all measurement actions? This paper studies a five-dimensional reduction of Lalonde’s inner product game, whose six-dimensional version already rules out perfect play with finite-dimensional maximal entanglement. The reduction retains four Alice questions and three Bob questions while reducing both answer alphabets from six to five. The reduced game has classical value $11/12$ and quantum value one. Every perfect finite-dimensional strategy self-tests the state $|\psi_\star\rangle=(2|00\rangle+2|11\rangle+2|22\rangle+2|33\rangle+|44\rangle)/\sqrt{17}$ and all 35 labeled measurement effects, up to local isometries and residual systems. Consequently, the perfect correlation table is unique, and no finite-dimensional maximally entangled state wins perfectly. For winning probability at least $1-\varepsilon$, local extraction achieves $d_{\mathrm{ext}}=\sqrt{1-\Xi}\leq\min\{1,2^{21}\sqrt{\varepsilon}\}$, where $\Xi$ is the optimal squared fidelity with the target under local channels. The results include mixed states and POVMs. The proof uses forbidden outcomes to recover five matching local labels, align four equal-amplitude components, and impose a fifth amplitude half as large through three binary agreement tests and one disagreement test. Pair sums and differences identify the measurements. Direct bounded-operator estimates yield the state bound; extending exact identities to commuting-operator representations enables a compactness argument for simultaneous, dimension-independent qualitative robustness of all measurement actions. The state prefactor is unoptimized and large, measurement robustness has no explicit rate, and no minimality claim is made for the dimension or question and answer counts.
Several frontier LLMs was used under human direction to generate exploratory proofs, prepare and revise the manuscript.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 10 + 21 pages