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

IEEE International Symposium on Information Theory (ISIT)

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

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

Published Jul 7, 2024• 1 citation
Publisher

Abstract

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.

DOI
10.1109/isit57864.2024.10619417

Related papers

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

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

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.

arXiv:2406.13243•IEEE Transactions on Information Theory•Apr 23, 2026•0 citations

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

Converse Bounds for Classical Communication Over Quantum Broadcast Channels and Quantum Multi-Access Channels

Wei Dong Xie, Xin Wang, Runyao Duan

We explore the classical communication over quantum channels with one sender and two receivers, or with two senders and one receiver, in both one-shot and asymptotic regimes. First, for the quantum broadcast channel (QBC) and the quantum multi-access channel (QMAC), we study the classical communication assisted by no-signalling and positive-partial-transpose-preserving codes, and obtain efficiently computable one-shot bounds to assess the performance of classical communication. Second, we consider the asymptotic communication capability of communication over the QBC and QMAC. We derive an efficiently computable strong converse bound for the capacity region, which behaves better than the previous semidefinite programming strong converse bound for point-to-point channels. Third, we obtain a converse bound on the one-shot capacity region based on the hypothesis testing divergence between the given channel and a certain class of subchannels. As applications, we analyze the communication performance for some basic network channels, including the classical broadcast channels and a specific class of quantum broadcast channels.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2018•4 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

Converse bounds for classical communication over quantum networks

Wei Dong Xie, Xin Wang, Runyao Duan

We explore the classical communication over quantum channels with one sender and two receivers, or with two senders and one receiver, First, for the quantum broadcast channel (QBC) and the quantum multi-access channel (QMAC), we study the classical communication assisted by non-signalling and positive-partial-transpose-preserving codes, and obtain efficiently computable one-shot bounds to assess the performance of classical communication. Second, we consider the asymptotic communication capability of communication over the QBC and QMAC. We derive an efficiently computable strong converse bound for the capacity region, which behaves better than the previous semidefinite programming strong converse bound for point-to-point channels. Third, we obtain a converse bound on the one-shot capacity region based on the hypothesis testing divergence between the given channel and a certain class of subchannels. As applications, we analyze the communication performance for some basic network channels, including the classical broadcast channels and a specific class of quantum broadcast channels.

arXiv:1712.05637•Dec 15, 2017•6 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
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.
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.
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 explore the classical communication over quantum channels with one sender and two receivers, or with two senders and one receiver, in both one-shot and asymptotic regimes. First, for the quantum broadcast channel (QBC) and the quantum multi-access channel (QMAC), we study the classical communication assisted by no-signalling and positive-partial-transpose-preserving codes, and obtain efficiently computable one-shot bounds to assess the performance of classical communication. Second, we consider the asymptotic communication capability of communication over the QBC and QMAC. We derive an efficiently computable strong converse bound for the capacity region, which behaves better than the previous semidefinite programming strong converse bound for point-to-point channels. Third, we obtain a converse bound on the one-shot capacity region based on the hypothesis testing divergence between the given channel and a certain class of subchannels. As applications, we analyze the communication performance for some basic network channels, including the classical broadcast channels and a specific class of quantum broadcast channels.
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 explore the classical communication over quantum channels with one sender and two receivers, or with two senders and one receiver, First, for the quantum broadcast channel (QBC) and the quantum multi-access channel (QMAC), we study the classical communication assisted by non-signalling and positive-partial-transpose-preserving codes, and obtain efficiently computable one-shot bounds to assess the performance of classical communication. Second, we consider the asymptotic communication capability of communication over the QBC and QMAC. We derive an efficiently computable strong converse bound for the capacity region, which behaves better than the previous semidefinite programming strong converse bound for point-to-point channels. Third, we obtain a converse bound on the one-shot capacity region based on the hypothesis testing divergence between the given channel and a certain class of subchannels. As applications, we analyze the communication performance for some basic network channels, including the classical broadcast channels and a specific class of quantum broadcast channels.
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.