On optimal entanglement assisted one-shot classical communication

Abstract

The one-shot success probability of a noisy classical channel for transmitting one classical bit is the optimal probability with which the bit can be sent via a single use of the channel. Prevedel et al. (PRL 106, 110505 (2011)) recently showed that for a specific channel, this quantity can be increased if the parties using the channel share an entangled quantum state. We completely characterize the optimal entanglement-assisted protocols in terms of the radius of a set of operators associated with the channel. This characterization can be used to construct optimal entanglement-assisted protocols from the given classical channel and to prove the limit of such protocols. As an example, we show that the Prevedel et al. protocol is optimal for two-qubit entanglement. We also prove some simple upper bounds on the improvement that can be obtained from quantum and no-signaling correlations.

5 pages, plus 7 pages of supplementary material. v2 is significantly expanded and contains a new result (Theorem 2)

References in corpus (6)

• Zero-error communication via quantum channels, non-commutative graphs and a quantum Lovasz theta function
• Zero-error channel capacity and simulation assisted by non-local correlations
• A linear program for the finite block length converse of Polyanskiy-Poor-Verdú via non-signalling codes
• Entanglement-Enhanced Classical Communication over a Noisy Classical Channel
• Entanglement can increase asymptotic rates of zero-error classical communication over classical channels
• Entanglement-assisted zero-error capacity is upper bounded by the Lovasz theta function

Cited by in corpus (4)

• Quantum Bilinear Optimization
• Contextuality in entanglement-assisted one-shot classical communication
• Algorithmic Aspects of Optimal Channel Coding
• Beating the Classical Limits of Information Transmission using a Quantum Decoder