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:2605.04931

Quantum Realizability of Probabilistic Theories Stable under Teleportation

Miguel A. A. Lisboa

quant-phSubmitted May 6, 2026• Announced May 7, 2026• 0 citations• Revised May 8, 2026 (v2)
v1 · May 6, 2026v2 · May 8, 2026
arXivHTMLPDF

Abstract

The classification of general probabilistic theories (GPTs) whose CHSH value is stable under arbitrary rounds of teleportation and entanglement swapping was obtained in Dmello and Gross work and consists of seven families, indexed by characters of the Klein four-group $K_4$, the cyclic group $\mathbb{Z}_4$, and the dihedral group $D_4$. The question of which of these families admits a realization within standard quantum mechanics was left open. In this work we resolve this question completely. Using elementary representation theory, we prove that exactly two families are quantum-realizable, namely $χ^{K_4}_{1234}$ and $χ^{D_4}_{125}$, while the remaining five admit no quantum realization.

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

Undecidability of consistency of generalized probabilistic theories

Serge Massar

Generalized probabilistic theories (GPTs) provide a unifying framework encompassing classical theories, quantum theories, as well as hypothetical alternatives. We investigate both the problem of extending a system with a finite set of transformations, and the problem of adding to a translation-invariant set of systems a finite set of entangled states and effects, plus all their images under the translation symmetry. We show that determining whether such extensions are consistent with the axioms of GPTs is undecidable. The source of the undecidability is that these finite extensions can generate infinitely many conditions which must be checked: iterating transformations may produce infinitely many new transformations; similarly, entangled states and effects may generate infinitely many new states via the analog of teleportation. Our results show that extending GPTs to include dynamics or entanglement encounters fundamental computability obstructions, which can only be circumvented by introducing additional physical or mathematical assumptions.

quant-pharXiv:2603.07002•Physical Review A•Mar 10, 2026•0 citations

An operational characterization of finite-dimensional quantum theory

Lionel J. Dmello, Xiangling Xu, Marc-Olivier Renou +1 more

A key goal in the foundations of quantum mechanics is to identify operational constraints characterizing physical theories. Bell inequalities do so for classical probability theory, while Tsirelson's bound provides a first step for quantum mechanics. Here, we address the dual question: Can one certify that all correlations predicted by quantum theory are actually realizable? In this work, we construct a finite number of two-body correlations such that the only probabilistic theory that (1) realizes them, and (2) does so in a way that is stable under iterated teleportation, is quantum theory. For $n$ quantum systems of dimension $d$ each, Condition (1) can be verified using $\operatorname{poly}(d,n)$ measurement settings. Condition (2) may be understood as a hierarchy of tests, one for each number $N$ of teleportation steps. There is thus a sense in which finite-dimensional quantum theory can be self-tested. In particular, one can certify the existence of Bell inequality violations larger than any that have been directly observed.

quant-pharXiv:2610.03694•Oct 5, 2026•0 citations

Four-level quantum teleportation, swapping and collective translations of multipartite quantum entanglement

Zai-Zhe Zhong

In this paper, an optimal scheme of four-level quantum teleportation and swapping of quantum entanglement is given. We construct a complete orthogonal basis of the bipartite ququadrit systems. Using this basis, the four-level quantum teleportation and swapping can be achieved according to the standard steps. In addition, associate the above bases with the unextendible product bases and the exact entanglement bases, we prove that in the $2\times 2\times 2$ systems or $3\times 3$ systems the collective translations of multipartite quantum entanglement can be realized. PACC numbers: 03.67.Mn, 03.65.Ud, 03.67.Hk. Keywords: Ququadrit systems, Bases, Four-level teleportation, Swapping, Collective translations.

arXiv:quant-ph/0412042•Dec 6, 2004•0 citations

Classical, quantum, and general probabilistic state-discrimination profiles

Mihály Weiner

