Quantum Information Processing

, Volume 15, Issue 9, pp 3619–3635 | Cite as

Localization of two-particle quantum walk on glued-tree and its application in generating Bell states



Studies on two-particle quantum walks show that the spatial interaction between walkers will dynamically generate complex entanglement. However, those entanglement states are usually on a large state space and their evolutions are complex. It makes the entanglement states generated by quantum walk difficult to be applied directly in many applications of quantum information, such as quantum teleportation and quantum cryptography. In this paper, we firstly analyse a localization phenomena of two-particle quantum walk and then introduce how to use it to generate a Bell state. We will show that one special superposition component of the walkers’ state is localized on the root vertex if a certain interaction exists between walkers. This localization is interesting because it is contrary to our knowledge that quantum walk spreads faster than its classical counterpart. More interestingly, the localized component is a Bell state in the coin space of two walkers. By this method, we can obtain a Bell state easily from the quantum walk with spatial interaction by a local measurement, which is required in many applications. Through simulations, we verify that this method is able to generate the Bell state \(\frac{1}{\sqrt{2}}(|A \rangle _1|A\rangle _2 \pm |B\rangle _1|B\rangle _2)\) in the coin space of two walkers with fidelity greater than \(99.99999\,\%\) in theory, and we have at least a \(50\,\%\) probability to obtain the expected Bell state after a proper local measurement.


Quantum walk Quantum entanglement Bell state 



