arXiv subjects

Lluis Masanes

Publications and source records attributed to Lluis Masanes.

42 records · Page 3Linked to original sources

arXiv2005

From Bell's Theorem to Secure Quantum Key Distribution

Any Quantum Key Distribution (QKD) protocol consists first of sequences of measurements that produce some correlation between classical data. We show that these correlation data must violate some Bell inequality in order to contain distillable secrecy, if not they could be produced by quantum measurements performed on a separable state of larger dimension. We introduce a new QKD protocol and prove its security against any individual attack by an adversary only limited by the no-signaling condition.

quant-ph↗

arXiv2005

Interconversion of Nonlocal Correlations

In this paper we study the correlations that arise when two separated parties perform measurements on systems they hold locally. We restrict ourselves to those correlations with which arbitrarily fast transmission of information is impossible. These correlations are called nonsignaling. We allow the measurements to be chosen from sets of an arbitrary size, but promise that each measurement has only two possible outcomes. We find the structure of this convex set of nonsignaling correlations by characterizing its extreme points. Taking an information-theoretic view, we prove that all of these extreme correlations are interconvertible. This suggests that the simplest extremal nonlocal distribution (called a PR box) might be the basic unit of nonlocality. We also show that this unit of nonlocality is sufficient to simulate all quantum states when measured with two outcome measurements.

quant-ph↗

arXiv2005

Multipartite Secret Correlations and Bound Information

We consider the problem of secret key extraction when $n$ honest parties and an eavesdropper share correlated information. We present a family of probability distributions and give the full characterization of its distillation properties. This formalism allows us to design a rich variety of cryptographic scenarios. In particular, we provide examples of multipartite probability distributions containing non-distillable secret correlations, also known as bound information.

cs.CR↗

arXiv2003

Bell's inequalities detect efficient entanglement

We review the status of Bell's inequalities in quantum information, stressing mainly the links with quantum key distribution and distillation of entanglement. We also prove that for all the eavesdropping attacks using one qubit, and for a family of attacks of two qubits, acting on half of a maximally entangled state of two qubits, the violation of a Bell inequality implies the possibility of an efficient secret-key extraction.

quant-ph↗

arXiv2003

Equivalence between two-qubit entanglement and secure key distribution

We study the problem of secret key distillation from bipartite states in the scenario where Alice and Bob can only perform measurements at the single-copy level and classically process the obtained outcomes. Even with these limitations, secret bits can be asymptotically distilled by the honest parties from any two-qubit entangled state, under any individual attack. Our results point out a complete equivalence between two-qubit entanglement and secure key distribution: a key can be established through a one-qubit channel if and only if it allows to distribute entanglement. These results can be generalized to higher dimension for all those states that are one-copy distillable.

quant-ph↗

arXiv2002

Tight Bell inequality for d-outcome measurements correlations

In this paper we prove that the inequality introduced by Collins, Gisin, Linden, Massar and Popescu is tight, or in other words, it is a facet of the convex polytope generated by all local-realistic joint probabilities of d outcomes. This means that this inequality is optimal. We also show that, for correlation functions generalized to deal with three-outcome measurements, the satisfyability of this inequality is a necessary and sufficient condition for the existence of a local-realistic model accounting for them.

quant-ph↗