9 research outputs found
Efficient quantum key distribution secure against no-signalling eavesdroppers
By carrying out measurements on entangled states, two parties can generate a
secret key which is secure not only against an eavesdropper bound by the laws
of quantum mechanics, but also against a hypothetical "post-quantum"
eavesdroppers limited by the no-signalling principle only. We introduce a
family of quantum key distribution protocols of this type, which are more
efficient than previous ones, both in terms of key rate and noise resistance.
Interestingly, the best protocols involve large number of measurements. We show
that in the absence of noise, these protocols can yield one secret bit per
entanglement bit, implying that the key rates in the no-signalling post-quantum
scenario are comparable to the key rates in usual quantum key distribution.Comment: 11 pages, 2 color figures. v2: minor modifications, added references,
added note on the relation to quant-ph/060604
Secrecy extraction from no-signalling correlations
Quantum cryptography shows that one can guarantee the secrecy of correlation
on the sole basis of the laws of physics, that is without limiting the
computational power of the eavesdropper. The usual security proofs suppose that
the authorized partners, Alice and Bob, have a perfect knowledge and control of
their quantum systems and devices; for instance, they must be sure that the
logical bits have been encoded in true qubits, and not in higher-dimensional
systems. In this paper, we present an approach that circumvents this strong
assumption. We define protocols, both for the case of bits and for generic
-dimensional outcomes, in which the security is guaranteed by the very
structure of the Alice-Bob correlations, under the no-signalling condition. The
idea is that, if the correlations cannot be produced by shared randomness, then
Eve has poor knowledge of Alice's and Bob's symbols. The present study assumes,
on the one hand that the eavesdropper Eve performs only individual attacks
(this is a limitation to be removed in further work), on the other hand that
Eve can distribute any correlation compatible with the no-signalling condition
(in this sense her power is greater than what quantum physics allows). Under
these assumptions, we prove that the protocols defined here allow extracting
secrecy from noisy correlations, when these correlations violate a Bell-type
inequality by a sufficiently large amount. The region, in which secrecy
extraction is possible, extends within the region of correlations achievable by
measurements on entangled quantum states.Comment: 23 pages, 4 figure
Large violation of Bell inequalities with low entanglement
In this paper we obtain violations of general bipartite Bell inequalities of
order with inputs, outputs and
-dimensional Hilbert spaces. Moreover, we construct explicitly, up to a
random choice of signs, all the elements involved in such violations: the
coefficients of the Bell inequalities, POVMs measurements and quantum states.
Analyzing this construction we find that, even though entanglement is necessary
to obtain violation of Bell inequalities, the Entropy of entanglement of the
underlying state is essentially irrelevant in obtaining large violation. We
also indicate why the maximally entangled state is a rather poor candidate in
producing large violations with arbitrary coefficients. However, we also show
that for Bell inequalities with positive coefficients (in particular, games)
the maximally entangled state achieves the largest violation up to a
logarithmic factor.Comment: Reference [16] added. Some typos correcte
Quantum Tasks in Minkowski Space
The fundamental properties of quantum information and its applications to
computing and cryptography have been greatly illuminated by considering
information-theoretic tasks that are provably possible or impossible within
non-relativistic quantum mechanics. I describe here a general framework for
defining tasks within (special) relativistic quantum theory and illustrate it
with examples from relativistic quantum cryptography and relativistic
distributed quantum computation. The framework gives a unified description of
all tasks previously considered and also defines a large class of new questions
about the properties of quantum information in relation to Minkowski causality.
It offers a way of exploring interesting new fundamental tasks and
applications, and also highlights the scope for a more systematic understanding
of the fundamental information-theoretic properties of relativistic quantum
theory