Sphere-packing bound for classical-quantum channels

Cheng, HC; Hsieh, MH; Tomamichel, M

Sphere-packing bound for classical-quantum channels

Cheng, HC

Hsieh, MH

Tomamichel, M

Permalink

Publication Type:: Conference Proceeding
Citation:: IEEE International Symposium on Information Theory - Proceedings, 2018, 2018-January pp. 479 - 483
Issue Date:: 2018-01-31

Closed Access

	Filename	Description	Size
	08278039.pdf	Published version	153.92 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	Cheng, HC https://orcid.org/0000-0003-4499-4679	en_US
dc.contributor.author	Hsieh, MH https://orcid.org/0000-0002-3396-8427	en_US
dc.contributor.author	Tomamichel, M https://orcid.org/0000-0001-5410-3329	en_US
dc.date.issued	2018-01-31	en_US
dc.identifier.citation	IEEE International Symposium on Information Theory - Proceedings, 2018, 2018-January pp. 479 - 483	en_US
dc.identifier.isbn	9781509030972	en_US
dc.identifier.issn	2157-8095	en_US
dc.identifier.uri	http://hdl.handle.net/10453/126800
dc.description.abstract	© 2017 IEEE. We study lower bounds on the optimal error probability in channel coding at rates below capacity, commonly termed sphere-packing bounds. In this work, we establish a sphere-packing bound for classical-quantum channels, which significantly improves previous prefactor from the order of subexponential to polynomial. Furthermore, the gap between the obtained error exponent for constant composition codes and the best known classical random coding exponent vanishes in the order of o(log n/n), indicating our sphere-packing bound is almost exact in the high rate regime. The main technical contributions are two converse Hoeffding bounds for quantum hypothesis testing and the saddle-point properties of error exponent functions.	en_US
dc.relation.ispartof	IEEE International Symposium on Information Theory - Proceedings	en_US
dc.relation.isbasedon	10.1109/ITW.2017.8278039	en_US
dc.title	Sphere-packing bound for classical-quantum channels	en_US
dc.type	Conference Proceeding
utslib.citation.volume	2018-January	en_US
utslib.for	0806 Information Systems	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
pubs.organisational-group	/University of Technology Sydney/Students
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US
pubs.volume	2018-January	en_US

Abstract:

© 2017 IEEE. We study lower bounds on the optimal error probability in channel coding at rates below capacity, commonly termed sphere-packing bounds. In this work, we establish a sphere-packing bound for classical-quantum channels, which significantly improves previous prefactor from the order of subexponential to polynomial. Furthermore, the gap between the obtained error exponent for constant composition codes and the best known classical random coding exponent vanishes in the order of o(log n/n), indicating our sphere-packing bound is almost exact in the high rate regime. The main technical contributions are two converse Hoeffding bounds for quantum hypothesis testing and the saddle-point properties of error exponent functions.

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

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