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:quant-ph/0403088

The Importance of Being Unistochastic

Ingemar Bengtsson

Published Mar 11, 2004• 16 citations
arXivHTMLPDF

Abstract

A bistochastic matrix is a square matrix with positive entries such that rows and columns sum to unity. A unistochastic matrix is a bistochastic matrix whose matrix elements are the absolute values squared of a unitary matrix. We can now ask questions such as when a given bistochastic matrix is unistochastic. I review these questions: Why they are asked, why they are difficult to answer, and what is known about them.

DOI
10.48550/arxiv.quant-ph/0403088

Related papers

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

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

Volume of the set of unistochastic matrices of order 3 and the mean Jarlskog invariant

Charles F. Dunkl, Karol Życzkowski

A bistochastic matrix B of size N is called unistochastic if there exists a unitary U such that Bij=|Uij|2 for i,j=1,…,N. The set U3 of all unistochastic matrices of order N=3 forms a proper subset of the Birkhoff polytope, which contains all bistochastic (doubly stochastic) matrices. We compute the volume of the set U3 with respect to the flat (Lebesgue) measure and analytically evaluate the mean entropy of an unistochastic matrix of this order. We also analyze the Jarlskog invariant J, defined for any unitary matrix of order three, and derive its probability distribution for the ensemble of matrices distributed with respect to the Haar measure on U(3) and for the ensemble which generates the flat measure on the set of unistochastic matrices. For both measures the probability of finding |J| smaller than the value observed for the Cabbibo–Kobayashi–Maskawa matrix, which describes the violation of the CP parity, is shown to be small. Similar statistical reasoning may also be applied to the Maki–Nakagawa–Sakata matrix, which plays role in describing the neutrino oscillations. Some conjectures are made concerning analogous probability measures in the space of unitary matrices in higher dimensions.

arXiv:0909.0116•Journal of Mathematical Physics•Dec 1, 2009•21 citations

The Born Representation Theorem and the Unistochastic Theorem

Jacob A. Barandes

This paper presents self-contained, constructive proofs of two new theorems about stochastic matrices, with direct relevance to quantum theory. The first theorem, herein called the Born Representation Theorem, shows that each entry of any stochastic matrix can be expressed as the trace of a pairwise product of matrices, where the first factor in the pairwise product belongs to a positive-operator-valued measure (POVM) and the second factor belongs to a projection-valued measure (PVM). As its name suggests, this theorem entails that the entries of any stochastic matrix can be expressed in terms of a generalized version of the quantum-theoretic Born rule. It follows as a corollary that if the POVM in this first theorem is a PVM, then the stochastic matrix is unistochastic, meaning that its entries are each the modulus square of the corresponding entry of a unitary matrix of the same size. The second theorem proved in this paper, called the Unistochastic Theorem, then shows that by dilating the underlying vector space by a bounded number of additional dimensions if necessary, each entry of any stochastic matrix can be expressed in terms of the trace of a pairwise product for which both factors belong to PVMs, and can thus be derived via marginalization from a larger unistochastic matrix. This second theorem therefore establishes a kind of primacy of unistochastic matrices over stochastic matrices, and hints at a close connection with unitary time evolution in quantum theory. The paper concludes with a brief discussion of potential applications to discrete-time deterministic processes and Markov chains.

quant-pharXiv:2608.04354•Aug 6, 2026•0 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

Definitions, Concepts, and Fundamental Characteristics of LDPC Codes

Juane Li, Shu Lin, Khaled Abdel-Ghaffar +2 more

In this chapter, we first present some definitions and concepts of matrices which are relevant for later developments of various algebraic-based and graph-theoretic-based constructions of LDPC codes. Then, we give a brief presentation of LDPC codes and characterize their fundamental structural properties that affect their error performance over the AWGNC and the BEC. Good coverage of the fundamentals of LDPC codes and the major iterative algorithms for decoding these codes can be found in [74, 97, 95]. Matrices and Matrix Dispersions of Finite Field Elements Let GF( q ) be a finite field with q elements, where q is a power of a prime [73]. GF( q ) is called a NB field if q ≠ 2 and a binary field if q = 2. A matrix A is said to be regular if every row has the same weight, called the row weight, every column has the same weight, called the column weight, and the row weight equals the column weight. If the row weight (or column weight) of a regular matrix A is w , we say that A has weight w and call it a weight- w regular matrix. For w ≠ 0, a weight- w regular matrix must be a square matrix. A binary weight-1 regular matrix is a permutation matrix (PM). It is clear that a weight- w regular matrix is the sum of w disjoint PMs. More generally, a rectangular matrix with constant column weight w c and constant row weight w r is said to be ( w c , w r ) -regular. A square matrix over GF( q ) is called a circulant if every row of the matrix is the cyclic-shift of the row above it one place to the right, and the top row is the cyclic-shift of the last row one place to the right. It is clear that a circulant is a regular matrix whose weight equals the weight of its top row. The top row of a circulant is called the generator of the circulant. A binary circulant of weight 1 is a binary circulant permutation matrix (CPM). It is clear that a weight- w circulant is the sum of w disjoint CPMs.

