International Journal of Theoretical Physics

, Volume 57, Issue 5, pp 1344–1355 | Cite as

Random Walk Quantum Clustering Algorithm Based on Space

  • Shufen Xiao
  • Yumin Dong
  • Hongyang Ma


In the random quantum walk, which is a quantum simulation of the classical walk, data points interacted when selecting the appropriate walk strategy by taking advantage of quantum-entanglement features; thus, the results obtained when the quantum walk is used are different from those when the classical walk is adopted. A new quantum walk clustering algorithm based on space is proposed by applying the quantum walk to clustering analysis. In this algorithm, data points are viewed as walking participants, and similar data points are clustered using the walk function in the pay-off matrix according to a certain rule. The walk process is simplified by implementing a space-combining rule. The proposed algorithm is validated by a simulation test and is proved superior to existing clustering algorithms, namely, Kmeans, PCA + Kmeans, and LDA-Km. The effects of some of the parameters in the proposed algorithm on its performance are also analyzed and discussed. Specific suggestions are provided.


Space Quantum walk Coherence Quantum entanglement Clustering 



This work is supported by the National Natural Science Foundation of China (61772295,61572270 and 11547035).


  1. 1.
    Aharonov, Y., Davidovich, L., Zagury, N.: Quantum random walks. Phys. Rev. A 48(2), 1687–1690 (1993)ADSCrossRefGoogle Scholar
  2. 2.
    Hua, T., Chen, J., Pei, D., Zhang, W., Zhou, N.: Quantum image encryption algorithm based on image correlation decomposition. Int. J. Theor. Phys. 54(2), 526–537 (2015)CrossRefzbMATHGoogle Scholar
  3. 3.
    Liang, H., Tao, X., Zhou, N.: Quantum image encryption based on generalized affine transform and logistic map. Quantum Inf. Process.
  4. 4.
    Zhou, N., Hua, T., Gong, L., Pei, D., Liao, Q.: Quantum image encryption based on generalized Arnold transform and double random phase encoding. Quantum Inf. Process. 14(4), 1193–1213 (2015)ADSMathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Gong, L., Song, H., He, C., Liu, Y., Zhou, N.: A continuous variable quantum deterministic key distribution based on two-mode squeezed states. Phys. Scr. 89(3), 035101 (2014)ADSCrossRefGoogle Scholar
  6. 6.
    Al-Baity, H., Meshoul, S., Kaban, A., Al Safadi, L.: Quantum behaved particle swarm optimization for data clustering with multiple objectives. In: 6th International Conference on Soft Computing and Pattern Recognition. SoCPaR, pp. 215–220 (2014)Google Scholar
  7. 7.
    Patel, O.P., Bharill, N., Tiwari, A.: A quantum-inspired fuzzy based evolutionary algorithm for data clustering. In: IEEE international conference on fuzzy systems (2015).
  8. 8.
    Leelavathi, A., et al.: Supported quantum clusters of silver as enhanced catalysts for reduction. Nanoscale Res. Lett. 6, 123 (2011)ADSCrossRefGoogle Scholar
  9. 9.
    Goswami, S., Sen, P.: Quantum random walk: effect of quenching. Phys. Rev. A: At. Mol. Opt. Phys. 86(2) (2012).
  10. 10.
    Patel, A., Rahaman, M.A.: Search on a hypercubic lattice using a quantum random walk. Phys. Rev. A: At. Mol. Opt. Phys. 82(3) (2010).
  11. 11.
    Childs, A.M.: On the relationship between continuous- and discrete-time quantum walk. Commun. Math. Phys. 294(2), 581–603 (2010)ADSMathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Portugal, R.: Quantum Walks and Search Algorithms. Springer, Berlin (2013)CrossRefzbMATHGoogle Scholar
  13. 13.
    Manouchehri, K., Wang, J.: Physical Implementation of Quantum Walks. Springer, Berlin (2014)CrossRefzbMATHGoogle Scholar
  14. 14.
    Potoček, V., Gábris, A., Kiss, T.: Optimized quantum random-walk search algorithms on the hypercube. Phys. Rev. A (2009).
  15. 15.
    Schreiber, A., Cassemiro, K.N., Potoček, V.: Photons walking the line: a quantum walk with adjustable coin operations. Phys. Rev. Lett. (2010).
  16. 16.
    Santha, M.: Quantum walk based search algorithms. TAMC 2008. LNCS 4978, 31–46Google Scholar
  17. 17.
    Zähringer, F., Kirchmair, G., Gerritsma, R.: Realization of a quantum walk with one and two trapped ions. Phys. Rev. Lett. (2010).
  18. 18.
    Sansoni, L., Sciarrino, F., Vallone, G.: Two-particle bosonic-fermionic quantum walk via integrated photonics. Phys. Rev. Lett. (2012).
  19. 19.
    Caruso, F.: QSTAR. Universally optimal noisy quantum walks on complex networks. New J. Phys. 16, 055015 (2014). ADSCrossRefGoogle Scholar
  20. 20.
    Li, M.: The basic properties and applications of quantum random walks. University of Science and Technology of China A dissertation for doctor’s degree (in Chinese) (2013)Google Scholar
  21. 21.
    Qiang, L.: Research on a clustering algorithm and its quantization. Doctoral Dissertation of Zhejiang University (in Chinese) (2009)Google Scholar
  22. 22.
    Huang, D.-C., Tang, S.-L.: Clustering algorithm based on quantum game and grid. Comput. Sci. (in Chinese) 41(10), 261–265 (2014)MathSciNetGoogle Scholar
  23. 23.
    Qian, G.-H., Huang, D.-C., Lu, Y.-H.: General weighted Minkowski distance and quantum genetic clustering algorithm. Comput. Sci. (in Chinese) 40(5), 224–228 (2013)Google Scholar
  24. 24.
    Ding, C., Li, T.: Adaptive dimension reduction using discriminant analysis and k-means clustering. In: Proceedings of the 24th International Conference on Machine Learning, vol. 52, pp. 1–528. Corvallis (2007)Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.College of Automobile and TransportationQingdao University of TechnologyQingdaoChina
  2. 2.Network CenterQingdao University of TechnologyQingdaoChina
  3. 3.College of ScienceQingdao University of TechnologyQingdaoChina

Personalised recommendations