Related papers: Exact Eigenanalyses of Certain N^m x N^m Density M…
The density matrix formalism is a fundamental tool in studying various problems in quantum information processing. In the space of density matrices, the most well-known measures are the Hilbert-Schmidt and Bures-Hall ensembles. In this…
In the context of the Oppenheim-Horodecki paradigm of nonclassical correlation, a bipartite quantum state is (properly) classically correlated if and only if it is represented by a density matrix having a product eigenbasis. On the basis of…
We calculate various quantities that characterize the dissimilarity of reduced density matrices for a short interval of length $\ell$ in a two-dimensional (2D) large central charge conformal field theory (CFT). These quantities include the…
Characterization of the multipartite mixed state entanglement is still a challenging problem. Since due to the fact that the entanglement for the mixed states, in general, is defined by a convex-roof extension. That is the entanglement…
We compute the probability densities of the effective neutrino masses $m_{\beta }$ and $m_{\beta \beta}$ using the Kernel Density Estimate (KDE) approach applied to a distribution of points in the $(m_{\min}, m_{\beta\beta })$ and…
We consider the empirical eigenvalue distribution of an $m\times m$ principal submatrix of an $n\times n$ random unitary matrix distributed according to Haar measure. For $n$ and $m$ large with $\frac{m}{n}=\alpha$, the empirical spectral…
In this paper we demonstrate that the alternative form, derived by us in an earlier paper, of the $n$-level densities for eigenvalues of matrices from the classical compact group $USp(2N)$ is far better suited for comparison with…
We study fast algorithms for computing fundamental properties of a positive semidefinite kernel matrix $K \in \mathbb{R}^{n \times n}$ corresponding to $n$ points $x_1,\ldots,x_n \in \mathbb{R}^d$. In particular, we consider estimating the…
For $k,m,n\in \mathbb{N}$, we consider $n^k\times n^k$ random matrices of the form $$ \mathcal{M}_{n,m,k}(\mathbf{y})=\sum_{\alpha=1}^m\tau_\alpha {Y_\alpha}Y_\alpha^T,\quad…
The set of cosmological density parameters ($\Omega_{0m}h_{0}^{2}$, $\Omega_{0k}h_{0}^{2}$, $\Omega_{0\Lambda}h_{0}^{2}$) and Hubble constant ($\hat{h}_{0}$) are useful for fundamental understanding of the universe from many perspectives.…
Statistical properties of non--symmetric real random matrices of size $M$, obtained as truncations of random orthogonal $N\times N$ matrices are investigated. We derive an exact formula for the density of eigenvalues which consists of two…
Inspired by the quantum computing algorithms for Linear Algebra problems [HHL,TaShma] we study how the simulation on a classical computer of this type of "Phase Estimation algorithms" performs when we apply it to solve the Eigen-Problem of…
We develop a rigorous framework for quantifying quantum coherence in finite-dimensional systems by applying the Schur-Horn majorization theorem to relate eigenvalue distributions and diagonal entries of density matrices. Building on this…
Pencils of Hankel matrices whose elements have a joint Gaussian distribution with nonzero mean and not identical covariance are considered. An approximation to the distribution of the squared modulus of their determinant is computed which…
We construct a kernel density estimator on symmetric spaces of non-compact type and establish an upper bound for its convergence rate, analogous to the minimax rate for classical kernel density estimators on Euclidean space. Symmetric…
We propose a novel parallel numerical algorithm for calculating the smallest eigenvalues of highly ill-conditioned matrices. It is based on the {\it LDLT} decomposition and involves finding a $k \times k$ sub-matrix of the inverse of the…
A result of Zyczkowski and Sommers [J.Phys.A, 33, 2045--2057 (2000)] gives the eigenvalue probability density function for the top N x N sub-block of a Haar distributed matrix from U(N+n). In the case n \ge N, we rederive this result,…
We derive a sufficient condition for a Hermitian $N \times N$ matrix $A$ to have at least $m$ eigenvalues (counting multiplicities) in the interval $(-\epsilon, \epsilon)$. This condition is expressed in terms of the existence of a…
We study algorithms for approximating the spectral density of a symmetric matrix $A$ that is accessed through matrix-vector product queries. By combining a previously studied Chebyshev polynomial moment matching method with a deflation step…
We propose a second-order accurate method to estimate the eigenvectors of extremely large matrices thereby addressing a problem of relevance to statisticians working in the analysis of very large datasets. More specifically, we show that…