Quantum algorithm for total least squares data fitting
classification
🪐 quant-ph
keywords
leastalgorithmsfittingquantumsquareserrorsmatrixmethod
pith:EBDQAGHW Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{EBDQAGHW}
Prints a linked pith:EBDQAGHW badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original 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.
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.