Work

Spanning-tree-packing protocol for conference-key propagation in quantum networks

Year: 2026

Type: article

Abstract: 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.

Source: Physical Review Applied

DOI: 10.1103/dhqb-k7tl

Authors: Anton Trushechkin, Hermann Kampermann, Dagmar Bruß

Institutions: Steklov Mathematical Institute, Heinrich Heine University Düsseldorf

Language: English

Topic: Quantum Information and Cryptography

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Funder: Bundesministerium für Bildung und Forschung

Award: Verbundprojekt: Quantennetzwerke: Korrelationen und Kommunikation - QuKuK -, Teilvorhaben: Netzwerkstrukturen und Quantenzustände