Cambridge University Press eBooks•Dec 1, 2016•0 citations
A bistochastic matrix is a square matrix with positive entries such that rows and columns sum to unity. A unistochastic matrix is a bistochastic matrix whose matrix elements are the absolute values squared of a unitary matrix. We can now ask questions such as when a given bistochastic matrix is unistochastic. I review these questions: Why they are asked, why they are difficult to answer, and what is known about them.
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.
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.
A bistochastic matrix B of size N is called unistochastic if there exists a unitary U such that Bij=|Uij|2 for i,j=1,…,N. The set U3 of all unistochastic matrices of order N=3 forms a proper subset of the Birkhoff polytope, which contains all bistochastic (doubly stochastic) matrices. We compute the volume of the set U3 with respect to the flat (Lebesgue) measure and analytically evaluate the mean entropy of an unistochastic matrix of this order. We also analyze the Jarlskog invariant J, defined for any unitary matrix of order three, and derive its probability distribution for the ensemble of matrices distributed with respect to the Haar measure on U(3) and for the ensemble which generates the flat measure on the set of unistochastic matrices. For both measures the probability of finding |J| smaller than the value observed for the Cabbibo–Kobayashi–Maskawa matrix, which describes the violation of the CP parity, is shown to be small. Similar statistical reasoning may also be applied to the Maki–Nakagawa–Sakata matrix, which plays role in describing the neutrino oscillations. Some conjectures are made concerning analogous probability measures in the space of unitary matrices in higher dimensions.
This paper presents self-contained, constructive proofs of two new theorems about stochastic matrices, with direct relevance to quantum theory. The first theorem, herein called the Born Representation Theorem, shows that each entry of any stochastic matrix can be expressed as the trace of a pairwise product of matrices, where the first factor in the pairwise product belongs to a positive-operator-valued measure (POVM) and the second factor belongs to a projection-valued measure (PVM). As its name suggests, this theorem entails that the entries of any stochastic matrix can be expressed in terms of a generalized version of the quantum-theoretic Born rule. It follows as a corollary that if the POVM in this first theorem is a PVM, then the stochastic matrix is unistochastic, meaning that its entries are each the modulus square of the corresponding entry of a unitary matrix of the same size. The second theorem proved in this paper, called the Unistochastic Theorem, then shows that by dilating the underlying vector space by a bounded number of additional dimensions if necessary, each entry of any stochastic matrix can be expressed in terms of the trace of a pairwise product for which both factors belong to PVMs, and can thus be derived via marginalization from a larger unistochastic matrix. This second theorem therefore establishes a kind of primacy of unistochastic matrices over stochastic matrices, and hints at a close connection with unitary time evolution in quantum theory. The paper concludes with a brief discussion of potential applications to discrete-time deterministic processes and Markov chains.
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.
In this chapter, we first present some definitions and concepts of matrices which are relevant for later developments of various algebraic-based and graph-theoretic-based constructions of LDPC codes. Then, we give a brief presentation of LDPC codes and characterize their fundamental structural properties that affect their error performance over the AWGNC and the BEC. Good coverage of the fundamentals of LDPC codes and the major iterative algorithms for decoding these codes can be found in [74, 97, 95]. Matrices and Matrix Dispersions of Finite Field Elements Let GF( q ) be a finite field with q elements, where q is a power of a prime [73]. GF( q ) is called a NB field if q ≠ 2 and a binary field if q = 2. A matrix A is said to be regular if every row has the same weight, called the row weight, every column has the same weight, called the column weight, and the row weight equals the column weight. If the row weight (or column weight) of a regular matrix A is w , we say that A has weight w and call it a weight- w regular matrix. For w ≠ 0, a weight- w regular matrix must be a square matrix. A binary weight-1 regular matrix is a permutation matrix (PM). It is clear that a weight- w regular matrix is the sum of w disjoint PMs. More generally, a rectangular matrix with constant column weight w c and constant row weight w r is said to be ( w c , w r ) -regular. A square matrix over GF( q ) is called a circulant if every row of the matrix is the cyclic-shift of the row above it one place to the right, and the top row is the cyclic-shift of the last row one place to the right. It is clear that a circulant is a regular matrix whose weight equals the weight of its top row. The top row of a circulant is called the generator of the circulant. A binary circulant of weight 1 is a binary circulant permutation matrix (CPM). It is clear that a weight- w circulant is the sum of w disjoint CPMs.