We consider a network of users connected by pairwise quantum key distribution (QKD) links. Using these pairwise secret keys and public classical communication, the users want to generate a common (conference) secret key at the maximal rate. We propose an algorithm based on spanning-tree packing (a known problem in graph theory) and prove its optimality. This algorithm enables optimal conference key generation in modern quantum networks of arbitrary topology. Additionally, we discuss how it can guide the optimal placement of new bipartite links in the network design.
@article{arxiv.2506.04105,
title = {Spanning-tree-packing protocol for conference key propagation in quantum networks},
author = {Anton Trushechkin and Hermann Kampermann and Dagmar Bruß},
journal= {arXiv preprint arXiv:2506.04105},
year = {2026}
}
Comments
10 pages+appendix and references, 9 figures; v2: final version, minor changes