Not So SuperDense Coding - Deterministic Dense Coding with Partially Entangled States

Abstract

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 non-maximally entangled states, and numerically obtain schemes in the general case. We study the dependency of the information capacity 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 show that the alphabet size grows in "steps" with the possible values $d,d+1,...,d^2-2$. We also find that states with less entanglement can have greater communication capacity than other more entangled states.

6 pages, 2 figures, submitted to Phys. Rev. A

References in corpus (11)

• Conditions for a class of entanglement transformations
• A Multiparticle Generalization of Entanglement Swapping
• Dense Coding for Continuous Variables
• Statistical distinguishability between unitary operations
• All Teleportation and Dense Coding Schemes
• Local indistinguishability: more nonlocality with less entanglement
• Local indistinguishability and LOCC monotones
• Quantum information and precision measurement
• Deterministic entanglement concentration
• Faithful Teleportation with Partially Entangled States
• A probabilistic and information theoretic interpretation of quantum evolutions

Cited by in corpus (33)

• Quantum entanglement
• The states of W-class as shared resources for perfect teleportation and superdense coding
• Witnessing entanglement sequentially: Maximally entangled states are not special
• Local Distinguishability of Multipartite Unitary Operations
• Deterministic and Unambiguous Dense Coding
• Additive Classical Capacity of Quantum Channels Assisted by Noisy Entanglement
• Simultaneous Dense Coding
• Entanglement in prepare-and-measure scenarios: many questions, a few answers
• Deterministic dense coding and entanglement entropy
• Optimal dense coding with arbitrary pure entangled states
• Boundary effect of deterministic dense coding
• Deterministic Quantum Dense Coding Networks
• Evolution of the superposition of displaced number states with the two-atom multiphoton Jaynes-Cummings model: interference and entanglement
• One-shot conclusive multiport quantum dense coding capacities
• Non-optimality of unitary operations for dense coding
• Optimal probabilistic dense coding schemes
• Secure $N$-dimensional Simultaneous Dense Coding and Applications
• Minimal control power of controlled dense coding and genuine tripartite entanglement
• Deterministic distributed dense coding with stabilizer states
• Phase boundaries in deterministic dense coding
• Marginal and density atomic Wehrl entropies for the Jaynes-Cummings model
• Overcoming a limitation of deterministic dense coding with a non-maximally entangled initial state
• More Communication with Less Entanglement
• The augmented message-matrix approach to deterministic dense coding theory
• Manipulating quantum states with aspheric lenses
• Entanglement in the bimodal Jaynes-Cummings model with the two-mode squeezed vacuum state
• The necessary and sufficient condition for perfect teleportation and superdense coding and all the suitable states for teleportation and superdense coding
• Minimal-error quantum state discrimination versus robustness of entanglement:More indistinguishability with less entanglement
• Design and Analysis of Communication Protocols using Quantum Resources
• Ancilla-Assisted Discrimination of Quantum Gates
• Secure communication over generalised quantum multiple access channels
• Unbounded entanglement-sustaining sequential local quantum state discrimination
• Entanglement-invertible channels