Metraipolis › archive › dc_ff7d407ffb25

Quantum minimum description of density matrices — arXiv:2610.06742

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.06742
License (as archived)
CC0-1.0
Archived
2026-10-06T16:59:53.084Z
SHA-256 of the archived text
30bcd1531ff08c2d08763962413ae7067d8813c6ba71fe641d6bd5e10912253e
Stable URL of this page
https://metraipolis.com/documento/dc_ff7d407ffb25

How to cite

Quantum minimum description of density matrices — arXiv:2610.06742 — arXiv (en), https://arxiv.org/abs/2610.06742 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ff7d407ffb25 (Metraipolis archive dc_ff7d407ffb25, sha256 30bcd1531ff08c2d08763962413ae7067d8813c6ba71fe641d6bd5e10912253e)
BibTeX
@misc{dcff7d407ffb25,
  title = {Quantum minimum description of density matrices — arXiv:2610.06742},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.06742},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ff7d407ffb25; sha256 30bcd1531ff08c2d08763962413ae7067d8813c6ba71fe641d6bd5e10912253e},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.06742. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study a variant of Schumacher compression. The task asks for the minimal memory cost for compressing many copies of a density matrix with known spectrum and unknown eigenbasis, without preserving its purification. For fixed dimension and distinct positive eigenvalues, we obtain the cost through its additive constant. Achievability uses a generalization of Werner's cloning map to $\mathrm{GL}(d,\mathbb C)$ irreducible representations, with finite trace-distance bounds controlled by highest-weight differences and row gaps. The matching converse follows from a quantitative form of Koashi--Imoto incompressibility for irreducible group orbits under a spectral-gap assumption. We also identify the relation between this quantum minimum description length and universal lossless coding overhead, and its connection to free entropy is explained in a companion letter. We provide a Lean certificate for our proofs.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph) ; Information Theory (cs.IT); Mathematical Physics (math-ph).
Pagina del lavoro: https://arxiv.org/abs/2610.06742 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T15:24:20.200Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).