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:2201.11899

Private Classical Communication over Quantum Multiple-Access Channels

Rémi A. Chou

Published Jan 28, 2022• 0 citations
arXivHTMLPDF

Abstract

We study private classical communication over quantum multiple-access channels. For an arbitrary number of transmitters, we derive a regularized expression of the capacity region. In the case of degradable channels, we establish a single-letter expression for the best achievable sum-rate and prove that this quantity also corresponds to the best achievable sum-rate for quantum communication over degradable quantum multiple-access channels. In our achievability result, we decouple the reliability and privacy constraints, which are handled via source coding with quantum side information and universal hashing, respectively. Hence, we also establish that the multi-user coding problem under consideration can be handled solely via point-to-point coding techniques. As a by-product of independent interest, we derive a distributed leftover hash lemma against quantum side information that ensures privacy in our achievability result.

DOI
10.48550/arxiv.2201.11899

Related papers

Private Classical Communication Over Quantum Multiple-Access Channels

Rémi A. Chou

We study private classical communication over quantum multiple-access channels. For an arbitrary number of transmitters, we derive a regularized expression of the capacity region. In the case of degradable channels, we establish a single-letter expression for the best achievable sum-rate and prove that this quantity also corresponds to the best achievable sum-rate for quantum communication over degradable quantum multiple-access channels. In our achievability result, we decouple the reliability and privacy constraints, which are handled via source coding with quantum side information and universal hashing, respectively. Hence, we also establish that the multi-user coding problem under consideration can be handled solely via point-to-point coding techniques. As a by-product of independent interest, we derive a distributed leftover hash lemma against quantum side information that ensures privacy in our achievability result.

IEEE Transactions on Information Theory•Nov 23, 2021•11 citations

Private Classical Communication over Quantum Multiple-Access Channels

Rémi A. Chou

We study private classical communication over quantum multiple-access channels. For an arbitrary number of transmitters, we derive a regularized expression of the capacity region. In the case of degradable channels, we establish a single-letter expression for the best achievable sum-rate and prove that this quantity also corresponds to the best achievable sum-rate for quantum communication over degradable quantum multiple-access channels. Our achievability result decouples the reliability and privacy constraints, which are handled via distributed source coding with quantum side information at the receiver and distributed hashing, respectively. As a by-product of independent interest, we derive a distributed leftover hash lemma against quantum side information that ensures privacy in our achievability result.

IEEE International Symposium on Information Theory (ISIT)•Jul 12, 2021•1 citation

Keyless Covert Communication Over Quantum MACs with General Message Sets

Hassan ZivariFard, Xiaodong Wang

We study covert classical communication over quantum multiple-access channels (MACs) with general message sets. Specifically, we consider a fully quantum MAC with arbitrary message sets and an arbitrary number of transmitters. We demonstrate the feasibility of achieving a positive covert rate over this channel and establish general one-shot and asymptotic achievable rate regions. For classical-quantum MACs with general message sets, we establish the covert capacity, when the transmitters are restricted to deterministic encoding. Our result recovers, as a special case, known results for classical communication over classical MACs with general message sets, covert communication of a classical message over a classical channel with two transmitters, and classical communication over quantum MACs. We provide three examples of MACs to which our results can be applied, either directly or indirectly, to achieve positive covert rates. Specifically, we first study covert communication over a finite-dimensional MAC with a helper. We then analyze a classical Gaussian MAC with a helper and derive its covert capacity. Finally, we extend the analysis to a single-mode bosonic MAC with a helper and show that positive covert rates can also be achieved in this setting. To the best of our knowledge, this is the first work to achieve positive-rate covert communication over both classical and quantum MACs.

cs.ITCross-listedarXiv:2607.08898•Jul 13, 2026•0 citations

Private Classical Information over a Quantum Multiple Access Channel: One-Shot Secrecy Rate Region

Hadi Aghaee, Bahareh Akhbari

In this paper, the problem of private communication of classical messages over a quantum multiple access channel under one-shot setting is studied. In this regard, we first introduce general quantum multiple access wiretap channel, and then we calculate an achievable secrecy rate region for the main channel. The encoding process follows the combination of the superposition and Wyner wiretap coding schemes, and the decoding technique is based on the simultaneous decoder and convex splitting. At last, we extend the results to the l-user case.

International Symposium on Telecommunications•Dec 15, 2020•4 citations

Quantum Advantage in Multiple Access Wiretap Channels with Entangled Transmitters

Hassan ZivariFard, Xiaodong Wang

We investigate secure communication over a classical multiple-access wiretap channel (MAC-WTC), specifically exploring the benefit of shared entanglement between the transmitters. Under the strict semantic security criterion, we derive an achievable rate region and a regularized expression for the secrecy capacity. We further establish a single-letter upper bound on the secure capacity of the MAC-WTC with entangled transmitters. Our results demonstrate that entanglement strictly enlarges the secrecy capacity of MAC-WTC compared to sharing only classical correlated randomness, a finding we illustrate using a pseudo-telepathy game example. Finally, we establish new strong soft-covering lemmas for the output statistics of multipleaccess channels (MACs) with entangled transmitters. Our results generalize existing results for non-entangled systems.

cs.ITCross-listedarXiv:2609.06808•IEEE Transactions on Information Theory•Sep 8, 2026•0 citations

