Quantum Density Peak Clustering Algorithm

A widely used clustering algorithm, density peak clustering (DPC), assigns different attribute values to data points through the distance between data points, and then determines the number and range of clustering by attribute values. However, DPC is inefficient when dealing with scenes with a large amount of data, and the range of parameters is not easy to determine. To fix these problems, we propose a quantum DPC (QDPC) algorithm based on a quantum DistCalc circuit and a Grover circuit. The time complexity is reduced to O(log(N-2) + 6N + root N), whereas that of the traditional algorithm is O(N-2). The space complexity is also decreased from O(N . inverted right perpendicularlog Ninverted left perpendicular) to O( inverted right perpendicularlog Ninverted left perpendicular).