Role of complementarity in superdense coding
arXiv:1308.1511 · doi:10.1103/PhysRevA.88.062317
Abstract
The complementarity of two observables is often captured in uncertainty relations, which quantify an inevitable tradeoff in knowledge. Here we study complementarity in the context of an information processing task: we link the complementarity of two observables to their usefulness for superdense coding (SDC). In SDC, Alice sends two classical dits of information to Bob by sending a single qudit. However, we show that encoding with commuting unitaries prevents Alice from sending more than one dit per qudit, implying that complementarity is necessary for SDC to be advantagous over a classical strategy for information transmission. When Alice encodes with products of Pauli operators for the and bases, we quantify the complementarity of these encodings in terms of the overlap of the and basis elements. Our main result explicitly solves for the SDC capacity as a function of the complementarity, showing that the entropy of the overlap matrix gives the capacity, when the preshared state is maximally entangled. We generalise this equation to resources with symmetric noise such as a preshared Werner state. In the most general case of arbitrary noisy resources, we obtain an analogous lower bound on the SDC capacity. Our results shed light on the role of complementarity in determining the quantum advantage in SDC and also seem fundamentally interesting since they bear a striking resemblance to uncertainty relations.
arXiv comment12 pages, 2 figures, title changed, close to published version
References in corpus (22)
- Quantum entanglement
- Quantum Cryptography
- Decoherence, einselection, and the quantum origins of the classical
- The Security of Practical Quantum Key Distribution
- The classical-quantum boundary for correlations: discord and related measures
- Quantum Computing
- The Uncertainty Principle in the Presence of Quantum Memory
- Tight Finite-Key Analysis for Quantum Cryptography
- The Uncertainty Relation for Smooth Entropies
- Entropic uncertainty relations - A survey
- One-Shot Classical-Quantum Capacity and Hypothesis Testing
- Conjectured Strong Complementary Information Tradeoff
- Uncertainty relations from simple entropic properties
- Distributed quantum dense coding
- Optimal dense coding with mixed state entanglement
- Classical data compression with quantum side information
- Classical information capacity of superdense coding
- Optimal super dense coding over noisy quantum channels
- On quantum advantage in dense coding
- A Quantitative Measure of Interference
- Distributed super dense coding over noisy channels
- A review on super dense coding over covariant noisy channels