pith. sign in

arxiv: quant-ph/0209124 · v3 · submitted 2002-09-24 · 🪐 quant-ph

Simple construction of quantum universal variable-length source coding

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

We simply construct a quantum universal variable-length source code in which, independent of information source, both of the average error and the probability that the coding rate is greater than the entropy rate $H(rho_p)$, tend to 0. If $H(rho_p)$ is estimated, we can compress the coding rate to the admissible rate $H(rho_p)$ with a probability close to 1. However, when we perform a naive measurement for the estimation of $H(rho_p)$, the input state is demolished. By smearing the measurement, we successfully treat the trade-off between the estimation of $H(rho_p)$ and the non-demolition of the input state. Our protocol can be used not only for the Schumacher's scheme but also for the compression of entangled states.

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.