期刊
PHYSICS LETTERS A
卷 488, 期 -, 页码 -出版社
ELSEVIER
DOI: 10.1016/j.physleta.2023.129138
关键词
Quantum algorithms; Quantum computation
This study leverages techniques from the HHL algorithm, classical power, and Krylov subspace method to devise a simple quantum algorithm for estimating the largest eigenvalues in magnitude of a Hermitian matrix. Our quantum algorithm offers significant speedup compared to classical algorithms in terms of matrix size.
Scientific computation involving numerical methods relies heavily on the manipulation of large matrices, including solving linear equations and finding eigenvalues and eigenvectors. Quantum algorithms have been developed to advance these computational tasks, and some have been shown to provide substantial speedup, such as factoring a large integer and solving linear equations. In this work, we leverage the techniques used in the Harrow-Hassidim-Llyod (HHL) algorithm for linear systems, the classical power, and the Krylov subsapce method to devise a simple quantum algorithm for estimating the largest eigenvalues in magnitude of a Hermitian matrix. Our quantum algorithm offers significant speedup with respect to the size of a given matrix over classical algorithms that solve the same problem.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据