analiza aiqbench
This research identifies a broader class of "game-induced" channels where quantum or no-signaling cooperation strictly increases communication capacity, extending previous findings on pseudo-telepathy games. By decomposing these channels into parallel subchannels with unique optimal input distributions, the study provides a rigorous framework for leveraging nonlocal correlations in interference and multiple access scenarios.
Enhancing Sum Capacity via Quantum and No-Signaling Cooperation Between Transmitters
arXiv:2509.08219v3 Announce Type: replace Abstract: We consider communication over discrete memoryless interference channels or multiple access channels without feedback, where transmitters exploit classical, quantum, or no-signaling cooperation. Previous works have shown that, for channels associated with pseudo-telepathy games, quantum or no-signaling cooperation can increase the sum capacity. However, a full characterization of channels admitting such an improvement remains open. Motivated by common features of previously studied examples, we propose a broader class of game-induced channels. In these channels, each input is a question-answer pair from a nonlocal game. When the inputs satisfy the game's winning condition, the channel has lower conditional output uncertainty, and the channel decomposes into parallel weakly symmetric subchannels with a unique capacity-achieving input distribution. We show that, for this class, quantum or no-signaling cooperation strictly increases the sum capacity whenever the associated game is a quantum or no-signaling pseudo-telepathy game, respectively. The proposed class recovers several previously studied channels and includes new examples.
Abstract:We consider communication over discrete memoryless interference channels or multiple access channels without feedback, where transmitters exploit classical, quantum, or no-signaling cooperation. Previous works have shown that, for channels associated with pseudo-telepathy games, quantum or no-signaling cooperation can increase the sum capacity. However, a full characterization of channels admitting such an improvement remains open. Motivated by common features of previously studied examples, we propose a broader class of game-induced channels. In these channels, each input is a question-answer pair from a nonlocal game. When the inputs satisfy the game's winning condition, the channel has lower conditional output uncertainty, and the channel decomposes into parallel weakly symmetric subchannels with a unique capacity-achieving input distribution. We show that, for this class, quantum or no-signaling cooperation strictly increases the sum capacity whenever the associated game is a quantum or no-signaling pseudo-telepathy game, respectively. The proposed class recovers several previously studied channels and includes new examples.
12 pages, 5 figures. Compared to v2, the definition of a G-game channel has been slightly modified to correct the proof of Proposition 1 (which was Proposition 3 in v2). Accepted for publication in IEEE Journal on Selected Areas in Communications (JSAC)
Quantum Physics (quant-ph); Information Theory (cs.IT)
arXiv:2509.08219 [quant-ph]
(or arXiv:2509.08219v3 [quant-ph] for this version)
Text integral sub licența deschisă a publicației · 208 cuvinte
Subiecte conexe

Digital States 2026: AI Moves From Experiment to Infrastructure
govtech.com · 24 sept. 2026

News
Quantum Computing Report · 25 iul. 2026
The Capacity Region of the Broadcast Channel with Non-Signaling Assistance
arXiv · 31 iul. 2026

BRICS Draws a New Global Line: Full Text of New Delhi Declaration
slguardian.org · 12 sept. 2026