Related papers: Recovery of eigenvectors from eigenvalues in syste…
Eigenvalue and eigenvector perturbation theory is a fundamental topic in several disciplines, including numerical linear algebra, quantum physics, and related fields. The central problem is to understand how the eigenvalues and eigenvectors…
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 prove that the point process of the eigenvalues of real or complex non-Hermitian matrices $X$ with independent, identically distributed entries is hyperuniform: the variance of the number of eigenvalues in a subdomain $\Omega$ of the…
Symplectic ensemble of disordered non-Hermitian Hamiltonians is studied. Starting from a model with an imaginary magnetic field, we derive a proper supermatrix $\sigma $-model. The zero-dimensional version of this model corresponds to a…
Seniority-zero geminal wavefunctions are known to capture bond-breaking correlation. Among this class of wavefunctions, Richardson-Gaudin states stand out as they are eigenvectors of a model Hamiltonian. This provides a clear physical…
Random matrix theory allows one to deduce the eigenvalue spectrum of a large matrix given only statistical information about its elements. Such results provide insight into what factors contribute to the stability of complex dynamical…
Consider an $ N \times N$ Hermitian one-dimensional random band matrix with band width $W > N^{1 / 2 + \frak c} $ for any $ {\frak c} > 0$. In the bulk of the spectrum and in the large $ N $ limit, we obtain the following results: (i) The…
We develop a theory which describes the behaviour of eigenvalues of a class of one-dimensional random non-Hermitian operators introduced recently by Hatano and Nelson. Under general assumptions on random parameters we prove that the…
Let $A$ be a rectangular matrix of size $m\times n$ and $A_1$ be the random matrix where each entry of $A$ is multiplied by an independent $\{0,1\}$-Bernoulli random variable with parameter $1/2$. This paper is about when, how and why the…
This work is concerned with variational analysis of so-called spectral functions and spectral sets of matrices that only depend on eigenvalues of the matrix. Based on our previous work [H. T. B\`ui, M. N. B\`ui, and C. Clason, Convex…
Consider $n$ linearly independent vectors in $\mathbb{C}^n$ which form columns of a matrix $A$. The recursive evaluation of eigen directions (normalized eigenvectors) of $A$ is the solution of an eigenvalue problem of the form…
Sensitivity of an eigenvalue $\lambda_i$ to the perturbation of matrix elements is controlled by the eigenvalue condition number defined as $\kappa_i = \sqrt{\left< L_i | L_i\right> \left< R_i|R_i \right> }$, where $\left<L_i\right|$ and…
We derive the connected correlation functions for eigenvalues of large Hermitian random matrices with independently distributed elements using both a diagrammatic and a renormalization group (RG) inspired approach. With the diagrammatic…
The observation that PT-symmetric Hamiltonians can have real-valued energy levels even if they are non-Hermitian has triggered intense activities, with experiments, in particular, focusing on optical systems, where Hermiticity can be broken…
Recent advances in representation learning reveal that widely used objectives, such as contrastive and non-contrastive, implicitly perform spectral decomposition of a contextual kernel, induced by the relationship between inputs and their…
Recovering an unknown Hamiltonian from measurements is an increasingly important task for certification of noisy quantum devices and simulators. Recent works have succeeded in recovering the Hamiltonian of an isolated quantum system with…
A generalized Fourier analysis on arbitrary graphs calls for a detailed knowledge of the eigenvectors of the graph Laplacian. Using the symmetries of the Cayley tree, we recursively construct the family of eigenvectors with exponentially…
This note considers the unstructured sparse recovery problems in a general form. Examples include rational approximation, spectral function estimation, Fourier inversion, Laplace inversion, and sparse deconvolution. The main challenges are…
While symmetry has been exploited to analyze synchronization patterns in complex networks, the identification of symmetries in large-size network remains as a challenge. We present in the present work a new method, namely the method of…
Assume that the eigenvalues of a finite hermitian linear operator have been deduced accurately but the linear operator itself could not be determined with precision. Given a set of eigenvalues $\lambda$ and a hermitian matrix $M$, this…