Optimal dense coding with arbitrary pure entangled states
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.