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

Antidistinguishability of states in General Probabilistic Theories

Satyaki Manna, Anandamay Das Bhowmik

quant-phSubmitted Sep 15, 2026• Announced Sep 16, 2026• 1 citation
arXivHTMLPDF

Abstract

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.

AI Summary

The paper studies perfect state exclusion (antidistinguishability) in general probabilistic theories (GPTs), relating exclusion measurements to state-space geometry. It distinguishes ordinary antidistinguishability, which permits zero measurement effects; strong antidistinguishability, which requires every effect to be nonzero; and equal antidistinguishability, where each outcome has probability $1/(k-1)$ on every state except the one it excludes. General results describe how exclusion behaves under enlarging sets, taking unions, and replacing states by states in their faces. Equal antidistinguishability requires $k\leq d+1$, where $d$ is the state space’s affine dimension: applying the exclusion effects to a putative affine dependence proves that the states must be affinely independent. Sets containing an interior, completely mixed state cannot be strongly antidistinguishable. For regular polygon GPTs, the paper gives geometric feasibility conditions for exclusion, constructs strongly antidistinguishing measurements for the full vertex set and equally spaced $k$-vertex subsets with $k\mid n$, and constructs equally antidistinguishing trines when $3\mid n$. A communication application considers Random Exclusion Codes with two uniformly random ternary symbols. Restricting decoding to dichotomic measurements relates the success probability to known Random Access Code optima through $S_{\mathrm{REC}}=5/9+(4/9)S_{\mathrm{RAC}}$. The square achieves success probability $1$, and the polygon formulas converge to the qubit value $(7+\sqrt{2})/9$; some polygons exceed it. The stated limitation is that dichotomic decoding is not proved sufficient for general GPTs, so these restricted optima provide lower bounds on unrestricted performance.

Little sign of AI-generated textIncrementalOverclaimsPossible errorUnclear writing

Error found: The paper omits an upper bound needed to justify unrestricted REC convergence, although its polygon geometry supplies a bound that recovers the claimed limit. In odd polygon models, complementary extremal effects u-e_j vanish at exactly one vertex omega_j, contrary to the lemma and summary table asserting two excluded vertices.

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

Comments
12 pages, 2 figures

Related papers

Antidistinguishability of states in General Probabilistic Theories — E8 Intelligence Research

Andrew Stewart Caldin

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 Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 5, 2026•0 citations

Birkhoff violation in even-polygon general probabilistic theories: implications for state transformations and information processing

Ananya Chakraborty, Sahil Gopalkrishna Naik, Samrat Sen +4 more

Abstract The entropy principle asserts that spontaneous processes drive systems toward states of higher disorder. Operational origin of such randomness is a question of utmost importance. The seminal Birkhoff theorem (also known as Birkhoff-von Neumann theorem) identifies doubly stochastic transformations as convex mixtures of reversible transformations, thereby providing an epistemic account of disorder. Quantum theory, however, does not satisfy this equivalence in general. In this work, we investigate this question within the framework of generalized probabilistic theories (GPTs). We prove a violation of the Birkhoff theorem in the square-bit model, a canonical non-quantum GPT, and further show that this violation persists asymptotically under tensor products of any finite, yet arbitrarily large, number of copies of even-polygon models. This provides evidence that the failure of the Birkhoff theorem is an intrinsic operational feature of a wide class of GPTs, rather than a peculiarity of quantum theory. Furthermore, we show that, beyond quantum theory, the preorder over states induced by mixtures of reversible transformations can differ from that induced by doubly stochastic transformations, leading to inequivalent notions of state convertibility and distinct resource theories of purity. Beyond its foundational significance, we show that the violation of the Birkhoff theorem admits a concrete operational interpretation: in the square-bit theory, it serves as a genuine resource for enhancing the performance of Random Access Codes. Finally, we discuss the construction of entropy functions in GPTs that remain consistent with thermodynamic principles, in the spirit of von Neumann’s formulation.

arXiv:2406.08803•Journal of Physics A Mathematical and Theoretical•Oct 14, 2026•0 citations

Single-shot distinguishability and antidistinguishability of quantum measurements

Satyaki Manna, Sneha Suresh, Manan Singh Kachhawaha +1 more

