Quantum algorithm for total least squares data fitting

DOI10.1016/J.PHYSLETA.2019.04.037MaRDI QIDQ820899zbMATH OpenOpenAlexWikidataFDO

Authors Hefeng Wang, Hua Xiang

Publication date 29 September 2021

Published in Physics Letters. A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1906.01194

zbMATH Keywords

total least squaresquantum algorithmquantum simulation

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Hamilton's equations (70H05) Least squares and related methods for stochastic control systems (93E24) Resonances in quantum scattering theory (81U24) Mathematical modeling or simulation for problems pertaining to mechanics of particles and systems (70-10)

Abstract: The total least squares~(TLS) method is widely used in data-fitting. Compared with the least squares fitting method, the TLS fitting takes into account not only observation errors, but also errors from the measurement matrix of the variables. In this work, the TLS problem is transformed to finding the ground state of a Hamiltonian matrix. We propose quantum algorithms for solving this problem based on quantum simulation of resonant transitions. Our algorithms can achieve at least polynomial speedup over the known classical algorithms.

Recommendations

• Quantum regularized least squares solver with parameter estimate
• Fast quantum algorithms for least squares regression and statistic leverage scores
• Fast quantum algorithms for least squares regression and statistic leverage scores
• An algebraic technique for total least squares problem in quaternionic quantum theory
• scientific article; zbMATH DE number 549932

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 51511 (Why is no real title available?)
• scientific article; zbMATH DE number 1734139 (Why is no real title available?)
• scientific article; zbMATH DE number 1058105 (Why is no real title available?)
• scientific article; zbMATH DE number 6159604 (Why is no real title available?)
• scientific article; zbMATH DE number 2193965 (Why is no real title available?)
• An Analysis of the Total Least Squares Problem
• Black-box Hamiltonian simulation and unitary implementation
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Quantum algorithms for algebraic problems
• Quantum random access memory
• Randomized algorithms for total least squares problems
• Sampling algorithms for \(l_2\) regression and applications
• The Analysis for the Total Least Squares Problem with More Than One Solution

Cited in

(8)

• Quantum algorithm for the advection-diffusion equation simulated with the lattice Boltzmann method
• Quantum radial basis function method for the Poisson equation
• Quantum regularized least squares solver with parameter estimate
• Quantum algorithm for unsupervised anomaly detection
• Fast quantum algorithms for least squares regression and statistic leverage scores
• Quantum radial basis function method for scattered data interpolation
• Fast quantum algorithms for least squares regression and statistic leverage scores
• Krylov Subspace Approach to Core Problems within Multilinear Approximation Problems: A Unifying Framework

Describes a project that uses

Uses Software

• VanHuffel

This page was built for publication: Quantum algorithm for total least squares data fitting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q820899)