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:1603.07735 · Journal of Mathematical Psychology

Possibilities determine the combinatorial structure of probability polytopes

Samson Abramsky, Rui Soares Barbosa, Kohei Kishida, Raymond Lal, Shane Mansfield

Published May 17, 2016• 12 citations
arXivHTMLPDF
DOI
10.1016/j.jmp.2016.03.006

Related papers

Bell inequalities and the cut polytope : bridging quantum information science and combinatorial optimization

剛志 伊藤

•Jan 1, 2007•1 citation

Conditional probabilities on orthomodular lattices

Gianni Cassinelli, Piero Truini

Reports on Mathematical Physics•Aug 1, 1984•8 citations

Vertex structure of fiber products of probability polytopes

Aziz Kharoof, Cihan Okay

We develop tools for characterizing vertices of fiber products of polytopes and apply them to simplicial distribution polytopes, a class of probability polytopes arising in quantum foundations and quantum information. In the theory of simplicial distributions, a pair of simplicial sets encoding measurement and outcome spaces determines a convex polytope of compatible probability assignments. Our first results give geometric criteria for detecting vertices of fiber products in terms of support data. These results are obtained in the more general framework of inverse limits of diagrams of polytopes in standard form, and they translate to corresponding criteria for simplicial distributions on arbitrary colimits of measurement spaces. We then focus on one-dimensional measurement spaces, where simplicial distributions recover and generalize local marginal polytopes in graphical models. In this setting, our sharpest results concern dipole graphs, for which we obtain a complete characterization of vertices and refine it to a graph-theoretic criterion. These characterizations are reminiscent of the classical support-graph criteria for transportation polytopes, but they arise in a richer class of polytopes in which vertex structure depends not only on support acyclicity but also on additional geometric compatibility data. Using the collapsing method from simplicial topology, we transfer the dipole characterization to rose graphs and obtain analogous results there. Finally, we apply collapsing to complete bipartite graphs, which encode physically relevant bipartite Bell scenarios, and more generally to arbitrary connected graphs, yielding lower bounds on the number of vertices.

math.COCross-listedarXiv:2603.19479•Mar 23, 2026•3 citations

Local realism, detection efficiencies, and probability polytopes

Johannes Wilms, Yann Disser, G. Alber +1 more

We present a detailed investigation of minimum detection efficiencies, below which local realism cannot be violated by any quantum system of any dimension in bipartite Bell experiments. Lower bounds on these minimum detection efficiencies are determined with the help of linear programming techniques. Our approach is based on the observation that any possible bipartite quantum correlation originating from a quantum state in an arbitrary dimensional Hilbert space is sandwiched between two probability polytopes, namely the local (Bell) polytope and a corresponding nonlocal no-signaling polytope. Numerical results are presented demonstrating the dependence of these lower bounds on the numbers of inputs and outputs of the bipartite physical system.

arXiv:0808.2126•Physical Review A•Sep 23, 2008•24 citations

Geometry of probability distributions

Ingemar Bengtsson, Karol Życzkowski

Cambridge University Press eBooks•May 11, 2006•0 citations

Linear Codes Over Finite Fields From Lattice Polytopes: Structure, Duality, and Quantum Constructions

Sihem Mesnager, Rameez Raja

Linear codes constructed from combinatorial and geometric structures have played a central role in both classical and quantum coding theory. In this paper, we discuss a class of linear codes over finite fields, calledpolytope codes, obtained via defining sets derived from lattice polytopes. Unlike evaluation-based constructions, our approach exploits the intersection structure of polytope faces to directly control the algebraic and metric properties of the resulting codes. We develop a general defining-set framework for polytope codes and explicitly determine their lengths, dimensions, minimum distances, and Hamming weight distributions. This leads to infinite families of projective, few-weight, distance-optimal, and almost distance-optimal codes. Sufficient conditions for minimality are derived, resulting in new minimal codes that are well suited for applications to secret-sharing schemes. We further study the duals and hulls of polytope codes and provide explicit characterizations of self-orthogonal and linear complementary dual (LCD) families. One of the central results of the paper is a complete classification of quantum codes arising from polytope codes via the Calderbank-Shor-Steane (CSS) construction. We show that the geometry of face intersections fully determines whether the resulting quantum code is a standard CSS code, an LCD-based code, or an entanglement-assisted quantum error-correcting code, and we explicitly compute the required entanglement in the latter case. As a consequence, new families of binary, ternary, and prime-power quantum codes with previously unattained parameters are obtained. The proposed polytope-based framework unifies classical and quantum code constructions under a common geometric principle and opens new avenues for applications in cryptography, distributed storage, and quantum information processing.Mathematics Subject Classification. 94B05, 52B20, 11T71, 94A62, 94A45.

