Entanglement-assisted capacity of quantum multiple-access channels

Hsieh, MH; Devetak, I; Winter, A

Entanglement-assisted capacity of quantum multiple-access channels

Hsieh, MH

Devetak, I Winter, A

Permalink

Publication Type:: Journal Article
Citation:: IEEE Transactions on Information Theory, 2008, 54 (7), pp. 3078 - 3090
Issue Date:: 2008-07-01

Closed Access

	Filename	Description	Size
	2012004790OK.pdf		346.98 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Hsieh, MH https://orcid.org/0000-0002-3396-8427	en_US
dc.contributor.author	Devetak, I	en_US
dc.contributor.author	Winter, A https://orcid.org/0000-0001-6344-4870	en_US
dc.date.issued	2008-07-01	en_US
dc.identifier.citation	IEEE Transactions on Information Theory, 2008, 54 (7), pp. 3078 - 3090	en_US
dc.identifier.issn	0018-9448	en_US
dc.identifier.uri	http://hdl.handle.net/10453/28140
dc.description.abstract	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. © 2008 IEEE.	en_US
dc.relation.ispartof	IEEE Transactions on Information Theory	en_US
dc.relation.isbasedon	10.1109/TIT.2008.924726	en_US
dc.subject.classification	Networking & Telecommunications	en_US
dc.title	Entanglement-assisted capacity of quantum multiple-access channels	en_US
dc.type	Journal Article
utslib.citation.volume	7	en_US
utslib.citation.volume	54	en_US
utslib.for	0801 Artificial Intelligence and Image Processing	en_US
utslib.for	0906 Electrical and Electronic Engineering	en_US
utslib.for	1005 Communications Technologies	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Strength - QSI - Centre for Quantum Software and Information
utslib.copyright.status	closed_access
pubs.issue	7	en_US
pubs.publication-status	Published	en_US
pubs.volume	54	en_US

Abstract:

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. © 2008 IEEE.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/28140