Score: 1

Nonlocal Games and Self-tests in the Presence of Noise

Published: September 24, 2025 | arXiv ID: 2509.20350v1

By: Honghao Fu , Minglong Qin , Haochen Xu and more

Potential Business Impact:

Tests quantum computers even when they make mistakes.

Business Areas:
A/B Testing Data and Analytics

Self-testing is a key characteristic of certain nonlocal games, which allow one to uniquely determine the underlying quantum state and measurement operators used by the players, based solely on their observed input-output correlations [MY04]. Motivated by the limitations of current quantum devices, we study self-testing in the high-noise regime, where the two players are restricted to sharing many copies of a noisy entangled state with an arbitrary constant noise rate. In this setting, many existing self-tests fail to certify any nontrivial structure. We first characterize the maximal winning probabilities of the CHSH game [CHSH69], the Magic Square game [Mer90a], and the 2-out-of-n CHSH game [CRSV18] as functions of the noise rate, under the assumption that players use traceless observables. These results enable the construction of device-independent protocols for estimating the noise rate. Building on this analysis, we show that these three games--together with an additional test enforcing the tracelessness of binary observables--can self-test one, two, and n pairs of anticommuting Pauli operators, respectively. These are the first known self-tests that are robust in the high-noise regime and remain sound even when the players' measurements are noisy. Our proofs rely on Sum-of-Squares (SoS) decompositions and Pauli analysis techniques developed in the contexts of quantum proof systems and quantum learning theory.

Country of Origin
πŸ‡ΊπŸ‡Έ πŸ‡ΈπŸ‡¬ πŸ‡¨πŸ‡¦ Singapore, United States, Canada

Page Count
46 pages

Category
Physics:
Quantum Physics