pith. sign in

arxiv: 0904.3011 · v1 · submitted 2009-04-20 · 🪐 quant-ph

Entanglement Transmission Capacity of Compound Channels

classification 🪐 quant-ph
keywords channelchannelsentanglementtransmissionachievableassumebelongscapacity
0
0 comments X
read the original abstract

We determine the optimal achievable rate at which entanglement can be reliably transmitted when the memoryless channel used during transmission is unknown both to sender and receiver. To be more precise, we assume that both of them only know that the channel belongs to a given set of channels. Thus, they have to use encoding and decoding schemes that work well for the whole set.

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.