Scaling Network Topologies for Multi-User Entanglement Distribution

TL;DR

This paper proposes a connected tree topology for quantum networks, demonstrating improved scalability and robustness against decoherence for multi-user entanglement distribution and quantum key distribution.

Contribution

Introduction of a connected tree topology with redundant edges, enhancing multi-path routing and scalability in large-scale quantum networks compared to traditional topologies.

Findings

Connected tree networks support more user pairs than lattice topologies.

Thin-connected trees are more robust against decoherence.

Quantum key distribution is more effective in tree topologies.

Abstract

Future quantum internet relies on large-scale entanglement distribution. Quantum decoherence is a significant obstacle in large-scale networks, which otherwise perform better with multiple paths between the source and destination. We propose a new topology, connected tree, with a significant amount of redundant edges to support multi-path routing of entangled pairs. We qualitatively analyse the scalability of quantum networks to maximum user capacity in decoherence for different topologies. Our analysis shows that thin-connected tree networks can accommodate a larger number of user pairs than more evenly distributed lattice topology. We extend our analysis to quantum key distribution and show that the quantum network of a thin tree topology is more robust against decoherence and leads to better key distribution among multiple communicating parties.