Quantum algorithm for total least squares data fitting
arXiv:1906.01194 · doi:10.1016/j.physleta.2019.04.037
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.
References in corpus (14)
- Quantum Mechanics helps in searching for a needle in a haystack
- Quantum algorithm for solving linear systems of equations
- Quantum support vector machine for big data classification
- Adiabatic Quantum Computing
- Quantum random access memory
- Optimal Hamiltonian Simulation by Quantum Signal Processing
- Simulating Hamiltonian dynamics with a truncated Taylor series
- Efficient quantum algorithms for simulating sparse Hamiltonians
- Quantum Data Fitting
- Quantum algorithms for algebraic problems
- A quantum linear system algorithm for dense matrices
- Quantum Hopfield neural network
- Quantum Simulation of Resonant Transitions for Solving the Eigen-problem of an Effective Water Hamiltonian
- Quantum algorithm for obtaining the eigenstates of a physical system