A Control Architecture for Entanglement Generation Switches in Quantum Networks

TL;DR

This paper introduces a cost-effective quantum network architecture with a central Entanglement Generation Switch (EGS) and a Rate Control Protocol (RCP) to efficiently manage entanglement resources among many nodes.

Contribution

The paper proposes a novel EGS architecture and an RCP algorithm, with proven convergence, for scalable and resource-efficient quantum network entanglement distribution.

Findings

The RCP algorithm converges to optimal rates.

The EGS architecture reduces costs for multi-node quantum networks.

The framework is adaptable to other quantum network hub designs.

Abstract

Entanglement between quantum network nodes is often produced using intermediary devices - such as heralding stations - as a resource. When scaling quantum networks to many nodes, requiring a dedicated intermediary device for every pair of nodes introduces high costs. Here, we propose a cost-effective architecture to connect many quantum network nodes via a central quantum network hub called an Entanglement Generation Switch (EGS). The EGS allows multiple quantum nodes to be connected at a fixed resource cost, by sharing the resources needed to make entanglement. We propose an algorithm called the Rate Control Protocol (RCP) which moderates the level of competition for access to the hub's resources between sets of users. We proceed to prove a convergence theorem for rates yielded by the algorithm. To derive the algorithm we work in the framework of Network Utility Maximization (NUM) and make use of the theory of Lagrange multipliers and Lagrangian duality. Our EGS architecture lays the groundwork for developing control architectures compatible with other types of quantum network hubs as well as system models of greater complexity.