Quantum entanglement plays a crucial role in quantum information, quantum teleportation and quantum computation. The information about the entanglement content between subsystems of the composite system is encoded in the Schmidt eigenvalues. We derive here closed expressions for the spectral density of Schmidt eigenvalues for all three invariant classes of random matrix ensembles. We also obtain exact results for average von Neumann entropy. We find that maximum average entanglement is achieved if the system belongs to the symplectic invariant class.
Quantum entanglement plays a crucial role in quantum information, quantum teleportation and quantum computation. The information about the entanglement content between subsystems of the composite system is encoded in the Schmidt eigenvalues. We derive here closed expressions for the spectral density of Schmidt eigenvalues for all three invariant classes of random matrix ensembles. We also obtain exact results for average von Neumann entropy. We find that maximum average entanglement is achieved if the system belongs to the symplectic invariant class.
We analyze the properties of entangled random pure states of a quantum system partitioned into two smaller subsystems of dimensions N and M. Framing the problem in terms of random matrices with a fixed-trace constraint, we establish, for arbitrary N≤M, a general relation between the n-point densities and the cross moments of the eigenvalues of the reduced density matrix, i.e., the so-called Schmidt eigenvalues, and the analogous functionals of the eigenvalues of the Wishart-Laguerre ensemble of the random matrix theory. This allows us to derive explicit expressions for two-level densities, and also an exact expression for the variance of von Neumann entropy at finite N,M. Then, we focus on the moments E{K^{a}} of the Schmidt number K, the reciprocal of the purity. This is a random variable supported on [1,N], which quantifies the number of degrees of freedom effectively contributing to the entanglement. We derive a wealth of analytical results for E{K^{a}} for N=2 and 3 and arbitrary M, and also for square N=M systems by spotting for the latter a connection with the probability P(x_{min}^{GUE}≥sqrt[2N]ξ) that the smallest eigenvalue x_{min}^{GUE} of an N×N matrix belonging to the Gaussian unitary ensemble is larger than sqrt[2N]ξ. As a by-product, we present an exact asymptotic expansion for P(x_{min}^{GUE}≥sqrt[2N]ξ) for finite N as ξ→∞. Our results are corroborated by numerical simulations whenever possible, with excellent agreement.
Studying the typical entanglement entropy of a bipartite system when averaging over different ensembles of pure quantum states has been instrumental in different areas of physics, ranging from many-body quantum chaos to black hole evaporation. We extend such analysis to open quantum systems and mixed states, where we compute the typical mutual information in a bipartite system averaged over the ensemble of mixed Gaussian states with a fixed spectrum. Tools from random matrix theory and determinantal point processes allow us to compute arbitrary k-point correlation functions of the singular values of the corresponding complex structure in a subsystem for a given spectrum in the full system. In particular, we evaluate the average von Neumann entropy in a subsystem based on the level density and the average mutual information. Those results are given for finite system size as well as in the thermodynamic limit.
Abstract Studying the typical entanglement entropy of a bipartite system when averaging over different ensembles of pure quantum states has been instrumental in different areas of physics, ranging from many-body quantum chaos to black hole evaporation. We extend such analysis to open quantum systems and mixed states, where we compute the typical mutual information in a bipartite system averaged over the ensemble of mixed Gaussian states with a fixed spectrum. Tools from random matrix theory and determinantal point processes allow us to compute arbitrary k-point correlation functions of the singular values of the corresponding complex structure in a subsystem for a given spectrum in the full system. In particular, we evaluate the average von Neumann entropy in a subsystem based on the level density and the average mutual information. Those results are given for finite system size as well as in the thermodynamic limit.
Abstract Entanglement entropy has long served as a central diagnostic of complexity and information scrambling in quantum many-body systems, and its behavior in random quantum circuits is by now well characterized. However, as a single scalar, entanglement entropy captures only the total uncertainty of the reduced density matrix spectrum while discarding the detailed structure of that spectrum — including the shape of the eigenvalue distribution, level repulsion signatures, and the transition from integrable to chaotic behavior. In this work, we propose spectral entropy — the Shannon entropy of the eigenvalue distribution of the reduced density matrix — as a structured diagnostic that goes beyond standard entanglement entropy. Using numerical simulations, we compute the spectral entropy of subsystem reduced states in Haar-random and Clifford circuits as a function of circuit depth, and compare its behavior against von Neumann entanglement entropy, Rényi-2 entropy, and entanglement spectrum level-spacing statistics. We expect to find three key results: (i) spectral entropy exhibits a growth timescale distinct from that of entanglement entropy, potentially reflecting spectral restructuring more sensitively; (ii) in the depth regime where entanglement entropy has already saturated, spectral entropy may continue to evolve, revealing late-time complexification that standard entanglement measures cannot resolve; (iii) spectral entropy may display a distinctive response to measurement-induced or noise-induced disentanglement that differs qualitatively from entanglement entropy. This work positions spectral entropy as a complementary — not replacement — tool to entanglement entropy, offering a finer spectral lens on information scrambling, thermalization, and complexity growth in random quantum circuits.
The entanglement spectrum (i.e., the full distribution of Schmidt eigenvalues of the reduced density matrix) contains more information than the conventional entanglement entropy and has been studied recently in several many-particle systems. We compute the disorder-averaged entanglement spectrum in the form of the disorder-averaged moments $\stackrel{\underline{}}{\mathrm{Tr}{\mathrm{\ensuremath{\rho}}}_{\mathrm{A}}^{\mathrm{\ensuremath{\alpha}}}}$ of the reduced density matrix ${\ensuremath{\rho}}_{A}$ for a contiguous block of many spins at the random-singlet quantum critical point in one dimension. The result compares well in the scaling limit with numerical studies on the random XX model and is also expected to describe the (interacting) random Heisenberg model. Our numerical studies on the XX case reveal that the dependence of the entanglement entropy and spectrum on the geometry of the Hilbert space partition is quite different than for conformally invariant critical points.
Entanglement plays an important role in quantum communication, algorithms, and error correction. Schmidt coefficients are correlated to the eigenvalues of the reduced density matrix. These eigenvalues are used in Von Neumann entropy to quantify the amount of the bipartite entanglement. In this paper, we map the Schmidt basis and the associated coefficients to quantum circuits to generate random quantum states. We also show that it is possible to adjust the entanglement between subsystems by changing the quantum gates corresponding to the Schmidt coefficients. In this manner, random quantum states with predefined bipartite entanglement amounts can be generated using random Schmidt basis. This provides a technique for generating equivalent quantum states for given weighted graph states, which are very useful in the study of entanglement, quantum computing, and quantum error correction.