aiqbench analysis
This research removes a non-physical constraint from robust self-testing proofs for synchronous games, extending validity to all quantum strategies rather than just symmetric projective maximally entangled ones. By bridging this gap, the work strengthens the theoretical foundations required for device-independent verification and efficient quantum low-degree tests in practical scenarios. The advancement directly impacts the reliability of certifying untrustworthy players' quantum behaviors without relying on idealized assumptions.
Lifting the maximally-entangledness assumption in robust self-testing for synchronous games
Quantum 10, 2222 (2026). https://doi.org/10.22331/q-2026-10-01-2222 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.
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.
[1] Pedro Baptista, Ranyiliu Chen, Jędrzej Kaniewski, David Rasmussen Lolck, Laura Mančinska, Thor Gabelgaard Nielsen, and Simon Schmidt, ``A mathematical foundation for self-testing: Lifting common assumptions'' (2023). https://doi.org/10.1007/s00023-025-01642-3 arXiv:2310.12662
[2] Rajendra Bhatia ``Matrix analysis'' Springer (1997). https://doi.org/10.1007/978-1-4612-0653-8
[3] Joseph Bowles, Ivan Šupić, Daniel Cavalcanti, and Antonio Acín, ``Device-independent entanglement certification of all entangled states'' Physical Review Letters 121, 180503 (2018). https://doi.org/10.1103/PhysRevLett.121.180503
[4] Joseph Bowles, Ivan Šupić, Daniel Cavalcanti, and Antonio Acín, ``Self-testing of Pauli observables for device-independent entanglement certification'' Physical Review A 98, 042336 (2018). https://doi.org/10.1103/PhysRevA.98.042336
[5] Anne Broadbent, Arthur Mehta, and Yuming Zhao, ``Quantum Delegation with an Off-The-Shelf Device'' 19th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2024) 310, 12:1–12:23 (2024). https://doi.org/10.4230/LIPIcs.TQC.2024.12
[6] Rui Chao, Ben W. Reichardt, Chris Sutherland, and Thomas Vidick, ``Overlapping Qubits'' 8th Innovations in Theoretical Computer Science Conference (ITCS 2017) 67, 48:1–48:21 (2017). https://doi.org/10.4230/LIPIcs.ITCS.2017.48
[7] Michael Chapman, Thomas Vidick, and Henry Yuen, ``Efficiently stable presentations from error-correcting codes'' (2023). https://doi.org/10.19086/da.154623 arXiv:2311.04681
[8] Andrea Coladangelo, Alex B. Grilo, Stacey Jeffery, and Thomas Vidick, ``Verifier-on-a-Leash: New Schemes for Verifiable Delegated Quantum Computation, with Quasilinear Resources'' Advances in Cryptology – EUROCRYPT 2019, Part III 11478, 247–277 (2019). https://doi.org/10.1007/978-3-030-17659-4_9
[9] John B. Conway ``A course in functional analysis'' Springer Science+Business Media (2010). https://doi.org/10.1007/978-1-4757-4383-8
[10] Yangjing Dong, Honghao Fu, Anand Natarajan, Minglong Qin, Haochen Xu, and Penghui Yao, ``The Computational Advantage of MIP$^*$ Vanishes in the Presence of Noise'' 39th Computational Complexity Conference (CCC 2024) 300, 30:1–30:71 (2024). https://doi.org/10.4230/LIPIcs.CCC.2024.30
[11] J. William Helton, Kyle P. Meyer, Vern I. Paulsen, and Matthew Satriano, ``Algebras, synchronous games, and chromatic numbers of graphs'' New York Journal of Mathematics 25, 328–361 (2019). https://doi.org/10.48550/arXiv.1703.00960
[12] Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, and Henry Yuen, ``MIP*=RE'' (2022). https://doi.org/10.48550/arXiv.2001.04383 arXiv:2001.04383
[13] Prem Nigam Kar ``Robust Self-testing for Synchronous Correlations and Games'' (2025). https://doi.org/10.48550/arXiv.2503.23500 arXiv:2503.23500
[14] Se-Jin Kim, Vern Paulsen, and Christopher Schafhauser, ``A synchronous game for binary constraint systems'' Journal of Mathematical Physics 59, 032201 (2018). https://doi.org/10.1063/1.4996867
[15] Junqiao Lin ``Tracial embeddable strategies: Lifting MIP* tricks to MIPco'' (2024). https://doi.org/10.48550/arXiv.2304.01940 arXiv:2304.01940
[16] Amine Marrakchiand Mikael de la Salle ``Almost synchronous correlations and Tomita-Takesaki theory'' (2023). https://doi.org/10.7900/jot.2025jan29.2507 arXiv:2307.08129
[17] Dominic Mayersand Andrew Yao ``Self Testing Quantum Apparatus'' Quantum Info. Comput. 4, 273–286 (2004). https://doi.org/10.26421/QIC4.4-3
[18] Hamoon Mousavi, Seyed Sajjad Nezhadi, and Henry Yuen, ``Nonlocal Games, Compression Theorems, and the Arithmetical Hierarchy'' Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (STOC) 1–11 (2022). https://doi.org/10.1145/3519935.3519949
[19] Anand Natarajanand Tina Zhang ``Quantum Free Games'' Proceedings of the 55th Annual ACM Symposium on Theory of Computing (STOC) 1603–1616 (2023). https://doi.org/10.1145/3564246.3585208
[20] Connor Paddock ``Rounding near-optimal quantum strategies for nonlocal games to strategies using maximally entangled states'' (2025). https://doi.org/10.1063/5.0209725 arXiv:2203.02525
[21] Connor Paddock, William Slofstra, Yuming Zhao, and Yangchen Zhou, ``An operator-algebraic formulation of self-testing'' Annales Henri Poincaré 25, 4283–4319 (2024). https://doi.org/10.1007/s00023-023-01378-y
[22] Vern I. Paulsen, Simone Severini, Daniel Stahlke, Ivan G. Todorov, and Andreas Winter, ``Estimating quantum chromatic numbers'' Journal of Functional Analysis 270, 2188–2222 (2016). https://doi.org/10.1016/j.jfa.2016.01.010
[23] Sandu Popescuand Daniel Rohrlich ``Which states violate Bell's inequality maximally?'' Physics Letters A 169, 411–414 (1992). https://doi.org/10.1016/0375-9601(92)90819-8
[24] Minglong Qinand Penghui Yao ``Nonlocal Games with Noisy Maximally Entangled States are Decidable'' SIAM Journal on Computing 50, 1800–1891 (2021). https://doi.org/10.1137/20M134592X
[25] Minglong Qinand Penghui Yao ``Decidability of Fully Quantum Nonlocal Games with Noisy Maximally Entangled States'' 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023) 261, 97:1–97:20 (2023). https://doi.org/10.4230/LIPIcs.ICALP.2023.97
[26] Iain Raeburnand Dana P. Williams ``Morita equivalence and continuous-trace C*-algebras'' American Mathematical Society (1998). https://doi.org/10.1090/surv/060
[27] Ben W. Reichardt, Falk Unger, and Umesh Vazirani, ``Classical command of quantum systems'' Nature 496, 456–460 (2013). https://doi.org/10.1038/nature12035
[28] Mikael de la Salle ``Orthogonalization of Positive Operator Valued Measures'' Comptes Rendus. Mathématique 360, 549–560 (2022). https://doi.org/10.5802/crmath.326
[29] Mikael de la Salle ``Spectral gap and stability for groups and non-local games'' (2022). https://doi.org/10.5802/jep.314 arXiv:2204.07084
[30] Stephen J. Summersand Reinhard F. Werner ``Maximal violation of Bell's inequalities is generic in quantum field theory'' Communications in Mathematical Physics 110, 247–259 (1987). https://doi.org/10.1007/BF01207366
[31] Boris S. Tsirel'son ``Quantum analogues of the Bell inequalities. The case of two spatially separated domains'' Journal of Soviet Mathematics 36, 557–570 (1987). https://doi.org/10.1007/BF01663472
[32] Thomas Vidick ``Almost synchronous quantum correlations'' Journal of Mathematical Physics 63, 022201 (2022). https://doi.org/10.1063/5.0056512
[33] Yuming Zhao ``Robust self-testing for nonlocal games with robust game algebras'' (2024). https://doi.org/10.48550/arXiv.2411.03259 arXiv:2411.03259
Could not fetch Crossref cited-by data during last attempt 2026-10-01 08:28:36: Could not fetch cited-by data for 10.22331/q-2026-10-01-2222 from Crossref. This is normal if the DOI was registered recently. Could not fetch ADS cited-by data during last attempt 2026-10-01 08:28:36: Cannot retrieve data from ADS due to rate limitations.
Full text under the publisher's open licence · 917 words
Related coverage
Lifting the maximally-entangledness assumption in robust self-testing for synchronous games
arXiv · Sep 11, 2026
Quantum self-testing no longer relies on ideal entanglement
Quantum Zeitgeist · Oct 1, 2026
Tactical and Operational Exploratory Modeling for AI Governance
LessWrong · Jun 17, 2026
Deconfusing Corrigibility
AI Alignment Forum · Oct 17, 2026