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:2405.13819 · Physical Review A

Entanglement swapping in generalized probabilistic theories and iterated Clauser-Horne-Shimony-Holt games

Lionel J. Dmello, Laurens T. Ligthart, David Gross

Published Aug 28, 2024• 4 citations
arXivHTMLPDF

Abstract

While there exist theories that have states more strongly entangled than quantum theory, in the sense that they show Clauser-Horne-Shimony-Holt (CHSH) values above Tsirelson's bound, all known examples of such theories have a strictly smaller set of measurements. Therefore, in tasks that require both bipartite states and measurements, they do not perform better than quantum mechanics. One of the simplest information processing tasks involving both bipartite states and measurements is that of entanglement swapping. In this paper, we study entanglement swapping in generalized probabilistic theories (GPTs). In particular, we introduce the iterated CHSH game, which measures the power of a GPT to preserve nonclassical correlations, in terms of the largest CHSH value obtainable after $n$ rounds of entanglement swapping. Our main result is the construction of a GPT that achieves a CHSH value of 4 after an arbitrary number of rounds. This addresses a question about the optimality of quantum theory for such games recently raised by Weilenmann and Colbeck. One challenge faced when treating this problem is that there seems to be no general framework for constructing GPTs in which entanglement swapping is a well-defined operation. Therefore, we introduce an algorithmic construction that turns a bipartite GPT into a multipartite GPT that supports entanglement swapping, if consistently possible.

DOI
10.1103/physreva.110.022225

Related papers

Probabilistic theories stable under teleportation

Lionel J. Dmello, David Gross

A long-standing problem in the foundations of quantum mechanics is to identify a physical principle that explains why algebraically maximal violations of Bell inequalities can generally not be achieved in Nature. One recently proposed approach considers iterated Bell tests, where a Bell test is performed on a state that has undergone several rounds of entanglement swapping. Obtaining large violations in this scenario is more demanding, because it requires a theory to have both highly entangled states and highly entangled measurements. It has been conjectured that the maximal quantum mechanical Clauser-Horne-Shimony-Holt (CHSH)-value of $2\sqrt2$ might be optimal for any probabilistic theory which, like quantum mechanics, maintains its CHSH-value after an arbitrary number of rounds of entanglement swapping. However, in a previous paper, we have exhibited a first example of a probabilistic theory that can sustain a CHSH value of $4$ in this setting. In this work, further investigating this property, we give a classification of all general probabilistic theories (GPTs) whose CHSH value is stable in the above sense. The problem reduces to a representation-theoretic condition that allows for exactly seven solutions. The GPT from our previous work showed some counter-intuitive features, e.g. that the local state space had a higher dimension than seemed necessary to realize CHSH tests. The classification shows that this is necessarily so. Along the way, we generalize the concept of self-testing to GPTs.

quant-pharXiv:2603.21347•Mar 24, 2026•2 citations

Toward correlation self-testing of quantum theory in the adaptive Clauser-Horne-Shimony-Holt game

Mirjam Weilenmann, Roger Colbeck

Correlation self-testing of a theory addresses the question of whether we can identify the set of correlations realizable in a theory from its performance in a particular information processing task. Applied to quantum theory it aims to identify an information processing task whose optimal performance is achieved only by theories realizing the same correlations as quantum theory in any causal structure. In M. Weilenmann and R. Colbeck [Phys. Rev. Lett. 125, 060406 (2020)], we introduce a candidate task for this---the adaptive Clauser-Horne-Shimony-Holt (CHSH) game. Here, we analyze the maximum probability of winning this game in different generalized probabilistic theories. We show that theories with a joint state space given by the minimal or the maximal tensor product are inferior to quantum theory, before considering other tensor products in theories whose elementary systems have various two-dimensional state spaces. For these, we find no theories that outperform quantum theory in the adaptive CHSH game and prove that it is impossible to recover the quantum performance in various cases. This is the first step towards a general solution that, if successful, will have wide-ranging consequences, in particular, enabling an experiment that could rule out all theories in which the set of realizable correlations does not coincide with the quantum set.

