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:2401.04596 · Journal of Physics A Mathematical and Theoretical

Optimal CHSH values for regular polygon theories in generalized probabilistic theories

Ryo Takakura

Published Aug 16, 2024• 1 citation
arXivHTMLPDF

Abstract

Abstract In this study, we consider generalized probabilistic theories (GPTs) and focus on a class of theories called regular polygon theories, which can be regarded as natural generalizations of a two-level quantum system (a qubit system). In the usual CHSH setting for quantum theory, the CHSH value is known to be optimized by maximally entangled states. This research will reveal that the same observations are obtained also in regular polygon theories. Our result gives a physical meaning to the concept of ‘maximal entanglement’ in regular polygon theories.

DOI
10.1088/1751-8121/ad7077

Related papers

Entropic uncertainty relations in a class of generalized probabilistic theories

Ryo Takakura, Takayuki Miyadera

Abstract Entropic uncertainty relations play an important role in both fundamentals and applications of quantum theory. Although they have been well-investigated in quantum theory, little is known about entropic uncertainty in generalized probabilistic theories (GPTs). The current study explores two types of entropic uncertainty relations, preparation and measurement uncertainty relations, in a class of GPTs which can be considered generalizations of quantum theory. Not only a method for obtaining entropic preparation uncertainty relations but also an entropic measurement uncertainty relation similar to the quantum one by Buscemi et al (2014 Phys. Rev. Lett. 112 050401) are proved in those theories. These results manifest that the entropic structure in the uncertainty relations is not restricted to quantum theory and therefore is universal one. Concrete calculations of our relations in GPTs called the regular polygon theories are also demonstrated.

arXiv:2006.05671•Journal of Physics A Mathematical and Theoretical•Jun 17, 2021•7 citations

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

Entropy of mixing exists only for classical and quantum-like theories among the regular polygon theories

Ryo Takakura

Abstract The thermodynamical entropy of a system which consists of different kinds of ideal gases is known to be defined successfully in the case when the differences are described by classical or quantum theory. Since these theories are special examples in the framework of generalized probabilistic theories (GPTs), it is natural to generalize the notion of thermodynamical entropy to systems where the internal degrees of particles are described by other possible theories. In this paper, we consider thermodynamical entropy of mixing in a specific series of theories of GPTs called the regular polygon theories, which can be regarded from a geometrical perspective as intermediate theories between a classical trit and a quantum bit with real coefficients. We prove that the operationally natural thermodynamical entropy of mixing does not exist in those inbetween theories, that is, the existence of the natural entropy results in classical and quantum-like theories among the regular polygon theories.

arXiv:1803.07388•Journal of Physics A Mathematical and Theoretical•Oct 2, 2019•6 citations

Antidistinguishability of states in General Probabilistic Theories

Satyaki Manna, Anandamay Das Bhowmik

We investigate antidistinguishability of states within the framework of general probabilistic theories (GPTs). We formulate antidistinguishability, strong and equal antidistinguishability as refined notions that imposed additional constraint on the measurement effects. We establish general results relating these notions of antidistinguishability and derive an upper bound on the cardinality of equally antidistinguishable sets in terms of the affine dimension of the state space. We then study antidistinguishability in polygonal theories, obtaining conditions for antidistinguishability of a set of states. In consequence, we show that the set of all pure states in a polygon model is antidistinguishable. Additionally, we identify broad families of strongly and equally antidistinguishable states. Finally, using Random Exclusion Codes, whose success probability is governed by the antidistinguishability of different sets of encoding states, we probe the nonclassicality of polygon theories. We find that certain polygon models can outperform the optimal quantum value, while their optimal performance converges to the quantum limit in the large-polygon limit.

quant-pharXiv:2609.17498•Sep 16, 2026•1 citation

Information and communication in polygon theories

Serge Massar, Manas K. Patra

