Device-independent quantum key distribution (DIQKD) is the art of using untrusted devices to distribute secret keys in an insecure network. It thus represents the ultimate form of cryptography, offering not only information-theoretic security against
channel attacks, but also against attacks exploiting implementation loopholes. In recent years, much progress has been made towards realising the first DIQKD experiments, but current proposals are just out of reach of todays loophole-free Bell experiments. Here, we significantly narrow the gap between the theory and practice of DIQKD with a simple variant of the original protocol based on the celebrated Clauser-Horne-Shimony-Holt (CHSH) Bell inequality. By using two randomly chosen key generating bases instead of one, we show that our protocol significantly improves over the original DIQKD protocol, enabling positive keys in the high noise regime for the first time. We also compute the finite-key security of the protocol for general attacks, showing that approximately 1E8 to 1E10 measurement rounds are needed to achieve positive rates using state-of-the-art experimental parameters. Our proposed DIQKD protocol thus represents a highly promising path towards the first realisation of DIQKD in practice.
Device-independent quantum key distribution (DIQKD) provides the strongest form of secure key exchange, using only the input-output statistics of the devices to achieve information-theoretic security. Although the basic security principles of DIQKD a
re now well-understood, it remains a technical challenge to derive reliable and robust security bounds for advanced DIQKD protocols that go beyond the existing results based on violations of the CHSH inequality. In this Letter, we present a framework based on semi-definite programming that gives reliable lower bounds on the asymptotic secret key rate of any QKD protocol using untrusted devices. In particular, our method can in principle be utilized to find achievable secret key rates for any DIQKD protocol, based on the full input-output probability distribution or any choice of Bell inequality. Our method also extends to other DI cryptographic tasks.
We study a generalization of the Wigner function to arbitrary tuples of hermitian operators, which is a distribution uniquely characterized by the property that the marginals for all linear combinations of the given operators agree with the quantum m
echanical distributions. Its role as a joint quasi-probability distribution is underlined by the property that its support always lies in the set of expectation value tuples of the operators. We characterize the set of singularities and positivity, and provide some basic examples.
We study a generalization of the Wigner function to arbitrary tuples of hermitian operators. We show that for any collection of hermitian operators A1...An , and any quantum state there is a unique joint distribution on R^n, with the property that th
e marginals of all linear combinations of the operators coincide with their quantum counterpart. In other words, we consider the inverse Radon transform of the exact quantum probability distributions of all linear combinations. We call it the Wigner distribution, because for position and momentum this property defines the standard Wigner function. We discuss the application to finite dimensional systems, establish many basic properties and illustrate these by examples. The properties include the support, the location of singularities, positivity, the behavior under symmetry groups, and informational completeness.
Quantifying quantum mechanical uncertainty is vital for the increasing number of experiments that reach the uncertainty limited regime. We present a method for computing tight variance uncertainty relations, i.e., the optimal state-independent lower
bound for the sum of the variances for any set of two or more measurements. The bounds come with a guaranteed error estimate, so results of pre-assigned accuracy can be obtained straightforwardly. Our method also works for POVM measurements. Therefore, it can be used for detecting entanglement in noisy environments, even in cases where conventional spin squeezing criteria fail because of detector noise.
Measurement uncertainty relations are lower bounds on the errors of any approximate joint measurement of two or more quantum observables. The aim of this paper is to provide methods to compute optimal bounds of this type. The basic method is semidefi
nite programming, which we apply to arbitrary finite collections of projective observables on a finite dimensional Hilbert space. The quantification of errors is based on an arbitrary cost function, which assigns a penalty to getting result $x$ rather than y, for any pair (x,y). This induces a notion of optimal transport cost for a pair of probability distributions, and we include an appendix with a short summary of optimal transport theory as needed in our context. There are then different ways to form an overall figure of merit from the comparison of distributions. We consider three, which are related to different physical testing scenarios. The most thorough test compares the transport distances between the marginals of a joint measurement and the reference observables for every input state. Less demanding is a test just on the states for which a true value is known in the sense that the reference observable yields a definite outcome. Finally, we can measure a deviation as a single expectation value by comparing the two observables on the two parts of a maximally entangled state. All three error quantities have the property that they vanish if and only if the tested observable is equal to the reference. The theory is illustrated with some characteristic examples.
A key ingredient of quantum repeaters is entanglement distillation, i.e., the generation of high-fidelity entangled qubits from a larger set of pairs with lower fidelity. Here, we present entanglement distillation protocols based on qubit couplings t
hat originate from exchange interaction. First, we make use of asymmetric bilateral two-qubit operations generated from anisotropic exchange interaction and show how to distill entanglement using two input pairs. We furthermore consider the case of three input pairs coupled through isotropic exchange. Here, we characterize a set of protocols which are optimizing the tradeoff between the fidelity increase and the probability of a successful run.
In this work we study various notions of uncertainty for angular momentum in the spin-s representation of SU(2). We characterize the uncertainty regions given by all vectors, whose components are specified by the variances of the three angular moment
um components. A basic feature of this set is a lower bound for the sum of the three variances. We give a method for obtaining optimal lower bounds for uncertainty regions for general operator triples, and evaluate these for small s. Further lower bounds are derived by generalizing the technique by which Robertson obtained his state-dependent lower bound. These are optimal for large s, since they are saturated by states taken from the Holstein-Primakoff approximation. We show that, for all s, all variances are consistent with the so-called vector model, i.e., they can also be realized by a classical probability measure on a sphere of radius sqrt(s(s+1)). Entropic uncertainty relations can be discussed similarly, but are minimized by different states than those minimizing the variances for small s. For large s the Maassen-Uffink bound becomes sharp and we explicitly describe the extremalizing states. Measurement uncertainty, as recently discussed by Busch, Lahti and Werner for position and momentum, is introduced and a generalized observable (POVM) which minimizes the worst case measurement uncertainty of all angular momentum components is explicitly determined, along with the minimal uncertainty. The output vectors for the optimal measurement all have the same length r(s), where r(s)/s goes to 1 as s tends to infinity.
