Sphere-packing bound for symmetric classical-quantum channels

Cheng, HC; Hsieh, MH; Tomamichel, M

Sphere-packing bound for symmetric classical-quantum channels

Cheng, HC

Hsieh, MH

Tomamichel, M

Permalink

Publication Type:: Conference Proceeding
Citation:: IEEE International Symposium on Information Theory - Proceedings, 2017, pp. 286 - 290
Issue Date:: 2017-08-09

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Submitted VersionAdobe PDF (284.58 kB)

View on publisher's site

View statistics

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	2017-08-09	en_US
dc.identifier.citation	IEEE International Symposium on Information Theory - Proceedings, 2017, pp. 286 - 290	en_US
dc.identifier.isbn	9781509040964	en_US
dc.identifier.issn	2157-8095	en_US
dc.identifier.uri	http://hdl.handle.net/10453/82003
dc.description.abstract	© 2017 IEEE. "To be considered for the 2017 IEEE Jack Keil Wolf ISIT Student Paper Award." We provide a sphere-packing lower bound for the optimal error probability in finite blocklengths when coding over a symmetric classical-quantum channel. Our result shows that the pre-factor can be significantly improved from the order of the subexponential to the polynomial, This established pre-factor is arguably optimal because it matches the best known random coding upper bound in the classical case. Our approaches rely on a sharp concentration inequality in strong large deviation theory and crucial properties of the error-exponent function.	en_US
dc.relation.ispartof	IEEE International Symposium on Information Theory - Proceedings	en_US
dc.relation.isbasedon	10.1109/ISIT.2017.8006535	en_US
dc.title	Sphere-packing bound for symmetric classical-quantum channels	en_US
dc.type	Conference Proceeding
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
pubs.organisational-group	/University of Technology Sydney/Students
utslib.copyright.status	open_access
pubs.publication-status	Published	en_US

Abstract:

© 2017 IEEE. "To be considered for the 2017 IEEE Jack Keil Wolf ISIT Student Paper Award." We provide a sphere-packing lower bound for the optimal error probability in finite blocklengths when coding over a symmetric classical-quantum channel. Our result shows that the pre-factor can be significantly improved from the order of the subexponential to the polynomial, This established pre-factor is arguably optimal because it matches the best known random coding upper bound in the classical case. Our approaches rely on a sharp concentration inequality in strong large deviation theory and crucial properties of the error-exponent function.

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

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