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

FCD-QM 1-A: Hyperbolic Degree Bounds Signaling Dimension in Generalized Probabilistic Theories

Geoffrey Marcellin

Published Sep 24, 2026• 0 citations
Publisher

Abstract

The signaling dimension of a probabilistic system is the minimum number of classical states required to reproduce, with shared randomness, every finite prepare-and-measure input-output correlation generated by the system. Frenkel and Weiner proved the complex-quantum simulation result that is equivalently expressed as signaling dimension n for an n-level system. Building on Frenkel’s later positive-multilinear-form/supply-demand formulation, we show that hyperbolic polarizations provide a general source of the multilinear structure required by that simulation mechanism, extending the resulting bound to arbitrary proper hyperbolicity cones. If the effect cone of an ordered probabilistic model is the hyperbolicity cone of a homogeneous polynomial p of degree d, then its signaling dimension is at most d. The proof uses the non-negativity of the polar form of p on the hyperbolicity cone and an order-theoretic identity relating the smallest hyperbolic eigenvalue of an effect to its minimum value over normalized dual states. As a corollary, every canonical Euclidean Jordan model has signaling dimension exactly equal to its Jordan rank. This simultaneously covers classical systems, real, complex and quaternionic matrix Jordan models, spin factors, the exceptional Albert algebra, and direct sums. For symmetric cones this yields a numerical identity between signaling dimension, Jordan rank, the cone Carathéodory number, and the optimal self-concordant barrier parameter. The general hyperbolic bound need not be tight; the ℓ1-cone/square-bit example of Ito and Lourenço provides a strict gap when viewed through signaling dimension. The result separates exact classical prepare-and-measure simulation dimension from internal state-space geometry at fixed signaling dimension and motivates the study of which operational invariants resolve the structure that signaling dimension alone does not capture.

DOI
10.5281/zenodo.22946777

Related papers

FCD-QM 1-B: Recursive No-Hypersignaling Constraints on Euclidean Jordan Theories

Geoffrey Marcellin

This paper extends the results of Hyperbolic Degree Bounds Signaling Dimension in Generalized Probabilistic Theories (Zenodo DOI: 10.5281/zenodo.22946778), which established that the signaling dimension of every canonical finite-dimensional Euclidean Jordan algebra (EJA) equals its Jordan rank. We investigate the consequences of this single-system identity under recursive composition. Combining the injectivity of local effect-space tensor products in standard non-signaling composites with the no-hypersignaling (NH) principle, we prove that the normalized linear-dimension ratio η_lin(S) = dim(S)/sign.dim(S)² is supermultiplicative. Consequently, any local excess above unity is amplified under repeated composition. For canonical EJA composites satisfying the structural axioms of Barnum, Graydon, and Wilce, product Jordan frames and NH enforce multiplicativity of composite rank. Together with established EJA classification results, this yields the conditional recursive constraint dim(J) ≤ rank(J)². Within this framework, quaternionic matrix Jordan systems and spin factors V_n with n ≥ 4 are excluded, while real matrix systems remain subcritical and complex matrix systems exactly saturate the bound. We also obtain finite-copy exclusion criteria and identify exact NH violations in specified EJA composition rules, including doubled complex and quaternionic composites. The analysis does not assume local tomography. Its conclusions are conditional on NH and the stated composition axioms; they do not establish unique selection of complex quantum theory. This work provides a compositional continuation of the preceding hyperbolic-signaling result, connecting classical simulation requirements to structural constraints on Jordan probabilistic theories.

•Oct 11, 2026•0 citations

The signaling dimension in generalized probabilistic theories

Michele Dall’Arno, Alessandro Tosini, Francesco Buscemi

