Quantum network dense coding via continuous-variable graph states.

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. [ABSTRACT FROM AUTHOR]