Abelian Group Codes for Classical-Quantum Channels: One-Shot and Asymptotic Rate Bounds
IEEE Transactions on Information Theory · 2026-06 · 72 (6) · 4056-4072
DOI: 10.1109/tit.2026.3687161 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Information Theory, 2026-06. Verfasst von James Pang und 2 weiteren Autor:innen. Die Arbeit nennt 49 Literaturangaben. Gefördert von: NSF.
Abstract (Originalsprache)
We study the problem of transmission of information over classical-quantum (CQ) channels in the one-shot regime where the underlying codes are constrained to be shifted group codes . Given a group $G$ , a group code of length $n$ is a subgroup of $G^{n}$ . In the achievability part, we introduce a new collection of input probability distributions that incorporates the encoding homomorphism and the underlying channel law. Using a random coding argument, we characterize the performance of group codes in terms of hypothesis testing relative-entropic quantities. In the converse part, we establish bounds by leveraging a hypothesis testing-based approach. Furthermore, we apply the one-shot result to the asymptotic stationary memoryless setting, and establish a single-letter lower bound on the group capacity of a CQ channel. Moreover, we derive a matching upper bound on the asymptotic group capacity.
Förderung
- NSF
Zitieren
APA
Pang, J., Pradhan, S. S., & Mahdavifar, H. (2026). Abelian Group Codes for Classical-Quantum Channels: One-Shot and Asymptotic Rate Bounds. IEEE Transactions on Information Theory, 72(6), 4056-4072. https://doi.org/10.1109/tit.2026.3687161
Vancouver
Pang J, Pradhan SS, Mahdavifar H. Abelian Group Codes for Classical-Quantum Channels: One-Shot and Asymptotic Rate Bounds. IEEE Transactions on Information Theory. 2026;72(6):4056-4072. doi:10.1109/tit.2026.3687161
BibTeX
@article{Pang2026,
author = {Pang, James and Pradhan, S. Sandeep and Mahdavifar, Hessam},
title = {Abelian Group Codes for Classical-Quantum Channels: One-Shot and Asymptotic Rate Bounds},
journal = {IEEE Transactions on Information Theory},
year = {2026},
volume = {72},
number = {6},
pages = {4056--4072},
doi = {10.1109/tit.2026.3687161}
}
EUVIMED