Gaussian Kernel in Quantum Learning
arXiv:1711.01464 · doi:10.1142/S0219749920500069
Abstract
The Gaussian kernel is a very popular kernel function used in many machine learning algorithms, especially in support vector machines (SVMs). It is more often used than polynomial kernels when learning from nonlinear datasets, and is usually employed in formulating the classical SVM for nonlinear problems. In [3], Rebentrost et al. discussed an elegant quantum version of a least square support vector machine using quantum polynomial kernels, which is exponentially faster than the classical counterpart. This paper demonstrates a quantum version of the Gaussian kernel and analyzes its runtime complexity using the quantum random access memory (QRAM) in the context of quantum SVM. Our analysis shows that the runtime computational complexity of the quantum Gaussian kernel seems to be significantly faster as compared to its classical version.
References in corpus (8)
- Quantum support vector machine for big data classification
- Quantum random access memory
- Strong Coupling of a Spin Ensemble to a Superconducting Resonator
- High cooperativity coupling of electron-spin ensembles to superconducting cavities
- Architectures for a quantum random access memory
- Storage of multiple coherent microwave excitations in an electron spin ensemble
- Magnetic strong coupling in a spin-photon system and transition to classical regime
- An All-Pair Quantum SVM Approach for Big Data Multiclass Classification