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

Quantum Information Processing

The private classical capacity region of classical–quantum broadcasting channel with three receivers

Fangyuan Chen, Xiaomin Liu, Zhengjun Xi

Published Oct 27, 2025• 0 citations
Publisher
DOI
10.1007/s11128-025-04970-9

Related papers

Three-Receiver Quantum Broadcast Channels: Classical Communication with Quantum Non-unique Decoding

Farzin Salek, Patrick M. Hayden, Masahito Hayashi

arXiv:2406.09854•Annales Henri Poincaré•Jun 30, 2025•2 citations

An achievable rate for private classical information over a quantum broadcast channel

Alireza Nadem Ghazvini, Seyed Vahab Al‐Din Makki, Shahpoor Alirezaee

The rate region for transmission of classical information over a quantum broadcast channel and an inner bound for the rate of transmission of private classical information over a single-user quantum channel have been achieved in the previous paper. In this work, we extended the proofs of them to obtain an achievable private classical capacity for a two receivers quantum broadcast channel.

International Journal of Quantum Information•Feb 1, 2015•1 citation

Capacity Bounds for Broadcast Channels With Confidential Messages

Jin Xu, Yi Cao, Biao Chen

This paper studies capacity bounds for discrete memoryless broadcast channels with confidential messages. Two private messages as well as a common message are transmitted; the common message is to be decoded by both receivers, while each private message is only for its intended receiver. In addition, each private message is to be kept secret from the unintended receiver where secrecy is measured by equivocation. Both inner and outer bounds are proposed to the rate equivocation region for broadcast channels with confidential messages. The proposed inner bound generalizes Csiszar and Korner's rate equivocation region for broadcast channels with a single confidential message, Liu 's achievable rate region for broadcast channels with perfect secrecy, Marton's and Gel'fand-Pinsker's achievable rate region for general broadcast channels. The proposed outer bounds, together with the inner bound, help establish the rate equivocation region of several classes of discrete memoryless broadcast channels with confidential messages, including the less noisy, deterministic, and semideterministic broadcast channels. Furthermore, specializing to the general broadcast channel by removing the confidentiality constraint, the proposed outer bounds reduce to new capacity outer bounds for the discrete memory broadcast channel.

arXiv:0805.4374•IEEE Transactions on Information Theory•Sep 16, 2009•82 citations

Capacity Regions for Compound Quantum Broadcast Channels with Confidential Messages

Holger Boche, Gisbert Janßen, Sajad Saeedinaeeni

•Jan 1, 2020•0 citations

Capacity Regions for Broadcast Channels With Degraded Message Sets and Message Cognition Under Different Secrecy Constraints.

Ahmed S. Mansour, Rafael F. Schaefer, Holger Boche

This paper considers a three-receiver broadcast channel with degraded message sets and message cognition. The model consists of a common message for all three receivers, a private common message for only two receivers and two additional private messages for these two receivers, such that each receiver is only interested in one message, while being fully cognizant of the other one. First, this model is investigated without any secrecy constraints, where the capacity region is established. This result implies that the straightforward extension of K\orner and Marton inner bound to the investigated scenario is optimal. In particular, this agrees with Nair and Wang result, which states that the idea of indirect decoding -introduced to improve K\orner and Marton inner bound- does not provide a better region for this scenario. Further, some secrecy constraints are introduced by letting the private messages to be confidential ones. Two different secrecy criteria are considered: joint secrecy and individual secrecy. For both criteria, a general achievable rate region is provided, in addition to establishing the secrecy capacity regions, if the two legitimate receivers are more capable than the eavesdropper. The established capacity regions indicate that the individual secrecy criterion can provide a larger capacity region as compared to the joint one, because the cognizant messages can be used as a secret keys for the other messages. Moreover, the joint secrecy capacity is established for a more general class of more capable channels, where only one of the two legitimate receivers is more capable than the eavesdropper by proving the optimality of the principle of indirect decoding introduced by Nair and El Gamal for this class of channels. This result is in contrast with the non-secrecy case, where the indirect decoding does not provide any gain.

•Jan 19, 2015•5 citations

The broadcast classical–quantum capacity region of a two-phase bidirectional relaying channel

Holger Boche, Minglai Cai, Christian Deppe

arXiv:1401.3682•Quantum Information Processing•Jul 16, 2015•5 citations
This paper studies capacity bounds for discrete memoryless broadcast channels with confidential messages. Two private messages as well as a common message are transmitted; the common message is to be decoded by both receivers, while each private message is only for its intended receiver. In addition, each private message is to be kept secret from the unintended receiver where secrecy is measured by equivocation. Both inner and outer bounds are proposed to the rate equivocation region for broadcast channels with confidential messages. The proposed inner bound generalizes Csiszar and Korner's rate equivocation region for broadcast channels with a single confidential message, Liu 's achievable rate region for broadcast channels with perfect secrecy, Marton's and Gel'fand-Pinsker's achievable rate region for general broadcast channels. The proposed outer bounds, together with the inner bound, help establish the rate equivocation region of several classes of discrete memoryless broadcast channels with confidential messages, including the less noisy, deterministic, and semideterministic broadcast channels. Furthermore, specializing to the general broadcast channel by removing the confidentiality constraint, the proposed outer bounds reduce to new capacity outer bounds for the discrete memory broadcast channel.
This paper considers a three-receiver broadcast channel with degraded message sets and message cognition. The model consists of a common message for all three receivers, a private common message for only two receivers and two additional private messages for these two receivers, such that each receiver is only interested in one message, while being fully cognizant of the other one. First, this model is investigated without any secrecy constraints, where the capacity region is established. This result implies that the straightforward extension of K\orner and Marton inner bound to the investigated scenario is optimal. In particular, this agrees with Nair and Wang result, which states that the idea of indirect decoding -introduced to improve K\orner and Marton inner bound- does not provide a better region for this scenario. Further, some secrecy constraints are introduced by letting the private messages to be confidential ones. Two different secrecy criteria are considered: joint secrecy and individual secrecy. For both criteria, a general achievable rate region is provided, in addition to establishing the secrecy capacity regions, if the two legitimate receivers are more capable than the eavesdropper. The established capacity regions indicate that the individual secrecy criterion can provide a larger capacity region as compared to the joint one, because the cognizant messages can be used as a secret keys for the other messages. Moreover, the joint secrecy capacity is established for a more general class of more capable channels, where only one of the two legitimate receivers is more capable than the eavesdropper by proving the optimality of the principle of indirect decoding introduced by Nair and El Gamal for this class of channels. This result is in contrast with the non-secrecy case, where the indirect decoding does not provide any gain.