Generalized probabilistic theories (GPTs) provide a framework in which one can formulate physical theories that includes classical and quantum theories, but also many other alternative theories. In order to compare different GPTs, we advocate an approach in which one views a state in a GPT as a resource and quantifies the cost of interconverting between different such resources. We illustrate this approach on polygon theories [New J. Phys. 13, 063024 (2011).] that interpolate (as the number $n$ of edges of the polygon increases) between a classical trit (when $n=3$) and a real quantum bit (when $n=\ensuremath{\infty}$). Our main results are that simulating the transmission of a single $n$-gon state requires more than one qubit, or more than $log(log(n))$ bits, and that $n$-gon states with $n$ odd cannot be simulated by ${n}^{\ensuremath{'}}$-gon states with ${n}^{\ensuremath{'}}$ even (for all $n,{n}^{\ensuremath{'}}$). These results are obtained by showing that the classical capacity of a single $n$-gon state with $n$ even is 1 bit, whereas it is larger than 1 bit when $n$ is odd; by showing that transmitting a single $n$-gon state with $n$ even violates information causality; and by studying the communication complexity cost of the nondeterministic not-equal function using $n$-gon states.

arXiv:1403.2509•Physical Review A•May 20, 2014•21 citations

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

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

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.

arXiv:2405.13819•Physical Review A•Aug 28, 2024•4 citations
Abstract In this study, we consider generalized probabilistic theories (GPTs) and focus on a class of theories called regular polygon theories, which can be regarded as natural generalizations of a two-level quantum system (a qubit system). In the usual CHSH setting for quantum theory, the CHSH value is known to be optimized by maximally entangled states. This research will reveal that the same observations are obtained also in regular polygon theories. Our result gives a physical meaning to the concept of ‘maximal entanglement’ in regular polygon theories.
Abstract Entropic uncertainty relations play an important role in both fundamentals and applications of quantum theory. Although they have been well-investigated in quantum theory, little is known about entropic uncertainty in generalized probabilistic theories (GPTs). The current study explores two types of entropic uncertainty relations, preparation and measurement uncertainty relations, in a class of GPTs which can be considered generalizations of quantum theory. Not only a method for obtaining entropic preparation uncertainty relations but also an entropic measurement uncertainty relation similar to the quantum one by Buscemi et al (2014 Phys. Rev. Lett. 112 050401) are proved in those theories. These results manifest that the entropic structure in the uncertainty relations is not restricted to quantum theory and therefore is universal one. Concrete calculations of our relations in GPTs called the regular polygon theories are also demonstrated.
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.
Abstract The thermodynamical entropy of a system which consists of different kinds of ideal gases is known to be defined successfully in the case when the differences are described by classical or quantum theory. Since these theories are special examples in the framework of generalized probabilistic theories (GPTs), it is natural to generalize the notion of thermodynamical entropy to systems where the internal degrees of particles are described by other possible theories. In this paper, we consider thermodynamical entropy of mixing in a specific series of theories of GPTs called the regular polygon theories, which can be regarded from a geometrical perspective as intermediate theories between a classical trit and a quantum bit with real coefficients. We prove that the operationally natural thermodynamical entropy of mixing does not exist in those inbetween theories, that is, the existence of the natural entropy results in classical and quantum-like theories among the regular polygon theories.
We investigate antidistinguishability of states within the framework of general probabilistic theories (GPTs). We formulate antidistinguishability, strong and equal antidistinguishability as refined notions that imposed additional constraint on the measurement effects. We establish general results relating these notions of antidistinguishability and derive an upper bound on the cardinality of equally antidistinguishable sets in terms of the affine dimension of the state space. We then study antidistinguishability in polygonal theories, obtaining conditions for antidistinguishability of a set of states. In consequence, we show that the set of all pure states in a polygon model is antidistinguishable. Additionally, we identify broad families of strongly and equally antidistinguishable states. Finally, using Random Exclusion Codes, whose success probability is governed by the antidistinguishability of different sets of encoding states, we probe the nonclassicality of polygon theories. We find that certain polygon models can outperform the optimal quantum value, while their optimal performance converges to the quantum limit in the large-polygon limit.
Generalized probabilistic theories (GPTs) provide a framework in which one can formulate physical theories that includes classical and quantum theories, but also many other alternative theories. In order to compare different GPTs, we advocate an approach in which one views a state in a GPT as a resource and quantifies the cost of interconverting between different such resources. We illustrate this approach on polygon theories [New J. Phys. 13, 063024 (2011).] that interpolate (as the number nnn of edges of the polygon increases) between a classical trit (when n=3n=3n=3) and a real quantum bit (when $n=\ensuremath{\infty}$). Our main results are that simulating the transmission of a single nnn-gon state requires more than one qubit, or more than log(log(n))log(log(n))log(log(n)) bits, and that nnn-gon states with nnn odd cannot be simulated by ${n}^{\ensuremath{'}}$-gon states with ${n}^{\ensuremath{'}}$ even (for all $n,{n}^{\ensuremath{'}}$). These results are obtained by showing that the classical capacity of a single nnn-gon state with nnn even is 1 bit, whereas it is larger than 1 bit when nnn is odd; by showing that transmitting a single nnn-gon state with nnn even violates information causality; and by studying the communication complexity cost of the nondeterministic not-equal function using nnn-gon states.
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.