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:1007.5246 · Journal of Physics A Mathematical and Theoretical

Quantum sign permutation polytopes

Colin Wilmott, Hermann Kampermann, Dagmar Bruß

Published Nov 25, 2010• 1 citation
arXivHTMLPDF

Abstract

Convex polytopes are convex hulls of point sets in the n -dimensional space that generalize two-dimensional convex polygons and three-dimensional convex polyhedra. We concentrate on the class of n -dimensional polytopes in called sign permutation polytopes. We characterize sign permutation polytopes before relating their construction to constructions over the space of quantum density matrices. Finally, we consider the problem of state identification and show how sign permutation polytopes may be useful in addressing issues of robustness.

DOI
10.1088/1751-8113/43/50/505306

Related papers

Concavity of the set of quantum probabilities for any given dimension

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

Let us consider the set of all probabilities generated by local binary measurements on two separated quantum systems of a given local dimension $d$. We address the question of whether the shape of this quantum body is convex or not. We construct a point in the space of probabilities, which is on the convex hull of the local polytope, but still cannot be attained by measuring $d$-dimensional quantum systems if the number of measurement settings is large enough. From this it follows that this body is not convex. We also show that for finite $d$ the quantum body with the generalized measurement associated with positive operator-valued measures allowed may contain points that cannot be achieved with only projective measurements.

arXiv:0905.2915•Physical Review A•Oct 30, 2009•18 citations

Convex bodies of states and maps

Janusz Grabowski, Alberto Ibort, Marek Kuś +1 more

We give a general solution to the question of when the convex hulls of orbits of quantum states on a finite-dimensional Hilbert space under unitary actions of a compact group have a non-empty interior in the surrounding space of all density operators. The same approach can be applied to study convex combinations of quantum channels. The importance of both problems stems from the fact that, usually, only sets with non-vanishing volumes in the embedding spaces of all states or channels are of practical importance. For the group of local transformations on a bipartite system we characterize maximally entangled states by the properties of a convex hull of orbits through them. We also compare two partial characteristics of convex bodies in terms of the largest balls and maximum volume ellipsoids contained in them and show that, in general, they do not coincide. Separable states, mixed-unitary channels and k -entangled states are also considered as examples of our techniques.

arXiv:1306.3187•Journal of Physics A Mathematical and Theoretical•Oct 7, 2013•3 citations

Quantum magic squares: Dilations and their limitations

Gemma De las Cuevas, Tom Drescher, Tim Netzer

Quantum permutation matrices and quantum magic squares are generalizations of permutation matrices and magic squares, where the entries are no longer numbers but elements from arbitrary (non-commutative) algebras. The famous Birkhoff–von Neumann theorem characterizes magic squares as convex combinations of permutation matrices. In the non-commutative case, the corresponding question is as follows: Does every quantum magic square belong to the matrix convex hull of quantum permutation matrices? That is, does every quantum magic square dilate to a quantum permutation matrix? Here, we show that this is false even in the simplest non-commutative case. We also classify the quantum magic squares that dilate to a quantum permutation matrix with commuting entries and prove a quantitative lower bound on the diameter of this set. Finally, we conclude that not all Arveson extreme points of the free spectrahedron of quantum magic squares are quantum permutation matrices.

arXiv:1912.07332•Journal of Mathematical Physics•Nov 1, 2020•24 citations

Convex polytopes and quantization of symplectic manifolds

Michèle Vergne

Quantum mechanics associate to some symplectic manifolds M a quantum model Q(M), which is a Hilbert space. The space Q(M) is the quantum mechanical analogue of the classical phase space M. We discuss here relations between the volume of M and the dimension of the vector space Q(M). Analogues for convex polyhedra are considered.

Proceedings of the National Academy of Sciences•Dec 10, 1996•14 citations

Convex optimization on moment polytopes: Hadamard mirror descent and efficient algorithms for quantum functionals and other tensor parameters

Mahmut Levent Doğan, Keiya Sakabe, Michael Walter

Convex optimization on polytopes arises in many areas of science. When the polytope is given implicitly or has exponentially many vertices and facets, standard methods may not apply or be ineffective. This is the case for moment polytopes, such as the entanglement polytopes, which play a foundational role in quantum information and algebraic complexity. They give rise to important entanglement measures and tensor parameters such as the quantum functionals, yet general effective methods for computing these quantities have been elusive. In this paper we address this challenge. We develop a first-order framework called Hadamard mirror descent to optimize suitable convex functions over moment polytopes and, more generally, the gradient sets of geodesically convex functions. It operates locally and does not rely on any explicit description of the polytope. Our framework extends mirror descent, an effective and widely used framework for convex optimization, from the Euclidean setting to Hadamard manifolds, and is motivated by a recent work by Hirai, which we interpret as a Hadamard version of mirror flow. Applying the framework to entanglement polytopes yields the first efficient first-order algorithms to compute the quantum functionals, the symmetric quantum functional, and the G-stable ranks, as well as a new direct algorithm for the non-commutative rank.

cs.CCCross-listedarXiv:2609.06633•Sep 8, 2026•0 citations

High-dimensional Private Quantum Channels and Regular Polytopes

