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

TL;DR

This paper extends robust self-testing results from symmetric projective maximally entangled strategies to all strategies in synchronous games, making the results more physically relevant and applicable.

Contribution

It proves that perfect synchronous games that are robust self-tests under PME strategies are also robust self-tests for all strategies, removing the PME restriction.

Findings

Robust self-testing results are valid for all strategies in perfect synchronous games.

Application to Quantum Low Degree Test yields an efficient n-qubit test.

Extends the physical relevance of previous theoretical results.

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.