Metraipolis › archive › dc_a579af89291d
Universal Entanglement Distillation — arXiv:2609.40080
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.40080
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T14:40:51.087Z
- SHA-256 of the archived text
5e13ea0a0dccb715b41d20749a1b9837be6c3928093c0b2082170b099c62acdb- Stable URL of this page
https://metraipolis.com/documento/dc_a579af89291d
How to cite
Universal Entanglement Distillation — arXiv:2609.40080 — arXiv (en), https://arxiv.org/abs/2609.40080 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a579af89291d (Metraipolis archive dc_a579af89291d, sha256 5e13ea0a0dccb715b41d20749a1b9837be6c3928093c0b2082170b099c62acdb)
BibTeX
@misc{dca579af89291d,
title = {Universal Entanglement Distillation — arXiv:2609.40080},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.40080},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a579af89291d; sha256 5e13ea0a0dccb715b41d20749a1b9837be6c3928093c0b2082170b099c62acdb},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.40080. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We present a universal entanglement distillation protocol that asymptotically achieves the distillable entanglement of any unknown bipartite state in a fixed finite dimension. That is, its ebit yield attains every rate below the optimum that would be available if the state were known, with vanishing trace-distance error. Our approach combines tomography by local operations and classical communication with an adaptive distillation routine, using a local robustness lemma to control finite-sample estimation errors. We also characterize worst-case distillation from a family of states: the optimal uniform rate is the minimum distillable entanglement on the family's closure. These results show that ignorance of the state need not incur an asymptotic rate penalty. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-01 in math.IT). Categorie arXiv: Quantum Physics (quant-ph) ; Information Theory (cs.IT). Pagina del lavoro: https://arxiv.org/abs/2609.40080 — 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-07T14:14:20.805Z dalla pagina https://arxiv.org/catchup/math.IT/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).