Efficient Quantum Conference Key Agreement over Quantum Networks

Conference Paper (2025)
Author(s)

Samuel Oslovich (TU Delft - QuTech Advanced Research Centre, TU Delft - QID/Wehner Group)

Md Zakir Hossain (University of Connecticut)

Trevor Thomas (University of Connecticut)

Bing Wang (University of Connecticut)

Walter Krawec (University of Connecticut)

Kenneth Goodenough (University of Massachusetts Amherst)

Research Group
QID/Wehner Group
DOI related publication
https://doi.org/10.1109/QCNC64685.2025.00057
More Info
expand_more
Publication Year
2025
Language
English
Research Group
QID/Wehner Group
Bibliographical Note
Green Open Access added to TU Delft Institutional Repository as part of the Taverne amendment. More information about this copyright law amendment can be found at https://www.openaccess.nl. Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.@en
Pages (from-to)
315-322
ISBN (electronic)
9798331531591
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

Quantum conference key agreement (CKA) is useful for many applications that involve secure communication or collaboration among multiple parties. While CKA over quantum networks can be achieved using pairwise quantum key distribution, a more efficient approach is to establish keys among the parties directly through multipartite entanglement distribution. Existing studies on multipartite entanglement distribution, however, are not designed for CKA, and hence do not aim to optimize key rate. In this paper, we first develop an efficient 3-party CKA strategy based on a closed-form expression that we derive for estimating errors. We then develop a general strategy for N-party CKA that accounts for estimated key rates on individual network paths. For both cases, we use multipath routing to improve key rate. We evaluate our approach in a wide range of settings and demonstrate that it achieves high key rate and degrades gracefully when increasing the number of parties.

Files

License info not available
warning

File under embargo until 15-11-2025