pith. sign in

arxiv: quant-ph/9607010 · v1 · submitted 1996-07-12 · 🪐 quant-ph

Data Compression for Quantum Code

classification 🪐 quant-ph
keywords quantumcompressiondatageneralcodingschemesubspacesbefore
0
0 comments X
read the original abstract

The general scheme of data compression using the quantum noiseless coding theorem of Schumacher is dicussed for general quantum sources. When the Hilbert space of the quantum source is decomposable into orthogonal subspaces, one can first perform classical data compression before performing the quantum data compression for individual subspaces. For minimizing the resource in quantum coding, a general parameterization of the dimensions in the Jozsa-Schumacher quantum data compression scheme is presented.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.