Entanglement-assisted capacities of compound quantum channels
File(s)1603.02282v2.pdf (371.21 KB)
Accepted version
Author(s)
Berta, Mario
Gharibyan, Hrant
Walter, Michael
Type
Journal Article
Abstract
We study universal quantum codes for entanglement-assisted quantum communication over compound quantum channels. In this setting, sender and receiver do not know the specific channel that will be used for communication, but only know the set that the channel is selected from. We investigate different variations of the problem: uninformed users, informed receiver, informed sender, and feedback assistance. We derive single-letter formulas for all corresponding channel capacities. Our proofs are based on one-shot decoupling bounds and properties of smooth entropies.
Date Issued
2017-05-01
Date Acceptance
2017-01-26
Citation
IEEE Transactions on Information Theory, 2017, 63 (5), pp.3306-3321
ISSN
0018-9448
Publisher
Institute of Electrical and Electronics Engineers
Start Page
3306
End Page
3321
Journal / Book Title
IEEE Transactions on Information Theory
Volume
63
Issue
5
Copyright Statement
© 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Identifier
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000399939200038&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=1ba7043ffcc86c417c072aa74d649202
Subjects
Science & Technology
Technology
Computer Science, Information Systems
Engineering, Electrical & Electronic
Computer Science
Engineering
Quantum mechanics
quantum entanglement
compound channels
decoupling
LONG-TERM-MEMORY
CLASSICAL CAPACITY
INFORMATION
COMMUNICATION
UNCERTAINTY
CONTINUITY
ENTROPIES
THEOREM
BOUNDS
STATES
Publication Status
Published
Date Publish Online
2017-02-24