File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ISIT.1998.708958
- Scopus: eid_2-s2.0-84890339416
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: A quantum analog of Huffman coding
| Title | A quantum analog of Huffman coding |
|---|---|
| Authors | |
| Issue Date | 1998 |
| Citation | IEEE International Symposium on Information Theory - Proceedings, 1998, p. 353 How to Cite? |
| Abstract | We construct a Huffman-coding inspired scheme for quantum data compression. The number of computational steps in the encoding and decoding processes of N quantum signals can be made to be polynomial in log N 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 Di-Vincenzo (see Phys. Rev. A54, p.2636, 1996) of the Schumacher (see Phys. Rev. A51, p.2738, 1995) quantum noiseless block coding scheme. © 1998 IEEE. |
| Persistent Identifier | http://hdl.handle.net/10722/285931 |
| ISSN | 2020 SCImago Journal Rankings: 0.600 |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Braunstein, S. L. | - |
| dc.contributor.author | Fuchs, C. A. | - |
| dc.contributor.author | Gottesman, D. | - |
| dc.contributor.author | Lo, Hoi Kwong | - |
| dc.date.accessioned | 2020-08-18T04:57:01Z | - |
| dc.date.available | 2020-08-18T04:57:01Z | - |
| dc.date.issued | 1998 | - |
| dc.identifier.citation | IEEE International Symposium on Information Theory - Proceedings, 1998, p. 353 | - |
| dc.identifier.issn | 2157-8095 | - |
| dc.identifier.uri | http://hdl.handle.net/10722/285931 | - |
| dc.description.abstract | We construct a Huffman-coding inspired scheme for quantum data compression. The number of computational steps in the encoding and decoding processes of N quantum signals can be made to be polynomial in log N 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 Di-Vincenzo (see Phys. Rev. A54, p.2636, 1996) of the Schumacher (see Phys. Rev. A51, p.2738, 1995) quantum noiseless block coding scheme. © 1998 IEEE. | - |
| dc.language | eng | - |
| dc.relation.ispartof | IEEE International Symposium on Information Theory - Proceedings | - |
| dc.title | A quantum analog of Huffman coding | - |
| dc.type | Conference_Paper | - |
| dc.description.nature | link_to_subscribed_fulltext | - |
| dc.identifier.doi | 10.1109/ISIT.1998.708958 | - |
| dc.identifier.scopus | eid_2-s2.0-84890339416 | - |
| dc.identifier.spage | 353 | - |
| dc.identifier.epage | - | |
| dc.identifier.issnl | 2157-8095 | - |