Approximating the eigenvalues of self-adjoint trace-class operators

• URL: http://arxiv.org/abs/2407.04478v2
• Date: Thu, 22 Aug 2024 16:50:49 GMT
• Title: Approximating the eigenvalues of self-adjoint trace-class operators
• Authors: Richárd Balka, Gábor Homa, András Csordás,
• Abstract summary: We define a set $Lambda_nsubset mathbbR$ for each self-adjoint, trace-class operator $O$. We show that it converges to the spectrum of $O$ in the Hausdorff metric under mild conditions.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Spectral properties of bounded linear operators play a crucial role in several areas of mathematics and physics. For each self-adjoint, trace-class operator $O$ we define a set $\Lambda_n\subset \mathbb{R}$, and we show that it converges to the spectrum of $O$ in the Hausdorff metric under mild conditions. Our set $\Lambda_n$ only depends on the first $n$ moments of $O$. We show that it can be effectively calculated for physically relevant operators, and it approximates the spectrum well. We prove that using the above method we can converge to the minimal and maximal eigenvalues with super-exponential speed. We also construct monotone increasing lower bounds $q_n$ for the minimal eigenvalue (or decreasing upper bounds for the maximal eigenvalue). This sequence only depends on the moments of $O$ and a concrete upper estimate of its $1$-norm; we also demonstrate that $q_n$ can be effectively calculated for a large class of physically relevant operators. This rigorous lower bound $q_n$ tends to the minimal eigenvalue with super-exponential speed provided that $O$ is not positive semidefinite. As a by-product, we obtain computable upper bounds for the $1$-norm of $O$, too.

Related papers

• Optimal Sketching for Residual Error Estimation for Matrix and Vector Norms [50.15964512954274]
  We study the problem of residual error estimation for matrix and vector norms using a linear sketch. We demonstrate that this gives a substantial advantage empirically, for roughly the same sketch size and accuracy as in previous work. We also show an $Omega(k2/pn1-2/p)$ lower bound for the sparse recovery problem, which is tight up to a $mathrmpoly(log n)$ factor.
  arXiv  Detail & Related papers  (2024-08-16T02:33:07Z)
• More on symmetry resolved operator entanglement [0.0]
  We focus on spin chains with a global $U(1)$ conservation law, and on operators $O$ with a well-defined $U(1)$ charge. We employ the notion of symmetry resolved operator entanglement (SROE) introduced in [PRX Quantum 4, 010318 (2023) and extend the results of the latter paper in several directions. Our main results are: i) the SROE of $rho_beta$ obeys the operator area law; ii) for free fermions, local operators in Heisenberg picture can have a SROE that grows logarithmically in time or saturate
  arXiv  Detail & Related papers  (2023-09-07T21:58:18Z)
• A note on $L^1$-Convergence of the Empiric Minimizer for unbounded functions with fast growth [0.0]
  For $V : mathbbRd to mathbbR$ coercive, we study the convergence rate for the $L1$-distance of the empiric minimizer. We show that in general, for unbounded functions with fast growth, the convergence rate is bounded above by $a_n n-1/q$, where $q$ is the dimension of the latent random variable.
  arXiv  Detail & Related papers  (2023-03-08T08:46:13Z)
• An Order Relation between Eigenvalues and Symplectic Eigenvalues of a Class of Infinite-Dimensional Operators [0.0]
  We prove an inequality between the eigenvalues and symplectic eigenvalues of a special class of infinite dimensional operators. The only possible accumulation point for the symplectic eigenvalues is $alpha$.
  arXiv  Detail & Related papers  (2022-12-07T19:00:32Z)
• Optimal Query Complexities for Dynamic Trace Estimation [59.032228008383484]
  We consider the problem of minimizing the number of matrix-vector queries needed for accurate trace estimation in the dynamic setting where our underlying matrix is changing slowly. We provide a novel binary tree summation procedure that simultaneously estimates all $m$ traces up to $epsilon$ error with $delta$ failure probability. Our lower bounds (1) give the first tight bounds for Hutchinson's estimator in the matrix-vector product model with Frobenius norm error even in the static setting, and (2) are the first unconditional lower bounds for dynamic trace estimation.
  arXiv  Detail & Related papers  (2022-09-30T04:15:44Z)
• Factorized Hilbert-space metrics and non-commutative quasi-Hermitian observables [0.0]
  It is well known that an (in general, non-commutative) set of non-Hermitian operators $Lambda_j$ with real eigenvalues need not necessarily represent observables. We describe a specific class of quantum models in which these operators plus the underlying physical Hilbert-space metric $Theta$ are all represented.
  arXiv  Detail & Related papers  (2022-06-27T18:33:03Z)
• Low-Rank Approximation with $1/\epsilon^{1/3}$ Matrix-Vector Products [58.05771390012827]
  We study iterative methods based on Krylov subspaces for low-rank approximation under any Schatten-$p$ norm. Our main result is an algorithm that uses only $tildeO(k/sqrtepsilon)$ matrix-vector products.
  arXiv  Detail & Related papers  (2022-02-10T16:10:41Z)
• Asymptotic Tensor Powers of Banach Spaces [77.34726150561087]
  We show that Euclidean spaces are characterized by the property that their tensor radius equals their dimension. We also show that the tensor radius of an operator whose domain or range is Euclidean is equal to its nuclear norm.
  arXiv  Detail & Related papers  (2021-10-25T11:51:12Z)
• Convexity of a certain operator trace functional [1.1470070927586014]
  In this article the operator trace function $ Lambda_r,s(A)[K, M] := operatornametr(K*Ar M Ar K)s$ is introduced and its convexity and concavity properties are investigated. This function has a direct connection to several well-studied operator trace functions that appear in quantum information theory.
  arXiv  Detail & Related papers  (2021-09-23T17:51:46Z)
• 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)
• Optimal Spectral Recovery of a Planted Vector in a Subspace [80.02218763267992]
  We study efficient estimation and detection of a planted vector $v$ whose $ell_4$ norm differs from that of a Gaussian vector with the same $ell$ norm. We show that in the regime $n rho gg sqrtN$, any spectral method from a large class (and more generally, any low-degree of the input) fails to detect the planted vector.
  arXiv  Detail & Related papers  (2021-05-31T16:10:49Z)

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.