Non-Local and Quantum Advantages in Network Coding for Multiple Access Channels

• URL: http://arxiv.org/abs/2304.10792v2
• Date: Tue, 19 Aug 2025 07:08:43 GMT
• Title: Non-Local and Quantum Advantages in Network Coding for Multiple Access Channels
• Authors: Jiyoung Yun, Seung-Hyun Nam, Hyun-Young Park, Ashutosh Rai, Si-Hyeon Lee, Joonwoo Bae,
• Abstract summary: We consider two-sender, one-receiver communication over a memoryless multiple-access channel without feedback.<n>We present the capacity region when senders employ cooperative encoding with quantum and nonlocal resources.<n>We show that nonlocal and quantum resources for cooperative encoding enable higher sum capacities over local ones.
• Score: 12.798560005546259
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this work, we consider two-sender, one-receiver communication over a discrete memoryless multiple-access channel without feedback, where two senders may cooperate on channel coding by using pre-shared resources, such as shared randomness, quantum states and measurements, or nonlocal correlations. We present the capacity region when senders employ cooperative encoding with quantum and nonlocal resources, extending beyond shared randomness, and derive a sum rate that serves as a lower bound to the sum capacity, the lower bound is computable by exploiting specific strategies. We also compute the sum capacities for two instances. One is when senders apply local resources for cooperative encoding. The other is when senders exploit non-classical resources for encoding against channels constructed by referring to nonlocal games, in this way, correlated noise other than independent errors occurs on codewords. Comparing the exact sum capacities and lower bounds, we show that nonlocal and quantum resources for cooperative encoding enable higher sum capacities over local ones. The Clauser-Horne-Shimony-Holt and magic square games are considered for constructing multiple-access channels, and we demonstrate the usefulness of nonlocal and quantum resources to achieve higher sum capacities.

Related papers

• Optimizing entanglement distribution via noisy quantum channels [44.99833362998488]
  Entanglement distribution is a crucial problem in quantum information science.<n>We investigate strategies for distributing quantum entanglement between two distant parties through noisy quantum channels.
  arXiv  Detail & Related papers  (2025-06-06T13:48:20Z)
• Extendibility limits quantum-secured communication and key distillation [4.079147243688764]
  We study the task of secret-key distillation from bipartite states and point-to-point quantum channels. We extend our formalism to private communication over a quantum channel assisted by forward classical communication.
  arXiv  Detail & Related papers  (2024-10-28T18:00:11Z)
• Unextendible entanglement of quantum channels [4.079147243688764]
  We study the ability of quantum channels to perform quantum communication tasks. A quantum channel can distill a highly entangled state between two parties. We generalize the formalism of $k$-extendibility to bipartite superchannels.
  arXiv  Detail & Related papers  (2024-07-22T18:00:17Z)
• eQMARL: Entangled Quantum Multi-Agent Reinforcement Learning for Distributed Cooperation over Quantum Channels [98.314893665023]
  Quantum computing has sparked a potential synergy between quantum entanglement and cooperation in multi-agent environments.<n>Current state-of-the-art quantum MARL (QMARL) implementations rely on classical information sharing.<n>eQMARL is a distributed actor-critic framework that facilitates cooperation over a quantum channel.
  arXiv  Detail & Related papers  (2024-05-24T18:43:05Z)
• Generative AI for Physical Layer Communications: A Survey [76.61956357178295]
  generative artificial intelligence (GAI) has the potential to enhance the efficiency of digital content production. GAI's capability in analyzing complex data distributions offers great potential for wireless communications. This paper presents a comprehensive investigation of GAI's applications for communications at the physical layer, ranging from traditional issues, including signal classification, channel estimation, and equalization, to emerging topics, such as intelligent reflecting surfaces and joint source channel coding.
  arXiv  Detail & Related papers  (2023-12-09T15:20:56Z)
• The Multiple-Access Channel with Entangled Transmitters [67.92544792239086]
  Communication over a classical multiple-access channel (MAC) with entanglement resources is considered.<n>We establish inner and outer bounds on the capacity region for the general MAC with entangled transmitters.<n>Using superdense coding, entanglement can double the conferencing rate.
  arXiv  Detail & Related papers  (2023-03-18T16:51:08Z)