IEEE Transactions on Information Theory•Sep 7, 2026•0 citations
We develop tools for characterizing vertices of fiber products of polytopes and apply them to simplicial distribution polytopes, a class of probability polytopes arising in quantum foundations and quantum information. In the theory of simplicial distributions, a pair of simplicial sets encoding measurement and outcome spaces determines a convex polytope of compatible probability assignments. Our first results give geometric criteria for detecting vertices of fiber products in terms of support data. These results are obtained in the more general framework of inverse limits of diagrams of polytopes in standard form, and they translate to corresponding criteria for simplicial distributions on arbitrary colimits of measurement spaces. We then focus on one-dimensional measurement spaces, where simplicial distributions recover and generalize local marginal polytopes in graphical models. In this setting, our sharpest results concern dipole graphs, for which we obtain a complete characterization of vertices and refine it to a graph-theoretic criterion. These characterizations are reminiscent of the classical support-graph criteria for transportation polytopes, but they arise in a richer class of polytopes in which vertex structure depends not only on support acyclicity but also on additional geometric compatibility data. Using the collapsing method from simplicial topology, we transfer the dipole characterization to rose graphs and obtain analogous results there. Finally, we apply collapsing to complete bipartite graphs, which encode physically relevant bipartite Bell scenarios, and more generally to arbitrary connected graphs, yielding lower bounds on the number of vertices.
We present a detailed investigation of minimum detection efficiencies, below which local realism cannot be violated by any quantum system of any dimension in bipartite Bell experiments. Lower bounds on these minimum detection efficiencies are determined with the help of linear programming techniques. Our approach is based on the observation that any possible bipartite quantum correlation originating from a quantum state in an arbitrary dimensional Hilbert space is sandwiched between two probability polytopes, namely the local (Bell) polytope and a corresponding nonlocal no-signaling polytope. Numerical results are presented demonstrating the dependence of these lower bounds on the numbers of inputs and outputs of the bipartite physical system.
Linear codes constructed from combinatorial and geometric structures have played a central role in both classical and quantum coding theory. In this paper, we discuss a class of linear codes over finite fields, calledpolytope codes, obtained via defining sets derived from lattice polytopes. Unlike evaluation-based constructions, our approach exploits the intersection structure of polytope faces to directly control the algebraic and metric properties of the resulting codes. We develop a general defining-set framework for polytope codes and explicitly determine their lengths, dimensions, minimum distances, and Hamming weight distributions. This leads to infinite families of projective, few-weight, distance-optimal, and almost distance-optimal codes. Sufficient conditions for minimality are derived, resulting in new minimal codes that are well suited for applications to secret-sharing schemes. We further study the duals and hulls of polytope codes and provide explicit characterizations of self-orthogonal and linear complementary dual (LCD) families. One of the central results of the paper is a complete classification of quantum codes arising from polytope codes via the Calderbank-Shor-Steane (CSS) construction. We show that the geometry of face intersections fully determines whether the resulting quantum code is a standard CSS code, an LCD-based code, or an entanglement-assisted quantum error-correcting code, and we explicitly compute the required entanglement in the latter case. As a consequence, new families of binary, ternary, and prime-power quantum codes with previously unattained parameters are obtained. The proposed polytope-based framework unifies classical and quantum code constructions under a common geometric principle and opens new avenues for applications in cryptography, distributed storage, and quantum information processing.Mathematics Subject Classification. 94B05, 52B20, 11T71, 94A62, 94A45.