Exact eigenvalue order statistics for the reduced density matrix of a bipartite system

• URL: http://arxiv.org/abs/2110.01022v3
• Date: Thu, 2 Dec 2021 16:47:05 GMT
• Title: Exact eigenvalue order statistics for the reduced density matrix of a bipartite system
• Authors: B. Sharmila, V. Balakrishnan and S. Lakshmibala
• Abstract summary: eigenvalues $lambda_1(m),ldots, lambda_m(m)$ of $rho_A(m)$ are correlated random variables because their sum equals unity. We numerically generate histograms of the ordered set of eigenvalues corresponding to ensembles of over $105$ random complex pure states of the bipartite system.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We consider the reduced density matrix $\rho_{A}^{(m)}$ of a bipartite system $AB$ of dimensionality $mn$ in a Gaussian ensemble of random, complex pure states of the composite system. For a given dimensionality $m$ of the subsystem $A$, the eigenvalues $\lambda_{1}^{(m)},\ldots, \lambda_{m}^{(m)}$ of $\rho_{A}^{(m)}$ are correlated random variables because their sum equals unity. The following quantities are known, among others: The joint probability density function (PDF) of the eigenvalues $\lambda_{1}^{(m)},\ldots, \lambda_{m}^{(m)}$ of $\rho_{A}^{(m)}$, the PDFs of the smallest eigenvalue $\lambda_{\rm min}^{(m)}$ and the largest eigenvalue $\lambda_{\rm max}^{(m)}$, and the family of average values $\langle \mathrm{Tr}\big(\rho_{A}^{(m)}\big)^{q}\rangle$ parametrised by $q$. Using values of $m$ running from $2$ to $6$ for definiteness, we show that these inputs suffice to identify and characterise the eigenvalue order statistics, i.e., to obtain explicit analytic expressions for the PDFs of each of the $m$ eigenvalues arranged in ascending order from the smallest to the largest one. When $m = n$ (respectively, $m < n$) these PDFs are polynomials of order $m^{2}-2$ (respectively, $mn - 2$) with support in specific sub-intervals of the unit interval, demarcated by appropriate unit step functions. Our exact results are fully corroborated by numerically generated histograms of the ordered set of eigenvalues corresponding to ensembles of over $10^{5}$ random complex pure states of the bipartite system. Finally, we present the general solution for arbitrary values of the subsystem dimensions $m$ and $n$, namely, formal exact expressions for the PDFs of every ordered eigenvalue.

Related papers

• The Communication Complexity of Approximating Matrix Rank [50.6867896228563]
  We show that this problem has randomized communication complexity $Omega(frac1kcdot n2log|mathbbF|)$. As an application, we obtain an $Omega(frac1kcdot n2log|mathbbF|)$ space lower bound for any streaming algorithm with $k$ passes.
  arXiv  Detail & Related papers  (2024-10-26T06:21:42Z)
• Private Covariance Approximation and Eigenvalue-Gap Bounds for Complex Gaussian Perturbations [28.431572772564518]
  We show that the Frobenius norm of the difference between the matrix output by this mechanism and the best rank-$k$ approximation to $M$ is bounded by roughly $tildeO(sqrtkd)$. This improves on previous work that requires that the gap between every pair of top-$k$ eigenvalues of $M$ is at least $sqrtd$ for a similar bound.
  arXiv  Detail & Related papers  (2023-06-29T03:18:53Z)
• Bivariate moments of the two-point correlation function for embedded Gaussian unitary ensemble with $k$-body interactions [0.0]
  Two-point correlation function in eigenvalues of a random matrix ensemble is the ensemble average of the product of the density of eigenvalues at two eigenvalues. Fluctuation measures such as the number variance and Dyson-Mehta $Delta_3$ statistic are defined by the two-point function.
  arXiv  Detail & Related papers  (2022-08-24T05:37:47Z)
• Near-optimal fitting of ellipsoids to random points [68.12685213894112]
  A basic problem of fitting an ellipsoid to random points has connections to low-rank matrix decompositions, independent component analysis, and principal component analysis. We resolve this conjecture up to logarithmic factors by constructing a fitting ellipsoid for some $n = Omega(, d2/mathrmpolylog(d),)$. Our proof demonstrates feasibility of the least squares construction of Saunderson et al. using a convenient decomposition of a certain non-standard random matrix.
  arXiv  Detail & Related papers  (2022-08-19T18:00:34Z)
• Classical shadows of fermions with particle number symmetry [0.0]
  We provide an estimator for any $k$-RDM with $mathcalO(k2eta)$ classical complexity. Our method, in the worst-case of half-filling, still provides a factor of $4k$ advantage in sample complexity.
  arXiv  Detail & Related papers  (2022-08-18T17:11:12Z)
• Computational Complexity of Normalizing Constants for the Product of Determinantal Point Processes [12.640283469603357]
  We study the computational complexity of computing the normalizing constant. We show that $sum_Sdet(bf A_S,S)p$ exactly for every (fixed) positive even integer $p$ is UP-hard and Mod$_3$P-hard.
  arXiv  Detail & Related papers  (2021-11-28T14:08:25Z)
• Random matrices in service of ML footprint: ternary random features with no performance loss [55.30329197651178]
  We show that the eigenspectrum of $bf K$ is independent of the distribution of the i.i.d. entries of $bf w$. We propose a novel random technique, called Ternary Random Feature (TRF) The computation of the proposed random features requires no multiplication and a factor of $b$ less bits for storage compared to classical random features.
  arXiv  Detail & Related papers  (2021-10-05T09:33:49Z)
• Spectral properties of sample covariance matrices arising from random matrices with independent non identically distributed columns [50.053491972003656]
  It was previously shown that the functionals $texttr(AR(z))$, for $R(z) = (frac1nXXT- zI_p)-1$ and $Ain mathcal M_p$ deterministic, have a standard deviation of order $O(|A|_* / sqrt n)$. Here, we show that $|mathbb E[R(z)] - tilde R(z)|_F
  arXiv  Detail & Related papers  (2021-09-06T14:21:43Z)
• Sparse sketches with small inversion bias [79.77110958547695]
  Inversion bias arises when averaging estimates of quantities that depend on the inverse covariance. We develop a framework for analyzing inversion bias, based on our proposed concept of an $(epsilon,delta)$-unbiased estimator for random matrices. We show that when the sketching matrix $S$ is dense and has i.i.d. sub-gaussian entries, the estimator $(epsilon,delta)$-unbiased for $(Atop A)-1$ with a sketch of size $m=O(d+sqrt d/
  arXiv  Detail & Related papers  (2020-11-21T01:33:15Z)
• Optimal Combination of Linear and Spectral Estimators for Generalized Linear Models [59.015960528781115]
  We show how to optimally combine $hatboldsymbol xrm L$ and $hatboldsymbol xrm s$. In order to establish the limiting distribution of $(boldsymbol x, hatboldsymbol xrm L, hatboldsymbol xrm s)$, we design and analyze an Approximate Message Passing (AMP) algorithm.
  arXiv  Detail & Related papers  (2020-08-07T18:20:05Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.