arXiv:2609.25117
A non-robust quantum correlation self-test
Ranyiliu Chen, Yuming Zhao
Abstract
We show that exact self-testing of a quantum correlation does not imply robust self-testing. Mančinska and Schmidt previously established such a separation for non-local games, but their obstruction to robustness arises from two distinct optimal correlations, with the self-tested one remaining robust. We establish the separation for a single correlation. Our proof is operator-algebraic. The main technical contribution is a general construction that associates a synchronous binary correlation to any finitely presented C*-algebra with unitary generators and real-coefficient relations. The implementing states of the correlation correspond exactly to the tracial states on the algebra. We apply this construction to an algebra with a unique finite-dimensional tracial state and a distinct amenable tracial state. By a characterization established by Zhao and independently by Kar, the resulting correlation is a self-test but not a robust self-test.
AI Summary
Does exact self-testing of a single quantum correlation imply robust self-testing? This paper answers negatively. Unlike the previous separation for nonlocal games, where near-optimal strategies approach a different correlation, the obstruction here persists for strategies whose correlations converge to the self-tested correlation itself. The explicit example is an extreme synchronous binary correlation with $250$ questions per party. It exactly self-tests a projective strategy using a maximally entangled state of Schmidt rank $36$, but is not robust. The proof uses existing characterizations: for extreme synchronous correlations, exact self-testing means uniqueness of the finite-dimensional implementing tracial state, whereas robustness means uniqueness of the amenable implementing trace. The main construction encodes any finitely presented unital $C^*$-algebra with unitary generators and real-coefficient relations into a synchronous binary correlation. Its implementing traces correspond bijectively to the algebra’s traces, preserving finite dimensionality and translating Connes embeddability into amenability. Applying this to an algebra built from irrational rotation relations supplies a unique finite-dimensional trace and a distinct amenable trace. Further consequences include an infinite-dimensional self-test in $C_{qa}\setminus C_q$ and an extreme correlation with uncountably many inequivalent realizations at fixed local dimension and shared state. For synchronous binary nonrobust self-tests, the paper proves lower bounds of four questions and ideal Schmidt rank three. The explicit construction is not size-optimized; the general encoding theorem requires finite presentation and real coefficients for its trace-factorization property.
ChatGPT (5.6 sol ultra) proposed an initial solution to the research problem formulated by the authors. The authors subsequently verified, simplified, and further developed the arguments.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- v2 added further applications