Affiliation:
1. School of Mathematics, University of Bristol, Bristol, United Kingdom
Abstract
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.
Funder
QuantERA ERA-NET Cofund in Quantum Technologies implemented within the European Union’s Horizon 2020 Programme
EPSRC
Publisher
Association for Computing Machinery (ACM)
Reference39 articles.
1. Quantum Algorithm Providing Exponential Speed Increase for Finding Eigenvalues and Eigenvectors
2. Quantum algorithms for feedforward neural networks;Allcock Jonathan;ACM Trans. Quant. Comput.,2020
3. Simon Apers and Ronald de Wolf. 2020. Quantum speedup for graph sparsification, cut approximation and laplacian solving. In Proceedings of the IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS’20). IEEE, 637–648.
4. Lecture notes on solving large scale eigenvalue problems;Arbenz Peter;D-MATH, EHT Zurich,2012
5. Norms and exclusion theorems
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献