.png){kind=icon}
.png){kind=icon}
Return
Computing Eigenvalues of Diagonalizable Matrices on aQuantum Computer
.png){kind=icon}
OA
AI
DOI：10.1145/3527845.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Computing eigenvalues of matrices is ubiquitous in numerical linear algebra problems. Currently, fast quantum algorithms for estimating eigenvalues of Hermitian and unitary matrices are known. However, the general case is far from fully understood in the quantum case. Based on a quantum algorithm for solving linear ordinary differential equations, we show how to estimate the eigenvalues of diagonalizable matrices that only have real eigenvalues. The output is a superposition of the eigenpairs, and the overall complexity is polylog in the dimension for sparse matrices. Under an assumption, we extend the algorithm to diagonalizable matrices with complex eigenvalues.
Keywords:
Quantum algorithm
eigenvalue problem
quantum phase estimation
Journal
A
IF:
6.8
Papers:
539
Citations:
508