The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation

by   Shantanav Chakraborty, et al.

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 using quantum accessible data structures. We develop several tools within the block-encoding framework, including quantum linear system solvers using block-encodings. Our 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 amplitude amplification technique, which we are also able to apply within the framework. As applications, we design the following algorithms: (1) a quantum algorithm for the quantum weighted least squares problem, exhibiting a 6-th power improvement in the dependence on the condition number and an exponential improvement in the dependence on the precision over the previous best algorithm of Kerenidis and Prakash; (2) the first quantum algorithm for the quantum generalized least squares problem; and (3) quantum algorithms for estimating electrical-network quantities, including effective resistance and dissipated power, improving upon previous work in other input models.


page 1

page 2

page 3

page 4


Quantum Regularized Least Squares

Linear regression is a widely used technique to fit linear models and fi...

A quantum algorithm for simulating non-sparse Hamiltonians

We present a quantum algorithm for simulating the dynamics of Hamiltonia...

Quantum linear systems algorithms: a primer

The Harrow-Hassidim-Lloyd (HHL) quantum algorithm for sampling from the ...

Nearly tight Trotterization of interacting electrons

We consider simulating quantum systems on digital quantum computers. We ...

Quantum Chebyshev's Inequality and Applications

In this paper we provide new quantum algorithms with polynomial speed-up...

Explicit Quantum Circuits for Block Encodings of Certain Sparse Matrices

Many standard linear algebra problems can be solved on a quantum compute...