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:1511.04194 · New Journal of Physics

Self-testing in parallel

Matthew McKague

Published Apr 15, 2016• 45 citations
arXivHTMLPDF

Abstract

Self-testing allows us to determine, through classical interaction only, whether some players in a non-local game share particular quantum states. Most work on self-testing has concentrated on developing tests for small states like one pair of maximally entangled qubits, or on tests where there is a separate player for each qubit, as in a graph state. Here we consider the case of testing many maximally entangled pairs of qubits shared between two players. Previously such a test was shown where testing is sequential, i.e., one pair is tested at a time. Here we consider the parallel case where all pairs are tested simultaneously, giving considerably more power to dishonest players. We derive sufficient conditions for a self-test for many maximally entangled pairs of qubits shared between two players and also two constructions for self-tests where all pairs are tested simultaneously.

DOI
10.1088/1367-2630/18/4/045013

Related papers

Self-testing in parallel with CHSH

Matthew McKague

Self-testing allows classical referees to verify the quantum behaviour of some untrusted devices. Recently we developed a framework for building large self-tests by repeating a smaller self-test many times in parallel. However, the framework did not apply to the CHSH test, which tests a maximally entangled pair of qubits. CHSH is the most well known and widely used test of this type. Here we extend the parallel self-testing framework to build parallel CHSH self-tests for any number of pairs of maximally entangled qubits. Our construction achieves an error bound which is polynomial in the number of tested qubit pairs.

arXiv:1609.09584•Quantum•Apr 25, 2017•24 citations

Self-testing high dimensional states using the generalized magic square game

Matthew McKague

To date all self-tests for high dimensional systems are confined to many-qubit states. This is due to two restrictions in the literature: the standard techniques for proving self-testing results apply only to qubits, and there are few suitable non-local games that are known to require high dimensional non-qubit states to achieve their optimal quantum value. In this paper we address these two problems. Specifically, we generalize the usual self-testing framework to q$d$its and then apply it to a generalization of the magic square game, giving a self-test for two maximally entangled pairs of q$d$its. This self-test has two parties, perfect completeness for honest quantum players, and requires only a constant number of measurement settings, regardless of the dimension $d$.

arXiv:1605.09435•May 30, 2016•4 citations

Device-independent parallel self-testing of two singlets

Xingyao Wu, Jean-Daniel Bancal, Matthew McKague +1 more

Device-independent self-testing offers the possibility of certifying the quantum state and measurements, up to local isometries, using only the statistics observed by querying uncharacterized local devices. In this paper we study parallel self-testing of two maximally entangled pairs of qubits; in particular, the local tensor product structure is not assumed but derived. We prove two criteria that achieve the desired result: a double use of the Clauser-Horne-Shimony-Holt inequality and the $3\ifmmode\times\else\texttimes\fi{}3$ magic square game. This demonstrate that the magic square game can only be perfectly won by measuring a two-singlet state. The tolerance to noise is well within reach of state-of-the-art experiments.

arXiv:1512.02074•Physical Review A•Jun 23, 2016•83 citations

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

Self-testing multipartite entangled states through projections onto two systems

Ivan Šupić, Andrea Coladangelo, Remigiusz Augusiak +1 more

Finding ways to test the behaviour of quantum devices is a timely enterprise, especially in light of the rapid development of quantum technologies. Device-independent self-testing is one desirable approach, as it makes minimal assumptions on the devices being tested. In this work, we address the question of which states can be self-tested. This has been answered recently in the bipartite case (Coladangelo et al 2017 Nat. Commun. 8 15485), while it is largely unexplored in the multipartite case, with only a few scattered results, using a variety of different methods: maximal violation of a Bell inequality, numerical SWAP method, stabiliser self-testing etc. In this work, we investigate a simple, and potentially unifying, approach: combining projections onto two-qubit spaces (projecting parties or degrees of freedom) and then using maximal violation of the tilted CHSH inequalities. This allows one to obtain self-testing of Dicke states and partially entangled GHZ states with two measurements per party, and also to recover self-testing of graph states (previously known only through stabiliser methods). Finally, we give the first self-test of a class of multipartite qudit states: we generalise the self-testing of partially entangled GHZ states by adapting techniques from (Coladangelo et al 2017 Nat. Commun. 8 15485), and show that all multipartite states which admit a Schmidt decomposition can be self-tested with few measurements.

