Quantum Wiretap Channel Coding Assisted by Noisy Correlation

Abstract

We consider the private classical capacity of a quantum wiretap channel, where the users (sender Alice, receiver Bob, and eavesdropper Eve) have access to the resource of a shared quantum state, additionally to their channel inputs and outputs. An extreme case is maximal entanglement or a secret key between Alice and Bob, both of which would allow for onetime padding the message. But here both the wiretap channel and the shared state are general. In the other extreme case that the state is trivial, we recover the wiretap channel and its private capacity [N. Cai, A. Winter and R. W. Yeung, Probl. Inform. Transm. 40(4):318-336, 2004]. We show how to use the given resource state to build a code for secret classical communication. Our main result is a lower bound on the assisted private capacity, which asymptotically meets the multi-letter converse and which encompasses all sorts of previous results as special cases.

References in corpus (15)

• Entanglement-Assisted Classical Capacity of Noisy Quantum Channels
• Coding Theorem and Strong Converse for Quantum Channels
• Secure key from bound entanglement
• The entanglement of purification
• Optimal dense coding with mixed state entanglement
• Entanglement-Assisted Capacity of Quantum Multiple-Access Channels
• Distilling common randomness from bipartite quantum states
• Classical information capacity of superdense coding
• On quantum advantage in dense coding
• Entanglement-assisted private communication over quantum broadcast channels
• Scalable programmable quantum gates and a new aspect of the additivity problem for the classical capacity of quantum channels
• Non-Additivity of the Entanglement of Purification (Beyond Reasonable Doubt)
• Secure communication over fully quantum Gel'fand-Pinsker wiretap channel
• Every entangled state provides an advantage in classical communication
• Entanglement generation with a quantum channel and a shared state