Unistochastic matrix

Last updated May 13, 2023

In mathematics, a unistochastic matrix (also called unitary-stochastic) is a doubly stochastic matrix whose entries are the squares of the absolute values of the entries of some unitary matrix.

A square matrix B of size n is doubly stochastic (or bistochastic) if all its entries are non-negative real numbers and each of its rows and columns sum to 1. It is unistochastic if there exists a unitary matrix U such that

B_{ij}=|U_{ij}|^{2}{\text{ for }}i,j=1,\dots ,n.\,

This definition is analogous to that for an orthostochastic matrix, which is a doubly stochastic matrix whose entries are the squares of the entries in some orthogonal matrix. Since all orthogonal matrices are necessarily unitary matrices, all orthostochastic matrices are also unistochastic. The converse, however, is not true. First, all 2-by-2 doubly stochastic matrices are both unistochastic and orthostochastic, but for larger n this is not the case. For example, take $n=3$ and consider the following doubly stochastic matrix:

B={\frac {1}{2}}{\begin{bmatrix}1&1&0\\0&1&1\\1&0&1\end{bmatrix}}.

This matrix is not unistochastic, since any two vectors with moduli equal to the square root of the entries of two columns (or rows) of B cannot be made orthogonal by a suitable choice of phases. For ${\textstyle n>2}$ , the set of orthostochastic matrices is a proper subset of the set of unistochastic matrices.

the set of unistochastic matrices contains all permutation matrices and its convex hull is the Birkhoff polytope of all doubly stochastic matrices
for $n\geq 3$ this set is not convex
for $n=3$ the set of triangle inequality on the moduli of the raw is a sufficient and necessary condition for the unistocasticity ^[1]
for $n=3$ the set of unistochastic matrices takes the form of a centrosymmetric matrix and unistochasticity of any bistochastic matrix B is implied by a non-negative value of its Jarlskog invariant ^[2]
for $n=3$ the relative volume of the set of unistochastic matrices with respect to the Birkhoff polytope of doubly stochastic matrices is ^[3] $8\pi ^{2}/105\approx 75.2\%$
for $n=4$ explicit conditions for unistochasticity are not known yet, but there exists a numerical method to verify unistochasticity based on the algorithm by Haagerup ^[4]
The Schur-Horn theorem is equivalent to the following "weak convexity" property of the set ${\mathcal {U}}_{n}$ of unistochastic $n\times n$ matrices: for any vector $v\in \mathbb {R} ^{n}$ the set ${\mathcal {U}}_{n}v$ is the convex hull of the set of vectors obtained by all permutations of the entries of the vector $v$ (the permutation polytope generated by the vector $v$ ).
The set of $n\times n$ unistochastic matrices ${\mathcal {U}}_{n}\subset \mathbb {R} ^{(n-1)^{2}}$ has a nonempty interior. The unistochastic matrix corresponding to the unitary $n\times n$ matrix with the entries $U_{ij}=\delta _{ij}+{\frac {\theta -1}{n}}$ , where $|\theta |=1$ and $\theta \neq \pm 1$ , is an interior point of ${\mathcal {U}}_{n}$ .

Related Research Articles

In linear algebra, an orthogonal matrix, or orthonormal matrix, is a real square matrix whose columns and rows are orthonormal vectors.

In linear algebra, a symmetric matrix is a square matrix that is equal to its transpose. Formally,

In linear algebra, an invertible complex square matrix $U$ is unitary if its conjugate transpose $U *$ is also its inverse, that is, if

In mathematics, the orthogonal group in dimension $, denoted, is the group of distance-preserving transformations of a Euclidean space of dimension that preserve a fixed point, where the group operation is given by composing transformations. The orthogonal group is sometimes called the general orthogonal group, by analogy with the general linear group. Equivalently, it is the group of orthogonal matrices, where the group operation is given by matrix multiplication. The orthogonal group is an algebraic group and a Lie group. It is compact.$

In mathematics, particularly in linear algebra, a skew-symmetricmatrix is a square matrix whose transpose equals its negative. That is, it satisfies the condition

In mathematics, particularly in matrix theory, a permutation matrix is a square binary matrix that has exactly one entry of 1 in each row and each column and 0s elsewhere. Each such matrix, say $P$ , represents a permutation of $m$ elements and, when used to multiply another matrix, say $A$ , results in permuting the rows or columns of the matrix $A$ .

In the mathematical discipline of linear algebra, a matrix decomposition or matrix factorization is a factorization of a matrix into a product of matrices. There are many different matrix decompositions; each finds use among a particular class of problems.

In quantum mechanics, a quantum operation is a mathematical formalism used to describe a broad class of transformations that a quantum mechanical system can undergo. This was first discussed as a general stochastic transformation for a density matrix by George Sudarshan. The quantum operation formalism describes not only unitary time evolution or symmetry transformations of isolated systems, but also the effects of measurement and transient interactions with an environment. In the context of quantum computation, a quantum operation is called a quantum channel.

In mathematics, especially in probability and combinatorics, a doubly stochastic matrix (also called bistochastic matrix) is a square matrix $of nonnegative real numbers, each of whose rows and columns sums to 1, i.e.,$

A complex Hadamard matrix is any complex $matrix satisfying two conditions:$

The Birkhoff polytopeB_n is the convex polytope in R^N whose points are the doubly stochastic matrices, i.e., the n × n matrices whose entries are non-negative real numbers and whose rows and columns each add up to 1. It is named after Garrett Birkhoff.

