Non-Local Network Coding in Interference Channels
- URL: http://arxiv.org/abs/2003.11867v2
- Date: Tue, 13 Oct 2020 02:09:46 GMT
- Title: Non-Local Network Coding in Interference Channels
- Authors: Jiyoung Yun, Ashutosh Rai, and Joonwoo Bae
- Abstract summary: 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.
- Score: 1.433758865948252
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In a network, a channel introduces correlations to the parties that aim to
establish a communication protocol. In this work, we present a framework of
non-local network coding by exploiting a Bell scenario and show the usefulness
of non-local and quantum resources in network coding. 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. It is also shown that, however,
more non-locality does not necessarily imply a higher channel capacity. The
framework can be generally applied to network communication protocols.
Related papers
- Hierarchical certification of nonclassical network correlations [50.32788626697182]
We derive linear and nonlinear Bell-like inequalities for networks, whose violation certifies the absence of a minimum number of classical sources in them.
We insert this assumption, which leads to results more amenable to certification in experiments.
arXiv Detail & Related papers (2023-06-27T18:00:01Z) - Non-Local and Quantum Advantages in Network Coding for Multiple Access
Channels [1.6114012813668934]
We study entanglement-assisted communication over classical network channels.
We develop a framework for n-senders and 1-receiver multiple access channels based on nonlocal games.
arXiv Detail & Related papers (2023-04-21T07:54:52Z) - No graph state is preparable in quantum networks with bipartite sources
and no classical communication [0.0]
We show that graph states of an arbitrary prime local dimension known for their numerous applications in quantum information cannot be generated in a quantum network.
We then generalise our result to arbitrary quantum states that are sufficiently close to graph states.
arXiv Detail & Related papers (2022-08-25T13:59:48Z) - Persistency of non-n-local correlations in noisy linear networks [0.0]
Linear n-local networks are compatible with quantum repeaters based entanglement distribution protocols.
Error in entanglement generation, communication over noisy quantum channels and imperfections in measurements result in decay of quantumness across such networks.
arXiv Detail & Related papers (2022-08-14T14:47:07Z) - A scheme for multipartite entanglement distribution via separable
carriers [68.8204255655161]
We develop a strategy for entanglement distribution via separable carriers that can be applied to any number of network nodes.
We show that our protocol results in multipartite entanglement, while the carrier mediating the process is always in a separable state with respect to the network.
arXiv Detail & Related papers (2022-06-20T10:50:45Z) - 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) - Genuine network quantum nonlocality and self-testing [0.0]
We define a notion of genuine network quantum nonlocality.
We show several examples of correlations that are genuine network nonlocal.
In particular, we present an example of quantum self-testing which relies on the network structure.
arXiv Detail & Related papers (2021-05-26T06:05:22Z) - Full network nonlocality [68.8204255655161]
We introduce the concept of full network nonlocality, which describes correlations that necessitate all links in a network to distribute nonlocal resources.
We show that the most well-known network Bell test does not witness full network nonlocality.
More generally, we point out that established methods for analysing local and theory-independent correlations in networks can be combined in order to deduce sufficient conditions for full network nonlocality.
arXiv Detail & Related papers (2021-05-19T18:00:02Z) - 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)
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.