Related papers: Eigenvector Approximation Leading to Exponential S…
For the generalized eigenvalue problem, a quotient function is devised for estimating eigenvalues in terms of an approximate eigenvector. This gives rise to an infinite family of quotients, all entirely arguable to be used in estimation.…
Inspired by the idea of mimicking the measurement on a quantum system through a decoherence process to target specific eigenstates based on Born's law, i.e. the hiearchy of probabilities instead of the hierarchy of eigenvalues, we transform…
Solving eigenvalue problems is crucially important for both classical and quantum applications. Many well-known numerical eigensolvers have been developed, including the QR and the power methods for classical computers, as well as the…
We consider an iterative eigensolver for Schr\"odinger equations that constructs low-rank approximations of eigenfunctions with accuracy-adapted ranks, with particular focus on fermionic Schr\"odinger equations in second-quantized form and…
A powerful method for calculating the eigenvalues of a Hamiltonian operator consists of converting the energy eigenvalue equation into a matrix equation by means of an appropriate basis set of functions. The convergence of the method can be…
Nonlinear eigenvalue equations arise naturally in quantum information theory, particularly in the variational quantification of entanglement. In this work, we present a hybrid analytical and numerical framework for evaluating the geometric…
We propose a quantum algorithm for finding eigenvalues of non-unitary matrices. We show how to construct, through interactions in a quantum system and projective measurements, a non-Hermitian or non-unitary matrix and obtain its eigenvalues…
Large-scale eigenvalue problems arise in various fields of science and engineering and demand computationally efficient solutions. In this study, we investigate the subspace approximation for parametric linear eigenvalue problems, aiming to…
We give an exact solution to the nonlinear optimization problem of approximating a Hermitian matrix by positive semi-definite matrices. Our algorithm was then used to judge whether a quantum state is entangled or not. We show that the exact…
Quantum algorithms speeding up classical counterparts are proposed for the problems: 1. Recognition of eigenvalues with fixed precision. Given a quantum circuit generating unitary mapping $U$ and a complex number the problem is to determine…
In this paper, we present a direct quantum adaptation of the classical shifted power method. The method is very similar to the iterative phase estimation algorithm; however, it does not require any initial estimate of an eigenvector and as…
We present a quantum algorithm for systems of (possibly inhomogeneous) linear ordinary differential equations with constant coefficients. The algorithm produces a quantum state that is proportional to the solution at a desired final time.…
We develop an accelerated gradient descent algorithm on the Grassmann manifold to compute the subspace spanned by a number of leading eigenvectors of a symmetric positive semi-definite matrix. This has a constant cost per iteration and a…
In this paper we discuss reduced order models for the approximation of parametric eigenvalue problems. In particular, we are interested in the presence of intersections or clusters of eigenvalues. The singularities originating by these…
This paper is to introduce a type of full multigrid method for the nonlinear eigenvalue problem. The main idea is to transform the solution of nonlinear eigenvalue problem into a series of solutions of the corresponding linear boundary…
Trotter approximation in conjunction with Quantum Phase Estimation can be used to extract eigen-energies of a many-body Hamiltonian on a quantum computer. There were several ways proposed to assess the quality of this approximation based on…
Often the easiest way to discretize an ordinary or partial differential equation is by a rectangular numerical method, in which n basis functions are sampled at m>>n collocation points. We show how eigenvalue problems can be solved in this…
We propose a novel numerical algorithm for computing the electronic structure related eigenvalue problem of incommensurate systems. Unlike the conventional practice that approximates the system by a large commensurate supercell, our…
In this paper, we compute the eigenvalue problem (EVP) for the semiclassical random Schr\"odinger operators, where the random potentials are parameterized by an infinite series of random variables. After truncating the series, we introduce…
We present a variational algorithm for fault tolerant quantum computing to solve a system of linear equations which directly maximises the parameters of the target fidelity. This so-called measurement test algorithm can be applied to any…