Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.06755

The Grothendieck Game and Self-Testing Continuous Groups

Alexander Kulpe, Giulio Malavolta, Simon Schmidt, Michael Walter

quant-phmath-phSubmitted Oct 5, 2026• Announced Oct 6, 2026• 0 citations
arXivHTMLPDF

Abstract

Self-testing certifies quantum states and measurements from observed correlations alone, without requiring a description of the devices that produce them. In this work we establish, to the best of our knowledge, the first robust self-test of the full continuous family of measurements generated by Majorana operators. We achieve this by showing that the Grothendieck game, a two-player nonlocal game in which the players receive directions on a sphere and return binary answers, is a self-test of Majorana observables. That is, any near-optimal performance certifies an entire continuously parameterized family of quantum measurements. We further extend this certification to products of Majorana observables, obtaining a robust self-test of the spin representation of the continuous pin group.

Related papers

Counterexamples in self-testing

Laura Mančinska, Simon Schmidt

In the recent years self-testing has grown into a rich and active area of study with applications ranging from practical verification of quantum devices to deep complexity theoretic results. Self-testing allows a classical verifier to deduce which quantum measurements and on what state are used, for example, by provers Alice and Bob in a nonlocal game. Hence, self-testing as well as its noise-tolerant cousin – robust self-testing – are desirable features for a nonlocal game to have.Contrary to what one might expect, we have a rather incomplete understanding of if and how self-testing could fail to hold. In particular, could it be that every 2-party nonlocal game or Bell inequality with a quantum advantage certifies the presence of a specific quantum state? Also, is it the case that every self-testing result can be turned robust with enough ingeniuty and effort? We answer these questions in the negative by providing simple and fully explicit counterexamples. To this end, given two nonlocal games G1 and G2 , we introduce the (G1∨G2) -game, in which the players get pairs of questions and choose which game they want to play. The players win if they choose the same game and win it with the answers they have given. Our counterexamples are based on this game and we believe this class of games to be of independent interest.

arXiv:2212.11572•Quantum•Jul 11, 2023•1 citation

Robust self-testing for nonlocal games with robust game algebras

Yuming Zhao

We give an operator-algebraic formulation of robust self-testing in terms of states on C*-algebras. We show that a quantum correlation p is a robust self-test only if among all (abstract) states, there is a unique one achieving p. We show that the "if" direction of this statement also holds, provided that p is optimal/perfect for a nonlocal game that has a robust game algebra. This last condition applies to many nonlocal games of interest, including all XOR games, synchronous games, and boolean constrained system (BCS) games. For those nonlocal games with robust game algebras, we prove that self-testing is equivalent to the uniqueness of finite-dimensional tracial states on the associated game algebra, and robust self-testing is equivalent to the uniqueness of amenable tracial states. Applying this tracial-state characterization of self-testing to parallel repetition, we show that a synchronous game is a self-test for perfect quantum strategies if and only if its parallel repeated version is a self-test for perfect quantum strategies. As a proof approach, we give the first quantitative Gower-Hatami theorem that is applicable to C*-algebras. Here "quantitative" means there is a constructive bound on the distance between the approximate representations and exact representations. We also demonstrate how this quantitative Gowers-Hatami theorem can be used to calculate the explicit robustness function of a self-test.

arXiv:2411.03259•Nov 5, 2024•0 citations

Robust self-testing of the $m-$partite maximally entangled state and observables

Ritesh K. Singh, Souradeep Sasmal, A. K. Pan

As quantum technologies continue to advance rapidly, the device-independent testing of the functioning of a quantum device has become increasingly important. Self-testing, a correlation based protocol, enables such certification of a promised quantum state as well as measurements performed on it without requiring knowledge of the device's internal workings. This approach typically relies on achieving the optimal quantum violation of a suitable Bell inequality. Self-testing has been extensively investigated in the context of bipartite Bell experiments. However, its extension to multipartite scenarios remains largely unexplored, owing to the intricate nature of multipartite quantum correlations. In this work, we propose a simple and efficient self-testing protocol that certifies the state and observables based on the optimal quantum violation of the Svetlichny inequality involving an arbitrary number of parties, each with two inputs. Our method leverages an elegant sum-of-squares approach to derive the optimal quantum value of the Svetlichny functional, devoid of assuming the dimension of the quantum system. This enables the self-testing of the $m-$partite maximally entangled state and local anti-commuting observables for each party. Moreover, we develop a swap circuit isometry to assess the proximity of reference states and measurements to their ideal counterparts in the presence of noise and imperfections in real experiments, thereby demonstrating the robustness of our self-testing protocol. Finally, we illustrate how our self-testing protocol facilitates the generation of certified genuine randomness from correlations that enable the optimal violation of the Svetlichny inequality.

