Boundary effect of deterministic dense coding

Abstract

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

3 pages, RevTeX, no figure. Comments, criticisms and suggestions are welcome

References in corpus (7)

• General Scheme for Super Dense Coding between Multi-Parties
• Dense Coding for Continuous Variables
• Distributed quantum dense coding
• Optimal dense coding with mixed state entanglement
• Probabilistic Super Dense Coding
• Not So SuperDense Coding - Deterministic Dense Coding with Partially Entangled States
• Deterministic and Unambiguous Dense Coding

Cited by in corpus (15)

• Pairing in a three component Fermi gas
• Fermion pairing with spin-density imbalance in an optical lattice
• Additive Classical Capacity of Quantum Channels Assisted by Noisy Entanglement
• Ultracold polarized Fermi gas at intermediate temperatures
• Deterministic dense coding and entanglement entropy
• Optimal dense coding with arbitrary pure entangled states
• Deterministic Quantum Dense Coding Networks
• One-shot conclusive multiport quantum dense coding capacities
• Non-optimality of unitary operations for dense coding
• Optimal probabilistic dense coding schemes
• Deterministic distributed dense coding with stabilizer states
• Phase boundaries in deterministic dense coding
• Superiority in dense coding through non-Markovian stochasticity
• Overcoming a limitation of deterministic dense coding with a non-maximally entangled initial state
• The augmented message-matrix approach to deterministic dense coding theory