Lossless quantum prefix compression for communication channels that are always open

Mueller, M., Rogers, C. and Nagarajan, R. (2009) Lossless quantum prefix compression for communication channels that are always open. Physical Review A: Atomic, Molecular and Optical Physics, 79(1), (doi: 10.1103/PhysRevA.79.012302)

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: Articles
• Status: Published
• Refereed: Yes
• Glasgow Author(s) Enlighten ID: Mueller, Dr Markus
• Authors: Mueller, M., Rogers, C., and Nagarajan, R.
• College/School: College of Science and Engineering > School of Engineering
• Journal Name: Physical Review A: Atomic, Molecular and Optical Physics
• Publisher: American Physical Society
• ISSN: 1050-2947
• ISSN (Online): 1094-1622
• Published Online: 01 January 2009
• Copyright Holders: Copyright © 2009 The American Physical Society
• First Published: First published in Physical Review A 2009 79(1)
• Publisher Policy: Reproduced in accordance with the copyright policy of the publisher

Project Code	Award No	Project Name	Principal Investigator	Funder's Name	Funder Ref	Lead Dept
43194	1	Semantics of quantum computation	Simon Gay	Engineering & Physical Sciences Research Council (EPSRC)	EP/E00623X/1	Computing Science