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:2407.17725 · Quantum Information and Computation

The signaling dimension of two-dimensional and polytopic systems

Shuriku Kai, Michele Dall’Arno

Published Oct 1, 2024• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.26421/qic24.11-12-3

Related papers

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

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

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

Geoffrey Marcellin

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.

•Sep 24, 2026•0 citations

The signaling dimension of physical systems

Michele Dall’Arno

The signaling dimension of a physical system is the minimum dimension of a classical channel that can reproduce the set of input-output correlations attainable by the given system. Here we put the signaling dimension into perspective by reviewing some of the main known results on the topic, starting from Frenkel and Weiner's 2015 breakthrough showing that the signaling dimension of any quantum system is equal to its Hilbert space dimension.

arXiv:2210.15210•Aug 25, 2022•2 citations

Platonic Bell inequalities for all dimensions

Károly F. Pál, Tamás Vértesi

In this paper we study the Platonic Bell inequalities for all possible dimensions. There are five Platonic solids in three dimensions, but there are also solids with Platonic properties (also known as regular polyhedra) in four and higher dimensions. The concept of Platonic Bell inequalities in the three-dimensional Euclidean space was introduced by Tavakoli and Gisin [Quantum 4, 293 (2020)]. For any three-dimensional Platonic solid, an arrangement of projective measurements is associated where the measurement directions point toward the vertices of the solids. For the higher dimensional regular polyhedra, we use the correspondence of the vertices to the measurements in the abstract Tsirelson space. We give a remarkably simple formula for the quantum violation of all the Platonic Bell inequalities, which we prove to attain the maximum possible quantum violation of the Bell inequalities, i.e. the Tsirelson bound. To construct Bell inequalities with a large number of settings, it is crucial to compute the local bound efficiently. In general, the computation time required to compute the local bound grows exponentially with the number of measurement settings. We find a method to compute the local bound exactly for any bipartite two-outcome Bell inequality, where the dependence becomes polynomial whose degree is the rank of the Bell matrix. To show that this algorithm can be used in practice, we compute the local bound of a 300-setting Platonic Bell inequality based on the halved dodecaplex. In addition, we use a diagonal modification of the original Platonic Bell matrix to increase the ratio of quantum to local bound. In this way, we obtain a four-dimensional 60-setting Platonic Bell inequality based on the halved tetraplex for which the quantum violation exceeds the 2 ratio.

arXiv:2112.03887•Quantum•Jul 7, 2022•10 citations

Computing the quantumguesswork: a quadratic assignment problem

Michele Dall’Arno, Francesco Buscemi, Takeshi Koshiba

The quantum guesswork quantifies the minimum number of queries needed to guess the state of a quantum ensemble if one is allowed to query only one state at a time. Previous approaches to the computation of the guesswork were based on standard semi-definite programming techniques and therefore lead to approximated results. In contrast, we show that computing the quantum guesswork of qubit ensembles with uniform probability distribution corresponds to solving a quadratic assignment problem and we provide an algorithm that, upon the input of any qubit ensemble over a discrete ring, after finitely many steps outputs the exact closed-form expression of its guesswork. While in general the complexity of our guesswork-computing algorithm is factorial in the number of states, our main result consists of showing a more-than-quadratic speedup for symmetric ensembles, a scenario corresponding to the three-dimensional analog of the maximization version of the turbine-balancing problem. To find such symmetries, we provide an algorithm that, upon the input of any point set over a discrete ring, after finitely many steps outputs its exact symmetries. The complexity of our symmetries-finding algorithm is polynomial in the number of points. As examples, we compute the guesswork of regular and quasi-regular sets of qubit states.

arXiv:2112.01666•Quantum Information and Computation•Jul 1, 2023•5 citations
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.
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.
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.
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.
In this paper we study the Platonic Bell inequalities for all possible dimensions. There are five Platonic solids in three dimensions, but there are also solids with Platonic properties (also known as regular polyhedra) in four and higher dimensions. The concept of Platonic Bell inequalities in the three-dimensional Euclidean space was introduced by Tavakoli and Gisin [Quantum 4, 293 (2020)]. For any three-dimensional Platonic solid, an arrangement of projective measurements is associated where the measurement directions point toward the vertices of the solids. For the higher dimensional regular polyhedra, we use the correspondence of the vertices to the measurements in the abstract Tsirelson space. We give a remarkably simple formula for the quantum violation of all the Platonic Bell inequalities, which we prove to attain the maximum possible quantum violation of the Bell inequalities, i.e. the Tsirelson bound. To construct Bell inequalities with a large number of settings, it is crucial to compute the local bound efficiently. In general, the computation time required to compute the local bound grows exponentially with the number of measurement settings. We find a method to compute the local bound exactly for any bipartite two-outcome Bell inequality, where the dependence becomes polynomial whose degree is the rank of the Bell matrix. To show that this algorithm can be used in practice, we compute the local bound of a 300-setting Platonic Bell inequality based on the halved dodecaplex. In addition, we use a diagonal modification of the original Platonic Bell matrix to increase the ratio of quantum to local bound. In this way, we obtain a four-dimensional 60-setting Platonic Bell inequality based on the halved tetraplex for which the quantum violation exceeds the 2 ratio.
The quantum guesswork quantifies the minimum number of queries needed to guess the state of a quantum ensemble if one is allowed to query only one state at a time. Previous approaches to the computation of the guesswork were based on standard semi-definite programming techniques and therefore lead to approximated results. In contrast, we show that computing the quantum guesswork of qubit ensembles with uniform probability distribution corresponds to solving a quadratic assignment problem and we provide an algorithm that, upon the input of any qubit ensemble over a discrete ring, after finitely many steps outputs the exact closed-form expression of its guesswork. While in general the complexity of our guesswork-computing algorithm is factorial in the number of states, our main result consists of showing a more-than-quadratic speedup for symmetric ensembles, a scenario corresponding to the three-dimensional analog of the maximization version of the turbine-balancing problem. To find such symmetries, we provide an algorithm that, upon the input of any point set over a discrete ring, after finitely many steps outputs its exact symmetries. The complexity of our symmetries-finding algorithm is polynomial in the number of points. As examples, we compute the guesswork of regular and quasi-regular sets of qubit states.