Next Article in Journal
A Range Resolution Enhancement Algorithm for Active Millimeter Wave Based on Phase Unwrapping Mechanism
Previous Article in Journal
Modeling and Formulation of Optimization Problems for Optimal Scheduling of Multi-Generation and Hybrid Energy Systems: Review and Recommendations
Previous Article in Special Issue
Automated Quantum Hardware Selection for Quantum Workflows
Article

Coreset Clustering on Small Quantum Computers

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
*
Author to whom correspondence should be addressed.
Academic Editor: Jian-Qiang You
Electronics 2021, 10(14), 1690; https://doi.org/10.3390/electronics10141690
Received: 14 June 2021 / Revised: 9 July 2021 / Accepted: 12 July 2021 / Published: 15 July 2021
(This article belongs to the Special Issue Quantum Computing System Design and Architecture)
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. View Full-Text
Keywords: quantum computing; machine learning; QAOA quantum computing; machine learning; QAOA
Show Figures

Figure 1

MDPI and ACS Style

Tomesh, T.; Gokhale, P.; Anschuetz, E.R.; Chong, F.T. Coreset Clustering on Small Quantum Computers. Electronics 2021, 10, 1690. https://doi.org/10.3390/electronics10141690

AMA Style

Tomesh T, Gokhale P, Anschuetz ER, Chong FT. Coreset Clustering on Small Quantum Computers. Electronics. 2021; 10(14):1690. https://doi.org/10.3390/electronics10141690

Chicago/Turabian Style

Tomesh, Teague, Pranav Gokhale, Eric R. Anschuetz, and Frederic T. Chong 2021. "Coreset Clustering on Small Quantum Computers" Electronics 10, no. 14: 1690. https://doi.org/10.3390/electronics10141690

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop