arXiv Analytics

Sign in

arXiv:quant-ph/0511228AbstractReferencesReviewsResources

Entanglement-Assisted Capacity of Quantum Multiple-Access Channels

Min-Hsiu Hsieh, Igor Devetak, Andreas Winter

Published 2005-11-24, updated 2010-11-10Version 2

We find a regularized formula for the entanglement-assisted (EA) capacity region for quantum multiple access channels (QMAC). We illustrate the capacity region calculation with the example of the collective phase-flip channel which admits a single-letter characterization. On the way, we provide a first-principles proof of the EA coding theorem based on a packing argument. We observe that the Holevo-Schumacher-Westmoreland theorem may be obtained from a modification of our EA protocol. We remark on the existence of a family hierarchy of protocols for multiparty scenarios with a single receiver, in analogy to the two-party case. In this way, we relate several previous results regarding QMACs.

Comments: Published version. 13 pages, 3 figures
Journal: IEEE Transaction on Information Theory, vol. 54, Issue 7, pp. 3078-3090, Jul. 2008
Categories: quant-ph
Related articles: Most relevant | Search more
arXiv:2301.02513 [quant-ph] (Published 2023-01-06)
Information Carried by a Single Particle in Quantum Multiple-Access Channels
arXiv:0807.3977 [quant-ph] (Published 2008-07-24)
Nonadditivity effects in classical capacities of quantum multiple-access channels
arXiv:1101.0264 [quant-ph] (Published 2010-12-31, updated 2011-01-05)
Subadditivity of the minimum output entropy and superactivation of the classical capacity of quantum multiple access channels