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 eBooks

More About Matrices

V. Balakrishnan

Published Jan 1, 2020• 0 citations
Publisher
DOI
10.1007/978-3-030-39680-0_12

Related papers

Matrices

Sadri Hassani

Springer eBooks•Jan 1, 2013•1 citation

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•68 citations

Geometry of density matrices. I. Definitions, N matrices and 1 matrices

John E. Harriman

Density matrices defined with respect to a finite basis set are considered as elements in a vector space. A basis set is introduced in the space whose elements are Hermitian matrices. By a suitable transformation of the basis, one component only will contribute to the trace, so the space of unit trace matrices is a translated linear subspace. The positivity constraint is then examined in terms of distance from a multiple of the unit matrix, which is in the interior of the set of density matrices. The boundary of this set is shown to lie between two concentric hyperspheres. The set whose elements are $N$-representable 1 matrices has similar properties.

Physical Review A•Apr 1, 1978•105 citations

Matrices and Operators

Springer eBooks•Jul 31, 2007•0 citations

Linear Algebra

Alto Osada, Rekishu Yamazaki, Atsushi Noguchi

Lecture notes in physics•Jan 1, 2022•0 citations

Recursive parametrization and invariant phases of unitary matrices

Ch. Zacharatou Jarlskog

We present further properties of a previously proposed recursive scheme for parametrization of n-by-n unitary matrices. We show that the factors in the recursive formula may be introduced in any desired order. The method is used to study the invariant phases of unitary matrices. The case of four-by-four unitary matrices is investigated in detail. We also address the question of how to construct symmetric unitary matrices (i.e., unitary matrices U that satisfy the condition Uij=Uji) using the recursive approach.

arXiv:math-ph/0510034•Journal of Mathematical Physics•Jan 1, 2006•22 citations
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.
Density matrices defined with respect to a finite basis set are considered as elements in a vector space. A basis set is introduced in the space whose elements are Hermitian matrices. By a suitable transformation of the basis, one component only will contribute to the trace, so the space of unit trace matrices is a translated linear subspace. The positivity constraint is then examined in terms of distance from a multiple of the unit matrix, which is in the interior of the set of density matrices. The boundary of this set is shown to lie between two concentric hyperspheres. The set whose elements are NNN-representable 1 matrices has similar properties.
We present further properties of a previously proposed recursive scheme for parametrization of n-by-n unitary matrices. We show that the factors in the recursive formula may be introduced in any desired order. The method is used to study the invariant phases of unitary matrices. The case of four-by-four unitary matrices is investigated in detail. We also address the question of how to construct symmetric unitary matrices (i.e., unitary matrices U that satisfy the condition Uij=Uji) using the recursive approach.