In quantum computing, quantum finite automata (QFA) or quantum state machines are a quantum analog of probabilistic automata or a Markov decision process. They provide a mathematical abstraction of real-world quantum computers. Several types of automata may be defined, including measure-once and measure-many automata. Quantum finite automata can also be understood as the quantization of subshifts of finite type, or as a quantization of Markov chains. QFAs are, in turn, special cases of geometric finite automata or topological finite automata.

In mathematics, an orthostochastic matrix is a doubly stochastic matrix whose entries are the squares of the absolute values of the entries of some orthogonal matrix.

Sinkhorn's theorem states that every square matrix with positive entries can be written in a certain standard form.

In mathematics, particularly linear algebra, the Schur–Horn theorem, named after Issai Schur and Alfred Horn, characterizes the diagonal of a Hermitian matrix with given eigenvalues. It has inspired investigations and substantial generalizations in the setting of symplectic geometry. A few important generalizations are Kostant's convexity theorem, Atiyah–Guillemin–Sternberg convexity theorem, Kirwan convexity theorem.

Given a Hilbert space with a tensor product structure a product numerical range is defined as a numerical range with respect to the subset of product vectors. In some situations, especially in the context of quantum mechanics product numerical range is known as local numerical range

Leonid Mirsky was a Russian-British mathematician who worked in number theory, linear algebra, and combinatorics. Mirsky's theorem is named after him.

<span class="mw-page-title-main">Matrix completion</span>

Matrix completion is the task of filling in the missing entries of a partially observed matrix, which is equivalent to performing data imputation in statistics. A wide range of datasets are naturally organized in matrix form. One example is the movie-ratings matrix, as appears in the Netflix problem: Given a ratings matrix in which each entry $represents the rating of movie by customer, if customer has watched movie and is otherwise missing, we would like to predict the remaining entries in order to make good recommendations to customers on what to watch next. Another example is the document-term matrix: The frequencies of words used in a collection of documents can be represented as a matrix, where each entry corresponds to the number of times the associated term appears in the indicated document.$

Birkhoff's algorithm is an algorithm for decomposing a bistochastic matrix into a convex combination of permutation matrices. It was published by Garrett Birkhoff in 1946. It has many applications. One such application is for the problem of fair random assignment: given a randomized allocation of items, Birkhoff's algorithm can decompose it into a lottery on deterministic allocations.

References

↑ Fedullo, A. (1992-12-01). "On the existence of a Hilbert-space model for finite-valued observables". Il Nuovo Cimento B. Springer. 107 (12): 1413–1426. doi:10.1007/BF02722852. ISSN 1826-9877.
↑ Jarlskog, C. (1985-09-02). "Commutator of the Quark Mass Matrices in the Standard Electroweak Model and a Measure of Maximal CP Nonconservation". Physical Review Letters. American Physical Society (APS). 55 (10): 1039–1042. doi:10.1103/physrevlett.55.1039. ISSN 0031-9007.
↑ Dunkl, Charles; Życzkowski, Karol (2009). "Volume of the set of unistochastic matrices of order 3 and the mean Jarlskog invariant". Journal of Mathematical Physics. AIP Publishing. 50 (12): 123521. arXiv: 0909.0116 . doi:10.1063/1.3272543. ISSN 0022-2488.
↑ Rajchel, Grzegorz; Gąsiorowski, Adam; Życzkowski, Karol (2018-09-19). "Robust Hadamard Matrices, Unistochastic Rays in Birkhoff Polytope and Equi-Entangled Bases in Composite Spaces". Mathematics in Computer Science. Springer Science and Business Media LLC. 12 (4): 473–490. arXiv: 1804.10715 . doi: 10.1007/s11786-018-0384-y . ISSN 1661-8270.

Bengtsson, Ingemar; Ericsson, Åsa; Kuś, Marek; Tadej, Wojciech; Życzkowski, Karol (2005), "Birkhoff's Polytope and Unistochastic Matrices, N = 3 and N = 4", Communications in Mathematical Physics, 259 (2): 307–324, arXiv: math/0402325 , Bibcode:2005CMaPh.259..307B, doi:10.1007/s00220-005-1392-8 .
Bengtsson, Ingemar (2004-03-11). "The importance of being unistochastic". arXiv: quant-ph/0403088 .
Karabegov, Alexander (2008-06-14). "A mapping from the unitary to doubly stochastic matrices and symbols on a finite set". arXiv: 0806.2357 .

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[1] Fedullo, A. (1992-12-01). "On the existence of a Hilbert-space model for finite-valued observables". Il Nuovo Cimento B. Springer. 107 (12): 1413–1426. doi:10.1007/BF02722852. ISSN 1826-9877.

[2] Jarlskog, C. (1985-09-02). "Commutator of the Quark Mass Matrices in the Standard Electroweak Model and a Measure of Maximal CP Nonconservation". Physical Review Letters. American Physical Society (APS). 55 (10): 1039–1042. doi:10.1103/physrevlett.55.1039. ISSN 0031-9007.

[3] Dunkl, Charles; Życzkowski, Karol (2009). "Volume of the set of unistochastic matrices of order 3 and the mean Jarlskog invariant". Journal of Mathematical Physics. AIP Publishing. 50 (12): 123521. arXiv: 0909.0116 . doi:10.1063/1.3272543. ISSN 0022-2488.

[4] Rajchel, Grzegorz; Gąsiorowski, Adam; Życzkowski, Karol (2018-09-19). "Robust Hadamard Matrices, Unistochastic Rays in Birkhoff Polytope and Equi-Entangled Bases in Composite Spaces". Mathematics in Computer Science. Springer Science and Business Media LLC. 12 (4): 473–490. arXiv: 1804.10715 . doi: 10.1007/s11786-018-0384-y . ISSN 1661-8270.

[1]

[2]

[3]

[4]