pith. sign in

arxiv: quant-ph/0603098 · v2 · pith:4E7TOPHKnew · submitted 2006-03-10 · 🪐 quant-ph · cs.IT· math.IT

Quantum broadcast channels

classification 🪐 quant-ph cs.ITmath.IT
keywords channelsquantumclassicalcodinggivesuperpositionachievablebipartite
0
0 comments X
read the original 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 pairs of parties with the assistance of free classical communication.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.