Related papers: Functional boxes, communication complexity and inf…
Communication complexity quantifies how difficult it is for two distant computers to evaluate a function f(X,Y), where the strings X and Y are distributed to the first and second computer respectively, under the constraint of exchanging as…
A set of nonlocal correlations that have come to be known as a PR box suggest themselves as a natural unit of nonlocality, much as a singlet is a natural unit of entanglement. We present two results relevant to this idea. One is that a wide…
One of the most intriguing features of quantum physics is the non-locality of correlations that can be obtained by measuring entangled particles. Recently, it has been noticed that non-locality can be studied without reference to the…
We first present a protocol for deterministically distilling non-locality, building upon a recent result of Forster et al. [Phys. Rev. Lett. 102, 120401 (2009)]. Our protocol, which is optimal for two-copy distillation, works efficiently…
It is shown that Popescu-Rohrlich nonlocal boxes (beating the Tsirelson bound for Bell inequality) do exist in the existing structures of both quantum and classical theory. In particular, we design an explicit example of measure-and-prepare…
It is demonstrated that identifying information-theoretic limitations of quantum Bell nonlocality alone cannot completely distinguish quantum theory from generalized nonsignaling theories. To this end, an information-theoretic concept of…
We show that standard nonlocal boxes, also known as Popescu-Rohrlich machines, are not sufficient to simulate any nonlocal correlations that do not allow signalling. This was known in the multipartite scenario, but we extend the result to…
We provide mathematicaly rigorous justification of using term "probability" in connection to the so called non-signalling theories,known also as Popescu's and Rohrlich's box worlds. No only do we prove correctness of these models (in the…
Identifying the physical grounds distinguishing quantum theory from broader probabilistic frameworks remains an open challenge. Communication-based proposals -- most notably the principles of impossibility of superluminal signaling and…
Non-signalling boxes (NS) are theoretical resources defined by the principle of no-faster-than-light communication. They generalize quantum correlations, and some of them are known to collapse communication complexity (CC). However, this…
It is known that there exist non-local correlations that respect no-signaling criterion, but violate Bell-type inequalities more than quantum-mechanical correlations. Such super quantum correlations were introduced as the Popescu-Rohrlich…
We show that standard nonlocal boxes, also known as Popescu-Rohrlich machines, are not sufficient to simulate any nonlocal correlations that do not allow signalling. This was known in the multipartite scenario, but we extend the result to…
In instantaneous nonlocal quantum computation, two parties cooperate in order to perform a quantum computation on their joint inputs, while being restricted to a single round of simultaneous communication. Previous results showed that…
Communication games are crucial tools for investigating the limitations of physical theories. The communication complexity (CC) problem is a typical example, for which several distributed parties attempt to jointly calculate a given…
Recently, Brassard et. al. conjectured that the fact that the maximal possible correlations between two non-local parties are the quantum-mechanical ones is linked to a reasonable restriction on communication complexity. We provide further…
A classical non-signalling (or causal) box is an operation on classical bipartite input with classical bipartite output such that no signal can be sent from a party to the other through the use of the box. The quantum counterpart of such…
Complex information-processing systems, for example quantum circuits, cryptographic protocols, or multi-player games, are naturally described as networks composed of more basic information-processing systems. A modular analysis of such…
A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a, b are uniformly distributed and the parity of a+b equals xy. Such boxes have been central to…
Communication complexity, which quantifies the minimum communication required for distributed computation, offers a natural setting for investigating the capabilities and limitations of quantum mechanics in information processing. We…
In view of the remarkable interest raised by the introduction of the so called PR-box we analyze its nonlocal features from the point of view of Parameter and Outcome Dependence.