Papers
Topics
Authors
Recent
Search
2000 character limit reached

Hybrid quantum-classical unsupervised data clustering based on the self-organizing feature map

Published 19 Sep 2020 in quant-ph | (2009.09246v3)

Abstract: Unsupervised machine learning is one of the main techniques employed in artificial intelligence. We introduce an algorithm for quantum-assisted unsupervised data clustering using the self-organizing feature map, a type of artificial neural network. The complexity of our algorithm scales as O(LN), in comparison to the classical case which scales as O(LMN), where N is the number of samples, M is the number of randomly sampled cluster vectors, and L is the number of the shifts of cluster vectors. We perform a proof-of-concept demonstration of one of the central components on the IBM quantum computer and show that it allows us to reduce the number of calculations in the number of clusters. Our algorithm exhibits exponential decrease in the errors of the distance matrix with the number of runs of the algorithm.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.