Lossless quantum prefix compression for communication channels that are always open

Müller, Markus, Rogers, Caroline and Nagarajan, Rajagopal (2009) Lossless quantum prefix compression for communication channels that are always open. Physical Review A, 79 (1). ISSN 1050-2947 (doi:10.1103/PhysRevA.79.012302)

Full text is not in this repository.

Abstract

We describe a method for lossless quantum compression if the output of the information source is not known. We compute the best possible compression rate, minimizing the expected base length of the output quantum bit string (the base length of a quantum string is the maximal length in the superposition). This complements work by Schumacher and Westmoreland who calculated the corresponding rate for minimizing the output’s average length. Our compressed code words are prefix-free indeterminate-length quantum bit strings which can be concatenated in the case of multiple sources. Therefore, we generalize the known theory of prefix-free quantum codes to the case where strings have indeterminate length. Moreover, we describe a communication model which allows the lossless transmission of the compressed code words. The benefit of compression is then the reduction of transmission errors in the presence of noise.

Item Type: Article
Research Areas: A. > School of Science and Technology > Computer Science
A. > School of Science and Technology > Computer Science > Foundations of Computing group
Item ID: 11235
Useful Links:
Depositing User: Teddy ~
Date Deposited: 10 Jul 2013 10:32
Last Modified: 13 Oct 2016 14:27
URI: https://eprints.mdx.ac.uk/id/eprint/11235

Actions (login required)

Edit Item Edit Item