Deterministic dense coding with partially entangled states
Shay Mozes, Jonathan Oppenheim, Benni Reznik · Physical Review A · 2005
The utilization of a $d$-level partially entangled state, shared by two parties wishing to communicate classical information without errors over a noiseless quantum channel, is discussed. We analytically construct deterministic dense coding schemes for certain classes of nonmaximally entangled states, and numerically obtain schemes in the general case. We study the dependency of the maximal alphabet size of such schemes on the partially entangled state shared by the two parties. Surprisingly, for $d>2$ it is possible to have deterministic dense coding with less than one ebit. In this case the number of alphabet letters that can be communicated by a single particle is between $d$ and $2d$. In general, we numerically find that the maximal alphabet size is any integer in the range $[d,{d}^{2}]$ with the possible exception of ${d}^{2}\ensuremath{-}1$. We also find that states with less entanglement can have a greater deterministic communication capacity than other more entangled states.