Abstract
We present a dense coding network based on continuous-variable graph state along with its corresponding protocol. A scheme to distill bipartite entanglement between two arbitrary modes in a graph state is provided in order to realize the dense coding network. We also analyze the capacity of network dense coding and provide a method to calculate its maximum mutual information. As an application, we analyze the performance of dense coding in a square lattice graph state network. The result showed that the mutual information of the dense coding is not largely affected by the complexity of the network. We conclude that the performance of dense coding network is very optimistic.
Similar content being viewed by others
References
Bennett, C.H., Wiesner, S.J.: Communication via one-and two-particle operators on Einstein–Podolsky–Rosen states. Phys. Rev. Lett. 69, 2881 (1992)
Braunstein, S.L., Kimble, H.J.: Dense coding for continuous variables. Phys. Rev. A 61, 042302 (2000)
Su, X., Jing, J., Pan, Q., Xie: Dense-coding quantum key distribution based on continuous-variable entanglement. C Phys. Rev. A 74, 062305 (2006)
Hao, J.C., Li, C.F., Guo, G.C.: Controlled dense coding using the Greenberger–Horne–Zeilinger state. Phys. Rev. A 63, 054301 (2001)
Zhang, J., Xie, C., Peng, K.: Controlled dense coding for continuous variables using three-particle entangled states. Phys. Rev. A 66, 032318 (2002)
Lee, H.J., Ahn, D., Hwang, S.W.: Dense coding in entangled states. Phys. Rev. A 66, 024304 (2002)
Mattle, K., Weinfurter, H., Kwiat, P.G., Zeilinger, A.: Dense coding in experimental quantum communication. Phys. Rev. Lett. 76, 4656 (1996)
Li, X., Pan, Q., Jing, J., Zhang, J., Xie, C., Peng, K.: Quantum dense coding exploiting a bright Einstein–Podolsky–Rosen beam. Phys. Rev. Lett. 88, 047904 (2002)
Jing, J., Zhang, J., Yan, Y., Zhao, F., Xie, C., Peng, K.: Experimental demonstration of tripartite entanglement and controlled dense coding for continuous variables. Phys. Rev. Lett. 90, 167903 (2003)
Pereira, S.F., Ou, Z.Y., Kimble, H.J.: Phys. Rev. A 62, 042311 (2000)
Huang, C.Y., Ching, YuI, Lin, F.L., Hsu, L.Y.: Quantum communication with correlated nonclassical states. Phys. Rev. A 79, 052306 (2009)
Ren, L., He, G., Zeng, G.: Universal teleportation via continuous-variable graph states. Phys. Rev. A 78, 042302 (2008)
Qian, Y., Shen, Z., He, G., Zeng, G.: Quantum-cryptography network via continuous-variable graph states. Phys. Rev. A 86, 052333 (2012)
Tan, A., Wang, Y., Jin, X., Su, X., Jia, X., Zhang, J., Xie, C., Peng, K.: Experimental generation of genuine four-partite entangled states with total three-party correlation for continuous variables. Phys. Rev. A 78, 013828 (2008)
Su, X., Tan, A., Jia, X., Zhang, J., Xie, C., Peng, K.: Experimental preparation of quadripartite cluster and Greenberger–Horne–Zeilinger entangled states for continuous variables. Phys. Rev. Lett. 98, 070502 (2007)
Hein, M., Eisert, J., Briegel, H.J.: Multiparty entanglement in graph states. Phys. Rev. A 69, 062311 (2004)
Menicucci, N.C., Loock, P.V., Gu, M., Weedbrook, C., Ralph, T.C., Nielsen, M.A.: Universal quantum computation with continuous-variable cluster states. Phys. Rev. Lett. 97, 110501 (2006)
Zhang, J., Braunstein, S.L.: Continuous-variable Gaussian analog of cluster states. Phys. Rev. A 73, 032318 (2006)
Einstein, A., Podolsky, B., Rosen, N.: Can quantum-mechanical description of physical reality be considered complete? Phys. Rev. 47, 777 (1935)
Acknowledgments
We thank Jun Zhang, Yujin Qian and Yadong Wu for helpful discussions. This work was supported by the National Natural Science Foundation of China (Grants No. 61102053), the Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry, SMC Excellent Young Faculty program (2011) and and SJTU PRP (Grants No. T03013002).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhang, J., He, G. Quantum network dense coding via continuous-variable graph states. Quantum Inf Process 13, 2437–2450 (2014). https://doi.org/10.1007/s11128-014-0793-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11128-014-0793-z