Skip to Content
You are currently on the new version of our website. Access the old version .
ElectronicsElectronics
  • Article
  • Open Access

15 July 2021

13 Pages

Coreset Clustering on Small Quantum Computers

,
,
and
1
Department of Computer Science, Princeton University, Princeton, NJ 08540, USA
2
Super.tech, Chicago, IL 60615, USA
3
MIT Center for Theoretical Physics, Massachusetts Institute of Technology, Cambridge, MA 02139, USA
4
Department of Computer Science, University of Chicago, Chicago, IL 60637, USA

Abstract

Many quantum algorithms for machine learning require access to classical data in superposition. However, for many natural data sets and algorithms, the overhead required to load the data set in superposition can erase any potential quantum speedup over classical algorithms. Recent work by Harrow introduces a new paradigm in hybrid quantum-classical computing to address this issue, relying on coresets to minimize the data loading overhead of quantum algorithms. We investigated using this paradigm to perform k-means clustering on near-term quantum computers, by casting it as a QAOA optimization instance over a small coreset. We used numerical simulations to compare the performance of this approach to classical k-means clustering. We were able to find data sets with which coresets work well relative to random sampling and where QAOA could potentially outperform standard k-means on a coreset. However, finding data sets where both coresets and QAOA work well—which is necessary for a quantum advantage over k-means on the entire data set—appears to be challenging.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.