Universal Limitations on Quantum Key Distribution over a Network
Siddhartha Das, Stefan B\"auml, Marek Winczewski, Karol Horodecki

TL;DR
This paper establishes fundamental limits on quantum key distribution over networks, linking entanglement, channel capacities, and protocol structures to bound achievable secret key rates in various quantum network scenarios.
Contribution
It introduces a comprehensive framework for bounding secret key rates in quantum networks, including multipartite settings, and connects these bounds to entanglement measures and channel properties.
Findings
Multipartite private states must be genuinely multipartite entangled.
Derived strong and weak converse bounds for LOCC-assisted secret key capacities.
Determined capacities for MDI-QKD and GHZ-state distillation in specific cases.
Abstract
We consider the distribution of secret keys, both in a bipartite and a multipartite (conference) setting, via a quantum network and establish a framework to obtain bounds on the achievable rates. We show that any multipartite private state--the output of a protocol distilling secret key among the trusted parties--has to be genuinely multipartite entangled. In order to describe general network settings, we introduce a multiplex quantum channel, which links an arbitrary number of parties, where each party can take the role of sender only, receiver only, or both sender and receiver. We define asymptotic and non-asymptotic LOCC-assisted secret-key-agreement (SKA) capacities for multiplex quantum channels and provide strong and weak converse bounds. The structure of the protocols we consider, manifested by an adaptive strategy of secret key and entanglement [Greenberger-Horne-Zeilinger (GHZ…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
