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.
Hochstattler, Kirsch, and Warzel showed that the semicircle law holds for generalized Curie-Weiss matrix ensembles at or above the critical temperature. We extend their result to the case of subcritical temperatures for which the correlations between the matrix entries are stronger. Nevertheless, one may use the concept of approximately uncorrelated ensembles that was first introduced in the paper mentioned above. In order to do so one needs to remove the average magnetization of the entries by an appropriate modification of the ensemble that turns out to be of rank 1 thus not changing the limiting spectral measure.
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.
A new family of polarized ensembles of random pure states is presented. These ensembles are obtained by linear superposition of two random pure states with suitable distributions, and are quite manageable. We will use the obtained results for two purposes: on the one hand we will be able to derive an efficient strategy for sampling states from isopurity manifolds. On the other, we will characterize the deviation of a pure quantum state from separability under the influence of noise.
A Lagrangian formulation for the constrained search for the $N$-representable one-particle density matrix based on the McWeeny idempotency error minimization is proposed, which converges systematically to the ground state. A closed form of the canonical purification is derived for which no a posteriori adjustement on the trace of the density matrix is needed. The relationship with comparable methods are discussed, showing their possible generalization through the hole-particle duality. The appealing simplicity of this self-consistent recursion relation along with its low computational complexity could prove useful as an alternative to diagonalization in solving dense and sparse matrix eigenvalue problems.
We give a generalization of the random matrix ensembles, including all lassical ensembles. Then we derive the joint density function of the generalized ensemble by one simple formula, which give a direct and unified way to compute the density functions for all classical ensembles and various kinds of new ensembles. An integration formula associated with the generalized ensemble is also given. We also give a classification scheme of the generalized ensembles, which will include all classical ensembles and some new ensembles which were not considered before.