Limitations of Clustering Using Quantum Persistent Homology
Quantum Physics
2019-11-26 v1 General Topology
Abstract
Different algorithms can be used for clustering purposes with data sets. On of these algorithms, uses topological features extracted from the data set to base the clusters on. The complexity of this algorithm is however exponential in the number of data points. Recently a quantum algorithm was proposed by Lloyd Garnerone and Zanardi with claimed polynomial complexity, hence an exponential improved over classical algorithms. However, we show that this algorithm in general cannot be used to compute these topological features in any dimension but the zeroth. We also give pointers on how to still use the algorithm for clustering purposes.
Cite
@article{arxiv.1911.10781,
title = {Limitations of Clustering Using Quantum Persistent Homology},
author = {Niels Neumann and Sterre den Breeijen},
journal= {arXiv preprint arXiv:1911.10781},
year = {2019}
}
Comments
Submitted as Matters Arising at Nature Communications