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.
Quantum Information Processing – Springer Journals
Published: Aug 8, 2014
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud