Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userThe Level Densities of Random Matrix Unitary Ensembles and their Perturbation Invariability
174
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Using operator methods, we generally present the level densities for kinds of random matrix unitary ensembles in weak sense. As a corollary, the limit spectral distributions of random matrices from Gaussian, Laguerre and Jacobi unitary ensembles are recovered. At the same time, we study the perturbation invariability of the level densities of random matrix unitary ensembles. After the weight function associated with the 1-level correlation function is appended a polynomial multiplicative factor, the level density is invariant in the weak sense.
rate research
Read More
We generally study the density of eigenvalues in unitary ensembles of random matrices from the recurrence coefficients with regularly varying conditions for the orthogonal polynomials. First we calculate directly the moments of the density. Then, by studying some deformation of the moments, we get a family of differential equations of first order which the densities satisfy (see Theorem 1.2), and give the densities by solving them. Further, we prove that the density is invariant after the polynomial perturbation of the weight function (see Theorem 1.5).
In this paper we present a criterion for the covering condition of the generalized random matrix ensemble, which enable us to verify the covering condition for the seven classes of generalized random matrix ensemble in an unified and simpler way.
In this paper we study the distribution of level crossings for the spectra of linear families A+lambda B, where A and B are square matrices independently chosen from some given Gaussian ensemble and lambda is a complex-valued parameter. We formulate a number of theoretical and numerical results for the classical Gaussian ensembles and some generalisations. Besides, we present intriguing numerical information about the distribution of monodromy in case of linear families for the classical Gaussian ensembles of 3 * 3 matrices.
We present a simple, perturbative approach for calculating spectral densities for random matrix ensembles in the thermodynamic limit we call the Perturbative Resolvent Method (PRM). The PRM is based on constructing a linear system of equations and calculating how the solutions to these equation change in response to a small perturbation using the zero-temperature cavity method. We illustrate the power of the method by providing simple analytic derivations of the Wigner Semi-circle Law for symmetric matrices, the Marchenko-Pastur Law for Wishart matrices, the spectral density for a product Wishart matrix composed of two square matrices, and the Circle and elliptic laws for real random matrices.
The iterative method of Sinkhorn allows, starting from an arbitrary real matrix with non-negative entries, to find a so-called scaled matrix which is doubly stochastic, i.e. a matrix with all entries in the interval (0, 1) and with all line sums equal to 1. We conjecture that a similar procedure exists, which allows, starting from an arbitrary unitary matrix, to find a scaled matrix which is unitary and has all line sums equal to 1. The existence of such algorithm guarantees a powerful decomposition of an arbitrary quantum circuit.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
