© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

arXiv:1707.02449 · Physics Letters A

Deterministic quantum dense coding networks

Saptarshi Roy, Titas Chanda, Tamoghna Das, Aditi Sen, Ujjwal Sen

Published Apr 21, 2018• 15 citations

DOI: 10.1016/j.physleta.2018.04.033

Related papers

Deterministic quantum dense coding with cluster state in optical systems

Qing-Min Song, Bao‐Long Fang, Ye Liu

Optics Communications•Aug 31, 2010•6 citations

Complete multiple round quantum dense coding with quantum logical network

Chunyan Li, Xihan Li, Fu‐Guo Deng +2 more

Chinese Science Bulletin•May 1, 2007•17 citations

Dense coding using cluster states and its application on deterministic secure quantum communication

Chia‐Wei Tsai, C. R. Hsieh, Tzonelih Hwang

The European Physical Journal D•Feb 1, 2011•66 citations

Quantum network dense coding via continuous-variable graph states

Jiahao Zhang, Guangqiang He

Quantum Information Processing•Aug 7, 2014•5 citations

Opportunistic Quantum Network Coding

Tao Shang, Jianwei Liu

Springer eBooks•Jan 1, 2020•0 citations

Boundary effect of deterministic dense coding

Zhengfeng Ji, Yuan Feng, Runyao Duan +1 more

We present a rigorous proof of an interesting boundary effect of deterministic dense coding first observed by S. Mozes, J. Oppenheim, and B. Reznik [Phys. Rev. A 71, 012311 (2005)]. Namely, it is shown that ${d}^{2}\ensuremath{-}1$ cannot be the maximal alphabet size of any isometric deterministic dense coding schemes utilizing $d$-level partial entanglement.

arXiv:quant-ph/0601136•Physical Review A•Mar 20, 2006•17 citations

We present a rigorous proof of an interesting boundary effect of deterministic dense coding first observed by S. Mozes, J. Oppenheim, and B. Reznik [Phys. Rev. A 71, 012311 (2005)]. Namely, it is shown that ${d}^{2}\ensuremath{-}1$ cannot be the maximal alphabet size of any isometric deterministic dense coding schemes utilizing

d

-level partial entanglement.