Position-based coding and convex splitting for private communication over quantum channels
arXiv:1703.01733 · doi:10.1007/s11128-017-1718-4
Abstract
The classical-input quantum-output (cq) wiretap channel is a communication model involving a classical sender , a legitimate quantum receiver , and a quantum eavesdropper . The goal of a private communication protocol that uses such a channel is for the sender to transmit a message in such a way that the legitimate receiver can decode it reliably, while the eavesdropper learns essentially nothing about which message was transmitted. The -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 . The present paper provides a lower bound on the -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 and and the "alternate" smooth max-information between and . 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.
arXiv commentv2: 31 pages, 1 figure, applies main result to the pure-loss bosonic channel
References in corpus (24)
- Quantum cryptography: Public key distribution and coin tossing
- Distance measures to compare real and ideal quantum processes
- Min- and Max- Relative Entropies and a New Entanglement Monotone
- Classical capacity of the lossy bosonic channel: the exact solution
- One-Shot Classical-Quantum Capacity and Hypothesis Testing
- The quantum capacity of channels with arbitrarily correlated noise
- Second-order asymptotics for quantum hypothesis testing
- Converse bounds for private communication over quantum channels
- General paradigm for distilling classical key from quantum states
- Noisy channel coding via privacy amplification and information reconciliation
- One shot entanglement assisted classical and quantum communication over noisy quantum channels: A hypothesis testing and convex split approach
- Quantum message compression with applications
- Quantum Coding with Finite Resources
- Tight exponential analysis of universally composable privacy amplification and its applications
- Polar coding to achieve the Holevo capacity of a pure-loss optical channel
- On the Second-Order Asymptotics for Entanglement-Assisted Communication
- Energy-constrained private and quantum capacities of quantum channels
- Second-order asymptotics for source coding, dense coding and pure-state entanglement conversions
- Sine distance for quantum states
- Lower bound on the relative error of mixed-state cloning and related operations
- Decoding quantum information via the Petz recovery map
- General non-asymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to wire-tap channel
- Non-Asymptotic Output Statistics of Random Binning and Its Applications
- Finite-Blocklength Bounds for Wiretap Channels
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