For a collection of states indexed by $[n]={1,\ldots,n}$, let $F(H)$ denote the optimal unnormalized minimum discrimination error for each nonempty subfamily $H\subseteq[n]$. We call $F$ the discrimination profile and characterize exactly which profiles can arise in a general probabilistic theory (GPT). For fixed $n$, the GPT region $\mathfrak{G}_n$ is a bounded rational polytope, giving a hierarchy $\mathfrak{C}_n\subseteq\mathfrak{Q}_n\subseteq\mathfrak{G}_n$ of classical, quantum, and GPT profiles, analogous to the local--quantum--no-signalling hierarchy in Bell theory. For $n=3$ we determine the classical and GPT polytopes explicitly. Within $\mathfrak{G}_3$, the classical region is characterized by $β:=F(123)-F(12)-F(13)-F(23)\le0$, while the GPT maximum is $1$. For qubit triples, the maximal value is attained by the trine, $β_{\mathrm{tr}}=3\sqrt3/2-2$, and we prove the dimension-independent quantum bound $β_{\mathrm Q}\le2/3$, with a slight further improvement. Hence $0=β_{\mathrm C}<3\sqrt3/2-2\leβ_{\mathrm Q}\le2/3<1=β_{\mathrm{GPT}}$. We conjecture $β_{\mathrm Q}=β_{\mathrm{tr}}$ and prove this for arbitrary pure-state triples, together with further supporting evidence. For arbitrary $n$, every classical facet admitting a GPT violation already admits a quantum violation in dimension at most $3$. A four-state qubit example shows that quantum success profiles need not be submodular, unlike for $n=3$. Finally, we exhibit a four-dimensional quantum triple whose discrete profile is classical for all subfamilies but becomes nonclassical when unequal priors are allowed.

quant-pharXiv:2609.17920•Sep 17, 2026•0 citations

Non-classical correlations in quantum mechanics and beyond

Ludovico Lami

Is entanglement an exclusive feature of quantum systems, or is it common to all non-classical theories? And if this is the case, how strong is quantum mechanical entanglement as compared to that exhibited by other theories? The first part of this thesis deals with these questions by considering quantum theory as part of a wider landscape of physical theories, collectively called general probabilistic theories (GPTs). Among the other things, this manuscript contains a detailed introduction to the abstract state space formalism for GPTs. We start with a comprehensive review of the proof of a famous theorem by Ludwig that constitutes one of its cornerstones (Ch. 1). After explaining the basic rules of the game, we translate our questions into precise conjectures and present our progress toward a full solution (Ch. 2). In Ch. 3 we consider entanglement at the level of measurements instead of states, focusing on one of its main implications, i.e. data hiding. We determine the maximal data hiding strength that a quantum mechanical system can exhibit, and also the maximum value among all GPTs, finding that the former scales as the square root of the latter. In the second part of this manuscript we look into quantum entanglement. In Ch. 4 we discuss the entanglement transformation properties of a class of maps that model white noise acting either locally or globally on a bipartite system. In Ch. 5 we employ matrix analysis tools to develop a unified approach to Gaussian entanglement. The third part of this thesis concerns more general forms of non-classical correlations in bipartite continuous variable systems. In Ch. 6 we devise a general scheme that allows to consistently classify correlations of bipartite Gaussian states into classical and quantum ones. Finally, Ch. 7 explores some problems connected with a certain strong subadditivity matrix inequality.

