Second-Order Asymptotics of Visible Mixed Quantum Source Coding via Universal Codes
Accepted version
Peer-reviewed
Repository URI
Repository DOI
Change log
Authors
Abstract
The simplest example of a quantum information source with memory is a mixed source which emits signals entirely from one of two memoryless quantum sources with given a priori probabilities. Considering a mixed source consisting of a general one-parameter family of memoryless sources, we derive the second order asymptotic rate for fixed-length visible source coding. Furthermore, we specialize our main result to a mixed source consisting of two memoryless sources. Our results provide the first example of second order asymptotics for a quantum information-processing task employing a resource with memory. For the case of a classical mixed source (using a finite alphabet), our results reduce to those obtained by Nomura and Han [IEEE Trans. on Inf. Th. 59.1 (2013), pp. 1-16]. To prove the achievability part of our main result, we introduce universal quantum source codes achieving second order asymptotic rates. These are obtained by an extension of Hayashi's construction [IEEE Trans. on Inf. Th. 54.10 (2008), pp. 4619-4637] of their classical counterparts.
Description
This is the author accepted manuscript. The final version is available from IEEE via http://dx.doi.org/10.1109/TIT.2016.2571662
Keywords
Journal Title
Conference Name
Journal ISSN
1557-9654