Related papers: The quantum way to diagonalize hermitean matrices
We introduce a particular nonlinear generalization of quantum mechanics which has the property that it is exactly solvable in terms of the eigenvalues and eigenfunctions of the Hamiltonian of the usual linear quantum mechanics problem. We…
The quantum singular value transformation has revolutionised quantum algorithms. By applying a polynomial to an arbitrary matrix, it provides a unifying picture of quantum algorithms. However, polynomials are restricted to definite parity…
A very common problem in science is the numerical diagonalization of symmetric or hermitian 3x3 matrices. Since standard "black box" packages may be too inefficient if the number of matrices is large, we study several alternatives. We…
Quantum canonical transformations of the second kind and the non-Hermitian realizations of the basic canonical commutation relations are investigated with a special interest in the generalization of the conventional ladder operators. The…
We introduce variational methods for finding approximate eigenfunctions and eigenvalues of quantum Hamiltonians by constructing a set of orthogonal wave functions which approximately solve the eigenvalue equation.
Recent studies on quantum computing algorithms focus on excavating features of quantum computers which have potential for contributing to computational model enhancements. Among various approaches, quantum annealing methods effectively…
Update: A time-independent $n\times n$ PT-symmetric (and symmetric) Hamiltonian is diagonalizable since it has all distinct real eigenvalues and the resulting diagonal matrix is a real symmetric matrix. The diagonalization results an…
We propose a class of randomized quantum algorithms for the task of sampling from matrix functions, without the use of quantum block encodings or any other coherent oracle access to the matrix elements. As such, our use of qubits is purely…
A general method to derive the diagonal representation for a generic matrix valued quantum Hamiltonian is proposed. In this approach new mathematical objects like non-commuting operators evolving with the Planck constant promoted as a…
A general strategy is provided to identify the most general metric for diagonalizable pseudo-Hermitian and anti-pseudo-Hermitian Hamilton operators represented by two-dimensional matrices. It is investigated how a permutation of the…
An algorithm to classify a general Hermitian matrix according to its signature (positive semi-definite, negative or indefinite) is presented. It builds on the Quantum Phase Estimation algorithm, which stores the sign of the eigenvalues of a…
Fundamental matrix operations and solving linear systems of equations are ubiquitous in scientific investigations. Using the "Sender-Receiver" model, we propose quantum algorithms for matrix operations such as matrix-vector product,…
This paper investigates finite-dimensional representations of PT-symmetric Hamiltonians. In doing so, it clarifies some of the claims made in earlier papers on PT-symmetric quantum mechanics. In particular, it is shown here that there are…
We present a method for the explicit diagonalization of some Hankel operators. This method allows us to recover classical results on the diagonalization of Hankel operators with the absolutely continuous spectrum. It leads also to new…
A number of many-body problems can be formulated using Hamiltonians that are quadratic in the creation and annihilation operators. Here, we show how such quadratic Hamiltonians can be efficiently estimated indirectly, employing very few…
We present a new math-physics modeling approach, called canonical quantization with numerical mode-decomposition, for capturing the physics of how incoming photons interact with finite-sized dispersive media, which is not describable by the…
To any complex Hadamard matrix we associate a quantum permutation group. The correspondence is not one-to-one, but the quantum group encapsulates a number of subtle properties of the matrix. We investigate various aspects of the…
Coupling qubits together towards large-scale integration is a key point for realizing a quantum computer. We study the capacitively coupled superconducting phase qubits using two diagonalization methods, which are very efficient to obtain…
In this paper, we give random matrix theory approach to the quantum mechanics using the quantum Hamilton-Jacobi formalism. We show that the bound state problems in quantum mechanics are analogous to solving Gaussian unitary ensemble of…
We propose quantum algorithms, purely quantum in nature, for calculating the determinant and inverse of an $(N-1)\times (N-1)$ matrix (depth is $O(N^2\log N)$) which is a simple modification of the algorithm for calculating the determinant…