In a network, a channel introduces correlations to the parties that aim to establish a communication protocol. We present a framework of nonlocal network coding by exploiting a Bell scenario and show the usefulness of nonlocal 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 nonsignaling correlations lead to strictly higher channel capacities than quantum correlations in general. This also holds true for quantum and local correlations: network coding with quantum resources shows a strictly higher channel capacity than local ones. It turns out, however, that more nonlocality does not necessarily imply a higher channel capacity. The framework can be generally applied to network communication protocols.
In a network, a channel introduces correlations to the parties that aim to establish a communication protocol. We present a framework of nonlocal network coding by exploiting a Bell scenario and show the usefulness of nonlocal 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 nonsignaling correlations lead to strictly higher channel capacities than quantum correlations in general. This also holds true for quantum and local correlations: network coding with quantum resources shows a strictly higher channel capacity than local ones. It turns out, however, that more nonlocality does not necessarily imply a higher channel capacity. The framework can be generally applied to network communication protocols.
Network information theory establishes communication protocols among multiple senders and multiple receivers in the presence of correlations introduce noise over a network. We here present a framework of non-local network coding of multiple senders whereby network communication capacities improve over their classical counterparts. The framework exploits a Bell scenario and shows the usefulness of non-local and quantum resources in network information theory. Two-sender and two-receiver interference channels are considered in particular, for which network coding is characterized by two-input and four-outcome Bell scenarios. Resources for the network coding are classified 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.
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 preshared 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 nonclassical resources for encoding against channels constructed by referring to nonlocal games; in this way, correlated noise other than independent errors occurs on code words. 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.
In recent years, the study of Bell nonlocality has been generalized to quantum networks, where multiple independent sources distribute physical systems to distant parties who perform local measurements. In this context, a central open question is to identify the minimal network configuration in which quantum resources produce Bell nonlocal correlations. Here we address this question and show that quantum nonlocality is possible in the triangle network where the parties have no input choices and produce only binary-valued outcomes. To do so, we start by identifying a family of target distributions and proving their nonlocality. Next, we construct an explicit quantum model that reproduces the target distributions to machine precision. For this, we develop an efficient method for parameterizing quantum distributions in networks, inspired by the formalism of higher-order quantum operations. When considering the number of observed variables and their cardinality, this constitutes the smallest scenario possible that supports quantum nonlocality in networks. Moreover, by analyzing the explicit quantum model, we obtain new insights into how nonlocal distributions can be generated in quantum networks.
The zero-error capacity of a noisy classical channel quantifies its ability to transmit information with absolute certainty, i.e., without any error. Unlike Shannon's standard channel capacity, which remains unaffected by pre-shared correlations, zero-error capacity can be enhanced through nonlocal correlations. In this work, we investigate zero-error communication utility of such correlations arising in the 2-2-m Bell scenario, where two parties have two inputs and m possible outcomes per input. For all m\geq2, we construct examples of noisy classical channels with zero zero-error capacity that, when assisted by extremal 2-2-m nonlocal correlations, can transmit one bit of information. While nonlocal correlations arising from quantum entangled states cannot achieve a positive zero-error capacity for these channels, they significantly enhance the probability of successfully transmitting a classical bit in a single use. Extending this analysis to the 2-m-2 Bell scenario, we identify channels with zero zero-error capacity that can nonetheless perfectly transmit log m bits of information when assisted by corresponding extremal nonlocal correlations. Our findings underscore the versatile utility of Bell nonlocal correlations in achieving zero-error communication.
Bell nonlocality refers to correlations between two distant, entangled particles that challenge classical notions of local causality. Beyond its foundational significance, nonlocality is crucial for device-independent technologies like quantum key distribution and randomness generation. Nonlocality quickly deteriorates in the presence of noise, and restoring nonlocal correlations requires additional resources. These often come in the form of many instances of the input state and joint measurements, incurring a significant resource overhead. Here, we experimentally demonstrate that single copies of Bell-local states, incapable of violating any standard Bell inequality, can give rise to nonlocality after being embedded into a quantum network of multiple parties. We subject the initial entangled state to a quantum channel that broadcasts part of the state to two independent receivers and certify the nonlocality in the resulting network by violating a tailored Bell-like inequality. We obtain these results without making any assumptions about the prepared states, the quantum channel, or the validity of quantum theory. Our findings have fundamental implications for nonlocality and enable the practical use of nonlocal correlations in real-world applications, even in scenarios dominated by noise.
Contrary to the Bell scenario, quantum nonlocality can be exploited even when all the parties do not have freedom to select inputs randomly. Such manifestation of nonlocality is possible in networks involving independent sources. One can utilize such a feature of quantum networks for purpose of entanglement detection of bipartite quantum states. In this context, we characterize correlations simulated in networks involving a finite number of sources generating quantum states when some parties perform fixed measurement. Beyond bipartite entanglement, we inquire the same for networks involving sources now generating pure tripartite quantum states. Interestingly, here also randomness in input selection is not necessary for every party to generate nonlocal correlation.