Universal Classical-Quantum Superposition Coding and Universal Classical-Quantum Multiple Access Channel Coding
TL;DR: In this article , the capacity region of a classical-quantum compound broadcast channel with degraded message sets was established using generalized packing lemmas for the type method, and a universal classicalquantum superposition code was derived.
read more
Abstract: We derive universal classical-quantum superposition coding and universal classical-quantum multiple access channel coding by using generalized packing lemmas for the type method. Using our classical-quantum universal superposition code, we establish the capacity region of a classical-quantum compound broadcast channel with degraded message sets. Our universal classical-quantum multiple access channel codes have two types of codes. One is a code with joint decoding and the other is a code with separate decoding. It is not so easy to construct a former code that universally achieves general points of the capacity region beyond corner points. First, we construct the latter code that universally achieves general points of the capacity region. Then, converting the latter code to the former coder, we construct the above desired code with the former type.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Universal classical-quantum multiple access channel coding
Masahito Hayashi,Ning Cai +1 more
- 12 Jul 2021
TL;DR: In this article, the capacity region of a classical-quantum compound broadcast channel with degraded message sets was established by using generalized packing lemmas for the type method, and a universal classicalquantum superposition code was derived.
4
References
•Book
Information Theory: Coding Theorems for Discrete Memoryless Systems
I. Csiszar,János Körner +1 more
- 26 Sep 2014
TL;DR: This new edition presents unique discussions of information theoretic secrecy and of zero-error information theory, including the deep connections of the latter with extremal combinatorics.
4.2K
Broadcast channels with confidential messages
Imre Csiszár,János Körner +1 more
TL;DR: Given two discrete memoryless channels (DMC's) with a common input, a single-letter characterization is given of the achievable triples where R_{e} is the equivocation rate and the related source-channel matching problem is settled.
3.9K
The private classical capacity and quantum capacity of a quantum channel
TL;DR: In this paper, the capacity of a quantum channel for transmitting private classical information is derived, which is shown to be equal to the capacity for generating a secret key, and neither capacity is enhanced by forward public classical communication.
992
Quasi-entropies for finite quantum systems
TL;DR: In this article, the authors generalize Lieb's convexity theorem and the monotonicity of the relative entropy using the Jensen inequality of operator convex functions and derive the quantum version of Renyi's α-entropies.
640