Improvement of K-means Clustering Algorithm Based on Quantum State Similarity Measurement

Hongfei Zhang; Mingwei Li

doi:10.23977/acss.2025.090202

Improvement of K-means Clustering Algorithm Based on Quantum State Similarity Measurement

Download as PDF

DOI: 10.23977/acss.2025.090202 | Downloads: 10 | Views: 129

Author(s)

Hongfei Zhang ¹, Mingwei Li ¹

Affiliation(s)

¹ Northeastern University at Qinhuangdao, Qinhuangdao, 066004, China

Corresponding Author

Mingwei Li

ABSTRACT

The classical K-means clustering algorithm is widely used in various fields due to its simple implementation and efficient computation, but the classical K-means clustering algorithm relies on the random selection of the initial center of mass, which is prone to fall into the deadlock of local optimality. In order to break through this limitation, the quantum K-means clustering algorithm is introduced, which is able to explore multiple potential clustering center combinations at the same time through the parallelism of quantum computation, so as to have a greater probability of converging to the globally optimal solution. Quantum K-means clustering algorithms typically employ fidelity as a similarity measure between quantum states, and similarity is assessed by calculating the probability of overlap between quantum states. However, the fidelity only quantizes the pure state information of the quantum states and ignores the classical statistical features of the data itself, which may lead to unreasonable clustering boundaries in mixed state or noise interference scenarios. In response to the above problems, this paper proposes an improved quantum-classical hybrid similarity metric, whose core idea is to incorporate the dual constraints of quantum information and classical features.

KEYWORDS

Quantum K-means clustering; Quantum state encoding; Similarity metrics for quantum-classical mixing

CITE THIS PAPER

Hongfei Zhang, Mingwei Li, Improvement of K-means Clustering Algorithm Based on Quantum State Similarity Measurement. Advances in Computer, Signals and Systems (2025) Vol. 9: 10-18. DOI: http://dx.doi.org/10.23977/acss.2025.090202.

REFERENCES

[1] Shor P. Algorithms for quantum computation: discrete logarithms and factoring[J]. In Proceedings of 35th Annual Symposium on the Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1994:124-134.
[2] Grover L K. A fast quantum mechanical algorithm for database search[C]. Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, 1996: 212-219.
[3] Anguita D, Ridella S , Rivieccio F ,et al. Quantum optimization for training support vector machines[J]. Neural Networks, 2003, 16(5-6):763-770.
[4] Ruan Y, Chen H W, Liu Z H, et al. Quantum Principal Component Analysis Algorithm[J]. Chinese Journal of Computers, 2014.
[5] Kerenidis I, Landman J. Quantum spectral clustering[J]. Physical Review A, 2021, 103(4): 042415.
[6] Wiebe N, Kapoor A, Svore K. Quantum Nearest-Neighbor Algorithms for Machine Learning[J]. Quantum Information & Computation, 2014, 15:0318-0358.
[7] Khan S U, Awan A J, Vall-Llosera G. K-Means Clustering on Noisy Intermediate Scale Quantum Computers[J]. arXiv preprint arXiv:1909.12183, 2019.
[8] Arthur D, Date P. Balanced k-means clustering on an adiabatic quantum computer[J]. Quantum Information Processing, 2021, 20(9): 294.
[9] Ohno H. A quantum algorithm of K-means toward practical use[J]. Quantum Information Processing, 2022, 21(4).
[10] DiAdamo S, O’Meara C, Cortiana G, et al. Practical quantum k-means clustering: Performance analysis and applications in energy grid classification[J]. IEEE Transactions on Quantum Engineering, 2022, 3: 1-16.

Subscription

E-Mail Alert

Downloads:	34528
Visits:	575369

Improvement of K-means Clustering Algorithm Based on Quantum State Similarity Measurement

Author(s)

Affiliation(s)

Corresponding Author

ABSTRACT

KEYWORDS

CITE THIS PAPER

REFERENCES

RESOURCES

JOIN US

PUBLICATION SERVICES

CONTACT US