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

International Conference on Computer, Information and Telecommunication Systems

Entanglement-Enabled Communication for the Internet of Things

Janis Nötzel, Stephen DiAdamo

Published Oct 1, 2020• 12 citations
Publisher

Abstract

We consider an N-user multiple-access channel (MAC) with a varying channel state. The senders receive partial state information, but cannot communicate amongst reach other. This particular channels rate region vanishes asymptotically with a growing number of users in the sense of an exponential bound on the sum rate. However, when pre-established quantum entanglement is shared between the senders, the sum rate stays at a constant positive number. Thus a beneficial impact of entanglement-modulated coding for multi-access scenarios where many senders attempt to reach one receiver is demonstrated, a scenario with an increased likelihood in the internet of things.

DOI
10.1109/cits49457.2020.9232550

Related papers

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•26 citations

Entanglement-Enabled Communication

Janis Nötzel

We introduce and analyse a multiple-access channel with two senders and one receiver, in the presence of i.i.d. noise coming from the environment. Partial side information about the environmental states allows the senders to modulate their signals accordingly. An adversarial jammer with its own access to information on environmental states and the modulation signals can jam a fraction of the transmissions. Our results show that for many choices of the system parameters, entanglement shared between the two senders allows them to communicate at non-zero rates with the receiver, while for the same parameters the system forbids any communication without entanglement-assistance, even if the senders have access to common randomness (local correlations).

International Conference on Computer, Information and Telecommunication Systems•Oct 1, 2020•1 citation

Playing games with multiple access channels

Felix Leditzky, Mohammad A. Alhejji, Joshua Levin +1 more

Communication networks have multiple users, each sending and receiving messages. A multiple access channel (MAC) models multiple senders transmitting to a single receiver, such as the uplink from many mobile phones to a single base station. The optimal performance of a MAC is quantified by a capacity region of simultaneously achievable communication rates. We study the two-sender classical MAC, the simplest and best-understood network, and find a surprising richness in both a classical and quantum context. First, we find that quantum entanglement shared between senders can substantially boost the capacity of a classical MAC. Second, we find that optimal performance of a MAC with bounded-size inputs may require unbounded amounts of entanglement. Third, determining whether a perfect communication rate is achievable using finite-dimensional entanglement is undecidable. Finally, we show that evaluating the capacity region of a two-sender classical MAC is in fact NP-hard.

arXiv:1909.02479•Nature Communications•Mar 20, 2020•64 citations

Entanglement-Assisted Bosonic MAC: Achievable Rates and Covert Communication

Yu-Chen Shen, Matthieu R. Bloch

We consider the problem of covert communication over the entanglement-assisted (EA) bosonic multiple access channel (MAC). We derive a closed-form achievable rate region for the general EA bosonic MAC using high-order phase-shift keying (PSK) modulation. Specifically, we demonstrate that in the low-photon regime the capacity region collapses into a rectangle, asymptotically matching the point-to-point capacity as multi-user interference vanishes. We also characterize an achievable covert throughput region, showing that entanglement assistance enables an aggregate throughput scaling of \(O(\sqrt{n} \log n)\) covert bits with the block length $n$ for both senders, surpassing the square-root law as in the point-to-point case. Our analysis reveals that the joint covertness constraint imposes a linear trade-off between the senders throughput.

quant-pharXiv:2601.21869•IEEE International Symposium on Information Theory (ISIT)•Jan 30, 2026•0 citations

Entanglement-Enabled Communication

Janis Nötzel

We introduce and analyse a multiple-access channel with two senders and one receiver, in the presence of i.i.d. noise coming from the environment. Partial side information about the environmental states allows the senders to modulate their signals accordingly. An adversarial jammer with its own access to information on environmental states and the modulation signals can jam a fraction of the transmissions. Our results show that for many choices of the system parameters, entanglement shared between the two senders allows them to communicate at non-zero rates with the receiver, while for the same parameters the system forbids any communication without entanglement-assistance, even if the senders have access to common randomness (local correlations). A simplified model displaying a similar behaviour but with a compound channel instead of a jammer is outlined to introduce basic aspects of the modeling. We complement these results by demonstrating that there even exist model parameters for which entanglement-assisted communication is no longer possible, but a hypothetical use of nonlocal no-signalling correlations between Alice and Bob could enable them to communicate to Charlie again.

arXiv:1910.03796•IEEE Journal on Selected Areas in Information Theory•Aug 1, 2020•37 citations

The Multiple-Access Channel with Entangled Transmitters

Uzi Pereg, Christian Deppe, Holger Boche

