Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2406.13243 · IEEE Transactions on Information Theory

Abelian Group Codes for Classical-Quantum Channels: One-Shot and Asymptotic Rate Bounds

James Chin-Jen Pang, S. Sandeep Pradhan, Hessam Mahdavifar

Published Apr 23, 2026• 0 citations
arXivHTMLPDF

Abstract

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 shiftedgroup codes. Given a groupG, a group code of lengthnis a subgroup ofGn. 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 thegroup capacityof a CQ channel. Moreover, we derive a matching upper bound on the asymptotic group capacity.

DOI
10.1109/tit.2026.3687161

Related papers

Abelian Group Codes for Classical and CQ Channel Coding: One-Shot and Asymptotic Rate Bounds

James Chin-Jen Pang, S. Sandeep Pradhan, Hessam Mahdavifar

We study the one-shot channel coding problem over classical and classical-quantum channels, where the underlying codes are constrained to be group codes. In the achievability part, we introduce a new distribution that incorporates the encoding homomorphism and the underlying channel law. Using a random coding argument, we characterize the performance in terms of hypothesis testing relative-entropies. In the converse part, we es-tablish bounds by leveraging a hypothesis testing-based approach. Further we apply the one-shot result to the asymptotic use case and establish the group capacities for both channels.

IEEE International Symposium on Information Theory (ISIT)•Jul 7, 2024•1 citation

One-shot and asymptotic classical capacity in general physical theories

Shintaro Minagawa, Hayato Arai

With the recent development of quantum information theory, some attempts have been made to construct information theory beyond quantum theory. Here, we consider hypothesis-testing relative entropy and one-shot classical capacity, that is, the optimal rate of classical information transmitted by using a single channel under the constraint of a certain error probability, in general physical theories where states and measurements are operationally defined. Then we obtain the upper bound of the one-shot classical capacity by generalizing the method given by Wang and Renner [Phys. Rev. Lett. 108, 200501 (2012)]. Also, we derive the lower bound of the capacity by showing the existence of a good code that can transmit classical information with a certain error probability. Applying the above two bounds, we prove the asymptotic equivalence between classical capacity and hypothesis-testing relative entropy in any general physical theory.

arXiv:2303.04138•Physical Review A•Jun 11, 2024•0 citations

One-Shot Capacity Bounds on the Simultaneous Transmission of Classical and Quantum Information

Farzin Salek, Anurag Anshu, Min-Hsiu Hsieh +2 more

We study the communication capabilities of a quantum channel under the most general channel model known as the one-shot model. Unlike classical channels that can only be used to transmit classical information (bits), a quantum channel can be used for transmission of classical information, quantum information (qubits) and simultaneous transmission of classical and quantum information. In this work, we investigate the one-shot capabilities of a quantum channel for simultaneously transmitting bits and qubits. This problem was studied in the asymptotic regime for a memoryless channel where a regularized characterization of the capacity region was reported. It is known that the transmission of private classical information is closely related to the problem of quantum information transmission. We resort to this idea and find achievable and converse bounds on the simultaneous transmission of the public and private classical information. Then shifting the classical private rate to the quantum information rate leads to a rate region for simultaneous transmission of classical and quantum information. In the case of asymptotic i.i.d. setting, our one-shot result is evaluated to the known results in the literature. Our main tools used in the achievability proofs are position-based decoding and convex-split lemma.

arXiv:1809.07104•IEEE Transactions on Information Theory•Oct 7, 2019•18 citations

Strong converses for classical information transmission and hypothesis testing

Nilanjana Datta, Milán Mosonyi, Min-Hsiu Hsieh +1 more

We obtain lower and upper bounds on the one-shot strong converse capacity for the transmission of classical information through quantum channels, in terms of a generalized relative entropy quantity, namely, the smoothed max-relative entropy. For the case of a memoryless channel, these bounds converge independently to the Holevo capacity, in the limit of asymptotically many uses. We also employ our one-shot result to obtain an upper bound to the strong converse capacity of a channel with long-term memory which can be shown to violate the strong converse property. Finally, we show bounds on the strong converse rate of hypothesis testing in the one-shot scenario, again in terms of the smoothed max-relative entropies.

•Jun 15, 2011•4 citations

One-Shot Entanglement-Assisted Quantum and Classical Communication

Nilanjana Datta, Min-Hsiu Hsieh

We study entanglement-assisted quantum and classical communication over a single use of a quantum channel, which itself can correspond to a finite number of uses of a channel with arbitrarily correlated noise. We obtain characterizations of the corresponding one-shot capacities by establishing upper and lower bounds on them in terms of the difference of two smoothed entropic quantities. In the case of a memoryless channel, the upper and lower bounds converge to the known single-letter formulas for the corresponding capacities, in the limit of asymptotically many uses of it. Our results imply that the difference of two smoothed entropic quantities characterizing the one-shot entanglement-assisted capacities serves as a one-shot analog of the mutual information, since it reduces to the mutual information, between the output of the channel and a system purifying its input, in the asymptotic, memoryless scenario.

arXiv:1105.3321•IEEE Transactions on Information Theory•Nov 21, 2012•55 citations

