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

Antidistinguishability of states in General Probabilistic Theories — E8 Intelligence Research

Andrew Stewart Caldin

Published Nov 5, 2026• 0 citations
Publisher

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

DOI
10.5281/zenodo.23978998

Related papers

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

Multinegativity and single-letter formulas for asymptotic entanglement — E8 Intelligence Research

Andrew Stewart Caldin

The study of entanglement inevitably leads to the concept of regularization, where measures are evaluated on infinitely many copies of a state. Single-letter formulas try to make these asymptotic entanglement quantities accessible through a calculation on one copy of a state, but are rarely available. We introduce a decreasing hierarchy of computable upper bounds on the asymptotic relative entropy of entanglement with respect to positive-partial-transpose (PPT) states. The regularization of every fixed hierarchy level equals this asymptotic quantity. Additivity at any level therefore yields a single-letter formula, even when the usual one-copy relative entropy is nonadditive. We establish such additivity at the first nontrivial level for two broad multiparameter families, both containing all Werner states. The upper-bound construction also extends to sandwiched Renyi divergences. The hierarchy motivates $k$-multinegative states, a generalization of binegative states and the associated Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 7, 2026•0 citations

Quantum Cognition: Revolutionising Decision-Making Through Quantum Probability Theory and Geometric Frameworks — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Quantum cognition redefines decision-making processes using quantum probability theory | MATH: Quantum probability models (e.g., the Born rule), superposition states, entanglement | CONNECTION: Links to non-classical probability structures, potentially indicating underlying geometric frameworks relevant to human cognition | DEPTH: 8 Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 15, 2026•0 citations

Deep thermalization and Hilbert space ergodicity — E8 Intelligence Research

Andrew Stewart Caldin

Recent advances in quantum simulation have enabled the discovery of novel forms of universality in quantum many-body dynamics. In this Review, we discuss deep thermalization and Hilbert space ergodicity--two recently discovered phenomena characterized by the emergence of distributions of quantum states that are "maximally random" in a precise sense. They offer a new perspective on how irreversible statistical mechanics arises from reversible unitary quantum dynamics, going beyond conventional theories of quantum thermalization and equilibration. We review a unifying framework, rooted in quantum information theory and principles of maximum entropy, that explains the different forms of ergodicity which arise under various physical constraints. We discuss open questions and active research directions, including generalizations beyond ensembles of pure quantum states, phase transitions in deep thermalization tied to deeper forms of ergodicity-breaking, connections to broader topics in quan Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 13, 2026•0 citations

Tight bounds for antidistinguishability and circulant sets of pure quantum states

Nathaniel Johnston, Vincent Russo, Jamie Sikora

A set of pure quantum states is said to be antidistinguishable if upon sampling one at random, there exists a measurement to perfectly determine some state that was not sampled. We show that antidistinguishability of a set of n pure states is equivalent to a property of its Gram matrix called ( n − 1 ) -incoherence, thus establishing a connection with quantum resource theories that lets us apply a wide variety of new tools to antidistinguishability. As a particular application of our result, we present an explicit formula (not involving any semidefinite programming) that determines whether or not a set with a circulant Gram matrix is antidistinguishable. We also show that if all inner products are smaller than ( n − 2 ) / ( 2 n − 2 ) then the set must be antidistinguishable, and we show that this bound is tight when n ≤ 4 . We also give a simpler proof that if all the inner products are strictly larger than ( n − 2 ) / ( n − 1 ) , then the set cannot be antidistinguishable, and we show that this bound is tight for all n .

arXiv:2311.17047•Quantum•Feb 4, 2025•22 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
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
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 study of entanglement inevitably leads to the concept of regularization, where measures are evaluated on infinitely many copies of a state. Single-letter formulas try to make these asymptotic entanglement quantities accessible through a calculation on one copy of a state, but are rarely available. We introduce a decreasing hierarchy of computable upper bounds on the asymptotic relative entropy of entanglement with respect to positive-partial-transpose (PPT) states. The regularization of every fixed hierarchy level equals this asymptotic quantity. Additivity at any level therefore yields a single-letter formula, even when the usual one-copy relative entropy is nonadditive. We establish such additivity at the first nontrivial level for two broad multiparameter families, both containing all Werner states. The upper-bound construction also extends to sandwiched Renyi divergences. The hierarchy motivates kkk-multinegative states, a generalization of binegative states and the associated Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Recent advances in quantum simulation have enabled the discovery of novel forms of universality in quantum many-body dynamics. In this Review, we discuss deep thermalization and Hilbert space ergodicity--two recently discovered phenomena characterized by the emergence of distributions of quantum states that are "maximally random" in a precise sense. They offer a new perspective on how irreversible statistical mechanics arises from reversible unitary quantum dynamics, going beyond conventional theories of quantum thermalization and equilibration. We review a unifying framework, rooted in quantum information theory and principles of maximum entropy, that explains the different forms of ergodicity which arise under various physical constraints. We discuss open questions and active research directions, including generalizations beyond ensembles of pure quantum states, phase transitions in deep thermalization tied to deeper forms of ergodicity-breaking, connections to broader topics in quan Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
A set of pure quantum states is said to be antidistinguishable if upon sampling one at random, there exists a measurement to perfectly determine some state that was not sampled. We show that antidistinguishability of a set of n pure states is equivalent to a property of its Gram matrix called ( n − 1 ) -incoherence, thus establishing a connection with quantum resource theories that lets us apply a wide variety of new tools to antidistinguishability. As a particular application of our result, we present an explicit formula (not involving any semidefinite programming) that determines whether or not a set with a circulant Gram matrix is antidistinguishable. We also show that if all inner products are smaller than ( n − 2 ) / ( 2 n − 2 ) then the set must be antidistinguishable, and we show that this bound is tight when n ≤ 4 . We also give a simpler proof that if all the inner products are strictly larger than ( n − 2 ) / ( n − 1 ) , then the set cannot be antidistinguishable, and we show that this bound is tight for all n .
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.