This is not the latest version of this item. The latest version can be found here.
Coreset Clustering on Small Quantum Computers
Name
electronics-10-01690.pdf
Size
2.18 MB
Format
Adobe PDF
Checksum (MD5)
44efc84fc67d0103136f509042cd22c8
Author(s)
Tomesh, Teague
Gokhale, Pranav
Anschuetz, Eric R.
Chong, Frederic T.
Date Issued
July 15, 2021
Publisher
Multidisciplinary Digital Publishing Institute
Citation
Electronics 10 (14): 1690 (2021)
Version
Final published version
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.
Terms of Use
Creative Commons Attribution
Persistent DSpace Link
DOI of Published Version
http://dx.doi.org/10.3390/electronics10141690
