Quantum coding with finite resources

Tomamichel, M; Berta, M; Renes, JM

Quantum coding with finite resources

Tomamichel, M

Berta, M Renes, JM

Permalink

Publication Type:: Journal Article
Citation:: Nature Communications, 2016, 7
Issue Date:: 2016-05-09

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Submitted VersionAdobe PDF (664.96 kB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Tomamichel, M https://orcid.org/0000-0001-5410-3329	en_US
dc.contributor.author	Berta, M	en_US
dc.contributor.author	Renes, JM	en_US
dc.date.available	2016-03-16	en_US
dc.date.issued	2016-05-09	en_US
dc.identifier.citation	Nature Communications, 2016, 7	en_US
dc.identifier.uri	http://hdl.handle.net/10453/89825
dc.description.abstract	The quantum capacity of a memoryless channel determines the maximal rate at which we can communicate reliably over asymptotically many uses of the channel. Here we illustrate that this asymptotic characterization is insufficient in practical scenarios where decoherence severely limits our ability to manipulate large quantum systems in the encoder and decoder. In practical settings, we should instead focus on the optimal trade-off between three parameters: the rate of the code, the size of the quantum devices at the encoder and decoder, and the fidelity of the transmission. We find approximate and exact characterizations of this trade-off for various channels of interest, including dephasing, depolarizing and erasure channels. In each case, the trade-off is parameterized by the capacity and a second channel parameter, the quantum channel dispersion. In the process, we develop several bounds that are valid for general quantum channels and can be computed for small instances.	en_US
dc.relation.ispartof	Nature Communications	en_US
dc.relation.isbasedon	10.1038/ncomms11419	en_US
dc.title	Quantum coding with finite resources	en_US
dc.type	Journal Article
utslib.citation.volume	7	en_US
utslib.for	010503 Mathematical Aspects of Classical Mechanics, Quantum Mechanics and Quantum Information Theory	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	open_access
pubs.publication-status	Published	en_US
pubs.volume	7	en_US

Abstract:

The quantum capacity of a memoryless channel determines the maximal rate at which we can communicate reliably over asymptotically many uses of the channel. Here we illustrate that this asymptotic characterization is insufficient in practical scenarios where decoherence severely limits our ability to manipulate large quantum systems in the encoder and decoder. In practical settings, we should instead focus on the optimal trade-off between three parameters: the rate of the code, the size of the quantum devices at the encoder and decoder, and the fidelity of the transmission. We find approximate and exact characterizations of this trade-off for various channels of interest, including dephasing, depolarizing and erasure channels. In each case, the trade-off is parameterized by the capacity and a second channel parameter, the quantum channel dispersion. In the process, we develop several bounds that are valid for general quantum channels and can be computed for small instances.

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

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