相关论文: A note on the exact simulation of a random eigenva…

For a quantum system in a macroscopically large volume $V$, prepared in a pure state and subject to maximally noisy or ergodic unitary dynamics, the reduced density matrix of any sub-system $v\ll V$ is almost surely totally mixed. We show…

We consider $N\times N$ Hermitian or symmetric random matrices with independent entries. The distribution of the $(i,j)$-th matrix element is given by a probability measure $\nu_{ij}$ whose first two moments coincide with those of the…

In this paper we construct a class of random matrix ensembles labelled by a real parameter $\alpha \in (0,1)$, whose eigenvalue density near zero behaves like $|x|^\alpha$. The eigenvalue spacing near zero scales like $1/N^{1/(1+\alpha)}$…

Probabilistic machine learning models are distinguished by their ability to integrate prior knowledge of noise statistics, smoothness parameters, and training data uncertainty. A common approach involves modeling data with Gaussian…

We study statistical properties of the eigenvectors of non-Hermitian random matrices, concentrating on Ginibre's complex Gaussian ensemble, in which the real and imaginary parts of each element of an N x N matrix, J, are independent random…

Solving the generalized eigenvalue problem is a useful method for finding energy eigenstates of large quantum systems. It uses projection onto a set of basis states which are typically not orthogonal. One needs to invert a matrix whose…

In this paper we consider the problem of linear unmixing hidden random variables defined over the simplex with additive Gaussian noise, also known as probabilistic simplex component analysis (PRISM). Previous solutions to tackle this…

The structure function of a random matrix ensemble can be specified as the covariance of the linear statistics $\sum_{j=1}^N e^{i k_1 \lambda_j}$, $\sum_{j=1}^N e^{-i k_2 \lambda_j}$ for Hermitian matrices, and the same with the eigenvalues…

In this short note we address a gaussian property of normal vectors in random non-Hermitian matrices. The approach uses a simple geometric and comparison technique.

Traditional numerical methods for calculating matrix eigenvalues are prohibitively expensive for high-dimensional problems. Iterative random sparsification methods allow for the estimation of a single dominant eigenvalue at reduced cost by…

We consider the single eigenvalue fluctuations of random matrices of general Wigner-type, under a one-cut assumption on the density of states. For eigenvalues in the bulk, we prove that the asymptotic fluctuations of a single eigenvalue…

The fermionic Gaussian operator basis provides a representation for treating strongly correlated fermion systems, as well as playing an important role in random matrix theory. We prove that a resolution of unity exists for any even…

We study the fluctuations of eigenvalues from a class of Wigner random matrices that generalize the Gaussian orthogonal ensemble. We begin by considering an $n \times n$ matrix from the Gaussian orthogonal ensemble (GOE) or Gaussian…

Eigenvalue density generated by embedded Gaussian unitary ensemble with $k$-body interactions for two species (say $\mathbf{\pi}$ and $\mathbf{\nu}$) fermion systems is investigated by deriving formulas for the lowest six moments. Assumed…

Linear combinations of translations of a single Gaussian, e^{-x^2}, are shown to be dense in L^2(R). Two algorithms for determining the coefficients for the approximations are given, using orthogonal Hermite functions and least squares.…

We present a new primitive for quantum algorithms that implements a discrete Hermite transform efficiently, in time that depends logarithmically in both the dimension and the inverse of the allowable error. This transform, which maps basis…

We prove that when suitably normalized, small enough powers of the absolute value of the characteristic polynomial of random Hermitian matrices, drawn from one-cut regular unitary invariant ensembles, converge in law to Gaussian…

The perturbed GUE corners ensemble is the joint distribution of eigenvalues of all principal submatrices of a matrix $G+\mathrm{diag}(\mathbf{a})$, where $G$ is the random matrix from the Gaussian Unitary Ensemble (GUE), and…

Given a random quantum state of multiple distinguishable or indistinguishable particles, we provide an effective method, rooted in symplectic geometry, to compute the joint probability distribution of the eigenvalues of its one-body reduced…

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.…