arXiv:2009.05069•Physical Review A•Aug 6, 2020•12 citations

Biased nonlocal quantum games

Thomas Lawson, Noah Linden, Sandu Popescu

We address the question of when quantum entanglement is a useful resource for information processing tasks by presenting a new class of nonlocal games that are simple, direct, generalizations of the Clauser Horne Shimony Holt game. For some ranges of the parameters that specify the games, quantum mechanics offers an advantage, while, surprisingly, for others quantum mechanics is no more powerful than classical mechanics in performing the nonlocal task. This sheds new light on the difference between classical, quantum and super-quantum correlations.

arXiv:1011.6245•Nov 29, 2010•36 citations

Tsirelson bounds for generalized Clauser-Horne-Shimony-Holt inequalities

Stephanie Wehner

Quantum theory imposes a strict limit on the strength of nonlocal correlations. It only allows for a violation of the Clauser, Horne, Shimony, and Holt (CHSH) inequality up to the value $2\sqrt{2}$, known as Tsirelson's bound. In this paper, we consider generalized CHSH inequalities based on many measurement settings with two possible measurement outcomes each. We demonstrate how to prove Tsirelson bounds for any such generalized CHSH inequality using semidefinite programming. As an example, we show that for any shared entangled state and observables ${X}_{1},\dots{},{X}_{n}$ and ${Y}_{1},\dots{},{Y}_{n}$ with eigenvalues $\ifmmode\pm\else\textpm\fi{}1$ we have $\ensuremath{\mid}⟨{X}_{1}{Y}_{1}⟩+⟨{X}_{2}{Y}_{1}⟩+⟨{X}_{2}{Y}_{2}⟩+⟨{X}_{3}{Y}_{2}⟩+\ensuremath{\cdots}+⟨{X}_{n}{Y}_{n}⟩\ensuremath{-}⟨{X}_{1}{Y}_{n}⟩\ensuremath{\mid}\ensuremath{\leqslant}2n\phantom{\rule{0.2em}{0ex}}\mathrm{cos}[\ensuremath{\pi}∕(2n)]$. It is well known that there exist observables such that equality can be achieved. However, we show that these are indeed optimal. Our approach can easily be generalized to other inequalities for such observables.

arXiv:quant-ph/0510076•Physical Review A•Feb 14, 2006•185 citations

A classical leash for a quantum system: Command of quantum systems via rigidity of CHSH games

Ben W. Reichardt, Falk Unger, Umesh V. Vazirani

Can a classical system command a general adversarial quantum system to realize arbitrary quantum dynamics? If so, then we could realize the dream of device-independent quantum cryptography: using untrusted quantum devices to establish a shared random key, with security based on the correctness of quantum mechanics. It would also allow for testing whether a claimed quantum computer is truly quantum. Here we report a technique by which a classical system can certify the joint, entangled state of a bipartite quantum system, as well as command the application of specific operators on each subsystem. This is accomplished by showing a strong converse to Tsirelson's optimality result for the Clauser-Horne-Shimony-Holt (CHSH) game: the only way to win many games is if the bipartite state is close to the tensor product of EPR states, and the measurements are the optimal CHSH measurements on successive qubits. This leads directly to a scheme for device-independent quantum key distribution. Control over the state and operators can also be leveraged to create more elaborate protocols for realizing general quantum circuits, and to establish that QMIP = MIP*.

arXiv:1209.0448•Sep 3, 2012•83 citations

Correlation Self-Testing of Quantum Theory against Generalised Probabilistic Theories with Restricted Relabelling Symmetry

Kuntal Sengupta, Mirjam Weilenmann, Roger Colbeck

