Quantum Broadcast Channels

Authors:
Jon Yard;Patrick Hayden;Igor Devetak
Affiliations:
Computer, Computational and Statistical Sciences (CCS-3) and Center for Nonlinear Studies (CNLS), Los Alamos National Laboratory, Los Alamos, NM, USA;School of Computer Science, McGill University, Montréal, Canada;Formerly at the Electrical Engineering Department, University of Southern California, USA
Venue:
IEEE Transactions on Information Theory
Year:
2011

Citing 0
Cited 4

A father protocol for quantum broadcast channels

IEEE Transactions on Information Theory
Nonlocal quantum information in bipartite quantum error correction

Quantum Information Processing
Trading classical communication, quantum communication, and entanglement in quantum Shannon theory

IEEE Transactions on Information Theory
Multiaccess quantum communication and product higher rank numerical range

Quantum Information & Computation

Quantified Score

Hi-index	754.96

Visualization

Abstract

We consider quantum channels with one sender and two receivers, used in several different ways for the simultaneous transmission of independent messages. We begin by extending the technique of superposition coding to quantum channels with a classical input to give a general achievable region. We also give outer bounds to the capacity regions for various special cases from the classical literature and prove that superposition coding is optimal for a class of channels. We then consider extensions of superposition coding for channels with a quantum input, where some of the messages transmitted are quantum instead of classical, in the sense that the parties establish bipartite or tripartite GHZ entanglement. We conclude by using state merging to give achievable rates for establishing bipartite entanglement between different pair of parties with the assistance of free classical communication.