Strong converse rates for quantum communication

Tomamichel, M; Wilde, MM; Winter, A

Strong converse rates for quantum communication

Tomamichel, M

Wilde, MM Winter, A

Permalink

Publication Type:: Conference Proceeding
Citation:: IEEE International Symposium on Information Theory - Proceedings, 2015, 2015-June pp. 2386 - 2390
Issue Date:: 2015-09-28

Closed Access

	Filename	Description	Size
	07282883(2).pdf	Published Version	238.77 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	Tomamichel, M https://orcid.org/0000-0001-5410-3329	en_US
dc.contributor.author	Wilde, MM	en_US
dc.contributor.author	Winter, A https://orcid.org/0000-0001-6344-4870	en_US
dc.date.issued	2015-09-28	en_US
dc.identifier.citation	IEEE International Symposium on Information Theory - Proceedings, 2015, 2015-June pp. 2386 - 2390	en_US
dc.identifier.isbn	9781467377041	en_US
dc.identifier.issn	2157-8095	en_US
dc.identifier.uri	http://hdl.handle.net/10453/115658
dc.description.abstract	© 2015 IEEE. We revisit a fundamental open problem in quantum information theory, namely whether it is possible to transmit quantum information at a rate exceeding the channel capacity if we allow for a non-vanishing probability of decoding error. Here we establish that the Rains information of any quantum channel is a strong converse rate for quantum communication: For any code with a rate exceeding the Rains information of the channel, we show that the fidelity vanishes exponentially fast as the number of channel uses increases. This remains true even if we consider codes that perform classical post-processing on the transmitted quantum data. Our result has several applications. Most importantly, for generalized dephasing channels we show that the Rains information is also achievable, and thereby establish the strong converse property for quantum communication over such channels. This for the first time conclusively settles the strong converse question for a class of quantum channels that have a non-trivial quantum capacity.	en_US
dc.relation.ispartof	IEEE International Symposium on Information Theory - Proceedings	en_US
dc.relation.isbasedon	10.1109/ISIT.2015.7282883	en_US
dc.title	Strong converse rates for quantum communication	en_US
dc.type	Conference Proceeding
utslib.citation.volume	2015-June	en_US
utslib.for	0802 Computation Theory and Mathematics	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/Faculty of Engineering and Information Technology/School of Computer Science
pubs.organisational-group	/University of Technology Sydney/Strength - QSI - Centre for Quantum Software and Information
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US
pubs.volume	2015-June	en_US

Abstract:

© 2015 IEEE. We revisit a fundamental open problem in quantum information theory, namely whether it is possible to transmit quantum information at a rate exceeding the channel capacity if we allow for a non-vanishing probability of decoding error. Here we establish that the Rains information of any quantum channel is a strong converse rate for quantum communication: For any code with a rate exceeding the Rains information of the channel, we show that the fidelity vanishes exponentially fast as the number of channel uses increases. This remains true even if we consider codes that perform classical post-processing on the transmitted quantum data. Our result has several applications. Most importantly, for generalized dephasing channels we show that the Rains information is also achievable, and thereby establish the strong converse property for quantum communication over such channels. This for the first time conclusively settles the strong converse question for a class of quantum channels that have a non-trivial quantum capacity.

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

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