Hybrid quantum-classical unsupervised data clustering based on the self-organizing feature map
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2020
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866916559908241408 |
|---|---|
| author | Lazarev, Ilia D. Narozniak, Marek Byrnes, Tim Pyrkov, Alexey N. |
| author_facet | Lazarev, Ilia D. Narozniak, Marek Byrnes, Tim Pyrkov, Alexey N. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2009_09246 |
| institution | arXiv |
| publishDate | 2020 |
| record_format | arxiv |
| spellingShingle | Hybrid quantum-classical unsupervised data clustering based on the self-organizing feature map Lazarev, Ilia D. Narozniak, Marek Byrnes, Tim Pyrkov, Alexey N. Quantum Physics 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. |
| title | Hybrid quantum-classical unsupervised data clustering based on the self-organizing feature map |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2009.09246 |