Physics – Quantum Physics
Scientific paper
2005-12-20
Phys. Rev. A 73, 042311 (2006)
Physics
Quantum Physics
Short new section VII added. Latex 23 pages, 1 PSTricks figure in text
Scientific paper
10.1103/PhysRevA.73.042311
Optimal dense coding using a partially-entangled pure state of Schmidt rank $\bar D$ and a noiseless quantum channel of dimension $D$ is studied both in the deterministic case where at most $L_d$ messages can be transmitted with perfect fidelity, and in the unambiguous case where when the protocol succeeds (probability $\tau_x$) Bob knows for sure that Alice sent message $x$, and when it fails (probability $1-\tau_x$) he knows it has failed. Alice is allowed any single-shot (one use) encoding procedure, and Bob any single-shot measurement. For $\bar D\leq D$ a bound is obtained for $L_d$ in terms of the largest Schmidt coefficient of the entangled state, and is compared with published results by Mozes et al. For $\bar D > D$ it is shown that $L_d$ is strictly less than $D^2$ unless $\bar D$ is an integer multiple of $D$, in which case uniform (maximal) entanglement is not needed to achieve the optimal protocol. The unambiguous case is studied for $\bar D \leq D$, assuming $\tau_x>0$ for a set of $\bar D D$ messages, and a bound is obtained for the average $\lgl1/\tau\rgl$. A bound on the average $\lgl\tau\rgl$ requires an additional assumption of encoding by isometries (unitaries when $\bar D=D$) that are orthogonal for different messages. Both bounds are saturated when $\tau_x$ is a constant independent of $x$, by a protocol based on one-shot entanglement concentration. For $\bar D > D$ it is shown that (at least) $D^2$ messages can be sent unambiguously. Whether unitary (isometric) encoding suffices for optimal protocols remains a major unanswered question, both for our work and for previous studies of dense coding using partially-entangled states, including noisy (mixed) states.
Cohen Scott M.
Griffiths Robert B.
Sun Yuqing
Wu Shengjun
No associations
LandOfFree
Deterministic and Unambiguous Dense Coding does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Deterministic and Unambiguous Dense Coding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Deterministic and Unambiguous Dense Coding will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-662549