arXiv:1707.06534•New Journal of Physics•Aug 7, 2018•92 citations

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

Matthijs Vernooij, Yuming Zhao

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 M I P ∗ = R E 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.

arXiv:2505.05994•Quantum•Oct 1, 2026•0 citations
Self-testing allows us to determine, through classical interaction only, whether some players in a non-local game share particular quantum states. Most work on self-testing has concentrated on developing tests for small states like one pair of maximally entangled qubits, or on tests where there is a separate player for each qubit, as in a graph state. Here we consider the case of testing many maximally entangled pairs of qubits shared between two players. Previously such a test was shown where testing is sequential, i.e., one pair is tested at a time. Here we consider the parallel case where all pairs are tested simultaneously, giving considerably more power to dishonest players. We derive sufficient conditions for a self-test for many maximally entangled pairs of qubits shared between two players and also two constructions for self-tests where all pairs are tested simultaneously.
Self-testing allows classical referees to verify the quantum behaviour of some untrusted devices. Recently we developed a framework for building large self-tests by repeating a smaller self-test many times in parallel. However, the framework did not apply to the CHSH test, which tests a maximally entangled pair of qubits. CHSH is the most well known and widely used test of this type. Here we extend the parallel self-testing framework to build parallel CHSH self-tests for any number of pairs of maximally entangled qubits. Our construction achieves an error bound which is polynomial in the number of tested qubit pairs.
To date all self-tests for high dimensional systems are confined to many-qubit states. This is due to two restrictions in the literature: the standard techniques for proving self-testing results apply only to qubits, and there are few suitable non-local games that are known to require high dimensional non-qubit states to achieve their optimal quantum value. In this paper we address these two problems. Specifically, we generalize the usual self-testing framework to qdddits and then apply it to a generalization of the magic square game, giving a self-test for two maximally entangled pairs of qdddits. This self-test has two parties, perfect completeness for honest quantum players, and requires only a constant number of measurement settings, regardless of the dimension ddd.
Device-independent self-testing offers the possibility of certifying the quantum state and measurements, up to local isometries, using only the statistics observed by querying uncharacterized local devices. In this paper we study parallel self-testing of two maximally entangled pairs of qubits; in particular, the local tensor product structure is not assumed but derived. We prove two criteria that achieve the desired result: a double use of the Clauser-Horne-Shimony-Holt inequality and the $3\ifmmode\times\else\texttimes\fi{}3$ magic square game. This demonstrate that the magic square game can only be perfectly won by measuring a two-singlet state. The tolerance to noise is well within reach of state-of-the-art experiments.
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.
Finding ways to test the behaviour of quantum devices is a timely enterprise, especially in light of the rapid development of quantum technologies. Device-independent self-testing is one desirable approach, as it makes minimal assumptions on the devices being tested. In this work, we address the question of which states can be self-tested. This has been answered recently in the bipartite case (Coladangelo et al 2017 Nat. Commun. 8 15485), while it is largely unexplored in the multipartite case, with only a few scattered results, using a variety of different methods: maximal violation of a Bell inequality, numerical SWAP method, stabiliser self-testing etc. In this work, we investigate a simple, and potentially unifying, approach: combining projections onto two-qubit spaces (projecting parties or degrees of freedom) and then using maximal violation of the tilted CHSH inequalities. This allows one to obtain self-testing of Dicke states and partially entangled GHZ states with two measurements per party, and also to recover self-testing of graph states (previously known only through stabiliser methods). Finally, we give the first self-test of a class of multipartite qudit states: we generalise the self-testing of partially entangled GHZ states by adapting techniques from (Coladangelo et al 2017 Nat. Commun. 8 15485), and show that all multipartite states which admit a Schmidt decomposition can be self-tested with few measurements.
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 M I P ∗ = R E 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.