pith. sign in

arxiv: quant-ph/0202002 · v6 · submitted 2002-02-01 · 🪐 quant-ph

Exponents of quantum fixed-length pure state source coding

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

We derive the optimal exponent of the error probability of the quantum fixed-length pure state source coding in both cases of blind coding and visible coding. The optimal exponent is universally attained by Jozsa et al. (PRL, 81, 1714 (1998))'s universal code. In the direct part, a group representation theoretical type method is essential. In the converse part, Nielsen and Kempe (PRL, 86, 5184 (2001))'s lemma is essential.

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.