• Two instances of random access code in the quantum regime [0.09545101073027092]
  We consider two classes of quantum generalisations of Random Access Code (RAC) First class is based on a random access code with quantum inputs and output known as No-Signalling Quantum RAC (NS-QRAC) Second class is based on a random access code with a quantum channel and shared entanglement.
  arXiv  Detail & Related papers  (2022-08-30T17:43:37Z)
• Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders [67.12391801199688]
  We investigate dense coding by imposing various locality restrictions to our decoder. In this task, the sender Alice and the receiver Bob share an entangled state.
  arXiv  Detail & Related papers  (2021-09-26T07:29:54Z)
• Group Fisher Pruning for Practical Network Compression [58.25776612812883]
  We present a general channel pruning approach that can be applied to various complicated structures. We derive a unified metric based on Fisher information to evaluate the importance of a single channel and coupled channels. Our method can be used to prune any structures including those with coupled channels.
  arXiv  Detail & Related papers  (2021-08-02T08:21:44Z)
• Statistical intrusion detection and eavesdropping in quantum channels with coupling: Multiple-preparation and single-preparation methods [2.2469167925905777]
  Non-quantum communications include configurations with multiple-input multiple-output (MIMO) channels. Some associated signal processing tasks consider these channels in a symmetric way, i.e. by assigning the same role to all inputs. We here address asymmetric (blind and non-blind) ones, with emphasis on intrusion detection and additional comments about eavesdropping.
  arXiv  Detail & Related papers  (2021-06-17T07:04:54Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• Computation-aided classical-quantum multiple access to boost network communication speeds [61.12008553173672]
  We quantify achievable quantum communication rates of codes with computation property for a two-sender cq-MAC. We show that it achieves the maximum possible communication rate (the single-user capacity), which cannot be achieved with conventional design.
  arXiv  Detail & Related papers  (2021-05-30T11:19:47Z)
• Distributed Deep Reinforcement Learning for Collaborative Spectrum Sharing [29.23509739013885]
  We discuss the problem of distributed spectrum collaboration without central management under general unknown channels. We combine game-theoretic insights with deep Q-learning to provide a novelally optimal solution to the spectrum collaboration problem.
  arXiv  Detail & Related papers  (2021-04-06T04:33:06Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)
• Overhead for simulating a non-local channel with local channels by quasiprobability sampling [0.8206877486958002]
  We provide a framework for a resource reduction suitable for first-generation quantum devices. This work develops a framework for a resource reduction suitable for first-generation quantum devices.
  arXiv  Detail & Related papers  (2020-06-19T15:04:26Z)
• Decentralized Learning for Channel Allocation in IoT Networks over Unlicensed Bandwidth as a Contextual Multi-player Multi-armed Bandit Game [134.88020946767404]
  We study a decentralized channel allocation problem in an ad-hoc Internet of Things network underlaying on the spectrum licensed to a primary cellular network. Our study maps this problem into a contextual multi-player, multi-armed bandit game, and proposes a purely decentralized, three-stage policy learning algorithm through trial-and-error.
  arXiv  Detail & Related papers  (2020-03-30T10:05:35Z)
• Non-Local Network Coding in Interference Channels [1.433758865948252]
  Two-sender and two-receiver interference channels are considered, for which network coding is characterized by two-input and four-outcome Bell scenarios. It is shown that non-signaling (quantum) correlations lead to strictly higher channel capacities in general than quantum (local) correlations.
  arXiv  Detail & Related papers  (2020-03-26T12:41:14Z)
• Quantum Advantage for Shared Randomness Generation [0.0]
  We show that quantum systems provide an advantage over their classical counterpart. In a resource theoretic set-up, this feature of quantum systems can be interpreted as an advantage in winning a two players co-operative game. Protocols presented here are noise-robust and hence should be realizable with state-of-the-art quantum devices.
  arXiv  Detail & Related papers  (2020-01-07T05:02:51Z)
• Permutation Enhances Classical Communication Assisted by Entangled States [67.12391801199688]
  We show that the capacity satisfies the strong converse property and thus the formula serves as a sharp dividing line between achievable and unachievable rates of communication. As examples, we derive analytically the classical capacity of various quantum channels of interests.
  arXiv  Detail & Related papers  (2020-01-07T01:49:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.