Correlation self-testing of quantum theory involves identifying a task or set of tasks whose optimal performance can be achieved only by theories that can realise the same set of correlations as quantum theory in every causal structure. Following this approach, previous work has ruled out various classes of generalised probabilistic theories whose joint state spaces have a certain regularity in the sense of a (discrete) rotation symmetry of the bipartite state spaces. Here we consider theories whose bipartite state spaces lack this regularity. We form them by taking the convex hull of all the local states and a finite number of non-local states. We show that a criterion of compositional consistency is needed in such theories: for a measurement effect to be valid, there must exist at least one measurement that it is part of. This goes beyond previous consistency criteria and corresponds to a strengthening of the no-restriction hypothesis. We show that quantum theory outperforms these theories in a task called the adaptive CHSH game, which shows that they can be ruled out experimentally. We further show a connection between compositional consistency and Tsirelson's bound.

quant-pharXiv:2511.02914•Nov 6, 2025•0 citations
While there exist theories that have states more strongly entangled than quantum theory, in the sense that they show Clauser-Horne-Shimony-Holt (CHSH) values above Tsirelson's bound, all known examples of such theories have a strictly smaller set of measurements. Therefore, in tasks that require both bipartite states and measurements, they do not perform better than quantum mechanics. One of the simplest information processing tasks involving both bipartite states and measurements is that of entanglement swapping. In this paper, we study entanglement swapping in generalized probabilistic theories (GPTs). In particular, we introduce the iterated CHSH game, which measures the power of a GPT to preserve nonclassical correlations, in terms of the largest CHSH value obtainable after nnn rounds of entanglement swapping. Our main result is the construction of a GPT that achieves a CHSH value of 4 after an arbitrary number of rounds. This addresses a question about the optimality of quantum theory for such games recently raised by Weilenmann and Colbeck. One challenge faced when treating this problem is that there seems to be no general framework for constructing GPTs in which entanglement swapping is a well-defined operation. Therefore, we introduce an algorithmic construction that turns a bipartite GPT into a multipartite GPT that supports entanglement swapping, if consistently possible.
A long-standing problem in the foundations of quantum mechanics is to identify a physical principle that explains why algebraically maximal violations of Bell inequalities can generally not be achieved in Nature. One recently proposed approach considers iterated Bell tests, where a Bell test is performed on a state that has undergone several rounds of entanglement swapping. Obtaining large violations in this scenario is more demanding, because it requires a theory to have both highly entangled states and highly entangled measurements. It has been conjectured that the maximal quantum mechanical Clauser-Horne-Shimony-Holt (CHSH)-value of 222\sqrt222​ might be optimal for any probabilistic theory which, like quantum mechanics, maintains its CHSH-value after an arbitrary number of rounds of entanglement swapping. However, in a previous paper, we have exhibited a first example of a probabilistic theory that can sustain a CHSH value of 444 in this setting. In this work, further investigating this property, we give a classification of all general probabilistic theories (GPTs) whose CHSH value is stable in the above sense. The problem reduces to a representation-theoretic condition that allows for exactly seven solutions. The GPT from our previous work showed some counter-intuitive features, e.g. that the local state space had a higher dimension than seemed necessary to realize CHSH tests. The classification shows that this is necessarily so. Along the way, we generalize the concept of self-testing to GPTs.
Correlation self-testing of a theory addresses the question of whether we can identify the set of correlations realizable in a theory from its performance in a particular information processing task. Applied to quantum theory it aims to identify an information processing task whose optimal performance is achieved only by theories realizing the same correlations as quantum theory in any causal structure. In M. Weilenmann and R. Colbeck [Phys. Rev. Lett. 125, 060406 (2020)], we introduce a candidate task for this---the adaptive Clauser-Horne-Shimony-Holt (CHSH) game. Here, we analyze the maximum probability of winning this game in different generalized probabilistic theories. We show that theories with a joint state space given by the minimal or the maximal tensor product are inferior to quantum theory, before considering other tensor products in theories whose elementary systems have various two-dimensional state spaces. For these, we find no theories that outperform quantum theory in the adaptive CHSH game and prove that it is impossible to recover the quantum performance in various cases. This is the first step towards a general solution that, if successful, will have wide-ranging consequences, in particular, enabling an experiment that could rule out all theories in which the set of realizable correlations does not coincide with the quantum set.
We address the question of when quantum entanglement is a useful resource for information processing tasks by presenting a new class of nonlocal games that are simple, direct, generalizations of the Clauser Horne Shimony Holt game. For some ranges of the parameters that specify the games, quantum mechanics offers an advantage, while, surprisingly, for others quantum mechanics is no more powerful than classical mechanics in performing the nonlocal task. This sheds new light on the difference between classical, quantum and super-quantum correlations.
Quantum theory imposes a strict limit on the strength of nonlocal correlations. It only allows for a violation of the Clauser, Horne, Shimony, and Holt (CHSH) inequality up to the value 222\sqrt{2}22​, known as Tsirelson's bound. In this paper, we consider generalized CHSH inequalities based on many measurement settings with two possible measurement outcomes each. We demonstrate how to prove Tsirelson bounds for any such generalized CHSH inequality using semidefinite programming. As an example, we show that for any shared entangled state and observables X1,…,Xn{X}_{1},\dots{},{X}_{n}X1​,…,Xn​ and Y1,…,Yn{Y}_{1},\dots{},{Y}_{n}Y1​,…,Yn​ with eigenvalues $\ifmmode\pm\else\textpm\fi{}1$ we have $\ensuremath{\mid}⟨{X}_{1}{Y}_{1}⟩+⟨{X}_{2}{Y}_{1}⟩+⟨{X}_{2}{Y}_{2}⟩+⟨{X}_{3}{Y}_{2}⟩+\ensuremath{\cdots}+⟨{X}_{n}{Y}_{n}⟩\ensuremath{-}⟨{X}_{1}{Y}_{n}⟩\ensuremath{\mid}\ensuremath{\leqslant}2n\phantom{\rule{0.2em}{0ex}}\mathrm{cos}[\ensuremath{\pi}∕(2n)]$. It is well known that there exist observables such that equality can be achieved. However, we show that these are indeed optimal. Our approach can easily be generalized to other inequalities for such observables.
Can a classical system command a general adversarial quantum system to realize arbitrary quantum dynamics? If so, then we could realize the dream of device-independent quantum cryptography: using untrusted quantum devices to establish a shared random key, with security based on the correctness of quantum mechanics. It would also allow for testing whether a claimed quantum computer is truly quantum. Here we report a technique by which a classical system can certify the joint, entangled state of a bipartite quantum system, as well as command the application of specific operators on each subsystem. This is accomplished by showing a strong converse to Tsirelson's optimality result for the Clauser-Horne-Shimony-Holt (CHSH) game: the only way to win many games is if the bipartite state is close to the tensor product of EPR states, and the measurements are the optimal CHSH measurements on successive qubits. This leads directly to a scheme for device-independent quantum key distribution. Control over the state and operators can also be leveraged to create more elaborate protocols for realizing general quantum circuits, and to establish that QMIP = MIP*.
Correlation self-testing of quantum theory involves identifying a task or set of tasks whose optimal performance can be achieved only by theories that can realise the same set of correlations as quantum theory in every causal structure. Following this approach, previous work has ruled out various classes of generalised probabilistic theories whose joint state spaces have a certain regularity in the sense of a (discrete) rotation symmetry of the bipartite state spaces. Here we consider theories whose bipartite state spaces lack this regularity. We form them by taking the convex hull of all the local states and a finite number of non-local states. We show that a criterion of compositional consistency is needed in such theories: for a measurement effect to be valid, there must exist at least one measurement that it is part of. This goes beyond previous consistency criteria and corresponds to a strengthening of the no-restriction hypothesis. We show that quantum theory outperforms these theories in a task called the adaptive CHSH game, which shows that they can be ruled out experimentally. We further show a connection between compositional consistency and Tsirelson's bound.