Identification over quantum broadcast channels
From MaRDI portal
Publication:6048732
Abstract: Identification over quantum broadcast channels is considered. As opposed to the information transmission task, the decoder only identifies whether a message of his choosing was sent or not. This relaxation allows for a double-exponential code size. An achievable identification region is derived for a quantum broadcast channel, and a full characterization for the class of classical-quantum broadcast channels. The results are demonstrated for the quantum erasure broadcast channel. Furthermore, the identification capacity region of the single-mode pure-loss bosonic broadcast channel is obtained as a consequence. In contrast to the single-user case, the capacity region for identification can be significantly larger than for transmission.
Recommendations
- Quantum and classical message protect identification via quantum channels
- Identification via quantum channels
- Capacity bounds for identification via broadcast channels that are optimal for the determination broadcast channel
- Identification Via Quantum Channels in the Presence of Prior Correlation and Feedback
- An achievable rate for private classical information over a quantum broadcast channel
Cites work
- A coding theorem for the discrete memoryless broadcast channel
- A Father Protocol for Quantum Broadcast Channels
- A Mathematical Theory of Communication
- An Outer Bound to the Capacity Region ofthe Broadcast Channel
- Bounds on Entanglement Distillation and Secret Key Agreement for Quantum Broadcast Channels
- Building Blocks for Communication Over Noisy Quantum Networks
- Capacity bounds for identification via broadcast channels that are optimal for the determination broadcast channel
- Classical Codes for Quantum Broadcast Channels
- Coding theorem and strong converse for quantum channels
- Communication Over Quantum Channels With Parameter Estimation
- Gaussian States Minimize the Output Entropy of the One-Mode Quantum Attenuator
- General theory of information transfer: Updated
- Hadamard quantum broadcast channels
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 5223157 (Why is no real title available?)
- Identification and Other Probabilistic Models
- Identification in the presence of feedback-a discovery of new capacity formulas
- Identification in the presence of side information with application to watermarking
- Identification via channels
- Identification via quantum channels
- Identification via the Broadcast Channel
- Incompatibility of quantum channels
- Information theory. Coding theorems for discrete memoryless systems
- Minimax Converse for Identification via Channels
- Network information theory
- New Lower Bounds to the Output Entropy of Multi-Mode Quantum Gaussian Channels
- One-Shot Marton Inner Bound for Classical-Quantum Broadcast Channel
- Probability Inequalities for Sums of Bounded Random Variables
- Quantum and classical message protect identification via quantum channels
- Quantum Broadcast Channels
- Quantum broadcast channels with cooperating decoders: an information-theoretic perspective on quantum repeaters
- Quantum information theory
- Secure and Robust Identification via Classical-Quantum Channels
- Strong converse for identification via quantum channels
- The broadcast classical-quantum capacity region of a two-phase bidirectional relaying channel
- The capacity of a class of broadcast channels
- Watermarking Identification Codes with Related Topics on Common Randomness
This page was built for publication: Identification over quantum broadcast channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6048732)
