Metraipolis › archive › dc_25eeda0bd422

Minimax games for quantum channel discrimination — arXiv:2609.09839

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.09839
License (as archived)
CC0-1.0
Archived
2026-10-16T10:53:30.514Z
SHA-256 of the archived text
9f170d6707b34bd293940155932c862aacc779b045de5813821a2977d02ba932
Stable URL of this page
https://metraipolis.com/documento/dc_25eeda0bd422

How to cite

Minimax games for quantum channel discrimination — arXiv:2609.09839 — arXiv (en), https://arxiv.org/abs/2609.09839 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_25eeda0bd422 (Metraipolis archive dc_25eeda0bd422, sha256 9f170d6707b34bd293940155932c862aacc779b045de5813821a2977d02ba932)
BibTeX
@misc{dc25eeda0bd422,
  title = {Minimax games for quantum channel discrimination — arXiv:2609.09839},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.09839},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_25eeda0bd422; sha256 9f170d6707b34bd293940155932c862aacc779b045de5813821a2977d02ba932},
  year = {2026}
}

Archived text

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

Quantum channel discrimination is a primitive task for identifying, verifying, and benchmarking quantum dynamics. Previous studies have primarily considered either the best-case tester-input setting or the worst-case jammer-input setting. Here, we introduce a game-theoretic framework in which both the tester and jammer control separate inputs. Combining three input structures, characterized by whether the tester and jammer use entangled inputs or IID inputs across channel uses, with four information patterns, determined by the visibility of the jammer's strategy and its knowledge of the true hypothesis, yields twelve game models. We provide exact finite blocklength hypothesis testing characterizations of all twelve models in terms of nine minimax hypothesis testing divergences and derive their asymptotic Stein exponents. Notably, for entangled jammers, neither the visibility of the jammer's strategy nor its knowledge of the true hypothesis affects the asymptotic Stein exponent, whereas the information pattern remains consequential for IID jammers. As an example, we study the discrimination of a general channel from a replacer channel and show that all asymptotic Stein exponents coincide with the same additive, single letter quantity. We further develop a general argument that upgrades achievability results to strong converse results, thereby establishing strong converse properties for several game models, resolving an open problem in composite hypothesis testing posed by Berta et al. [Commun. Math. Phys. 385, 55 (2021)], and strengthening several recent results of Lami [ arXiv:2510.06340 ]. The framework and techniques developed here may support future studies of quantum information tasks involving competing roles.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-10 in math.IT).
Categorie arXiv: Quantum Physics (quant-ph) ; Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2609.09839 — 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-16T09:00:25.858Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-10?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).