Entanglement-assisted private communication over quantum broadcast channels

Abstract

We consider entanglement-assisted (EA) private communication over a quantum broadcast channel, in which there is a single sender and multiple receivers. We divide the receivers into two sets: the decoding set and the malicious set. The decoding set and the malicious set can either be disjoint or can have a finite intersection. For simplicity, we say that a single party Bob has access to the decoding set and another party Eve has access to the malicious set, and both Eve and Bob have access to the pre-shared entanglement with Alice. The goal of the task is for Alice to communicate classical information reliably to Bob and securely against Eve, and Bob can take advantage of pre-shared entanglement with Alice. In this framework, we establish a lower bound on the one-shot EA private capacity. When there exists a quantum channel mapping the state of the decoding set to the state of the malicious set, such a broadcast channel is said to be degraded. We establish an upper bound on the one-shot EA private capacity in terms of smoothed min- and max-entropies for such channels. In the limit of a large number of independent channel uses, we prove that the EA private capacity of a degraded quantum broadcast channel is given by a single-letter formula. Finally, we consider two specific examples of degraded broadcast channels and find their capacities. In the first example, we consider the scenario in which one part of Bob's laboratory is compromised by Eve. We show that the capacity for this protocol is given by the conditional quantum mutual information of a quantum broadcast channel, and so we thus provide an operational interpretation to the dynamic counterpart of the conditional quantum mutual information. In the second example, Eve and Bob have access to mutually exclusive sets of outputs of a broadcast channel.

arXiv commentv2: 23 pages, 2 figures, accepted for publication in the special issue "Shannon's Information Theory 70 years on: applications in classical and quantum physics" for Journal of Physics A

References in corpus (52)

• Quantum cryptography: Public key distribution and coin tossing
• Distillation of secret key and entanglement from quantum states
• On quantum Renyi entropies: a new generalization and some properties
• The operational meaning of min- and max-entropy
• Distance measures to compare real and ideal quantum processes
• On the quantum, classical and total amount of correlations in a quantum state
• Entanglement-Assisted Classical Capacity of Noisy Quantum Channels
• Min- and Max- Relative Entropies and a New Entanglement Monotone
• From Classical to Quantum Shannon Theory
• Quantum channels and memory effects
• One-Shot Classical-Quantum Capacity and Hypothesis Testing
• A Fully Quantum Asymptotic Equipartition Property
• A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks
• Tight uniform continuity bounds for quantum entropies: conditional entropy, relative entropy distance and energy constraints
• Quantum state merging and negative information
• A Resource Framework for Quantum Shannon Theory
• The quantum capacity of channels with arbitrarily correlated noise
• The Quantum Reverse Shannon Theorem based on One-Shot Information Theory
• Second-order asymptotics for quantum hypothesis testing
• Converse bounds for private communication over quantum channels
• The exact cost of redistributing multipartite quantum states
• Quantum mutual information and the one-time pad
• A family of quantum protocols
• Entanglement-Assisted Capacity of Quantum Multiple-Access Channels
• Quantum broadcast channels
• Chain Rules for Smooth Min- and Max-Entropies
• Finite blocklength converse bounds for quantum channels
• On entanglement-assisted classical capacity
• 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
• A father protocol for quantum broadcast channels
• Quantum Coding with Finite Resources
• Second-Order Asymptotics for the Classical Capacity of Image-Additive Quantum Channels
• Smooth Max-Information as One-Shot Generalization for Mutual Information
• On the Second-Order Asymptotics for Entanglement-Assisted Communication
• One-shot entanglement-assisted quantum and classical communication
• Second-order asymptotics for source coding, dense coding and pure-state entanglement conversions
• Position-based coding and convex splitting for private communication over quantum channels
• Sine distance for quantum states
• One-shot lossy quantum data compression
• Lower bound on the relative error of mixed-state cloning and related operations
• "Pretty strong" converse for the quantum capacity of degradable channels
• Decoding quantum information via the Petz recovery map
• Deconstruction and conditional erasure of quantum correlations
• A generalized quantum Slepian-Wolf
• Hadamard quantum broadcast channels
• Conditional quantum one-time pad
• Conditional Decoupling of Quantum Information
• Second-order asymptotics for quantum hypothesis testing in settings beyond i.i.d. - quantum lattice systems and more
• Relative entropies and their use in quantum information theory
• Second order asymptotics of visible mixed quantum source coding via universal codes

Cited by in corpus (9)

• Quantum secure direct communication with private dense coding using general preshared quantum state
• Conditional quantum one-time pad
• Second-order coding rates for key distillation in quantum key distribution
• Bounding quantum capacities via partial orders and complementarity
• Quantum conditional mutual information of W state in non-inertial frames
• Quantum Wiretap Channel Coding Assisted by Noisy Correlation
• Extendibility limits quantum-secured communication and key distillation
• Classical State Masking over a Quantum Channel
• Quantum Private Broadcasting