A hybrid classical-quantum clustering algorithm based on quantum walks

Authors:
Qiang Li;Yan He;Jing-Ping Jiang
Affiliations:
College of Electrical Engineering, Zhejiang University, Hang Zhou, China 310027 and College of Electrical Engineering, Chongqing University, Chong Qing, China 400044;College of Electrical Engineering, Zhejiang University, Hang Zhou, China 310027;College of Electrical Engineering, Zhejiang University, Hang Zhou, China 310027
Venue:
Quantum Information Processing
Year:
2011

Citing 10
Cited 1

One-dimensional quantum walks

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quantum walks on graphs

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quantum computation and quantum information

Quantum computation and quantum information
Quantum Counting

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Quantum Pattern Recognition

Quantum Information Processing
Exponential algorithmic speedup by a quantum walk

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Language model-based document clustering using random walks

HLT-NAACL '06 Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics
Quantum clustering algorithms

Proceedings of the 24th international conference on Machine learning
Adaptive dimension reduction using discriminant analysis and K-means clustering

Proceedings of the 24th international conference on Machine learning
Algorithms for quantum computation: discrete logarithms and factoring

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science

Quantum speed-up for unsupervised learning

Machine Learning

Quantified Score

Hi-index	0.00

Visualization

Abstract

The enormous successes have been made by quantum algorithms during the last decade. In this paper, we combine the quantum walk (QW) with the problem of data clustering, and develop two clustering algorithms based on the one-dimensional discrete-time QW. Then, the position probability distributions induced by QW in these algorithms are investigated, which also indicates the possibility of obtaining better results. Consequently, the experimental results have demonstrated that data points in datasets are clustered reasonably and efficiently, and the clustering algorithms have fast rates of convergence. Moreover, the comparison with other algorithms also provides an indication of the effectiveness of the proposed approach.