Random unistochastic matrices
arXiv:nlin/0112036 · doi:10.1088/0305-4470/36/12/333
Abstract
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), respectively). 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 ortostochastic 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.
22 latex pages, including 7 figures in ps, minor revisions
References in corpus (5)
Cited by in corpus (44)
- Quantum Graphs: Applications to Quantum Chaos and Universal Spectral Statistics
- Google matrix analysis of directed networks
- Random Quantum Operations
- From dual-unitary to quantum Bernoulli circuits: Role of the entangling power in constructing a quantum ergodic hierarchy
- Birkhoff's polytope and unistochastic matrices, N=3 and N=4
- Unitary quantum gates, perfect entanglers and unistochastic maps
- Quantum state discrimination: a geometric approach
- Generating random quantum channels
- Spectral transitions and universal steady states in random Kraus maps and circuits
- Random generators of Markovian evolution: A quantum-classical transition by superdecoherence
- Composition of quantum states and dynamical subadditivity
- Maximal energy extraction via quantum measurement
- Spectral properties of Google matrix of Wikipedia and other networks
- Volume of the set of unistochastic matrices of order 3 and the mean Jarlskog invariant
- Time evolution of Wikipedia network ranking
- Constraints on conductances for Y-junction of quantum wires
- Quantum ergodicity for graphs related to interval maps
- Google matrix of Twitter
- Decohering Tensor Network Quantum Machine Learning Models
- Quantum dynamical entropy, chaotic unitaries and complex Hadamard matrices
- Entropic bounds on semiclassical measures for quantized one-dimensional maps
- How to mix a density matrix
- Random Bistochastic Matrices
- Random unitary matrices associated to a graph
- Finding maximal quantum resources
- Algebraic and geometric structures inside the Birkhoff polytope
- Locality for quantum systems on graphs depends on the number field
- Singular value distribution of dense random matrices with block Markovian dependence
- Diagonal approximation of the form factor of the unitary group
- Spectral Statistics of Non-Hermitian Matrices and Dissipative Quantum Chaos
- Quantum convolutional channels and multiparameter families of 2-unitary matrices
- Random stochastic matrices from classical compact Lie groups and symmetric spaces
- Anderson transition for Google matrix eigenstates
- Developments in Random Matrix Theory
- Pointwise Weyl law for graphs from quantized interval maps
- Quantum Algorithms and Covering Spaces
- Sub-quadratic scalable approximate linear converter using multi-plane light conversion with low-entropy mode mixers
- Quadrangularity in Tournaments
- A characterization of Hermitian matrices with variable diagonal and smallest operator norm
- Relative entropy for maximal abelian subalgebras of matrices and the entropy of unistochastic matrices
- Robust Hadamard matrices, unistochastic rays in Birkhoff polytope and equi-entangled bases in composite spaces
- On the mixing properties of piecewise expanding maps under composition with permutations
- Uncertainty-disturbance relations and applications
- Sequences of lower bounds for entropic uncertainty relations from bistochastic maps