Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This research establishes a fundamental theoretical distinction in quantum foundations by proving that exact self-testing of a quantum correlation does not guarantee robustness, even when relying on a single correlation rather than multiple optimal ones. The authors achieve this through an operator-algebraic construction linking synchronous binary correlations to specific C*-algebras with distinct tracial states, refining the understanding of how quantum devices can be verified against noise.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

A non-robust quantum correlation self-test

arXiv2 min read

arXiv:2609.25117v1 Announce Type: new Abstract: We show that exact self-testing of a quantum correlation does not imply robust self-testing. Man\v{c}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.

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.

arXiv:2609.25117 [quant-ph]

(or arXiv:2609.25117v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2609.25117 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 225 words

Related coverage