Quantum Data Fitting

Abstract

We provide a new quantum algorithm that efficiently determines the quality of a least-squares fit over an exponentially large data set by building upon an algorithm for solving systems of linear equations efficiently (Harrow et al., Phys. Rev. Lett. {\bf 103}, 150502 (2009)). In many cases, our algorithm can also efficiently find a concise function that approximates the data to be fitted and bound the approximation error. In cases where the input data is a pure quantum state, the algorithm can be used to provide an efficient parametric estimation of the quantum state and therefore can be applied as an alternative to full quantum state tomography given a fault tolerant quantum computer.

6 pages, corrected version

References in corpus (3)

• Quantum algorithm for solving linear systems of equations
• An Open-System Quantum Simulator with Trapped Ions
• Quantum Simulation of Antiferromagnetic Spin Chains in an Optical Lattice

Cited by in corpus (11)

• Experimental Realization of Quantum Artificial Intelligence
• Quantum Image Processing and Its Application to Edge Detection: Theory and Experiment
• Quantum Algorithms for Compositional Natural Language Processing
• Accelerated Randomized Benchmarking
• Machine learning \& artificial intelligence in the quantum domain
• Quantum Bootstrapping via Compressed Quantum Hamiltonian Learning
• Optimization and experimental realization of the quantum permutation algorithm
• Quantum algorithm for total least squares data fitting
• Quantum algorithm for logistic regression
• Quantum-Logic Synthesis of Hermitian Gates
• Implementation of a Hamming-Distance-Like Genomic Quantum Classifier Using Inner Products on IBMQX4 and IBMQX16