Covert Communication Over a Quantum MAC with a Helper

Hassan ZivariFard, Rémi A. Chou, Xiaodong Wang

We study covert classical communication over a quantum multiple-access channel (MAC) with a helper. Specifically, we consider three transmitters, where one transmitter helps the other two transmitters communicate covertly with a receiver. We demonstrate the feasibility of achieving a positive covert rate over this channel and establish an achievable rate region. Our result recovers as a special case known results for classical communication over classical MACs with a degraded message set, classical communication over quantum MACs, and classical communication over MACs with a helper. To the best of our knowledge, our result is the first to achieve covert communication with positive rates over both classical and quantum MACs.

arXiv:2504.18747•IEEE International Symposium on Information Theory (ISIT)•Jun 22, 2025•2 citations
We study private classical communication over quantum multiple-access channels. For an arbitrary number of transmitters, we derive a regularized expression of the capacity region. In the case of degradable channels, we establish a single-letter expression for the best achievable sum-rate and prove that this quantity also corresponds to the best achievable sum-rate for quantum communication over degradable quantum multiple-access channels. In our achievability result, we decouple the reliability and privacy constraints, which are handled via source coding with quantum side information and universal hashing, respectively. Hence, we also establish that the multi-user coding problem under consideration can be handled solely via point-to-point coding techniques. As a by-product of independent interest, we derive a distributed leftover hash lemma against quantum side information that ensures privacy in our achievability result.
We study private classical communication over quantum multiple-access channels. For an arbitrary number of transmitters, we derive a regularized expression of the capacity region. In the case of degradable channels, we establish a single-letter expression for the best achievable sum-rate and prove that this quantity also corresponds to the best achievable sum-rate for quantum communication over degradable quantum multiple-access channels. In our achievability result, we decouple the reliability and privacy constraints, which are handled via source coding with quantum side information and universal hashing, respectively. Hence, we also establish that the multi-user coding problem under consideration can be handled solely via point-to-point coding techniques. As a by-product of independent interest, we derive a distributed leftover hash lemma against quantum side information that ensures privacy in our achievability result.
We study private classical communication over quantum multiple-access channels. For an arbitrary number of transmitters, we derive a regularized expression of the capacity region. In the case of degradable channels, we establish a single-letter expression for the best achievable sum-rate and prove that this quantity also corresponds to the best achievable sum-rate for quantum communication over degradable quantum multiple-access channels. Our achievability result decouples the reliability and privacy constraints, which are handled via distributed source coding with quantum side information at the receiver and distributed hashing, respectively. As a by-product of independent interest, we derive a distributed leftover hash lemma against quantum side information that ensures privacy in our achievability result.
We study covert classical communication over quantum multiple-access channels (MACs) with general message sets. Specifically, we consider a fully quantum MAC with arbitrary message sets and an arbitrary number of transmitters. We demonstrate the feasibility of achieving a positive covert rate over this channel and establish general one-shot and asymptotic achievable rate regions. For classical-quantum MACs with general message sets, we establish the covert capacity, when the transmitters are restricted to deterministic encoding. Our result recovers, as a special case, known results for classical communication over classical MACs with general message sets, covert communication of a classical message over a classical channel with two transmitters, and classical communication over quantum MACs. We provide three examples of MACs to which our results can be applied, either directly or indirectly, to achieve positive covert rates. Specifically, we first study covert communication over a finite-dimensional MAC with a helper. We then analyze a classical Gaussian MAC with a helper and derive its covert capacity. Finally, we extend the analysis to a single-mode bosonic MAC with a helper and show that positive covert rates can also be achieved in this setting. To the best of our knowledge, this is the first work to achieve positive-rate covert communication over both classical and quantum MACs.
In this paper, the problem of private communication of classical messages over a quantum multiple access channel under one-shot setting is studied. In this regard, we first introduce general quantum multiple access wiretap channel, and then we calculate an achievable secrecy rate region for the main channel. The encoding process follows the combination of the superposition and Wyner wiretap coding schemes, and the decoding technique is based on the simultaneous decoder and convex splitting. At last, we extend the results to the l-user case.
We investigate secure communication over a classical multiple-access wiretap channel (MAC-WTC), specifically exploring the benefit of shared entanglement between the transmitters. Under the strict semantic security criterion, we derive an achievable rate region and a regularized expression for the secrecy capacity. We further establish a single-letter upper bound on the secure capacity of the MAC-WTC with entangled transmitters. Our results demonstrate that entanglement strictly enlarges the secrecy capacity of MAC-WTC compared to sharing only classical correlated randomness, a finding we illustrate using a pseudo-telepathy game example. Finally, we establish new strong soft-covering lemmas for the output statistics of multipleaccess channels (MACs) with entangled transmitters. Our results generalize existing results for non-entangled systems.
We study covert classical communication over a quantum multiple-access channel (MAC) with a helper. Specifically, we consider three transmitters, where one transmitter helps the other two transmitters communicate covertly with a receiver. We demonstrate the feasibility of achieving a positive covert rate over this channel and establish an achievable rate region. Our result recovers as a special case known results for classical communication over classical MACs with a degraded message set, classical communication over quantum MACs, and classical communication over MACs with a helper. To the best of our knowledge, our result is the first to achieve covert communication with positive rates over both classical and quantum MACs.