Universal superposition codes: capacity regions of compound quantum broadcast channel with confidential messages
From MaRDI portal
Publication:3298908
Abstract: We derive universal codes for transmission of broadcast and confidential messages over classical-quantum-quantum and fully quantum channels. These codes are robust to channel uncertainties considered in the compound model. To construct these codes we generalize random codes for transmission of public messages, to derive a universal superposition coding for the compound quantum broadcast channel. As an application, we give a multi-letter characterization of regions corresponding to the capacity of the compound quantum broadcast channel for transmitting broadcast and confidential messages simultaneously. This is done for two types of broadcast messages, one called public and the other common.
Recommendations
- Universal random codes: capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender
- Simultaneous transmission of classical and quantum information under channel uncertainty and jamming attacks
- Secret message transmission over quantum channels under adversarial quantum noise: Secrecy capacity and super-activation
- Entanglement transmission and generation under channel uncertainty: universal quantum channel coding
- Universal coding for transmission of private information
Cites work
- scientific article; zbMATH DE number 3288353 (Why is no real title available?)
- scientific article; zbMATH DE number 3300332 (Why is no real title available?)
- A Hypothesis Testing Approach for Communication Over Entanglement-Assisted Compound Quantum Channel
- A sharp continuity estimate for the von Neumann entropy
- Analytical properties of Shannon's capacity of arbitrarily varying channels under list decoding: super-additivity and discontinuity behavior
- Arbitrarily varying and compound classical-quantum channels and a note on quantum zero-error capacities
- Building Blocks for Communication Over Noisy Quantum Networks
- Classical Capacities of Compound and Averaged Quantum Channels
- Coding Theorems for Compound Problems via Quantum Rényi Divergences
- Elimination of correlation in random codes for arbitrarily varying channels
- General formulas for capacity of classical-quantum channels
- Information theory. Coding theorems for discrete memoryless systems
- On the Quantum Rényi Relative Entropies and Related Capacity Formulas
- Position-based coding and convex splitting for private communication over quantum channels
- Public and private resource trade-offs for a quantum channel
- Quantum information theory
- Simultaneous transmission of classical and quantum information under channel uncertainty and jamming attacks
- Strong converse for identification via quantum channels
- The capacity of a quantum channel for simultaneous transmission of classical and quantum information
- Tight uniform continuity bounds for the quantum conditional mutual information, for the Holevo quantity, and for capacities of quantum channels
- Universal coding for classical-quantum channel
- Universal coding for transmission of private information
Cited in
(7)- Universal Classical-Quantum Superposition Coding and Universal Classical-Quantum Multiple Access Channel Coding
- Entanglement transmission and generation under channel uncertainty: universal quantum channel coding
- Universal random codes: capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender
- Simultaneous transmission of classical and quantum information under channel uncertainty and jamming attacks
- Universal coding for transmission of private information
- Quantum broadcast channels with cooperating decoders: an information-theoretic perspective on quantum repeaters
- Secret message transmission over quantum channels under adversarial quantum noise: Secrecy capacity and super-activation
This page was built for publication: Universal superposition codes: capacity regions of compound quantum broadcast channel with confidential messages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3298908)
