相关论文: The quantum way to diagonalize hermitean matrices

To measure an observable of a quantum mechanical system leaves it in one of its eigenstates and the result of the measurement is one of its eigenvalues. This process is shown to be a computational resource. It allows one, in principle, to…

A motivation is given for expressing classical mechanics in terms of diagonal projection matrices and diagonal density matrices. Then quantum mechanics is seen to be a simple generalization in which one replaces the diagonal real matrices…

A hermitian matrix can be parametrized by a set consisting of its determinant and the eigenvalues of its submatrices. We established a group of equations which connect these variables with the mixing parameters of diagonalization. These…

Quantum subspace diagonalization methods are an exciting new class of algorithms for solving large\rev{-}scale eigenvalue problems using quantum computers. Unfortunately, these methods require the solution of an ill-conditioned generalized…

We show how to visualize the process of diagonalizing the Hamiltonian matrix to find the energy eigenvalues and eigenvectors of a generic one-dimensional quantum system. Starting in the familiar sine-wave basis of an embedding infinite…

We introduce a new diagonalization method called quasi-sparse eigenvector diagonalization which finds the most important basis vectors of the low energy eigenstates of a quantum Hamiltonian. It can operate using any basis, either orthogonal…

In the existing literature various numerical techniques have been developed to quantize the confined harmonic oscillator in higher dimensions. In obtaining the energy eigenvalues, such methods often involve indirect approaches such as…

An important theorem in Gaussian quantum information tells us that we can diagonalise the covariance matrix of any Gaussian state via a symplectic transformation. Whilst the diagonal form is easy to find, the process for finding the…

We present and analyze a simple numerical method that diagonalizes a complex normal matrix A by diagonalizing the Hermitian matrix obtained from a random linear combination of the Hermitian and skew-Hermitian parts of A.

The diagonalization of general mass matrices is a more delicate problem when eigenvalue degeneracies exist. In this case, often overlooked in the literature, some difficulties arise related to the freedom in the choice of basis in…

We introduce right eigenvalues and subeigenvalues for square dual complex matrices. An $n \times n$ dual complex Hermitian matrix has exactly $n$ right eigenvalues and subeigenvalues, which are all real. The Hermitian matrix is positive…

We describe a multi-scale resolution approach to analyzing problems in Quantum Mechanics using Daubechies wavelet basis. The expansion of the wavefunction of the quantum system in this basis allows a natural interpretation of each basis…

Quantum signal processing allows for quantum eigenvalue transformation with Hermitian matrices, in which each eigenspace component of an input vector gets transformed according to its eigenvalue. In this work, we introduce the multivariate…

Solving linear systems and computing eigenvalues are two fundamental problems in linear algebra. For solving linear systems, many efficient quantum algorithms have been discovered. For computing eigenvalues, currently, we have efficient…

We elaborate an approach to quantum fluctuations of angular momentum based on the diagonalization of the covariance matrix in two versions: real symmetric and complex Hermitian. At difference with previous approaches this is SU(2) invariant…

We discuss a method called quasi-sparse eigenvector diagonalization which finds the most important basis vectors of the low energy eigenstates of a quantum Hamiltonian. It can operate using any basis, either orthogonal or non-orthogonal,…

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…

We propose two different strategies to find eigenvalues and eigenvectors of a given, not necessarily Hermitian, matrix $A$. Our methods apply also to the case of complex eigenvalues, making the strategies interesting for applications to…

We present an intuitive and scalable algorithm for the diagonalization of complex symmetric matrices, which arise from the projection of pseudo--Hermitian and complex scaled Hamiltonians onto a suitable basis set of "trial" states. The…

The problem of diagonalizing hermitian matrices of continuous fiunctions was studied by Grove and Pederson in 1984. While diagonalization is not possible in general, in the presence of differentiability conditions we are able to obtain…