Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This research removes the non-physical restriction of symmetric projective maximally entangled strategies, proving that robust self-testing holds for all strategies in perfect synchronous games. By extending these results to the Quantum Low Degree Test, the authors establish a more physically relevant framework for certifying quantum protocols without relying on idealized assumptions. This advancement strengthens the theoretical foundations required for verifying complex quantum computations and communication schemes.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Lifting the maximally-entangledness assumption in robust self-testing for synchronous games

arXiv2 min read

arXiv:2505.05994v2 Announce Type: replace Abstract: Robust self-testing in non-local games allows a classical referee to certify that two untrustworthy players are able to perform a specific quantum strategy up to high precision. Proving robust self-testing results becomes significantly easier when one restricts the allowed strategies to symmetric projective maximally entangled (PME) strategies, which allow natural descriptions in terms of tracial von Neumann algebras. This has been exploited in the celebrated MIP*=RE paper and related articles to prove robust self-testing results for synchronous games when restricting to PME strategies. However, the PME assumptions are not physical, so these results need to be upgraded to make them physically relevant. In this work, we do just that: we prove that any perfect synchronous game which is a robust self-test when restricted to PME strategies, is in fact a robust self-test for all strategies. We then apply our result to the Quantum Low Degree Test to find an efficient $n$-qubit test.

Abstract:Robust self-testing in non-local games allows a classical referee to certify that two untrustworthy players are able to perform a specific quantum strategy up to high precision. Proving robust self-testing results becomes significantly easier when one restricts the allowed strategies to symmetric projective maximally entangled (PME) strategies, which allow natural descriptions in terms of tracial von Neumann algebras. This has been exploited in the celebrated MIP*=RE paper and related articles to prove robust self-testing results for synchronous games when restricting to PME strategies. However, the PME assumptions are not physical, so these results need to be upgraded to make them physically relevant. In this work, we do just that: we prove that any perfect synchronous game which is a robust self-test when restricted to PME strategies, is in fact a robust self-test for all strategies. We then apply our result to the Quantum Low Degree Test to find an efficient $n$-qubit test.

51 pages, comments welcome. Accepted in Quantum

Quantum Physics (quant-ph); Operator Algebras (math.OA)

arXiv:2505.05994 [quant-ph]

(or arXiv:2505.05994v2 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2505.05994 Focus to learn more arXiv-issued DOI via DataCite

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 · 254 words

Related coverage