Junseo Lee, Kabgyun Jeong

As the quantum analog of the classical one-time pad, the private quantum channel (PQC) plays a fundamental role in the construction of the maximally mixed state (from any input quantum state), which is very useful for studying secure quantum communications and quantum channel capacity problems. However, the undoubted existence of a relation between the geometric shape of regular polytopes and private quantum channels in the higher dimension has not yet been reported. Recently, it was shown that a one-to-one correspondence exists between single-qubit PQCs and three-dimensional regular polytopes (i.e., regular polyhedra). In this paper, we highlight these connections by exploiting two strategies known as a generalized Gell-Mann matrix and modified quantum Fourier transform. More precisely, we explore the explicit relationship between PQCs over a qutrit system (i.e., a three-level quantum state) and regular 4-polytopes. Finally, we attempt to devise a formula for such connections on higher dimensional cases.

arXiv:2101.00230•Communications in Physics•May 10, 2021•1 citation
Convex polytopes are convex hulls of point sets in the n -dimensional space that generalize two-dimensional convex polygons and three-dimensional convex polyhedra. We concentrate on the class of n -dimensional polytopes in called sign permutation polytopes. We characterize sign permutation polytopes before relating their construction to constructions over the space of quantum density matrices. Finally, we consider the problem of state identification and show how sign permutation polytopes may be useful in addressing issues of robustness.
Let us consider the set of all probabilities generated by local binary measurements on two separated quantum systems of a given local dimension ddd. We address the question of whether the shape of this quantum body is convex or not. We construct a point in the space of probabilities, which is on the convex hull of the local polytope, but still cannot be attained by measuring ddd-dimensional quantum systems if the number of measurement settings is large enough. From this it follows that this body is not convex. We also show that for finite ddd the quantum body with the generalized measurement associated with positive operator-valued measures allowed may contain points that cannot be achieved with only projective measurements.
We give a general solution to the question of when the convex hulls of orbits of quantum states on a finite-dimensional Hilbert space under unitary actions of a compact group have a non-empty interior in the surrounding space of all density operators. The same approach can be applied to study convex combinations of quantum channels. The importance of both problems stems from the fact that, usually, only sets with non-vanishing volumes in the embedding spaces of all states or channels are of practical importance. For the group of local transformations on a bipartite system we characterize maximally entangled states by the properties of a convex hull of orbits through them. We also compare two partial characteristics of convex bodies in terms of the largest balls and maximum volume ellipsoids contained in them and show that, in general, they do not coincide. Separable states, mixed-unitary channels and k -entangled states are also considered as examples of our techniques.
Quantum permutation matrices and quantum magic squares are generalizations of permutation matrices and magic squares, where the entries are no longer numbers but elements from arbitrary (non-commutative) algebras. The famous Birkhoff–von Neumann theorem characterizes magic squares as convex combinations of permutation matrices. In the non-commutative case, the corresponding question is as follows: Does every quantum magic square belong to the matrix convex hull of quantum permutation matrices? That is, does every quantum magic square dilate to a quantum permutation matrix? Here, we show that this is false even in the simplest non-commutative case. We also classify the quantum magic squares that dilate to a quantum permutation matrix with commuting entries and prove a quantitative lower bound on the diameter of this set. Finally, we conclude that not all Arveson extreme points of the free spectrahedron of quantum magic squares are quantum permutation matrices.
Convex optimization on polytopes arises in many areas of science. When the polytope is given implicitly or has exponentially many vertices and facets, standard methods may not apply or be ineffective. This is the case for moment polytopes, such as the entanglement polytopes, which play a foundational role in quantum information and algebraic complexity. They give rise to important entanglement measures and tensor parameters such as the quantum functionals, yet general effective methods for computing these quantities have been elusive. In this paper we address this challenge. We develop a first-order framework called Hadamard mirror descent to optimize suitable convex functions over moment polytopes and, more generally, the gradient sets of geodesically convex functions. It operates locally and does not rely on any explicit description of the polytope. Our framework extends mirror descent, an effective and widely used framework for convex optimization, from the Euclidean setting to Hadamard manifolds, and is motivated by a recent work by Hirai, which we interpret as a Hadamard version of mirror flow. Applying the framework to entanglement polytopes yields the first efficient first-order algorithms to compute the quantum functionals, the symmetric quantum functional, and the G-stable ranks, as well as a new direct algorithm for the non-commutative rank.
As the quantum analog of the classical one-time pad, the private quantum channel (PQC) plays a fundamental role in the construction of the maximally mixed state (from any input quantum state), which is very useful for studying secure quantum communications and quantum channel capacity problems. However, the undoubted existence of a relation between the geometric shape of regular polytopes and private quantum channels in the higher dimension has not yet been reported. Recently, it was shown that a one-to-one correspondence exists between single-qubit PQCs and three-dimensional regular polytopes (i.e., regular polyhedra). In this paper, we highlight these connections by exploiting two strategies known as a generalized Gell-Mann matrix and modified quantum Fourier transform. More precisely, we explore the explicit relationship between PQCs over a qutrit system (i.e., a three-level quantum state) and regular 4-polytopes. Finally, we attempt to devise a formula for such connections on higher dimensional cases.