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.

AI Summary

Can a single nonlocal game robustly self-test a continuously indexed measurement family? This paper studies the Grothendieck XOR game $G_n$: questions are sphere directions $(x,y)$ sampled with density proportional to $|\langle x,y\rangle|$, and binary answers must have product $\operatorname{sgn}\langle x,y\rangle$. Its classical and quantum biases are $z_n$ and $1/(nz_n)$, respectively, where $z_n=\mathbb E|\langle x,y\rangle|\sim\sqrt{2/(\pi n)}$. For even $n=2m$, any finite-dimensional strategy achieving at least $(1-\varepsilon)$ times the optimal quantum bias admits one pair of local isometries certifying the entire family $\gamma(x)=\sum_i x_i\gamma_i$. Squared state error relative to $m$ maximally entangled qubit pairs plus an auxiliary state is $O(n^2\varepsilon)$; sphere-averaged squared, state-dependent measurement errors are $O(n\varepsilon)$. Both dimension dependences are optimal among uniform bounds linear in $\varepsilon$. Randomized products of the devices’ observables additionally certify the spin representation of $\mathrm{Pin}(n)$, with squared error $O(n^3\varepsilon)$ averaged over group elements and rotations. The proof derives approximate linearity, consistency and anticommutation from near-optimality, selects a random orthonormal frame, and applies a state-dependent Gowers–Hatami rounding argument to the finite Clifford group. Rotation averaging extends certification to products. Additional results establish classical and vector-strategy rigidity and give an explicit compact-group rounding construction. Certification is averaged, not pointwise: measurements on any null set can change without affecting the score. The main theorems assume finite-dimensional tensor-product strategies and even $n$; implementing the pin-group construction requires unitary access to the observables.

No sign of AI-generated text

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

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•6 citations

Robust self-testing quantum states and binary nonlocal XOR games

Carl A. Miller, Yaoyun Shi

Self-testing a quantum device means verifying the existence of a certain quantum state as well as the effect of the associated measurements based only on the statistics of the measurement outcomes. Robust, i.e., error-tolerant, self-testing quantum devices are critical building blocks for quantum cryptographic protocols that rely on imperfect or untrusted quantum devices. We give a criterion which determines whether a given binary XOR game is robust self-testing with the asymptotically optimal error parameter. As an application, we prove that the celebrated CHSH game is an optimally robust self-test. We also prove the same for a family of tests recently proposed by Acin et al. (PRL 108:100402, 2012) for random number generation, thus extending the benefit of the latter tests to allow imperfect or untrusted quantum devices.

•Jul 7, 2012•1 citation

Optimal Robust Self-Testing by Binary Nonlocal XOR Games

Carl A. Miller, Yaoyun Shi

Self-testing a quantum apparatus means verifying the existence of a certain quantum state as well as the effect of the associated measuring devices based only on the statistics of the measurement outcomes. Robust (i.e., error-tolerant) self-testing quantum apparatuses are critical building blocks for quantum cryptographic protocols that rely on imperfect or untrusted devices. We devise a general scheme for proving optimal robust self-testing properties for tests based on nonlocal binary XOR games. We offer some simplified proofs of known results on self-testing, and also prove some new results.

Leibniz international proceedings in informatics•Jan 1, 2013•23 citations

Optimal robust quantum self-testing by binary nonlocal XOR games

Carl A. Miller, Yaoyun Shi

Self-testing a quantum device means verifying the existence of a certain quantum state as well as the effect of the associated measurements based only on the statistics of the measurement outcomes. Robust, i.e., error-tolerant, self-testing quantum devices are critical building blocks for quantum cryptographic protocols that rely on imperfect or untrusted quantum devices. We give a criterion which determines whether a given binary XOR game is robust self-testing with the asymptotically optimal error parameter. As an application, we prove that the celebrated CHSH game is an optimally robust self-test. We also prove the same for a family of tests recently proposed by Acin et al. (PRL 108:100402, 2012) for random number generation, thus extending the benefit of the latter tests to allow imperfect or untrusted quantum devices.

