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 Transactions on Information Theory

Classical Communication Over Quantum Multiple-Access Channel With Unreliable Entanglement Assistance

Xiaomin Liu, Zhengjun Xi

Published Apr 2, 2026• 0 citations
Publisher

Abstract

We study classical communication over quantum multiple-access channels and their wiretap counterparts with unreliable entanglement assistance. Using a robust superposition coding scheme, we characterize the trade-off between baseline rates that are guaranteed without entanglement and additional rates achievable when entanglement is available. We establish a regularized characterization of the classical capacity region for the quantum multiple-access channel and extend it to regularized secrecy capacity regions under two models: entanglement loss and interception. Specifically, for the class of entanglement-breaking channels, we demonstrate that these regularized regions reduce to computable single-letter formulas.

DOI
10.1109/tit.2026.3680133

Related papers

Secure Communication with Unreliable Entanglement Assistance

Meir Lederman, Uzi Pereg

Secure communication is considered with unreliable entanglement assistance, where the adversary may intercept the legitimate receiver's entanglement resource before communication takes place. The communication setting of unreliable assistance, without security aspects, was originally motivated by the extreme photon loss in practical communication systems. The operational principle is to adapt the transmission rate to the availability of entanglement assistance, without resorting to feedback and repetition. Here, we require secrecy as well. An achievable secrecy rate region is derived for general quantum wiretap channels, and a multi-letter secrecy capacity formula for the special class of degraded channels.

arXiv:2401.12861•IEEE International Symposium on Information Theory (ISIT)•Jul 7, 2024•9 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•1 citation

Entanglement-assisted capacity regions and protocol designs for quantum multiple-access channels

Haowei Shi, Min-Hsiu Hsieh, Saikat Guha +2 more

Abstract We solve the entanglement-assisted (EA) classical capacity region of quantum multiple-access channels (MACs) with an arbitrary number of senders. As an example, we consider the bosonic thermal-loss MAC and solve the one-shot capacity region enabled by an entanglement source composed of sender-receiver pairwise two-mode squeezed vacuum states. The EA capacity region is strictly larger than the capacity region without entanglement-assistance. With two-mode squeezed vacuum states as the source and phase modulation as the encoding, we also design practical receiver protocols to realize the entanglement advantages. Four practical receiver designs, based on optical parametric amplifiers, are given and analyzed. In the parameter region of a large noise background, the receivers can enable a simultaneous rate advantage of 82.0% for each sender. Due to teleportation and superdense coding, our results for EA classical communication can be directly extended to EA quantum communication at half of the rates. Our work provides a unique and practical network communication scenario where entanglement can be beneficial.

arXiv:2101.12173•npj Quantum Information•May 19, 2021•32 citations

The Multiple- Access Channel with Entangled and Conferencing Transmitters

Uzi Pereg, Christian Deppe, Holger Boche

Communication over a multiple-access channel (MAC) with entanglement assisted and conferencing transmitters is considered, where the transmitters can also communicate with each other over rate-limited links. We fully characterize the capacity region for the MAC with entangled transmitters and classical conferencing. We also introduce a quantum conferencing protocol. For the MAC with entangled transmitters and quantum conferencing, we determine a achievable region. This region is generally larger than the capacity region for the MAC with entangled transmitters and classical conferencing. Using superdense coding, entanglement can double the conferencing rate. We continue to discuss potential applications of cooperation between the transmitters for the future 6G system. This is only a short abstract. The long version with all proofs can be found on arxiv [l ],

IEEE Globecom Workshops (GC Wkshps)•Dec 4, 2023•2 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•5 citations

Communication over entanglement-breaking channels with unreliable entanglement assistance

Uzi Pereg

Entanglement assistance can improve communication rates significantly. Yet its generation is susceptible to failure. The unreliable assistance model accounts for those challenges. Previous work provided an asymptotic formula that outlined the tradeoff between the unassisted and excess rates from entanglement assistance. We derive a full characterization for entanglement-breaking channels and show that combining entanglement-assisted and unassisted coding is suboptimal. From a networking perspective, this finding is nontrivial and highlights a quantum behavior arising from superposition.

arXiv:2305.17692•Physical Review A•Oct 23, 2023•8 citations
We study classical communication over quantum multiple-access channels and their wiretap counterparts with unreliable entanglement assistance. Using a robust superposition coding scheme, we characterize the trade-off between baseline rates that are guaranteed without entanglement and additional rates achievable when entanglement is available. We establish a regularized characterization of the classical capacity region for the quantum multiple-access channel and extend it to regularized secrecy capacity regions under two models: entanglement loss and interception. Specifically, for the class of entanglement-breaking channels, we demonstrate that these regularized regions reduce to computable single-letter formulas.
Secure communication is considered with unreliable entanglement assistance, where the adversary may intercept the legitimate receiver's entanglement resource before communication takes place. The communication setting of unreliable assistance, without security aspects, was originally motivated by the extreme photon loss in practical communication systems. The operational principle is to adapt the transmission rate to the availability of entanglement assistance, without resorting to feedback and repetition. Here, we require secrecy as well. An achievable secrecy rate region is derived for general quantum wiretap channels, and a multi-letter secrecy capacity formula for the special class of degraded channels.
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.
Abstract We solve the entanglement-assisted (EA) classical capacity region of quantum multiple-access channels (MACs) with an arbitrary number of senders. As an example, we consider the bosonic thermal-loss MAC and solve the one-shot capacity region enabled by an entanglement source composed of sender-receiver pairwise two-mode squeezed vacuum states. The EA capacity region is strictly larger than the capacity region without entanglement-assistance. With two-mode squeezed vacuum states as the source and phase modulation as the encoding, we also design practical receiver protocols to realize the entanglement advantages. Four practical receiver designs, based on optical parametric amplifiers, are given and analyzed. In the parameter region of a large noise background, the receivers can enable a simultaneous rate advantage of 82.0% for each sender. Due to teleportation and superdense coding, our results for EA classical communication can be directly extended to EA quantum communication at half of the rates. Our work provides a unique and practical network communication scenario where entanglement can be beneficial.
Communication over a multiple-access channel (MAC) with entanglement assisted and conferencing transmitters is considered, where the transmitters can also communicate with each other over rate-limited links. We fully characterize the capacity region for the MAC with entangled transmitters and classical conferencing. We also introduce a quantum conferencing protocol. For the MAC with entangled transmitters and quantum conferencing, we determine a achievable region. This region is generally larger than the capacity region for the MAC with entangled transmitters and classical conferencing. Using superdense coding, entanglement can double the conferencing rate. We continue to discuss potential applications of cooperation between the transmitters for the future 6G system. This is only a short abstract. The long version with all proofs can be found on arxiv [l ],
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.
Entanglement assistance can improve communication rates significantly. Yet its generation is susceptible to failure. The unreliable assistance model accounts for those challenges. Previous work provided an asymptotic formula that outlined the tradeoff between the unassisted and excess rates from entanglement assistance. We derive a full characterization for entanglement-breaking channels and show that combining entanglement-assisted and unassisted coding is suboptimal. From a networking perspective, this finding is nontrivial and highlights a quantum behavior arising from superposition.