Lossless Quantum Prefix Compression for Communication Channels that are Always Open

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

13 pages, 1 figure; published version

Scientific paper

10.1103/PhysRevA.79.012302

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 of strings with 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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Lossless Quantum Prefix Compression for Communication Channels that are Always Open does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Lossless Quantum Prefix Compression for Communication Channels that are Always Open, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lossless Quantum Prefix Compression for Communication Channels that are Always Open will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-584774

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.