Exponents of quantum fixed-length pure state source coding

Masahito Hayashi

Exponents of quantum fixed-length pure state source coding

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv quant-ph/0202002 v6 pith:NA4LSLRL submitted 2002-02-01 quant-ph

Masahito Hayashi This is my paper · ORCID

classification quant-ph

keywords codingessentialexponentfixed-lengthoptimalpartpurequantum

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Error exponents for tripartite-to-bipartite entanglement transformations
quant-ph 2025-07 accept novelty 7.0 of 10

For pure tripartite states, the optimal deterministic rate is the minimum of two min-entropies of entanglement, and the direct and strong converse error exponents are given by explicit rate formulas.

Pith tools