Among the surprising features of quantum measurements, the problem of distinguishing and antidistinguishing general quantum measurements is fundamentally appealing. Unlike classical systems, quantum theory offers entangled states and peculiar state update rule of the postmeasurement state, which gives rise to four distinct scenarios for distinguishing (and antidistinguishing) quantum measurements: (i) probing single systems and without access to the postmeasurement states, (ii) probing entangled systems and without access to the postmeasurement states, (iii) probing single systems with access to the postmeasurement states, and (iv) probing entangled systems with access to the postmeasurement states. In these scenarios, we consider the probability of distinguishing (and antidistinguishing) quantum measurements sampled from a given set in the single-shot regime. For some scenarios, we provide the analytical expressions of distinguishability (and antidistinguishability) for qubit projective measurements. We show that the distinguishability of any pair of qubit projective measurements in scenario (iii) is always greater than its values in scenario (ii). Interestingly, we find certain pairs of qubit nonprojective measurements for which the optimal distinguishability in scenario (ii) is achieved using a nonmaximally entangled state. It turns out that, for any set of measurements, distinguishability (and antidistinguishability) in scenario (i) is always less than or equal to in any other scenario, while it reaches its highest possible value in scenario (iv). We establish that the relations form a strict hierarchy, and there is no hierarchical relation between scenarios (ii) and (iii). In particular, we introduce different variants of the well-known ``trine'' qubit measurement to construct pairs (and triples) of qubit quantum measurements such that they are perfectly distinguishable (and antidistinguishable) in scenario (ii) but not in scenario (iii) and vice versa. Additionally, we present qubit measurements that are perfectly distinguishable (and antidistinguishable) in scenario (iv) but not in any other scenario.

arXiv:2410.10632•Physical Review A•Feb 14, 2025•7 citations

Incompatible measurements in a class of general probabilistic theories

Anna Jenčová

We study incompatibility of measurements and its relation to steering and nonlocality in a class of finite-dimensional general probabilistic theories (GPTs). The basic idea is to represent finite collections of measurements as affine maps of a state space into a polysimplex and show that incompatibility is characterized by properties of these maps. We introduce the notion of an incompatibility witness and show its relation to incompatibility degree. We find the largest incompatibility degree attainable by pairs of two-outcome quantum measurements and characterize state spaces for which incompatibility degree attains maximal values possible in GPTs. As examples, we study the spaces of classical and quantum channels and show their close relation to polysimplices. This relation explains the superquantum nonclassical effects that were observed on these spaces.

arXiv:1705.08008•Physical Review A•Jul 25, 2018•39 citations

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

Single-shot antidistinguishability of unitary operations

Satyaki Manna, Anandamay Das Bhowmik

The notion of antidistinguishability captures the possibility of ruling out certain alternatives in a quantum experiment without identifying the actual outcome. Although extensively studied for quantum states, the antidistinguishability of quantum channels remains largely unexplored. In this work, we investigate the single-shot antidistinguishability of unitary operations. We analyse two scenarios: antidistinguishability with single-system probes and with entangled probes. For sets of three unitaries, we first prove that all maximally entangled states are equivalent in their performance as probe. In the qubit case, we further establish that maximally entangled probes are always sufficient: if a set of three qubit unitaries is antidistinguishable with either a single-system or non-maximally entangled probe, then it is also antidistinguishable with a maximally entangled one. However, in higher dimension, this equivalence fails. In \textit{dimension 3}, there exists a set of unitaries that are antidistinguishable with non-maximally entangled probe or single-system probe but not with maximally entangled probe. We also establish that union of two antidistinguishable sets of three qubit unitaries also forms a set of antidistinguishable unitaries. Lastly, we provide methods to construct antidistinguishable unitaries from non-antidistinguishable ones.

