Computing an Optimal Entanglement Path with Throughput and Fidelity Considerations

Thu, 27 Aug 2026 00:00:00 +0000

Abstract

Entanglement distribution is a core function of quantum networks essential for operations including teleportation, distributed quantum sensing, and multisite computation. Entanglement throughput and fidelity are two critical performance measures that depend on the quantum transmission along the links and swapping operations at the repeaters along the path. We study the problem of computing a end-to-end entanglement path that satisfies both fidelity and throughput requirements, leveraging qubit buffers at the nodes and considering the sequential swapping order. We show that the general problem of simultaneously satisfying both metrics to be NP-hard, and develop an algorithm to maximize throughput subject to a given fidelity threshold. We introduce the concepts of entanglement probability distribution and path domination and exploit them in the design of our algorithm. Extensive numerical results show that our algorithm can find optimal solutions in networks with thousands of nodes in less than a second. We also describe practical and possible implementation aspects of this algorithm in terms of devices and architecture support.

Published online as an Early Access article on August 27, 2026. Final volume and page numbers have not yet been assigned.

Entanglement Distribution | Xuanli Lin

Computing an Optimal Entanglement Path with Throughput and Fidelity Considerations

Abstract