arXiv:1803.02902•Mar 7, 2018•63 citations
The classification of general probabilistic theories (GPTs) whose CHSH value is stable under arbitrary rounds of teleportation and entanglement swapping was obtained in Dmello and Gross work and consists of seven families, indexed by characters of the Klein four-group K4K_4K4​, the cyclic group Z4\mathbb{Z}_4Z4​, and the dihedral group D4D_4D4​. The question of which of these families admits a realization within standard quantum mechanics was left open. In this work we resolve this question completely. Using elementary representation theory, we prove that exactly two families are quantum-realizable, namely χ1234K4χ^{K_4}_{1234}χ1234K4​​ and χ125D4χ^{D_4}_{125}χ125D4​​, while the remaining five admit no quantum realization.
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.
Generalized probabilistic theories (GPTs) provide a unifying framework encompassing classical theories, quantum theories, as well as hypothetical alternatives. We investigate both the problem of extending a system with a finite set of transformations, and the problem of adding to a translation-invariant set of systems a finite set of entangled states and effects, plus all their images under the translation symmetry. We show that determining whether such extensions are consistent with the axioms of GPTs is undecidable. The source of the undecidability is that these finite extensions can generate infinitely many conditions which must be checked: iterating transformations may produce infinitely many new transformations; similarly, entangled states and effects may generate infinitely many new states via the analog of teleportation. Our results show that extending GPTs to include dynamics or entanglement encounters fundamental computability obstructions, which can only be circumvented by introducing additional physical or mathematical assumptions.
A key goal in the foundations of quantum mechanics is to identify operational constraints characterizing physical theories. Bell inequalities do so for classical probability theory, while Tsirelson's bound provides a first step for quantum mechanics. Here, we address the dual question: Can one certify that all correlations predicted by quantum theory are actually realizable? In this work, we construct a finite number of two-body correlations such that the only probabilistic theory that (1) realizes them, and (2) does so in a way that is stable under iterated teleportation, is quantum theory. For nnn quantum systems of dimension ddd each, Condition (1) can be verified using poly⁡(d,n)\operatorname{poly}(d,n)poly(d,n) measurement settings. Condition (2) may be understood as a hierarchy of tests, one for each number NNN of teleportation steps. There is thus a sense in which finite-dimensional quantum theory can be self-tested. In particular, one can certify the existence of Bell inequality violations larger than any that have been directly observed.
In this paper, an optimal scheme of four-level quantum teleportation and swapping of quantum entanglement is given. We construct a complete orthogonal basis of the bipartite ququadrit systems. Using this basis, the four-level quantum teleportation and swapping can be achieved according to the standard steps. In addition, associate the above bases with the unextendible product bases and the exact entanglement bases, we prove that in the 2×2×22\times 2\times 22×2×2 systems or 3×33\times 33×3 systems the collective translations of multipartite quantum entanglement can be realized. PACC numbers: 03.67.Mn, 03.65.Ud, 03.67.Hk. Keywords: Ququadrit systems, Bases, Four-level teleportation, Swapping, Collective translations.
For a collection of states indexed by [n]=1,…,n[n]={1,\ldots,n}[n]=1,…,n, let F(H)F(H)F(H) denote the optimal unnormalized minimum discrimination error for each nonempty subfamily H⊆[n]H\subseteq[n]H⊆[n]. We call FFF the discrimination profile and characterize exactly which profiles can arise in a general probabilistic theory (GPT). For fixed nnn, the GPT region Gn\mathfrak{G}_nGn​ is a bounded rational polytope, giving a hierarchy Cn⊆Qn⊆Gn\mathfrak{C}_n\subseteq\mathfrak{Q}_n\subseteq\mathfrak{G}_nCn​⊆Qn​⊆Gn​ of classical, quantum, and GPT profiles, analogous to the local--quantum--no-signalling hierarchy in Bell theory. For n=3n=3n=3 we determine the classical and GPT polytopes explicitly. Within G3\mathfrak{G}_3G3​, the classical region is characterized by β:=F(123)−F(12)−F(13)−F(23)≤0β:=F(123)-F(12)-F(13)-F(23)\le0β:=F(123)−F(12)−F(13)−F(23)≤0, while the GPT maximum is 111. For qubit triples, the maximal value is attained by the trine, βtr=33/2−2β_{\mathrm{tr}}=3\sqrt3/2-2βtr​=33​/2−2, and we prove the dimension-independent quantum bound βQ≤2/3β_{\mathrm Q}\le2/3βQ​≤2/3, with a slight further improvement. Hence 0=βC<33/2−2≤βQ≤2/3<1=βGPT0=β_{\mathrm C}<3\sqrt3/2-2\leβ_{\mathrm Q}\le2/3<1=β_{\mathrm{GPT}}0=βC​<33​/2−2≤βQ​≤2/3<1=βGPT​. We conjecture βQ=βtrβ_{\mathrm Q}=β_{\mathrm{tr}}βQ​=βtr​ and prove this for arbitrary pure-state triples, together with further supporting evidence. For arbitrary nnn, every classical facet admitting a GPT violation already admits a quantum violation in dimension at most 333. A four-state qubit example shows that quantum success profiles need not be submodular, unlike for n=3n=3n=3. Finally, we exhibit a four-dimensional quantum triple whose discrete profile is classical for all subfamilies but becomes nonclassical when unequal priors are allowed.
Is entanglement an exclusive feature of quantum systems, or is it common to all non-classical theories? And if this is the case, how strong is quantum mechanical entanglement as compared to that exhibited by other theories? The first part of this thesis deals with these questions by considering quantum theory as part of a wider landscape of physical theories, collectively called general probabilistic theories (GPTs). Among the other things, this manuscript contains a detailed introduction to the abstract state space formalism for GPTs. We start with a comprehensive review of the proof of a famous theorem by Ludwig that constitutes one of its cornerstones (Ch. 1). After explaining the basic rules of the game, we translate our questions into precise conjectures and present our progress toward a full solution (Ch. 2). In Ch. 3 we consider entanglement at the level of measurements instead of states, focusing on one of its main implications, i.e. data hiding. We determine the maximal data hiding strength that a quantum mechanical system can exhibit, and also the maximum value among all GPTs, finding that the former scales as the square root of the latter. In the second part of this manuscript we look into quantum entanglement. In Ch. 4 we discuss the entanglement transformation properties of a class of maps that model white noise acting either locally or globally on a bipartite system. In Ch. 5 we employ matrix analysis tools to develop a unified approach to Gaussian entanglement. The third part of this thesis concerns more general forms of non-classical correlations in bipartite continuous variable systems. In Ch. 6 we devise a general scheme that allows to consistently classify correlations of bipartite Gaussian states into classical and quantum ones. Finally, Ch. 7 explores some problems connected with a certain strong subadditivity matrix inequality.