arXiv:2510.14609•Physical Review A•Jan 29, 2026•5 citations
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.
The paper studies perfect state exclusion (antidistinguishability) in general probabilistic theories (GPTs), relating exclusion measurements to state-space geometry. It distinguishes ordinary antidistinguishability, which permits zero measurement effects; strong antidistinguishability, which requires every effect to be nonzero; and equal antidistinguishability, where each outcome has probability 1/(k−1)1/(k-1)1/(k−1) on every state except the one it excludes.
General results describe how exclusion behaves under enlarging sets, taking unions, and replacing states by states in their faces. Equal antidistinguishability requires k≤d+1k\leq d+1k≤d+1, where ddd is the state space’s affine dimension: applying the exclusion effects to a putative affine dependence proves that the states must be affinely independent. Sets containing an interior, completely mixed state cannot be strongly antidistinguishable.
For regular polygon GPTs, the paper gives geometric feasibility conditions for exclusion, constructs strongly antidistinguishing measurements for the full vertex set and equally spaced kkk-vertex subsets with k∣nk\mid nk∣n, and constructs equally antidistinguishing trines when 3∣n3\mid n3∣n.
A communication application considers Random Exclusion Codes with two uniformly random ternary symbols. Restricting decoding to dichotomic measurements relates the success probability to known Random Access Code optima through SREC=5/9+(4/9)SRACS_{\mathrm{REC}}=5/9+(4/9)S_{\mathrm{RAC}}SREC​=5/9+(4/9)SRAC​. The square achieves success probability 111, and the polygon formulas converge to the qubit value (7+2)/9(7+\sqrt{2})/9(7+2​)/9; some polygons exceed it. The stated limitation is that dichotomic decoding is not proved sufficient for general GPTs, so these restricted optima provide lower bounds on unrestricted performance.
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 Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Abstract The entropy principle asserts that spontaneous processes drive systems toward states of higher disorder. Operational origin of such randomness is a question of utmost importance. The seminal Birkhoff theorem (also known as Birkhoff-von Neumann theorem) identifies doubly stochastic transformations as convex mixtures of reversible transformations, thereby providing an epistemic account of disorder. Quantum theory, however, does not satisfy this equivalence in general. In this work, we investigate this question within the framework of generalized probabilistic theories (GPTs). We prove a violation of the Birkhoff theorem in the square-bit model, a canonical non-quantum GPT, and further show that this violation persists asymptotically under tensor products of any finite, yet arbitrarily large, number of copies of even-polygon models. This provides evidence that the failure of the Birkhoff theorem is an intrinsic operational feature of a wide class of GPTs, rather than a peculiarity of quantum theory. Furthermore, we show that, beyond quantum theory, the preorder over states induced by mixtures of reversible transformations can differ from that induced by doubly stochastic transformations, leading to inequivalent notions of state convertibility and distinct resource theories of purity. Beyond its foundational significance, we show that the violation of the Birkhoff theorem admits a concrete operational interpretation: in the square-bit theory, it serves as a genuine resource for enhancing the performance of Random Access Codes. Finally, we discuss the construction of entropy functions in GPTs that remain consistent with thermodynamic principles, in the spirit of von Neumann’s formulation.
Among the surprising features of quantum measurements, the problem of distinguishing and antidistinguishing general quantum measurements is fundamentally appealing. Unlike classical systems, quantum theory offers entangled states and peculiar state update rule of the postmeasurement state, which gives rise to four distinct scenarios for distinguishing (and antidistinguishing) quantum measurements: (i) probing single systems and without access to the postmeasurement states, (ii) probing entangled systems and without access to the postmeasurement states, (iii) probing single systems with access to the postmeasurement states, and (iv) probing entangled systems with access to the postmeasurement states. In these scenarios, we consider the probability of distinguishing (and antidistinguishing) quantum measurements sampled from a given set in the single-shot regime. For some scenarios, we provide the analytical expressions of distinguishability (and antidistinguishability) for qubit projective measurements. We show that the distinguishability of any pair of qubit projective measurements in scenario (iii) is always greater than its values in scenario (ii). Interestingly, we find certain pairs of qubit nonprojective measurements for which the optimal distinguishability in scenario (ii) is achieved using a nonmaximally entangled state. It turns out that, for any set of measurements, distinguishability (and antidistinguishability) in scenario (i) is always less than or equal to in any other scenario, while it reaches its highest possible value in scenario (iv). We establish that the relations form a strict hierarchy, and there is no hierarchical relation between scenarios (ii) and (iii). In particular, we introduce different variants of the well-known ``trine'' qubit measurement to construct pairs (and triples) of qubit quantum measurements such that they are perfectly distinguishable (and antidistinguishable) in scenario (ii) but not in scenario (iii) and vice versa. Additionally, we present qubit measurements that are perfectly distinguishable (and antidistinguishable) in scenario (iv) but not in any other scenario.
We study incompatibility of measurements and its relation to steering and nonlocality in a class of finite-dimensional general probabilistic theories (GPTs). The basic idea is to represent finite collections of measurements as affine maps of a state space into a polysimplex and show that incompatibility is characterized by properties of these maps. We introduce the notion of an incompatibility witness and show its relation to incompatibility degree. We find the largest incompatibility degree attainable by pairs of two-outcome quantum measurements and characterize state spaces for which incompatibility degree attains maximal values possible in GPTs. As examples, we study the spaces of classical and quantum channels and show their close relation to polysimplices. This relation explains the superquantum nonclassical effects that were observed on these spaces.
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.
The notion of antidistinguishability captures the possibility of ruling out certain alternatives in a quantum experiment without identifying the actual outcome. Although extensively studied for quantum states, the antidistinguishability of quantum channels remains largely unexplored. In this work, we investigate the single-shot antidistinguishability of unitary operations. We analyse two scenarios: antidistinguishability with single-system probes and with entangled probes. For sets of three unitaries, we first prove that all maximally entangled states are equivalent in their performance as probe. In the qubit case, we further establish that maximally entangled probes are always sufficient: if a set of three qubit unitaries is antidistinguishable with either a single-system or non-maximally entangled probe, then it is also antidistinguishable with a maximally entangled one. However, in higher dimension, this equivalence fails. In \textit{dimension 3}, there exists a set of unitaries that are antidistinguishable with non-maximally entangled probe or single-system probe but not with maximally entangled probe. We also establish that union of two antidistinguishable sets of three qubit unitaries also forms a set of antidistinguishable unitaries. Lastly, we provide methods to construct antidistinguishable unitaries from non-antidistinguishable ones.