arXiv:1207.1819•Jul 7, 2012•41 citations

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•10 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•1 citation
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.
Can a single nonlocal game robustly self-test a continuously indexed measurement family? This paper studies the Grothendieck XOR game GnG_nGn​: questions are sphere directions (x,y)(x,y)(x,y) sampled with density proportional to ∣⟨x,y⟩∣|\langle x,y\rangle|∣⟨x,y⟩∣, and binary answers must have product sgn⁡⟨x,y⟩\operatorname{sgn}\langle x,y\ranglesgn⟨x,y⟩. Its classical and quantum biases are znz_nzn​ and 1/(nzn)1/(nz_n)1/(nzn​), respectively, where zn=E∣⟨x,y⟩∣∼2/(πn)z_n=\mathbb E|\langle x,y\rangle|\sim\sqrt{2/(\pi n)}zn​=E∣⟨x,y⟩∣∼2/(πn)​.
For even n=2mn=2mn=2m, any finite-dimensional strategy achieving at least (1−ε)(1-\varepsilon)(1−ε) times the optimal quantum bias admits one pair of local isometries certifying the entire family γ(x)=∑ixiγi\gamma(x)=\sum_i x_i\gamma_iγ(x)=∑i​xi​γi​. Squared state error relative to mmm maximally entangled qubit pairs plus an auxiliary state is O(n2ε)O(n^2\varepsilon)O(n2ε); sphere-averaged squared, state-dependent measurement errors are O(nε)O(n\varepsilon)O(nε). Both dimension dependences are optimal among uniform bounds linear in ε\varepsilonε. Randomized products of the devices’ observables additionally certify the spin representation of Pin(n)\mathrm{Pin}(n)Pin(n), with squared error O(n3ε)O(n^3\varepsilon)O(n3ε) averaged over group elements and rotations.
The proof derives approximate linearity, consistency and anticommutation from near-optimality, selects a random orthonormal frame, and applies a state-dependent Gowers–Hatami rounding argument to the finite Clifford group. Rotation averaging extends certification to products. Additional results establish classical and vector-strategy rigidity and give an explicit compact-group rounding construction.
Certification is averaged, not pointwise: measurements on any null set can change without affecting the score. The main theorems assume finite-dimensional tensor-product strategies and even nnn; implementing the pin-group construction requires unitary access to the observables.
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.
Self-testing a quantum device means verifying the existence of a certain quantum state as well as the effect of the associated measurements based only on the statistics of the measurement outcomes. Robust, i.e., error-tolerant, self-testing quantum devices are critical building blocks for quantum cryptographic protocols that rely on imperfect or untrusted quantum devices. We give a criterion which determines whether a given binary XOR game is robust self-testing with the asymptotically optimal error parameter. As an application, we prove that the celebrated CHSH game is an optimally robust self-test. We also prove the same for a family of tests recently proposed by Acin et al. (PRL 108:100402, 2012) for random number generation, thus extending the benefit of the latter tests to allow imperfect or untrusted quantum devices.
Self-testing a quantum apparatus means verifying the existence of a certain quantum state as well as the effect of the associated measuring devices based only on the statistics of the measurement outcomes. Robust (i.e., error-tolerant) self-testing quantum apparatuses are critical building blocks for quantum cryptographic protocols that rely on imperfect or untrusted devices. We devise a general scheme for proving optimal robust self-testing properties for tests based on nonlocal binary XOR games. We offer some simplified proofs of known results on self-testing, and also prove some new results.
Self-testing a quantum device means verifying the existence of a certain quantum state as well as the effect of the associated measurements based only on the statistics of the measurement outcomes. Robust, i.e., error-tolerant, self-testing quantum devices are critical building blocks for quantum cryptographic protocols that rely on imperfect or untrusted quantum devices. We give a criterion which determines whether a given binary XOR game is robust self-testing with the asymptotically optimal error parameter. As an application, we prove that the celebrated CHSH game is an optimally robust self-test. We also prove the same for a family of tests recently proposed by Acin et al. (PRL 108:100402, 2012) for random number generation, thus extending the benefit of the latter tests to allow imperfect or untrusted quantum devices.
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.
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.