Spanning-tree-packing protocol for conference key propagation in quantum networks
arXiv:2506.04105 · doi:10.1103/dhqb-k7tl
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.
10 pages+appendix and references, 9 figures; v2: final version, minor changes
References in corpus (31)
- Quantum Cryptography
- The Quantum Internet
- The Security of Practical Quantum Key Distribution
- Advances in Quantum Cryptography
- Everything You Always Wanted to Know About LOCC (But Were Afraid to Ask)
- Security in Quantum Cryptography
- Towards a global quantum network
- Multi-partite entanglement speeds up quantum key distribution in networks
- Quantum Conference Key Agreement: A Review
- Experimental quantum conference key agreement
- Tools for quantum network design
- Conference key agreement with single-photon interference
- Genuine multipartite nonlocality is intrinsic to quantum networks
- Analysis of Multipartite Entanglement Distribution using a Central Quantum-Network Node
- Large-scale quantum networks based on graphs
- Quantum Router with Network Coding
- Fundamental limitation on quantum broadcast networks
- Multipartite state generation in quantum networks with optimal scaling
- Multi-User Entanglement Distribution in Quantum Networks Using Multipath Routing
- Phase-Matching Quantum Cryptographic Conferencing
- Experiment on scalable multi-user twin-field quantum key distribution network
- Linear programs for entanglement and key distribution in the quantum internet
- Overcoming fundamental bounds on quantum conference key agreement
- General upper bounds for distributing conferencing keys in arbitrary quantum networks
- Genuine multipartite entanglement is not a precondition for secure conference key agreement
- On the Bipartite Entanglement Capacity of Quantum Networks
- Experimental Measurement-Device-Independent Quantum Cryptographic Conferencing
- Routing algorithm within the multiple non-overlapping paths approach for quantum key distribution networks
- DemoQuanDT: A Carrier-Grade QKD Network
- New Protocols for Conference Key and Multipartite Entanglement Distillation
- Multi-user QKD using quotient graph states derived from continuous-variable dual-rail cluster states