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

Springer proceedings in mathematics & statistics

Unistochastic Matrices and Related Problems

Aaron Carl Smith

Published Jan 1, 2015• 3 citations
Publisher
DOI
10.1007/978-81-322-2452-5_16

Related papers

Generalized unistochastic matrices

Ion Nechita, Zikun Ouyang, Anna Szczepanek

arXiv:2310.03436•Linear Algebra and its Applications•Jun 3, 2024•1 citation

On orthostochastic, unistochastic and qustochastic matrices

Oleg Chterental, Dragomir Ž. Djoković

arXiv:0708.4051•Linear Algebra and its Applications•Dec 1, 2007•19 citations

Birkhoff’s Polytope and Unistochastic Matrices, N = 3 and N = 4

Ingemar Bengtsson, Åsa Ericsson, Marek Kuś +2 more

arXiv:math/0402325•Communications in Mathematical Physics•Jul 15, 2005•70 citations

Self-dual maps and symmetric bistochastic matrices

Corey O'Meara, Rajesh Pereira

The H-unistochastic matrices are a special class of symmetric bistochastic matrices obtained by taking the square of the absolute value of each entry of a Hermitian unitary matrix. We examine the geometric relationship of the convex hull of the n by n H-unistochastic matrices relative to the larger convex set of n by n symmetric bistochastic matrices. We show that any line segment in the convex set of the n by n symmetric bistochastic matrices which passes through the centroid of this convex set must spend at least two-thirds of its length in the convex hull of the n by n H-unistochastic matrices when n is either three or four and we prove a partial result for higher n. A class of completely positive linear maps, called the self-dual doubly stochastic maps, is useful for studying this problem. Some results on self-dual doubly stochastic maps are given including a self-dual version of the Laudau–Streater theorem.

arXiv:1210.2579•Linear and Multilinear Algebra•Feb 28, 2012•7 citations

Algebraic and geometric structures inside the Birkhoff polytope

Grzegorz Rajchel-Mieldzioć, Kamil Korzekwa, Zbigniew Puchała +1 more

The Birkhoff polytope Bd consisting of all bistochastic matrices of order d assists researchers from many areas, including combinatorics, statistical physics, and quantum information. Its subset Ud of unistochastic matrices, determined by squared moduli of unitary matrices, is of particular importance for quantum theory as classical dynamical systems described by unistochastic transition matrices can be quantized. In order to investigate the problem of unistochasticity, we introduce the set Ld of bracelet matrices that forms a subset of Bd, but a superset of Ud. We prove that for every dimension d, this set contains the set of factorizable bistochastic matrices Fd and is closed under matrix multiplication by elements of Fd. Moreover, we prove that both Ld and Fd are star-shaped with respect to the flat matrix. We also analyze the set of d × d unistochastic matrices arising from circulant unitary matrices and show that their spectra lie inside d-hypocycloids on the complex plane. Finally, applying our results to small dimensions, we fully characterize the set of circulant unistochastic matrices of order d ≤ 4 and prove that such matrices form a monoid for d = 3.

arXiv:2101.11288•Journal of Mathematical Physics•Jan 1, 2022•6 citations

Random unistochastic matrices

Karol Życzkowski, Marek Kuś, Wojciech S omczy ski +1 more

An ensemble of random unistochastic (orthostochastic) matrices is defined by taking squared moduli of elements of random unitary (orthogonal) matrices distributed according to the Haar measure on U ( N ) (or O ( N )). An ensemble of symmetric unistochastic matrices is obtained with use of unitary symmetric matrices pertaining to the circular orthogonal ensemble. We study the distribution of complex eigenvalues of bistochastic, unistochastic and orthostochastic matrices in the complex plane. We compute averages (entropy, traces) over the ensembles of unistochastic matrices and present inequalities concerning the entropies of products of bistochastic matrices.

arXiv:nlin/0112036•Journal of Physics A Mathematical and General•Mar 13, 2003•69 citations
The H-unistochastic matrices are a special class of symmetric bistochastic matrices obtained by taking the square of the absolute value of each entry of a Hermitian unitary matrix. We examine the geometric relationship of the convex hull of the n by n H-unistochastic matrices relative to the larger convex set of n by n symmetric bistochastic matrices. We show that any line segment in the convex set of the n by n symmetric bistochastic matrices which passes through the centroid of this convex set must spend at least two-thirds of its length in the convex hull of the n by n H-unistochastic matrices when n is either three or four and we prove a partial result for higher n. A class of completely positive linear maps, called the self-dual doubly stochastic maps, is useful for studying this problem. Some results on self-dual doubly stochastic maps are given including a self-dual version of the Laudau–Streater theorem.
The Birkhoff polytope Bd consisting of all bistochastic matrices of order d assists researchers from many areas, including combinatorics, statistical physics, and quantum information. Its subset Ud of unistochastic matrices, determined by squared moduli of unitary matrices, is of particular importance for quantum theory as classical dynamical systems described by unistochastic transition matrices can be quantized. In order to investigate the problem of unistochasticity, we introduce the set Ld of bracelet matrices that forms a subset of Bd, but a superset of Ud. We prove that for every dimension d, this set contains the set of factorizable bistochastic matrices Fd and is closed under matrix multiplication by elements of Fd. Moreover, we prove that both Ld and Fd are star-shaped with respect to the flat matrix. We also analyze the set of d × d unistochastic matrices arising from circulant unitary matrices and show that their spectra lie inside d-hypocycloids on the complex plane. Finally, applying our results to small dimensions, we fully characterize the set of circulant unistochastic matrices of order d ≤ 4 and prove that such matrices form a monoid for d = 3.
An ensemble of random unistochastic (orthostochastic) matrices is defined by taking squared moduli of elements of random unitary (orthogonal) matrices distributed according to the Haar measure on U ( N ) (or O ( N )). An ensemble of symmetric unistochastic matrices is obtained with use of unitary symmetric matrices pertaining to the circular orthogonal ensemble. We study the distribution of complex eigenvalues of bistochastic, unistochastic and orthostochastic matrices in the complex plane. We compute averages (entropy, traces) over the ensembles of unistochastic matrices and present inequalities concerning the entropies of products of bistochastic matrices.