pith. sign in

arxiv: 1812.09934 · v1 · pith:2WKLH6SLnew · submitted 2018-12-24 · 🪐 quant-ph · math.NA

Quantum Regularized Least Squares Solver with Parameter Estimate

classification 🪐 quant-ph math.NA
keywords parameterregularizationquantumalgorithmregularizedleastlinearnumber
0
0 comments X
read the original abstract

In this paper we propose a quantum algorithm to determine the Tikhonov regularization parameter and solve the ill-conditioned linear equations, for example, arising from the finite element discretization of linear or nonlinear inverse problems. For regularized least squares problem with a fixed regularization parameter, we use the HHL algorithm and work on an extended matrix with smaller condition number. For the determination of the regularization parameter, we combine the classical L-curve and GCV function, and design quantum algorithms to compute the norms of regularized solution and the corresponding residual in parallel and locate the best regularization parameter by Grover's search. The quantum algorithm can achieve a quadratic speedup in the number of regularization parameters and an exponential speedup in the dimension of problem size.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.