Probability representation of spin states and inequalities for unitary matrices

We review the probability representation of spin states described by probability distributions (tomograms). We use the relation of a tomogram to unitary group elements to obtain some inequalities for unitary matrices. We present the Cirel’son bound and the entropic inequalities for entangled spin states in the form of relations for functions on the unitary group.     

Approximate unitary 3-designs from transvection Markov chains

Designs, Codes and Cryptography - Unitary k-designs are probabilistic ensembles of unitary matrices whose first k statistical moments match that of the full unitary group endowed with the Haar...     

Dixmier Traces and Unitary Representations

As is known, for any two given unitary representations of a topological group in Hilbert spaces, a new unitary representation in the corresponding space of Hilbert-Schmidt mappings can be defined. In the paper, a modification of this construction is suggested that uses the Dixmier trace (instead of the ordinary operator trace). The case of the group of second-order real unimodular matrices is studied in detail.     

M-P invertible matrices and unitary groups over Fq2

The Moor-Penrose generalized inverses (M-P inverses for short) of matrices over a finite field Fq2, which is a generalization of the Moor-Penrose generalized inverses over the complex field, are studied in the present paper. Some necessary and sufficient conditions for an m×n matrix A over Fq2 having an M-P inverse are obtained, which make clear the set of m×n matrices over Fq2 having M-P inverses and reduce the problem of constructing and enumerating the M-P invertible matrices to that of constructing and enumerating the non-isotropic subspaces with respect to the unitary group. Based on this reduction, both the construction problem and the enumeration problem are solved by borrowing the results in geometry of unitary groups over finite fields.     

Takagi’s decomposition of a symmetric unitary matrix as a finite algorithm

Takagi’s decomposition is an analog (for complex symmetric matrices and for unitary similarities replaced by unitary congruences) of the eigenvalue decomposition of Hermitian matrices. It is shown that, if a complex matrix is not only symmetric but is also unitary, then its Takagi decomposition can be found by quadratic radicals, that is, by means of a finite algorithm that involves arithmetic operations and quadratic radicals. A similar fact is valid for the eigenvalue decomposition of reflections, which are Hermitian unitary matrices.     

Stochastic aspects of the unitary dual group

In this note, we study the asymptotic properties of the ?-distribution of traces of some matrices, with respect to the free Haar trace on the unitary dual group. The considered matrices are powers of the unitary matrix generating the Brown algebra. We proceed in two steps, first computing the free cumulants of any R-cyclic family, then characterizing the asymptotic ?-distributions of the traces of powers of the generating matrix, thanks to these free cumulants. In particular, we obtain that these traces are asymptotic ?-free circular variables.     

Unitary designs and codes

A unitary design is a collection of unitary matrices that approximate the entire unitary group, much like a spherical design approximates the entire unit sphere. In this paper, we use irreducible representations of the unitary group to find a general lower bound on the size of a unitary t-design in U(d), for any d and t. We also introduce the notion of a unitary code—a subset of U(d) in which the trace inner product of any pair of matrices is restricted to only a small number of distinct absolute values—and give an upper bound for the size of a code with s inner product values in U(d), for any d and s. These bounds can be strengthened when the particular inner product values that occur in the code or design are known. Finally, we describe some constructions of designs: we give an upper bound on the size of the smallest weighted unitary t-design in U(d), and we catalogue some t-designs that arise from finite groups.      

关于k-广义酉矩阵

本文研究了k-广义酉矩阵的性质及其与酉矩阵、辛矩阵、Householder矩阵之间的联系,取得了许多新的结果,推广了酉矩阵及Householder矩阵的相应结果,特别将正交矩阵的广义Cayley分解推广到了广义酉矩阵上;并将各类酉矩阵及辛矩阵统一了起来.     

k-广义Hermite矩阵

本文给出了k-广义(反)Hermite矩阵的概念,研究了它的性质及其与k-广义酉矩阵之间的联系,推广了酉矩阵和(反)Hermite矩阵的相应结果.     

广义酉矩阵与广义Hermite矩阵的张量积与诱导矩阵

本文研究了有限个广义酉矩阵与广义(反)Hermite矩阵的张量积和诱导矩阵.利用矩阵的张量积和诱导矩阵的性质,得到了它的张量积和诱导矩阵仍为广义酉矩阵与广义(反)Hermite矩阵.     

Conjugate-normal matrices: A survey

Conjugate-normal matrices play the same important role in the theory of unitary congruence as the conventional normal matrices do with respect to unitary similarities. However, unlike the latter, the properties of conjugate-normal matrices are not widely known. Motivated by this fact, we give a survey of the properties of these matrices. In particular, a list of more than forty conditions is given, each of which is equivalent to A being conjugate-normal.     

Inductive Algebras and Homogeneous Shifts

Inductive algebras for the irreducible unitary representations of the universal cover of the group of unimodular two by two matrices are classified. The classification of homogeneous shift operators is obtained as a direct consequence. This gives a new approach to the results of Bagchi and Misra.     

When is a matrix unitary or Hermitian plus low rank?

Hermitian and unitary matrices are two representatives of the class of normal matrices whose full eigenvalue decomposition can be stably computed in quadratic computing complexity once the matrix has been reduced, for instance, to tridiagonal or Hessenberg form. Recently, fast and reliable eigensolvers dealing with low‐rank perturbations of unitary and Hermitian matrices have been proposed. These structured eigenvalue problems appear naturally when computing roots, via confederate linearizations, of polynomials expressed in, for example, the monomial or Chebyshev basis. Often, however, it is not known beforehand whether or not a matrix can be written as the sum of a Hermitian or unitary matrix plus a low‐rank perturbation. In this paper, we give necessary and sufficient conditions characterizing the class of Hermitian or unitary plus low‐rank matrices. The number of singular values deviating from 1 determines the rank of a perturbation to bring a matrix to unitary form. A similar condition holds for Hermitian matrices; the eigenvalues of the skew‐Hermitian part differing from 0 dictate the rank of the perturbation. We prove that these relations are linked via the Cayley transform. Then, based on these conditions, we identify the closest Hermitian or unitary plus rank k matrix to a given matrix A, in Frobenius and spectral norm, and give a formula for their distance from A. Finally, we present a practical iteration to detect the low‐rank perturbation. Numerical tests prove that this straightforward algorithm is effective.     

算子值酉随机矩阵及其渐近自由性

该文在算子值非交换概率空间上引入半标准酉随机矩阵的概念, 证明了它是算子值Haar酉元的矩阵模型,并给出了半标准酉随机矩阵的渐近自由判定定理.     

On tridiagonal conjugate-normal matrices

Conjugate-normal matrices play the same role in the theory of unitary congruences as conventional normal matrices do with respect to unitary similarities. Naturally, the properties of both matrix classes are fairly similar up to the distinction between the congruence and similarity. However, in certain respects, conjugate-normal matrices differ substantially from normal ones. Our goal in this paper is to indicate one of such distinctions. It is shown that none of the familiar characterizations of normal matrices having the irreducible tridiagonal form has a natural counterpart in the case of conjugate-normal matrices.