Quantum-enhanced least-square support vector machine: simplified quantum algorithm and sparse solutions
arXiv:1908.01462 · doi:10.1016/j.physleta.2020.126590
Abstract
Quantum algorithms can enhance machine learning in different aspects. Here, we study quantum-enhanced least-square support vector machine (LS-SVM). Firstly, a novel quantum algorithm that uses continuous variable to assist matrix inversion is introduced to simplify the algorithm for quantum LS-SVM, while retaining exponential speed-up. Secondly, we propose a hybrid quantum-classical version for sparse solutions of LS-SVM. By encoding a large dataset into a quantum state, a much smaller transformed dataset can be extracted using quantum matrix toolbox, which is further processed in classical SVM. We also incorporate kernel methods into the above quantum algorithms, which uses both exponential growth Hilbert space of qubits and infinite dimensionality of continuous variable for quantum feature maps. The quantum LS-SVM exploits quantum properties to explore important themes for SVM such as sparsity and kernel methods, and stresses its quantum advantages ranging from speed-up to the potential capacity to solve classically difficult machine learning tasks.
arXiv comment9 pages and 0 figures
References in corpus (26)
- Quantum algorithm for solving linear systems of equations
- Supervised learning with quantum enhanced feature spaces
- Quantum support vector machine for big data classification
- Quantum machine learning in feature Hilbert spaces
- Quantum principal component analysis
- Quantum computation over continuous variables
- Quantum random access memory
- Quantum generative adversarial learning
- Quantum Data Fitting
- Quantum-enhanced machine learning
- Architectures for a quantum random access memory
- Average-case complexity versus approximate simulation of commuting quantum computations
- Experimental Realization of Quantum Artificial Intelligence
- Machine learning meets quantum physics
- Quantum singular value decomposition of non-sparse low-rank matrices
- Occam's Quantum Razor: How Quantum Mechanics can reduce the complexity of classical models
- Quantum machine learning over infinite dimensions
- Experimental Blind Quantum Computing for a Classical Client
- Quantum algorithm for non-homogeneous linear partial differential equations
- Continuous-Variable Instantaneous Quantum Computing is hard to sample
- Quantum-inspired low-rank stochastic regression with logarithmic dependence on the dimension
- Quantum algorithm and quantum circuit for A-Optimal Projection: dimensionality reduction
- Efficient quantum circuit for singular value thresholding
- Protocol for implementing quantum nonparametric learning with trapped ions
- Realizing quantum linear regression with auxiliary qumodes
- An efficient quantum algorithm for spectral estimation