Quantum algorithm for total least squares data fitting

DOI10.1016/J.PHYSLETA.2019.04.037zbMATH Open1476.81026arXiv1906.01194OpenAlexW2940475582WikidataQ128023752 ScholiaQ128023752MaRDI QIDQ820899FDOQ820899

Authors: Hefeng Wang, Hua Xiang 

Publication date: 29 September 2021

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

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.

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• An Analysis of the Total Least Squares Problem
• Sampling algorithms for \(l_2\) regression and applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Quantum algorithms for algebraic problems
• Quantum random access memory
• The Analysis for the Total Least Squares Problem with More Than One Solution
• Title not available (Why is that?)
• Randomized algorithms for total least squares problems
• Black-box Hamiltonian simulation and unitary implementation
• Title not available (Why is that?)

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 algorithm for unsupervised anomaly detection
• Quantum regularized least squares solver with parameter estimate
• 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

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)