A quantum analog of Huffman coding

Details A quantum analog of Huffman coding A quantum analog of Huffman coding

1998-05-27

arxiv.org/abs/quant-ph/9805080v2

Physics

Quantum Physics

Revised version, 7 pages, two-column, RevTex. Presented at 1998 IEEE International Symposium on Information Theory

Scientific paper

We analyze a generalization of Huffman coding to the quantum case. In particular, we notice various difficulties in using instantaneous codes for quantum communication. Nevertheless, for the storage of quantum information, we have succeeded in constructing a Huffman-coding inspired quantum scheme. The number of computational steps in the encoding and decoding processes of N quantum signals can be made to be of polylogarithmic depth by a massively parallel implementation of a quantum gate array. This is to be compared with the O (N^3) computational steps required in the sequential implementation by Cleve and DiVincenzo of the well-known quantum noiseless block coding scheme of Schumacher. We also show that O(N^2(log N)^a) computational steps are needed for the communication of quantum information using another Huffman-coding inspired scheme where the sender must disentangle her encoding device before the receiver can perform any measurements on his signals.

Affiliated with

Also associated with

No associations

Rating

A quantum analog of Huffman coding 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 A quantum analog of Huffman coding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A quantum analog of Huffman coding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-725349