.png){kind=icon}
返回
Computing Eigenvalues of Diagonalizable Matrices on aQuantum Computer
.png){kind=icon}
OA
AI
DOI：10.1145/3527845.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Quantum algorithm
eigenvalue problem
quantum phase estimation
期刊
A
IF:
6.8
论文数:
542
被引数:
508
机构
引用论文
Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution.png)
NATURE PHYSICS
NATURE PHYSICSIF18.4
PREAI
分享收藏A variational eigenvalue solver on a photonic quantum processor光子量子处理器上的变分特征值求解器NATURE COMMUNICATIONS
OAAI
NATURE COMMUNICATIONSIF15.7
OAAI分享收藏
查看更多内容