The signaling dimension of a given physical system quantifies the minimum dimension of a classical system required to reproduce all input/output correlations of the given system. Thus, unlike other dimension measures - such as the dimension of the linear space or the maximum number of (jointly or pairwise) perfectly discriminable states - which examine the correlation space only along a single direction, the signaling dimension does not depend on the arbitrary choice of a specific operational task. In this sense, the signaling dimension summarizes the structure of the entire set of input/output correlations consistent with a given system in a single scalar quantity. For quantum theory, it was recently proved by Frenkel and Weiner in a seminal result that the signaling dimension coincides with the Hilbert space dimension. Here, we derive analytical and algorithmic techniques to compute the signaling dimension for any given system of any given generalized probabilistic theory. We prove that it suffices to consider extremal measurements with ray-extremal effects, and we bound the number of elements of any such measurement in terms of the linear dimension. For systems with a finite number of extremal effects, we recast the problem of characterizing the extremal measurements with ray-extremal effects as the problem of deriving the vertex description of a polytope given its face description, which can be conveniently solved by standard techniques such as the double description algorithm. For each such measurement, we recast the computation of the signaling dimension as a linear program, and we propose a combinatorial branch and bound algorithm to reduce its size. We apply our results to derive the extremal measurements with ray-extremal effects of a composition of two square bits (or squits) and prove that their signaling dimension is five, even though each squit has a signaling dimension equal to two.

arXiv:2311.13103•Quantum Information and Computation•Apr 1, 2024•2 citations

The signaling dimension of two-dimensional and polytopic systems

Shuriku Kai, Michele Dall’Arno