This work was supported by the National Natural Science Foundation of China (NSFC) No. 61402506 and the Open Fund from HPCL No. 20150101.


  1. 1.
    Aharonov, Y., Davidovich, L., Zagury, N.: Quantum random walks. Phys. Rev. A 48(2), 1687–1690 (1993)ADSCrossRefGoogle Scholar
  2. 2.
    Portugal, Renato: Quantum Walks Search Algorithms. Springer, New York (2013)CrossRefMATHGoogle Scholar
  3. 3.
    Ambainis, A.: Quantum walk algorithm for element distinctness. In: Foundations of Computer Science. Proceedings. 45th Annual IEEE Symposium on, pp. 22–31 (2004)Google Scholar
  4. 4.
    Wang, H., Wu, J., Yang, X., Yi, X.: A graph isomorphism algorithm using signatures computed via quantum walk search model. J. Phys. A Math. Theor. 48(11) (2015)Google Scholar
  5. 5.
    Junjie, W., Zhang, B., Tang, Y., Qiang, X., Wang, Huiquan: Finding symmetries of trees using continuous-time quantum walk. Chin. Phys. B 22(5), 50304 (2013)CrossRefGoogle Scholar
  6. 6.
    Ambainis, A., Bach, E., Nayak, A., Vishwanath, A., Watrous, J.: One-dimensional quantum walks. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 37–49 (2001)Google Scholar
  7. 7.
    Lovett, N.B.: Application of Quantum Walks on Graph Structures to Quantum Computing. University of Leeds, Leeds (2011)Google Scholar
  8. 8.
    Zhang, R., YunQiu, X., Xue, P.: Disordered quantum walks in two-dimensional lattices. Chin. Phys. B 24(1), 10303 (2015)ADSCrossRefGoogle Scholar
  9. 9.
    Li, D., Zhang, W., Kejia, Z.: One-dimensional lazy quantum walks and occupancy rate. Chin. Phys. B 05(5), 223–230 (2015)Google Scholar
  10. 10.
    Rohde, P.P., Schreiber, A., Stefanak, M., Jex, I., Gilchrist, A., Silberhorn, C.: Increasing the dimensionality of quantum walks using multiple walkers. J. Comput. Theor. Nanosci. 10(7), 1644–1652(9) (2013)CrossRefGoogle Scholar
  11. 11.
    Childs, A.M., Webb, Z.: Universal computation by multiparticle quantum walk. Science 339(6121), 791–794 (2013)ADSMathSciNetCrossRefGoogle Scholar
  12. 12.
    Linda, S., Fabio, S., Giuseppe, V., Paolo, M., Andrea, C., Roberta, R., Roberto, O.: Two-particle bosonic-fermionic quantum walk via integrated photonics. Phys. Rev. Lett. 108(1), 140–144 (2012)Google Scholar
  13. 13.
    Rohde, P.P., Schreiber, A., Stefanak, M., Jex, I., Silberhorn, C.: Multi-walker discrete time quantum walks on arbitrary graphs, their properties and their photonic implementation. New J. Phys. 13(1), 1–15 (2011)CrossRefGoogle Scholar
  14. 14.
    Berry, S.D., Wang, J.B.: Two-particle quantum walks: entanglement and graph isomorphism testing. Phys. Rev. A 83(4), 786–792 (2011)CrossRefGoogle Scholar
  15. 15.
    Carson, G.R., Loke, T., Wang, J.B.: Entanglement dynamics of two-particle quantum walks. Quan. Inf. Process. 14(9), 3193–3210 (2015)ADSMathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    Allés, B., Gündüç, S., Gündüç, Y.: Maximal entanglement from quantum random walks. Quan. Inf. Process. 11(1), 211–227 (2010)MathSciNetCrossRefMATHGoogle Scholar
  17. 17.
    Li, D., Zhang, J., Guo, F.Z., Huang, W., Wen, Q.Y., Chen, H.: Discrete-time interacting quantum walks and quantum hash schemes. Quan. Inf. Process. 12(3), 1501–1513 (2013)ADSMathSciNetCrossRefMATHGoogle Scholar
  18. 18.
    Ltkenhaus, N., Calsamiglia, J., Suominen, K.A.: On bell measurements for teleportation. Phys. Rev. A 59(5), 3295–3300 (1998)ADSMathSciNetCrossRefGoogle Scholar
  19. 19.
    Albeverio, S., Fei, S.M., Yang, W.L.: Optimal teleportation based on bell measurement. Phys. Rev. A 66(1), 144 (2002)MathSciNetCrossRefGoogle Scholar
  20. 20.
    Ekert, A.K.: Quantum cryptography based on bells theorem. Phys. Rev. Lett. 67(6), 661–663 (1991)ADSMathSciNetCrossRefMATHGoogle Scholar
  21. 21.
    Childs, A. M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., Spielman, D. A.: Exponential algorithmic speedup by quantum walk. In: Proceedings of the 35th ACM Annual Symposium Theory of Computing, pp. 59–68 (2002)Google Scholar
  22. 22.
    Ambainis, A.: Quantum walks and their algorithmic applications. Int. J. Quan. Inf. 1(4), 507–518 (2004)CrossRefMATHGoogle Scholar
  23. 23.
    Kempe, J.: Quantum random walks: an introductory overview. Contemp. Phys. 44(1), 417–418 (2009)Google Scholar
  24. 24.
    Li, Z.J., Wang, J.B.: An analytical study of quantum walk through glued-tree graphs. J. Phys. A Math. Theor. 48, 355301 (2015)ADSMathSciNetCrossRefMATHGoogle Scholar
  25. 25.
    Konno, N.: Localization of an inhomogeneous discrete-time quantum walk on the line. Quan. Inf. Process. 9(3), 405–418 (2009)MathSciNetCrossRefMATHGoogle Scholar
  26. 26.
    Shikano, Y., Katsura, H.: Localization and fractality in inhomogeneous quantum walks with self-duality. Phys. Rev. E 82, 031122 (2010)ADSMathSciNetCrossRefGoogle Scholar
  27. 27.
    Inui, N., Konno, N., Segawa, E.: One-dimensional three-state quantum walk. Phys. Rev. E 72(5), 168–191 (2005)CrossRefGoogle Scholar
  28. 28.
    Inui, N., Konno, N.: Localization of multi-state quantum walk in one dimension. Phys. A 353, 133–144 (2005). 2009CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  • Huiquan Wang
    • 1
    • 2
  • Junjie Wu
    • 1
    • 2
  • Hongjuan He
    • 1
    • 2
  • Yuhua Tang
    • 1
    • 2
  1. 1.State Key Laboratory of High Performance ComputingNational University of Defense TechnologyChangshaChina
  2. 2.College of ComputerNational University of Defense TechnologyChangshaChina

Personalised recommendations