aiqbench analysis
This research fully characterizes the capacity region of discrete memoryless multiple access channels when non-signaling assistance is available to all transmitters and receivers, revealing a structural similarity to classical regions but with dependent input distributions. The study establishes that the multiplicative gain in channel capacity from this form of quantum-inspired correlation can reach an extremal value proportional to the number of senders ($K$). These findings advance fundamental information theory by quantifying the theoretical limits of communication networks utilizing non-signaling resources, a key area for future high-density data transmission protocols.
The Capacity Region of the Multiple Access Channel with Non-Signaling Assistance
arXiv:2608.13860v1 Announce Type: cross Abstract: The capacity region of the $K$-sender discrete memoryless multiple access channel (MAC) is fully characterized when non-signaling (NS) assistance is available to all $K$ transmitters and the receiver. It is shown to have the same form as the classical capacity region of the MAC, except that the input distribution is allowed to be arbitrarily dependent across the senders. In particular, the NS-assisted capacity region matches the natural generalization to $K$ senders of an outer bound that was previously established by Fawzi and Ferm\'{e} for $K=2$ senders. Additionally, we provide examples of $K$-sender MACs where the multiplicative gain in capacity from NS-assistance is arbitrarily close to $K$. Combined with an upper bound from prior work, this establishes $K$ as the extremal value of the multiplicative gain from NS-assistance across all $K$-sender MAC settings.
Abstract:The capacity region of the $K$-sender discrete memoryless multiple access channel (MAC) is fully characterized when non-signaling (NS) assistance is available to all $K$ transmitters and the receiver. It is shown to have the same form as the classical capacity region of the MAC, except that the input distribution is allowed to be arbitrarily dependent across the senders. In particular, the NS-assisted capacity region matches the natural generalization to $K$ senders of an outer bound that was previously established by Fawzi and Fermé for $K=2$ senders. Additionally, we provide examples of $K$-sender MACs where the multiplicative gain in capacity from NS-assistance is arbitrarily close to $K$. Combined with an upper bound from prior work, this establishes $K$ as the extremal value of the multiplicative gain from NS-assistance across all $K$-sender MAC settings.
Information Theory (cs.IT); Quantum Physics (quant-ph)
arXiv:2608.13860 [cs.IT]
(or arXiv:2608.13860v1 [cs.IT] for this version)
https://doi.org/10.48550/arXiv.2608.13860 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 229 words
Related coverage

Forbes Asia 100 To Watch 2026
forbes.com · Aug 24, 2026

Vertical Advantage: Transforming Industries with Lakebase and Agentic AI
Databricks · Aug 27, 2026
News Archive 2026
Quantum Computing Report · Jul 25, 2026

How Databricks’ marketers use data 3x more with Genie, an AI analytics assistant
Databricks · Sep 15, 2026