Position-based coding and convex splitting for private communication over quantum channels

Abstract

The classical-input quantum-output (cq) wiretap channel is a communication model involving a classical sender $X$, a legitimate quantum receiver $B$, and a quantum eavesdropper $E$. The goal of a private communication protocol that uses such a channel is for the sender $X$ to transmit a message in such a way that the legitimate receiver $B$ can decode it reliably, while the eavesdropper $E$ learns essentially nothing about which message was transmitted. The $\epsilon$-one-shot private capacity of a cq wiretap channel is equal to the maximum number of bits that can be transmitted over the channel, such that the privacy error is no larger than $\epsilon \in (0,1)$. The present paper provides a lower bound on the $\epsilon$-one-shot private classical capacity, by exploiting the recently developed techniques of Anshu, Devabathini, Jain, and Warsi, called position-based coding and convex splitting. The lower bound is equal to a difference of the hypothesis testing mutual information between $X$ and $B$ and the "alternate" smooth max-information between $X$ and $E$. The one-shot lower bound then leads to a non-trivial lower bound on the second-order coding rate for private classical communication over a memoryless cq wiretap channel.

v2: 31 pages, 1 figure, applies main result to the pure-loss bosonic channel

References in corpus (5)

• Quantum cryptography: Public key distribution and coin tossing
• One shot entanglement assisted classical and quantum communication over noisy quantum channels: A hypothesis testing and convex split approach
• Energy-constrained private and quantum capacities of quantum channels
• Sine distance for quantum states
• Non-Asymptotic Output Statistics of Random Binning and Its Applications

Cited by in corpus (20)

• One shot entanglement assisted classical and quantum communication over noisy quantum channels: A hypothesis testing and convex split approach
• Applications of position-based coding to classical communication over quantum channels
• Covert Capacity of Bosonic Channels
• Entanglement-assisted private communication over quantum broadcast channels
• Convex-split and hypothesis testing approach to one-shot quantum measurement compression and randomness extraction
• A one-shot achievability result for quantum state redistribution
• Union bound for quantum information processing
• One-shot quantum error correction of classical and quantum information
• Simple and Tighter Derivation of Achievability for Classical Communication over Quantum Channels
• Second-order coding rates for key distillation in quantum key distribution
• Fidelity-Based Smooth Min-Relative Entropy: Properties and Applications
• One-shot Capacity bounds on the Simultaneous Transmission of Classical and Quantum Information
• Secure communication over fully quantum Gel'fand-Pinsker wiretap channel
• Universal superposition codes: capacity regions of compound quantum broadcast channel with confidential messages
• One-Shot Triple-Resource Trade-Off in Quantum Channel Coding
• Extendibility limits quantum-secured communication and key distillation
• Classical capacities of memoryless but not identical quantum channels
• One-shot inner bounds for sending private classical information over a quantum MAC
• Semantic Security with Infinite Dimensional Quantum Eavesdropping Channel
• One-shot Multiple Access Channel Simulation