Papers
Topics
Authors
Recent
Search
2000 character limit reached

Random coding exponents galore via decoupling

Published 27 Apr 2015 in quant-ph, cs.IT, and math.IT | (1504.07075v5)

Abstract: A missing piece in quantum information theory, with very few exceptions, has been to provide the random coding exponents for quantum information-processing protocols. We remedy the situation by providing these exponents for a variety of protocols including those at the top of the family tree of protocols. Our line of attack is to provide an exponential bound on the decoupling error for a restricted class of completely positive maps where a key term in the exponent is in terms of a R\'enyi \alpha-information-theoretic quantity for any \alpha $\in$ (1,2]. Among the protocols covered are fully quantum Slepian-Wolf, quantum state merging, quantum state redistribution, quantum/classical communication across channels with side information at the transmitter with or without entanglement assistance, and quantum communication across broadcast channels.

Citations (5)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.