Communication over a classical multiple-access channel (MAC) with entanglement resources is considered, whereby two transmitters share entanglement resources a priori before communication begins. Leditzky et al. (2020) presented an example of a classical MAC, defined in terms of a pseudo telepathy game, such that the sum rate with entangled transmitters is strictly higher than the best achievable sum rate without such resources. Here, we establish inner and outer bounds on the capacity region for the general MAC with entangled transmitters, and show that the previous result can be obtained as a special case. It has long been known that the capacity region of the classical MAC under a message-average error criterion can be strictly larger than with a maximal error criterion (Dueck, 1978). We observe that given entanglement resources, the regions coincide. Furthermore, we address the combined setting of entanglement resources and conferencing, where the transmitters can also communicate with each other over rate-limited links. Using superdense coding, entanglement can double the conferencing rate.

arXiv:2303.10456•Mar 18, 2023•1 citation
We consider an N-user multiple-access channel (MAC) with a varying channel state. The senders receive partial state information, but cannot communicate amongst reach other. This particular channels rate region vanishes asymptotically with a growing number of users in the sense of an exponential bound on the sum rate. However, when pre-established quantum entanglement is shared between the senders, the sum rate stays at a constant positive number. Thus a beneficial impact of entanglement-modulated coding for multi-access scenarios where many senders attempt to reach one receiver is demonstrated, a scenario with an increased likelihood in the internet of things.
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.
We introduce and analyse a multiple-access channel with two senders and one receiver, in the presence of i.i.d. noise coming from the environment. Partial side information about the environmental states allows the senders to modulate their signals accordingly. An adversarial jammer with its own access to information on environmental states and the modulation signals can jam a fraction of the transmissions. Our results show that for many choices of the system parameters, entanglement shared between the two senders allows them to communicate at non-zero rates with the receiver, while for the same parameters the system forbids any communication without entanglement-assistance, even if the senders have access to common randomness (local correlations).
Communication networks have multiple users, each sending and receiving messages. A multiple access channel (MAC) models multiple senders transmitting to a single receiver, such as the uplink from many mobile phones to a single base station. The optimal performance of a MAC is quantified by a capacity region of simultaneously achievable communication rates. We study the two-sender classical MAC, the simplest and best-understood network, and find a surprising richness in both a classical and quantum context. First, we find that quantum entanglement shared between senders can substantially boost the capacity of a classical MAC. Second, we find that optimal performance of a MAC with bounded-size inputs may require unbounded amounts of entanglement. Third, determining whether a perfect communication rate is achievable using finite-dimensional entanglement is undecidable. Finally, we show that evaluating the capacity region of a two-sender classical MAC is in fact NP-hard.
We consider the problem of covert communication over the entanglement-assisted (EA) bosonic multiple access channel (MAC). We derive a closed-form achievable rate region for the general EA bosonic MAC using high-order phase-shift keying (PSK) modulation. Specifically, we demonstrate that in the low-photon regime the capacity region collapses into a rectangle, asymptotically matching the point-to-point capacity as multi-user interference vanishes. We also characterize an achievable covert throughput region, showing that entanglement assistance enables an aggregate throughput scaling of O(nlog⁡n)O(\sqrt{n} \log n)O(n​logn) covert bits with the block length nnn for both senders, surpassing the square-root law as in the point-to-point case. Our analysis reveals that the joint covertness constraint imposes a linear trade-off between the senders throughput.
We introduce and analyse a multiple-access channel with two senders and one receiver, in the presence of i.i.d. noise coming from the environment. Partial side information about the environmental states allows the senders to modulate their signals accordingly. An adversarial jammer with its own access to information on environmental states and the modulation signals can jam a fraction of the transmissions. Our results show that for many choices of the system parameters, entanglement shared between the two senders allows them to communicate at non-zero rates with the receiver, while for the same parameters the system forbids any communication without entanglement-assistance, even if the senders have access to common randomness (local correlations). A simplified model displaying a similar behaviour but with a compound channel instead of a jammer is outlined to introduce basic aspects of the modeling. We complement these results by demonstrating that there even exist model parameters for which entanglement-assisted communication is no longer possible, but a hypothetical use of nonlocal no-signalling correlations between Alice and Bob could enable them to communicate to Charlie again.
Communication over a classical multiple-access channel (MAC) with entanglement resources is considered, whereby two transmitters share entanglement resources a priori before communication begins. Leditzky et al. (2020) presented an example of a classical MAC, defined in terms of a pseudo telepathy game, such that the sum rate with entangled transmitters is strictly higher than the best achievable sum rate without such resources. Here, we establish inner and outer bounds on the capacity region for the general MAC with entangled transmitters, and show that the previous result can be obtained as a special case. It has long been known that the capacity region of the classical MAC under a message-average error criterion can be strictly larger than with a maximal error criterion (Dueck, 1978). We observe that given entanglement resources, the regions coincide. Furthermore, we address the combined setting of entanglement resources and conferencing, where the transmitters can also communicate with each other over rate-limited links. Using superdense coding, entanglement can double the conferencing rate.