Optimal dense coding with arbitrary pure entangled states
arXiv:quant-ph/0604149 · doi:10.1103/PhysRevA.74.012310
Abstract
We examine dense coding with an arbitrary pure entangled state sharing between the sender and the receiver. Upper bounds on the average success probability in approximate dense coding and on the probability of conclusive results in unambiguous dense coding are derived. We also construct the optimal protocol which saturates the upper bound in each case.
5 pages, journal version
References in corpus (10)
- General Scheme for Super Dense Coding between Multi-Parties
- Dense Coding for Continuous Variables
- Entanglement of pure states for a single copy
- Distributed quantum dense coding
- Probabilistic Super Dense Coding
- Optimal conclusive teleportation of quantum states
- Optimal quantum teleportation with an arbitrary pure state
- Not So SuperDense Coding - Deterministic Dense Coding with Partially Entangled States
- Deterministic and Unambiguous Dense Coding
- Boundary effect of deterministic dense coding
Cited by in corpus (6)
- Perfect Teleportation and Superdense Coding With W-States
- Efficient quantum repeater in perspectives of both entanglement concentration rate and LOCC complexity
- One-shot conclusive multiport quantum dense coding capacities
- Deterministic distributed dense coding with stabilizer states
- Superiority in dense coding through non-Markovian stochasticity
- Entanglement-invertible channels