Metraipolis › archive › dc_7bea76cd6a23
The entanglement-assisted transmission capacity is a strong converse bound for identification — arXiv:2608.11000
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.11000
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T06:29:30.462Z
- SHA-256 of the archived text
4806cd9873685679100dac5c986cc71913f2e3729b41199b4962854aae7545d6- Stable URL of this page
https://metraipolis.com/documento/dc_7bea76cd6a23
How to cite
The entanglement-assisted transmission capacity is a strong converse bound for identification — arXiv:2608.11000 — arXiv (en), https://arxiv.org/abs/2608.11000 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7bea76cd6a23 (Metraipolis archive dc_7bea76cd6a23, sha256 4806cd9873685679100dac5c986cc71913f2e3729b41199b4962854aae7545d6)
BibTeX
@misc{dc7bea76cd6a23,
title = {The entanglement-assisted transmission capacity is a strong converse bound for identification — arXiv:2608.11000},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.11000},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7bea76cd6a23; sha256 4806cd9873685679100dac5c986cc71913f2e3729b41199b4962854aae7545d6},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.11000. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Classical identification via a noisy channel is a communication task in which the receiver is not required to reconstruct the full transmitted message, but only to decide whether it coincides with a message of interest. This relaxation allows the number of identifiable messages to grow doubly exponentially with the blocklength. For quantum channels, the resulting (doubly exponential) identification capacity $C_{\mathrm{ID}}$ can strictly exceed the ordinary (exponential) transmission capacity $C$. In this paper, we prove that the entanglement-assisted transmission capacity $C_E$ is a strong converse bound for this task: $C_{\mathrm{ID}}\leq C_E$. For sufficiently low-noise channels, this bound can also be achieved via the Hayden-Winter (quantum) identification + fingerprinting codes. This yields an exact characterization $C_{\mathrm{ID}}=C_E$ of identification capacity for such channels. However, for general channels, we prove that this upper bound can be strict. We exhibit an explicit family of transpose-depolarizing channels for which $C_{\mathrm{ID}}<C_E$. As a consequence, we also obtain the first example of strict superadditivity of the identification capacity $C_{\mathrm{ID}}$.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-12 in math.IT).
Categorie arXiv: Quantum Physics (quant-ph) ; Information Theory (cs.IT); Metric Geometry (math.MG).
Pagina del lavoro: https://arxiv.org/abs/2608.11000 — 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-19T06:22:36.029Z dalla pagina https://arxiv.org/catchup/math.IT/2026-08-12?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).