The signaling dimension of any given physical system represents its classical simulation cost, that is, the minimum dimension of a classical system capable of reproducing all the input/output correlations of the given system. The signaling dimension landscape is vastly unexplored; the only non-trivial systems whose signaling dimension is known -- other than quantum systems -- are the octahedron and the composition of two squares.}{Building on previous results by Matsumoto, Kimura, and Frenkel, our first result consists of deriving bounds on the signaling dimension of any system as a function of its Minkowski measure of asymmetry. We use such bounds to prove that the signaling dimension of any two-dimensional system (i.e. with two-dimensional set of admissible states, such as polygons and the real qubit) is two if and only if such a set is centrally symmetric, and three otherwise, thus conclusively settling the problem of the signaling dimension for such systems.} {Guided by the relevance of symmetries in the two dimensional case, we propose a branch and bound division-free algorithm for the exact computation of the symmetries of any given polytope, in polynomial time in the number of vertices and in factorial time in the dimension of the space. Our second result then consist of providing an algorithm for the exact computation of the signaling dimension of any given system, that outperforms previous proposals by exploiting the aforementioned bounds to improve its pruning techniques and incorporating as a subroutine the aforementioned symmetries-finding algorithm. We apply our algorithm to compute the exact value of the signaling dimension for all rational Platonic, Archimedean, and Catalan solids, and for the class of hyper-octahedral systems up to dimension five.

arXiv:2407.17725•Quantum Information and Computation•Oct 1, 2024•0 citations

The State Equation: Causal Cone Rank and Minimal Physical Memory

Максим Чурилов

We ask which finite classical or quantum memory is sufficient to generate the predictions of a stochastic process. Starting from its Hankel kernel \(H_p(u,v)=p(uv)\), we define causal cone rank by globally shift-compatible cone lifts of the canonical predictive realization. Within a specified realization class, the physical carrier minimum equals the corresponding minimum compatible lift dimension. The framework separates unconstrained Hankel rank, classical nonnegative realizations, and quantum completely positive instruments, and extends to action--outcome processes with interventionwise normalization. A declared linear coarse state has exactly \(\dim\ker(C|_{\operatorname{im} H_p})\) missing predictive coordinates. Finite temporal cuts give nonnegative- and positive-semidefinite-rank witnesses; an explicit two-time family exhibits a growing exact classical--quantum dimension gap, while its fixed-tolerance classical cost remains bounded. For an exact finite-dimensional time-homogeneous Markovian dilation, reset-conditioned closure rank obeys \(r_{\rm cl}\le d_S^2(d_E^2-1)\), with a saturating qubit--qubit example. We give nonasymptotic singular-value tests, while emphasizing that numerical rank and unconstrained truncated singular expansions do not themselves certify a physical realization.

•Nov 3, 2026•0 citations

Generalized probabilistic theories and conic extensions of polytopes

Samuel Fiorini, Serge Massar, Manas K. Patra +1 more

Generalized probabilistic theories (GPT) provide a general framework that includes classical and quantum theories. It is described by a cone C and its dual C *. We show that whether some one-way communication complexity problems can be solved within a GPT is equivalent to the recently introduced cone factorization of the corresponding communication matrix M . We also prove an analogue of Holevoʼs theorem: when the cone C is contained in , the classical capacity of the channel realized by sending GPT states and measuring them is bounded by . Polytopes and optimising functions over polytopes arise in many areas of discrete mathematics. A conic extension of a polytope is the intersection of a cone C with an affine subspace whose projection onto the original space yields the desired polytope. Extensions of polytopes can sometimes be much simpler geometric objects than the polytope itself. The existence of a conic extension of a polytope is equivalent to that of a cone factorization of the slack matrix of the polytope, on the same cone. We show that all polytopes whose vertices can be recognized by a polynomial size circuit, which includes as a special case the travelling salesman polytope and many other polytopes from combinatorial optimization, have small conic extension complexity when the cone is the completely positive cone. Using recent exponential lower bounds on the linear extension complexity of polytopes, this provides an exponential gap between the communication complexity of GPT based on the completely positive cone and classical communication complexity, and a conjectured exponential gap with quantum communication complexity. Our work thus relates the communication complexity of generalizations of quantum theory to questions of mainstream interest in the area of combinatorial optimization.

arXiv:1310.4125•Journal of Physics A Mathematical and Theoretical•Dec 11, 2014•17 citations

On the signaling dimension of the cross-polytope

Tamás Bencze, Péter E. Frenkel

In the general probabilistic model of information theory, the signaling dimension of a given communication protocol (or, equivalently, of its state space) is the smallest possible complexity of a classical communication protocol capable of perfectly simulating the given one in terms of input-output correlations. The signaling dimensions of three-, four-, and five-dimensional cross-polytopes have been known to be 3. We give logarithmic lower and upper bounds for the signaling dimensions of higher dimensional cross-polytopes, pinning down the value up to an additive gap of 2. The lower bound shows that the signaling dimension goes to infinity, in contrast to the case of balls and hypercubes.

arXiv:2610.05924•Oct 5, 2026•0 citations
The signaling dimension of a probabilistic system is the minimum number of classical states required to reproduce, with shared randomness, every finite prepare-and-measure input-output correlation generated by the system. Frenkel and Weiner proved the complex-quantum simulation result that is equivalently expressed as signaling dimension n for an n-level system. Building on Frenkel’s later positive-multilinear-form/supply-demand formulation, we show that hyperbolic polarizations provide a general source of the multilinear structure required by that simulation mechanism, extending the resulting bound to arbitrary proper hyperbolicity cones. If the effect cone of an ordered probabilistic model is the hyperbolicity cone of a homogeneous polynomial p of degree d, then its signaling dimension is at most d. The proof uses the non-negativity of the polar form of p on the hyperbolicity cone and an order-theoretic identity relating the smallest hyperbolic eigenvalue of an effect to its minimum value over normalized dual states. As a corollary, every canonical Euclidean Jordan model has signaling dimension exactly equal to its Jordan rank. This simultaneously covers classical systems, real, complex and quaternionic matrix Jordan models, spin factors, the exceptional Albert algebra, and direct sums. For symmetric cones this yields a numerical identity between signaling dimension, Jordan rank, the cone Carathéodory number, and the optimal self-concordant barrier parameter. The general hyperbolic bound need not be tight; the ℓ1-cone/square-bit example of Ito and Lourenço provides a strict gap when viewed through signaling dimension. The result separates exact classical prepare-and-measure simulation dimension from internal state-space geometry at fixed signaling dimension and motivates the study of which operational invariants resolve the structure that signaling dimension alone does not capture.
This paper extends the results of Hyperbolic Degree Bounds Signaling Dimension in Generalized Probabilistic Theories (Zenodo DOI: 10.5281/zenodo.22946778), which established that the signaling dimension of every canonical finite-dimensional Euclidean Jordan algebra (EJA) equals its Jordan rank. We investigate the consequences of this single-system identity under recursive composition. Combining the injectivity of local effect-space tensor products in standard non-signaling composites with the no-hypersignaling (NH) principle, we prove that the normalized linear-dimension ratio η_lin(S) = dim(S)/sign.dim(S)² is supermultiplicative. Consequently, any local excess above unity is amplified under repeated composition. For canonical EJA composites satisfying the structural axioms of Barnum, Graydon, and Wilce, product Jordan frames and NH enforce multiplicativity of composite rank. Together with established EJA classification results, this yields the conditional recursive constraint dim(J) ≤ rank(J)². Within this framework, quaternionic matrix Jordan systems and spin factors V_n with n ≥ 4 are excluded, while real matrix systems remain subcritical and complex matrix systems exactly saturate the bound. We also obtain finite-copy exclusion criteria and identify exact NH violations in specified EJA composition rules, including doubled complex and quaternionic composites. The analysis does not assume local tomography. Its conclusions are conditional on NH and the stated composition axioms; they do not establish unique selection of complex quantum theory. This work provides a compositional continuation of the preceding hyperbolic-signaling result, connecting classical simulation requirements to structural constraints on Jordan probabilistic theories.
The signaling dimension of a given physical system quantifies the minimum dimension of a classical system required to reproduce all input/output correlations of the given system. Thus, unlike other dimension measures - such as the dimension of the linear space or the maximum number of (jointly or pairwise) perfectly discriminable states - which examine the correlation space only along a single direction, the signaling dimension does not depend on the arbitrary choice of a specific operational task. In this sense, the signaling dimension summarizes the structure of the entire set of input/output correlations consistent with a given system in a single scalar quantity. For quantum theory, it was recently proved by Frenkel and Weiner in a seminal result that the signaling dimension coincides with the Hilbert space dimension. Here, we derive analytical and algorithmic techniques to compute the signaling dimension for any given system of any given generalized probabilistic theory. We prove that it suffices to consider extremal measurements with ray-extremal effects, and we bound the number of elements of any such measurement in terms of the linear dimension. For systems with a finite number of extremal effects, we recast the problem of characterizing the extremal measurements with ray-extremal effects as the problem of deriving the vertex description of a polytope given its face description, which can be conveniently solved by standard techniques such as the double description algorithm. For each such measurement, we recast the computation of the signaling dimension as a linear program, and we propose a combinatorial branch and bound algorithm to reduce its size. We apply our results to derive the extremal measurements with ray-extremal effects of a composition of two square bits (or squits) and prove that their signaling dimension is five, even though each squit has a signaling dimension equal to two.
The signaling dimension of any given physical system represents its classical simulation cost, that is, the minimum dimension of a classical system capable of reproducing all the input/output correlations of the given system. The signaling dimension landscape is vastly unexplored; the only non-trivial systems whose signaling dimension is known -- other than quantum systems -- are the octahedron and the composition of two squares.}{Building on previous results by Matsumoto, Kimura, and Frenkel, our first result consists of deriving bounds on the signaling dimension of any system as a function of its Minkowski measure of asymmetry. We use such bounds to prove that the signaling dimension of any two-dimensional system (i.e. with two-dimensional set of admissible states, such as polygons and the real qubit) is two if and only if such a set is centrally symmetric, and three otherwise, thus conclusively settling the problem of the signaling dimension for such systems.} {Guided by the relevance of symmetries in the two dimensional case, we propose a branch and bound division-free algorithm for the exact computation of the symmetries of any given polytope, in polynomial time in the number of vertices and in factorial time in the dimension of the space. Our second result then consist of providing an algorithm for the exact computation of the signaling dimension of any given system, that outperforms previous proposals by exploiting the aforementioned bounds to improve its pruning techniques and incorporating as a subroutine the aforementioned symmetries-finding algorithm. We apply our algorithm to compute the exact value of the signaling dimension for all rational Platonic, Archimedean, and Catalan solids, and for the class of hyper-octahedral systems up to dimension five.
We ask which finite classical or quantum memory is sufficient to generate the predictions of a stochastic process. Starting from its Hankel kernel Hp(u,v)=p(uv)H_p(u,v)=p(uv)Hp​(u,v)=p(uv), we define causal cone rank by globally shift-compatible cone lifts of the canonical predictive realization. Within a specified realization class, the physical carrier minimum equals the corresponding minimum compatible lift dimension. The framework separates unconstrained Hankel rank, classical nonnegative realizations, and quantum completely positive instruments, and extends to action--outcome processes with interventionwise normalization. A declared linear coarse state has exactly dim⁡ker⁡(C∣im⁡Hp)\dim\ker(C|_{\operatorname{im} H_p})dimker(C∣imHp​​) missing predictive coordinates. Finite temporal cuts give nonnegative- and positive-semidefinite-rank witnesses; an explicit two-time family exhibits a growing exact classical--quantum dimension gap, while its fixed-tolerance classical cost remains bounded. For an exact finite-dimensional time-homogeneous Markovian dilation, reset-conditioned closure rank obeys rcl≤dS2(dE2−1)r_{\rm cl}\le d_S^2(d_E^2-1)rcl​≤dS2​(dE2​−1), with a saturating qubit--qubit example. We give nonasymptotic singular-value tests, while emphasizing that numerical rank and unconstrained truncated singular expansions do not themselves certify a physical realization.
Generalized probabilistic theories (GPT) provide a general framework that includes classical and quantum theories. It is described by a cone C and its dual C *. We show that whether some one-way communication complexity problems can be solved within a GPT is equivalent to the recently introduced cone factorization of the corresponding communication matrix M . We also prove an analogue of Holevoʼs theorem: when the cone C is contained in , the classical capacity of the channel realized by sending GPT states and measuring them is bounded by . Polytopes and optimising functions over polytopes arise in many areas of discrete mathematics. A conic extension of a polytope is the intersection of a cone C with an affine subspace whose projection onto the original space yields the desired polytope. Extensions of polytopes can sometimes be much simpler geometric objects than the polytope itself. The existence of a conic extension of a polytope is equivalent to that of a cone factorization of the slack matrix of the polytope, on the same cone. We show that all polytopes whose vertices can be recognized by a polynomial size circuit, which includes as a special case the travelling salesman polytope and many other polytopes from combinatorial optimization, have small conic extension complexity when the cone is the completely positive cone. Using recent exponential lower bounds on the linear extension complexity of polytopes, this provides an exponential gap between the communication complexity of GPT based on the completely positive cone and classical communication complexity, and a conjectured exponential gap with quantum communication complexity. Our work thus relates the communication complexity of generalizations of quantum theory to questions of mainstream interest in the area of combinatorial optimization.
In the general probabilistic model of information theory, the signaling dimension of a given communication protocol (or, equivalently, of its state space) is the smallest possible complexity of a classical communication protocol capable of perfectly simulating the given one in terms of input-output correlations. The signaling dimensions of three-, four-, and five-dimensional cross-polytopes have been known to be 3. We give logarithmic lower and upper bounds for the signaling dimensions of higher dimensional cross-polytopes, pinning down the value up to an additive gap of 2. The lower bound shows that the signaling dimension goes to infinity, in contrast to the case of balls and hypercubes.