26 research outputs found
On the power of non-local boxes
A non-local box is a virtual device that has the following property: given
that Alice inputs a bit at her end of the device and that Bob does likewise, it
produces two bits, one at Alice's end and one at Bob's end, such that the XOR
of the outputs is equal to the AND of the inputs. This box, inspired from the
CHSH inequality, was first proposed by Popescu and Rohrlich to examine the
question: given that a maximally entangled pair of qubits is non-local, why is
it not maximally non-local? We believe that understanding the power of this box
will yield insight into the non-locality of quantum mechanics. It was shown
recently by Cerf, Gisin, Massar and Popescu, that this imaginary device is able
to simulate correlations from any measurement on a singlet state. Here, we show
that the non-local box can in fact do much more: through the simulation of the
magic square pseudo-telepathy game and the Mermin-GHZ pseudo-telepathy game, we
show that the non-local box can simulate quantum correlations that no entangled
pair of qubits can in a bipartite scenario and even in a multi-party scenario.
Finally we show that a single non-local box cannot simulate all quantum
correlations and propose a generalization for a multi-party non-local box. In
particular, we show quantum correlations whose simulation requires an
exponential amount of non-local boxes, in the number of maximally entangled
qubit pairs.Comment: 14 pages, 1 figur
No nonlocal box is universal
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 the bipartite case. We then generalize this result further by
showing that no finite set containing any finite-output-alphabet nonlocal boxes
can be a universal set for nonlocality.Comment: Additions to the acknowledgements sectio
A limit on nonlocality in any world in which communication complexity is not trivial
Bell proved that quantum entanglement enables two space-like separated
parties to exhibit classically impossible correlations. Even though these
correlations are stronger than anything classically achievable, they cannot be
harnessed to make instantaneous (faster than light) communication possible.
Yet, Popescu and Rohrlich have shown that even stronger correlations can be
defined, under which instantaneous communication remains impossible. This
raises the question: Why are the correlations achievable by quantum mechanics
not maximal among those that preserve causality? We give a partial answer to
this question by showing that slightly stronger correlations would result in a
world in which communication complexity becomes trivial.Comment: 13 pages, no figure
Free randomness can be amplified
Are there fundamentally random processes in nature? Theoretical predictions,
confirmed experimentally, such as the violation of Bell inequalities, point to
an affirmative answer. However, these results are based on the assumption that
measurement settings can be chosen freely at random, so assume the existence of
perfectly free random processes from the outset. Here we consider a scenario in
which this assumption is weakened and show that partially free random bits can
be amplified to make arbitrarily free ones. More precisely, given a source of
random bits whose correlation with other variables is below a certain
threshold, we propose a procedure for generating fresh random bits that are
virtually uncorrelated with all other variables. We also conjecture that such
procedures exist for any non-trivial threshold. Our result is based solely on
the no-signalling principle, which is necessary for the existence of free
randomness.Comment: 5+7 pages, 2 figures. Updated to match published versio