.png){kind=icon}
.png){kind=icon}
Return
Quantum speed-up for unsupervised learning
.png){kind=icon}
OA
AI
DOI：10.1007/s10994-012-5316-5.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We show how the quantum paradigm can be used to speed up unsupervised learning algorithms. More precisely, we explain how it is possible to accelerate learning algorithms by quantizing some of their subroutines. Quantization refers to the process that partially or totally converts a classical algorithm to its quantum counterpart in order to improve performance. In particular, we give quantized versions of clustering via minimum spanning tree, divisive clustering and k-medians that are faster than their classical analogues. We also describe a distributed version of k-medians that allows the participants to save on the global communication cost of the protocol compared to the classical version. Finally, we design quantum algorithms for the construction of a neighbourhood graph, outlier detection as well as smart initialization of the cluster centres.
Keywords:
Unsupervised learning
Clustering
Quantum learning
Quantum information processing
Grover's algorithm
Journal
IF:
2.9
Papers:
2.6K
Citations:
3.4W