Finite Blocklength Converse Bounds for Quantum Channels

William Matthews, Stephanie Wehner

We derive upper bounds on the rate of transmission of classical information over quantum channels by block codes with a given blocklength and error probability, for both entanglement-assisted and unassisted codes, in terms of a unifying framework of quantum hypothesis testing with restricted measurements. Our bounds do not depend on any special property of the channel (such as memorylessness) and generalize both a classical converse of Polyanskiy, Poor, and Verdú as well as a quantum converse of Renner and Wang, and have a number of desirable properties. In particular, our bound on entanglement-assisted codes is a semidefinite program and for memoryless channels, its large blocklength limit is the well-known formula for entanglement-assisted capacity due to Bennett, Shor, Smolin, and Thapliyal.

arXiv:1210.4722•IEEE Transactions on Information Theory•Sep 8, 2014•101 citations
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 shiftedgroup codes. Given a groupG, a group code of lengthnis a subgroup ofGn. 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 thegroup capacityof a CQ channel. Moreover, we derive a matching upper bound on the asymptotic group capacity.
We study the one-shot channel coding problem over classical and classical-quantum channels, where the underlying codes are constrained to be group codes. In the achievability part, we introduce a new distribution that incorporates the encoding homomorphism and the underlying channel law. Using a random coding argument, we characterize the performance in terms of hypothesis testing relative-entropies. In the converse part, we es-tablish bounds by leveraging a hypothesis testing-based approach. Further we apply the one-shot result to the asymptotic use case and establish the group capacities for both channels.
With the recent development of quantum information theory, some attempts have been made to construct information theory beyond quantum theory. Here, we consider hypothesis-testing relative entropy and one-shot classical capacity, that is, the optimal rate of classical information transmitted by using a single channel under the constraint of a certain error probability, in general physical theories where states and measurements are operationally defined. Then we obtain the upper bound of the one-shot classical capacity by generalizing the method given by Wang and Renner [Phys. Rev. Lett. 108, 200501 (2012)]. Also, we derive the lower bound of the capacity by showing the existence of a good code that can transmit classical information with a certain error probability. Applying the above two bounds, we prove the asymptotic equivalence between classical capacity and hypothesis-testing relative entropy in any general physical theory.
We study the communication capabilities of a quantum channel under the most general channel model known as the one-shot model. Unlike classical channels that can only be used to transmit classical information (bits), a quantum channel can be used for transmission of classical information, quantum information (qubits) and simultaneous transmission of classical and quantum information. In this work, we investigate the one-shot capabilities of a quantum channel for simultaneously transmitting bits and qubits. This problem was studied in the asymptotic regime for a memoryless channel where a regularized characterization of the capacity region was reported. It is known that the transmission of private classical information is closely related to the problem of quantum information transmission. We resort to this idea and find achievable and converse bounds on the simultaneous transmission of the public and private classical information. Then shifting the classical private rate to the quantum information rate leads to a rate region for simultaneous transmission of classical and quantum information. In the case of asymptotic i.i.d. setting, our one-shot result is evaluated to the known results in the literature. Our main tools used in the achievability proofs are position-based decoding and convex-split lemma.
We obtain lower and upper bounds on the one-shot strong converse capacity for the transmission of classical information through quantum channels, in terms of a generalized relative entropy quantity, namely, the smoothed max-relative entropy. For the case of a memoryless channel, these bounds converge independently to the Holevo capacity, in the limit of asymptotically many uses. We also employ our one-shot result to obtain an upper bound to the strong converse capacity of a channel with long-term memory which can be shown to violate the strong converse property. Finally, we show bounds on the strong converse rate of hypothesis testing in the one-shot scenario, again in terms of the smoothed max-relative entropies.
We study entanglement-assisted quantum and classical communication over a single use of a quantum channel, which itself can correspond to a finite number of uses of a channel with arbitrarily correlated noise. We obtain characterizations of the corresponding one-shot capacities by establishing upper and lower bounds on them in terms of the difference of two smoothed entropic quantities. In the case of a memoryless channel, the upper and lower bounds converge to the known single-letter formulas for the corresponding capacities, in the limit of asymptotically many uses of it. Our results imply that the difference of two smoothed entropic quantities characterizing the one-shot entanglement-assisted capacities serves as a one-shot analog of the mutual information, since it reduces to the mutual information, between the output of the channel and a system purifying its input, in the asymptotic, memoryless scenario.
We derive upper bounds on the rate of transmission of classical information over quantum channels by block codes with a given blocklength and error probability, for both entanglement-assisted and unassisted codes, in terms of a unifying framework of quantum hypothesis testing with restricted measurements. Our bounds do not depend on any special property of the channel (such as memorylessness) and generalize both a classical converse of Polyanskiy, Poor, and Verdú as well as a quantum converse of Renner and Wang, and have a number of desirable properties. In particular, our bound on entanglement-assisted codes is a semidefinite program and for memoryless channels, its large blocklength limit is the well-known formula for entanglement-assisted capacity due to Bennett, Shor, Smolin, and Thapliyal.