219 research outputs found
Limitations on device independent secure key via squashed non-locality
We initiate a systematic study to provide upper bounds on device-independent
key, secure against a non-signaling adversary (NSDI), distilled by a wide class
of operations, currently used in both quantum and non-signaling
device-independent protocols. These operations consist of a direct measurements
on the devices followed by Local Operations and Public Communication (MDLOPC).
We employ the idea of "squashing" on the secrecy monotones, which provide upper
bounds on the key rate in secret key agreement (SKA) scenario, and show that
squashed secrecy monotones are the upper bounds on NSDI key. As an important
instance, an upper bound on NSDI key rate called "squashed non-locality", has
been constructed. It exhibits several important properties, including
convexity, monotonicity, additivity on tensor products, and asymptotic
continuity. Using this bound, we identify numerically a domain of two binary
inputs and two binary outputs non-local devices for which the squashed
non-locality is zero, and therefore one can not distil key from them via MDLOPC
operations. These are mixtures of Popescu-Rohrlich (PR) and anti-PR box with
the weight of PR box less than . This example confirms the intuition that
non-locality need not imply secrecy in the non-signaling scenario. The approach
is general, describing how to construct other tighter yet possibly less
computable upper bounds. Our technique for obtaining upper bounds is based on
the non-signaling analog of quantum purification: the complete extension, which
yields equivalent security conditions as previously known in the literature.Comment: 12 pages and 2 figures + supplemental materia
No-signalling attacks and implications for (quantum) nonlocality distillation
The phenomenon of nonlocality, which can arise when entangled quantum systems are suitably measured, is perhaps one of the most puzzling features of quantum theory to the philosophical mind. It implies that these measurement statistics cannot be explained by hidden variables, as requested by Einstein, and it thus suggests that our universe may not be, in principle, a well-determined entity where the uncertainty we perceive in physical observations stems only from our lack of knowledge of the whole. Besides its philosophical impact, nonlocality is also a resource for information- theoretic tasks since it implies secrecy: If nonlocality limits the predictive power that any hidden variable (in the universe) can have about some observations, then it limits in particular the predictive power of a hidden variable held by an adversary in a cryptographic scenario. We investigate whether nonlocality alone can empower two parties to perform unconditionally secure communication in a feasible manner when only a provably minimal set of assumptions are made for such a task to be possible — independently of the validity of any physical theory (such as quantum theory). Nonlocality has also been of interest in the study of foundations of quantum theory and the principles that stand beyond its mathematical formalism. In an attempt to single out quantum theory within a broader set of theories, the study of nonlocality may help to point out intuitive principles that distinguish it from the rest. In theories where the limits by which quantum theory constrains the strength of nonlocality are surpassed, many “principles” on which an information theorist would rely on are shattered — one example is the hierarchy of communication complexity as the latter becomes completely trivial once a certain degree of nonlocality is overstepped. In order to study the structure of such super-quantum theories — beyond their aforementioned secrecy aspects — we investigate the phenomenon of distillation of nonlocality, the ability to distill stronger forms of nonlocality from weaker ones. By exploiting the inherent connection between nonlocality and secrecy, we provide a novel way of deriving bounds on nonlocality-distillation protocols through an ad
versarial view to the problem
Full randomness from arbitrarily deterministic events
Do completely unpredictable events exist? Classical physics excludes
fundamental randomness. Although quantum theory makes probabilistic
predictions, this does not imply that nature is random, as randomness should
be certified without relying on the complete structure of the theory being
used. Bell tests approach the question from this perspective. However, they
require prior perfect randomness, falling into a circular reasoning. A Bell
test that generates perfect random bits from bits possessing high—but less
than perfect—randomness has recently been obtained. Yet, the main question
remained open: does any initial randomness suffice to certify perfect
randomness? Here we show that this is indeed the case. We provide a Bell test
that uses arbitrarily imperfect random bits to produce bits that are, under
the non-signalling principle assumption, perfectly random. This provides the
first protocol attaining full randomness amplification. Our results have
strong implications onto the debate of whether there exist events that are
fully random
Bell nonlocality
Bell's 1964 theorem, which states that the predictions of quantum theory
cannot be accounted for by any local theory, represents one of the most
profound developments in the foundations of physics. In the last two decades,
Bell's theorem has been a central theme of research from a variety of
perspectives, mainly motivated by quantum information science, where the
nonlocality of quantum theory underpins many of the advantages afforded by a
quantum processing of information. The focus of this review is to a large
extent oriented by these later developments. We review the main concepts and
tools which have been developed to describe and study the nonlocality of
quantum theory, and which have raised this topic to the status of a full
sub-field of quantum information science.Comment: 65 pages, 7 figures. Final versio
- …