In this work, we introduce multipartite intrinsic non-locality as a method for quantifying resources in the multipartite scenario of device-independent (DI) conference key agreement. We prove that multipartite intrinsic non-locality is additive, convex, and monotone under a class of free operations called local operations and common randomness. As one of our technical contributions, we establish a chain rule for two variants of multipartite mutual information, which we then use to prove that multipartite intrinsic non-locality is additive. This chain rule may be of independent interest in other contexts. All of these properties of multipartite intrinsic non-locality are helpful in establishing the main result of our paper: multipartite intrinsic non-locality is an upper bound on secret key rate in the general multipartite scenario of DI conference key agreement. We discuss various examples of DI conference key protocols and compare our upper bounds for these protocols with known lower bounds. Finally, we calculate upper bounds on recent experimental realizations of DI quantum key distribution.
In this work, we introduce multipartite intrinsic non-locality as a method for quantifying resources in the multipartite scenario of device-independent (DI) conference key agreement. We prove that multipartite intrinsic non-locality is additive, convex, and monotone under a class of free operations called local operations and common randomness. As one of our technical contributions, we establish a chain rule for two variants of multipartite mutual information, which we then use to prove that multipartite intrinsic non-locality is additive. This chain rule may be of independent interest in other contexts. All of these properties of multipartite intrinsic non-locality are helpful in establishing the main result of our paper: multipartite intrinsic non-locality is an upper bound on secret key rate in the general multipartite scenario of DI conference key agreement. We discuss various examples of DI conference key protocols and compare our upper bounds for these protocols with known lower bounds. Finally, we calculate upper bounds on recent experimental realizations of DI quantum key distribution.
In this work, we introduce the multipartite intrinsic non-locality as a resource quantifier for the multipartite scenario of device-independent (DI) conference key agreement. We prove that this quantity is additive, convex, and monotone under a class of free operations called local operations and common randomness. As one of our technical contributions, we establish a chain rule for multipartite mutual information, which we then use to prove that the multipartite intrinsic non-locality is additive. This chain rule may be of independent interest in other contexts. All of these properties of multipartite intrinsic non-locality are helpful in establishing the main result of our paper: multipartite intrinsic non-locality is an upper bound on secret key rate in the general multipartite scenario of DI conference key agreement. We discuss various examples of DI conference key protocols and compare our upper bounds for these protocols with known lower bounds. Finally, we calculate upper bounds on recent experimental realizations of DI quantum key distribution.
Abstract In this paper, we introduce intrinsic non-locality and quantum intrinsic non-locality as quantifiers for Bell non-locality, and we prove that they satisfy certain desirable properties such as faithfulness, convexity, and monotonicity under local operations and shared randomness. We then prove that intrinsic non-locality is an upper bound on the secret-key-agreement capacity of any device-independent protocol conducted using a device characterized by a correlation p, while quantum intrinsic non-locality is an upper bound on the same capacity for a correlation arising from an underlying quantum model. We also prove that intrinsic steerability is faithful, and it is an upper bound on the secret-key-agreement capacity of any one-sided-device-independent protocol conducted using a device characterized by an assemblage ρ ˆ . Finally, we prove that quantum intrinsic non-locality is bounded from above by intrinsic steerability.
In this paper, we introduce intrinsic non-locality and quantum intrinsic non-locality as quantifiers for Bell non-locality, and we prove that they satisfy certain desirable properties such as faithfulness, convexity, and monotonicity under local operations and shared randomness. We then prove that intrinsic non-locality is an upper bound on the secret-key-agreement capacity of any device-independent protocol conducted using a device characterized by a correlation p, while quantum intrinsic non-locality is an upper bound on the same capacity for a correlation arising from an underlying quantum model. We also prove that intrinsic steerability is faithful, and it is an upper bound on the secret-key-agreement capacity of any one-sided-device-independent protocol conducted using a device characterized by an assemblage ρˇ. Finally, we prove that quantum intrinsic non-locality is bounded from above by intrinsic steerability.
Quantum entanglement is a unique property of quantum particles. It can correlate them in such a way, that further correlations to an additional unwanted party is prevented. This renders quantum theory as the prime candidate to implement a secure distribution of an encryption key. Quantum key distribution (QKD) is dedicated to this task. A striking feature of correlations in a statistical experiment is, that they can, in principle, always be approximated. Even more so, correlations can be obtained without a detailed knowledge about the underlying physical process that generated the experimental data. This no-characterization approach is at the heart of the device-independent (DI) paradigm. Here, Bell inequalities are an imperative tool to detect nonlocal correlations, which are necessary for a DI secret key. One central subject of this thesis is multipartite DIQKD and the implications of Bell nonlocality in this context. Any DIQKD protocol involves test rounds in which the violation of a Bell inequality is checked. For multipartite DIQKD, however, not all Bell inequalities are suitable. We identify the crucial properties a Bell test requires to be a viable option. In this light, a published protocol for multipartite DIQKD is examined. We establish an incompatibility which is inherent to the proposed Bell test in combination with the required quantum states. This leads us to the conclusion, that the proposed protocol necessarily aborts. In a subsequent work, we develop a family of multipartite Bell inequalities, specifically tailored to the task of DI conference key agreement (CKA). Several features of this Bell inequality are analytically characterized. In addition, we prove its usefulness for the purposes of DICKA. To this end, semidefinite programming techniques are employed and extended to the multipartite scenario which allows us to quantify asymptotic DI conference key rates. In a second part, we explore the challenges of implementing (bipartite) long-distance DIQKD with quantum repeaters. For two repeater protocols, we describe how experimental parameters manifest themselves in DI secret-key rates. In doing so, we shed light on the fundamental differences between the usual and the DI scenario and we benchmark the threshold requirements of quantum devices to make profitable DI secret-key rates feasible. Finally, we develop a general method to describe in a non-DI setting the propagation of an important class of errors through quantum circuits in arbitrary dimensions. With this, we discuss the potential of error-corrected quantum repeaters to overcome fundamental point-to-point limitations.
We provide several general upper bounds on the rate of a key secure against a quantum adversary in the device-independent conference key agreement (DI-CKA) scenario. They include bounds by reduced entanglement measures and those based on multipartite secrecy monotones such as a multipartite squashed entanglement-based measure, which we refer to as reduced c-squashed entanglement. We compare the latter bound with the known lower bound for the protocol of conference key distillation based on the parity Clauser-Horne-Shimony-Holt game. We also show that the gap between the DI-CKA rate and the device-dependent rate is inherited from the bipartite gap between device-independent and device-dependent key rates, giving examples that exhibit the strict gap.
Multipartite device-independent quantum key distribution (DI-QKD), also known as device-independent conference key agreement, enables more than two remote parties to share a common key with information-theoretic security even without trusting the devices. So far, several multipartite DI-QKD protocols have been proposed where Greenberger-Horne-Zeilinger (GHZ) states are used as multipartite entanglement. A natural question is then whether one can construct multipartite DI-QKD with the other type of multipartite entanglement. W state is of particular interest since it is intrinsically different from GHZ state and in some cases, easier to optically implement. In this paper, we show that multipartite DI-QKD is possible with W states. To this end, we construct Bell inequalities largely violated by W states, which can be used for the multipartite DI-QKD. Furthermore, we consider several different implementation scenarios. First, we analyze the minimum required detection efficiencies to extract finite amount of keys. Then we propose a long-distance multipartite DI-QKD protocol with single-photon interference and make detailed analyses with several physical implementation scenarios. We show that the protocol enables secret key distribution over longer distances than the existing multipartite DI-QKD protocols based on GHZ states. This study provides new insight about the relationship between multipartite entanglement and device-independent quantum information processing as well as opens an alternative path toward long-distance multipartite DI-QKD.