Clustering by Contour coreset and variational quantum eigensolver (2312.03516v1)
Abstract: Recent work has proposed solving the k-means clustering problem on quantum computers via the Quantum Approximate Optimization Algorithm (QAOA) and coreset techniques. Although the current method demonstrates the possibility of quantum k-means clustering, it does not ensure high accuracy and consistency across a wide range of datasets. The existing coreset techniques are designed for classical algorithms and there has been no quantum-tailored coreset technique which is designed to boost the accuracy of quantum algorithms. In this work, we propose solving the k-means clustering problem with the variational quantum eigensolver (VQE) and a customised coreset method, the Contour coreset, which has been formulated with specific focus on quantum algorithms. Extensive simulations with synthetic and real-life data demonstrated that our VQE+Contour Coreset approach outperforms existing QAOA+Coreset k-means clustering approaches with higher accuracy and lower standard deviation. Our work has shown that quantum tailored coreset techniques has the potential to significantly boost the performance of quantum algorithms when compared to using generic off-the-shelf coreset techniques.
- Aram W Harrow “Small quantum computers and large classical data sets” In arXiv preprint arXiv:2004.00026, 2020
- “Coreset clustering on small quantum computers” In Electronics 10.14 MDPI, 2021, pp. 1690
- Fanzhe Qu, Sarah M Erfani and Muhammad Usman “Performance analysis of coreset selection for quantum implementation of K-Means clustering algorithm” In arXiv preprint arXiv:2206.07852, 2022
- Olivier Bachem, Mario Lucic and Andreas Krause “Scalable k-means clustering via lightweight coresets” In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018, pp. 1119–1127
- Olivier Bachem, Mario Lucic and Andreas Krause “Practical coreset constructions for machine learning” In arXiv preprint arXiv:1703.06476, 2017
- Olivier Bachem, Mario Lucic and Silvio Lattanzi “One-shot coresets: The case of k-clustering” In International conference on artificial intelligence and statistics, 2018, pp. 784–792 PMLR
- “UCI Repository of machine learning databases”, 1998 URL: http://www.ics.uci.edu/~mlearn/MLRepository.html
- “Variational quantum simulation for quantum chemistry” In Advanced Theory and Simulations 2.4 Wiley Online Library, 2019, pp. 1800182
- “Quantum chemistry calculations on a trapped-ion quantum simulator” In Physical Review X 8.3 APS, 2018, pp. 031022
- “K-means++ the advantages of careful seeding” In Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, 2007, pp. 1027–1035
- Mario Lucic, Olivier Bachem and Andreas Krause “Strong coresets for hard and soft Bregman clustering with applications to exponential family mixtures” In Artificial intelligence and statistics, 2016, pp. 1–9 PMLR
- Qiskit contributors “Qiskit: An Open-source Framework for Quantum Computing”, 2023 DOI: 10.5281/zenodo.2573505
- “Scikit-learn: Machine Learning in Python” In Journal of Machine Learning Research 12, 2011, pp. 2825–2830
- Pankaj K Agarwal, Sariel Har-Peled and Kasturi R Varadarajan “Geometric approximation via coresets” In Combinatorial and computational geometry 52.1 Cambridge University Press Cambridge, 2005
- Michael Langberg and Leonard J Schulman “Universal ε𝜀\varepsilonitalic_ε-approximators for integrals” In Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms, 2010, pp. 598–607 SIAM
- “k-means++: The advantages of careful seeding”, 2006
- Aram Harrow, Patrick Hayden and Debbie Leung “Superdense coding of quantum states” In Physical review letters 92.18 APS, 2004, pp. 187901
- Hans-Peter Kriegel, Erich Schubert and Arthur Zimek “The (black) art of runtime evaluation: Are we comparing algorithms or implementations?” In Knowledge and Information Systems 52 Springer, 2017, pp. 341–378
- “Adiabatic quantum computing for binary clustering” In arXiv preprint arXiv:1706.05528, 2017