Quantum Expectation-Maximization Algorithm
arXiv:1908.06655 · doi:10.1103/PhysRevA.101.012326
Abstract
Clustering algorithms are a cornerstone of machine learning applications. Recently, a quantum algorithm for clustering based on the k-means algorithm has been proposed by Kerenidis, Landman, Luongo and Prakash. Based on their work, we propose a quantum expectation-maximization (EM) algorithm for Gaussian mixture models (GMMs). The robustness and quantum speedup of the algorithm is demonstrated. We also show numerically the advantage of GMM over k-means for non-trivial cluster data.
arXiv comment10 pages, 9 figures
References in corpus (12)
- Quantum Machine Learning
- Quantum support vector machine for big data classification
- Quantum Amplitude Amplification and Estimation
- An introduction to quantum machine learning
- Quantum random access memory
- Quantum-enhanced machine learning
- Architectures for a quantum random access memory
- q-means: A quantum algorithm for unsupervised machine learning
- Programmable Superpositions of Ising Configurations
- A Quantum Extension of Variational Bayes Inference
- Deterministic Quantum Annealing Expectation-Maximization Algorithm
- Designing ground states of Hopfield networks for quantum state preparation