arXiv:2408.10732•Aug 20, 2024•0 citations

Robust Self-testing for Synchronous Correlations and Games

Prem Nigam Kar

We develop an abstract operator-algebraic characterization of robust self-testing for synchronous correlations and games. Specifically, we show that a synchronous correlation is a robust self-test if and only if there is a unique state on an appropriate $C^*$-algebra that "implements" the correlation. Extending this result, we prove that a synchronous game is a robust self-test if and only if its associated $C^*$-algebra admits a unique amenable tracial state. This framework allows us to establish that all synchronous correlations and games that serve as commuting operator self-tests for finite-dimensional strategies are also robust self-tests. As an application, we recover sufficient conditions for linear constraint system games to exhibit robust self-testing. We also demonstrate the existence of a synchronous nonlocal game that is a robust self-test but not a commuting operator self-test, showing that these notions are not equivalent.

arXiv:2503.23500•Mar 30, 2025•0 citations

Robust and Versatile Black-Box Certification of Quantum Devices

Tzyh Haur Yang, Tamás Vértesi, Jean-Daniel Bancal +2 more

Self-testing refers to the fact that, in some quantum devices, both states and measurements can be assessed in a black-box scenario, on the sole basis of the observed statistics, i.e., without reference to any prior device calibration. Only a few examples of self-testing are known, and they just provide nontrivial assessment for devices performing unrealistically close to the ideal case. We overcome these difficulties by approaching self-testing with the semidefinite programing hierarchy for the characterization of quantum correlations. This allows us to improve dramatically the robustness of previous self-testing schemes; e.g., we show that a Clauser-Horne-Shimony-Holt violation larger than 2.57 certifies a singlet fidelity of more than 70%. In addition, the versatility of the tool brings about self-testing of hitherto impossible cases, such as the robust self-testing of nonmaximally entangled two-qutrit states in the Collins-Gisin-Linden-Massar-Popescu scenario.

arXiv:1406.7127•Physical Review Letters•Jul 22, 2014•131 citations

A non-robust quantum correlation self-test

Ranyiliu Chen, Yuming Zhao

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.

