Secure communication over fully quantum Gel'fand-Pinsker wiretap channel
arXiv:1801.00940 · doi:10.1109/TIT.2020.3005015
Abstract
In this work we study the problem of secure communication over a fully quantum Gel'fand-Pinsker channel. The best known achievability rate for this channel model in the classical case was proven by Goldfeld, Cuff and Permuter in [Goldfeld, Cuff, Permuter, 2016]. We generalize the result of [Goldfeld, Cuff, Permuter, 2016]. One key feature of the results obtained in this work is that all the bounds obtained are in terms of error exponent. We obtain our achievability result via the technique of simultaneous pinching. This in turn allows us to show the existence of a simultaneous decoder. Further, to obtain our encoding technique and to prove the security feature of our coding scheme we prove a bivariate classical-quantum channel resolvability lemma and a conditional classical-quantum channel resolvability lemma. As a by product of the achievability result obtained in this work, we also obtain an achievable rate for a fully quantum Gel'fand-Pinsker channel in the absence of Eve. The form of this achievable rate matches with its classical counterpart. The Gel'fand-Pinsker channel model had earlier only been studied for the classical-quantum case and in the case where Alice (the sender) and Bob (the receiver) have shared entanglement between them.
arXiv commentversion 2, 1 figure, 26 pages, added some extra proof and corrected few typos
References in corpus (17)
- On quantum Renyi entropies: a new generalization and some properties
- Distance measures to compare real and ideal quantum processes
- Noncommuting mixed states cannot be broadcast
- Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
- Quantum Information Processing with Finite Resources -- Mathematical Foundations
- Duality Between Smooth Min- and Max-Entropies
- Error Exponent in Asymmetric Quantum Hypothesis Testing and Its Application to Classical-Quantum Channel coding
- An Information-Spectrum Approach to Classical and Quantum Hypothesis Testing for Simple Hypotheses
- Optimal sequence of quantum measurements in the sense of Stein's lemma in quantum hypothesis testing
- Correlation Detection and an Operational Interpretation of the Renyi Mutual Information
- Noisy channel coding via privacy amplification and information reconciliation
- Operational Interpretation of Renyi Information Measures via Composite Hypothesis Testing Against Product and Markov Distributions
- Position-based coding and convex splitting for private communication over quantum channels
- Quantum wiretap channel with non-uniform random number and its exponent and equivocation rate of leaked information
- Lower bound on the relative error of mixed-state cloning and related operations
- Classical codes for quantum broadcast channels
- Coding for quantum channels with side information at the transmitter