The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation
Shantanav Chakraborty, Andr\'as Gily\'en, Stacey Jeffery

TL;DR
This paper advances quantum machine learning by developing block-encoding techniques for matrices, leading to improved algorithms for linear systems, least squares, and electrical network estimations with exponential precision gains.
Contribution
It introduces new block-encoding tools and algorithms that significantly improve quantum linear system solving and regression methods, especially for non-sparse matrices.
Findings
Exponential improvement in precision dependence for quantum linear system solvers.
New quantum algorithms for weighted and generalized least squares problems.
Enhanced quantum algorithms for electrical network estimations.
Abstract
We apply the framework of block-encodings, introduced by Low and Chuang (under the name standard-form), to the study of quantum machine learning algorithms and derive general results that are applicable to a variety of input models, including sparse matrix oracles and matrices stored in a data structure. We develop several tools within the block-encoding framework, such as singular value estimation of a block-encoded matrix, and quantum linear system solvers using block-encodings. The presented results give new techniques for Hamiltonian simulation of non-sparse matrices, which could be relevant for certain quantum chemistry applications, and which in turn imply an exponential improvement in the dependence on precision in quantum linear systems solvers for non-sparse matrices. In addition, we develop a technique of variable-time amplitude estimation, based on Ambainis' variable-time…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
