Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Physical Review A

Boundary effect of deterministic dense coding (3 pages)

Mengyun Ying, Ran Duan, Yongxiang Feng, Zhiqiang Ji

Published Jan 1, 2006• 0 citations
OpenAlex

Related papers

Deterministic and unambiguous dense coding (12 pages)

Sheldon Cohen, Shilin Wu

Physical Review A•Jan 1, 2006•0 citations

Deterministic dense coding with partially entangled states (7 pages)

Jonathan Oppenheim, Shay Mozes

Physical Review A•Jan 1, 2005•1 citation

Deterministic quantum dense coding networks

Saptarshi Roy, Titas Chanda, Tamoghna Das +2 more

arXiv:1707.02449•Physics Letters A•Apr 21, 2018•15 citations

Optimal dense coding with arbitrary pure entangled states (5 pages)

Rui Duan, Yuan Feng

Physical Review A•Jan 1, 2006•0 citations

Treatment of non-Markovian effects to investigate non-locality, dense coding and non-local information

Y. Aiache, C. Seida, K. El Anouz +1 more

Physics Letters A•Jan 18, 2024•6 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 ddd-level partial entanglement.