quant-pharXiv:2609.25117•Sep 22, 2026•0 citations
Self-testing certifies quantum states and measurements from observed correlations alone, without requiring a description of the devices that produce them. In this work we establish, to the best of our knowledge, the first robust self-test of the full continuous family of measurements generated by Majorana operators. We achieve this by showing that the Grothendieck game, a two-player nonlocal game in which the players receive directions on a sphere and return binary answers, is a self-test of Majorana observables. That is, any near-optimal performance certifies an entire continuously parameterized family of quantum measurements. We further extend this certification to products of Majorana observables, obtaining a robust self-test of the spin representation of the continuous pin group.
In the recent years self-testing has grown into a rich and active area of study with applications ranging from practical verification of quantum devices to deep complexity theoretic results. Self-testing allows a classical verifier to deduce which quantum measurements and on what state are used, for example, by provers Alice and Bob in a nonlocal game. Hence, self-testing as well as its noise-tolerant cousin – robust self-testing – are desirable features for a nonlocal game to have.Contrary to what one might expect, we have a rather incomplete understanding of if and how self-testing could fail to hold. In particular, could it be that every 2-party nonlocal game or Bell inequality with a quantum advantage certifies the presence of a specific quantum state? Also, is it the case that every self-testing result can be turned robust with enough ingeniuty and effort? We answer these questions in the negative by providing simple and fully explicit counterexamples. To this end, given two nonlocal games G1 and G2 , we introduce the (G1∨G2) -game, in which the players get pairs of questions and choose which game they want to play. The players win if they choose the same game and win it with the answers they have given. Our counterexamples are based on this game and we believe this class of games to be of independent interest.
We give an operator-algebraic formulation of robust self-testing in terms of states on C*-algebras. We show that a quantum correlation p is a robust self-test only if among all (abstract) states, there is a unique one achieving p. We show that the "if" direction of this statement also holds, provided that p is optimal/perfect for a nonlocal game that has a robust game algebra. This last condition applies to many nonlocal games of interest, including all XOR games, synchronous games, and boolean constrained system (BCS) games. For those nonlocal games with robust game algebras, we prove that self-testing is equivalent to the uniqueness of finite-dimensional tracial states on the associated game algebra, and robust self-testing is equivalent to the uniqueness of amenable tracial states. Applying this tracial-state characterization of self-testing to parallel repetition, we show that a synchronous game is a self-test for perfect quantum strategies if and only if its parallel repeated version is a self-test for perfect quantum strategies. As a proof approach, we give the first quantitative Gower-Hatami theorem that is applicable to C*-algebras. Here "quantitative" means there is a constructive bound on the distance between the approximate representations and exact representations. We also demonstrate how this quantitative Gowers-Hatami theorem can be used to calculate the explicit robustness function of a self-test.
Robust self-testing of the m−m-m−partite maximally entangled state and observables
As quantum technologies continue to advance rapidly, the device-independent testing of the functioning of a quantum device has become increasingly important. Self-testing, a correlation based protocol, enables such certification of a promised quantum state as well as measurements performed on it without requiring knowledge of the device's internal workings. This approach typically relies on achieving the optimal quantum violation of a suitable Bell inequality. Self-testing has been extensively investigated in the context of bipartite Bell experiments. However, its extension to multipartite scenarios remains largely unexplored, owing to the intricate nature of multipartite quantum correlations. In this work, we propose a simple and efficient self-testing protocol that certifies the state and observables based on the optimal quantum violation of the Svetlichny inequality involving an arbitrary number of parties, each with two inputs. Our method leverages an elegant sum-of-squares approach to derive the optimal quantum value of the Svetlichny functional, devoid of assuming the dimension of the quantum system. This enables the self-testing of the m−m-m−partite maximally entangled state and local anti-commuting observables for each party. Moreover, we develop a swap circuit isometry to assess the proximity of reference states and measurements to their ideal counterparts in the presence of noise and imperfections in real experiments, thereby demonstrating the robustness of our self-testing protocol. Finally, we illustrate how our self-testing protocol facilitates the generation of certified genuine randomness from correlations that enable the optimal violation of the Svetlichny inequality.
We develop an abstract operator-algebraic characterization of robust self-testing for synchronous correlations and games. Specifically, we show that a synchronous correlation is a robust self-test if and only if there is a unique state on an appropriate C∗C^*C∗-algebra that "implements" the correlation. Extending this result, we prove that a synchronous game is a robust self-test if and only if its associated C∗C^*C∗-algebra admits a unique amenable tracial state. This framework allows us to establish that all synchronous correlations and games that serve as commuting operator self-tests for finite-dimensional strategies are also robust self-tests. As an application, we recover sufficient conditions for linear constraint system games to exhibit robust self-testing. We also demonstrate the existence of a synchronous nonlocal game that is a robust self-test but not a commuting operator self-test, showing that these notions are not equivalent.
Self-testing refers to the fact that, in some quantum devices, both states and measurements can be assessed in a black-box scenario, on the sole basis of the observed statistics, i.e., without reference to any prior device calibration. Only a few examples of self-testing are known, and they just provide nontrivial assessment for devices performing unrealistically close to the ideal case. We overcome these difficulties by approaching self-testing with the semidefinite programing hierarchy for the characterization of quantum correlations. This allows us to improve dramatically the robustness of previous self-testing schemes; e.g., we show that a Clauser-Horne-Shimony-Holt violation larger than 2.57 certifies a singlet fidelity of more than 70%. In addition, the versatility of the tool brings about self-testing of hitherto impossible cases, such as the robust self-testing of nonmaximally entangled two-qutrit states in the Collins-Gisin-Linden-Massar-Popescu scenario.
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.