Skip to content
Preprint

Free-Space Quantum Networks and Optimized Fiber-Reinforcement

Aug 2026 · 0 citations · 55 references
Physics

TL;DR

It is proved that any optimal backbone configuration must correspond to a capacity-maximizing Voronoi tessellation of the network region, and this can be efficiently approximated by a centroidal Voronoi tessellation via Lloyd's algorithm, with backbone nodes connected according to a Delaunay triangulation.

Abstract

Free-space quantum communication provides a flexible complement to fiber-based quantum networks, but its point-to-point capacity is fundamentally limited by diffraction, atmospheric extinction and beam wandering induced by turbulence. In this work, we study the end-to-end performance of large-scale free-space quantum networks connecting randomly distributed fixed or mobile users, modelled as Waxman random graphs. We derive the mean network capacity, edge consumption and connectivity phase transitions for both single-path and multi-path (flooding) routing. We also study router-centered star networks, deriving the full distribution of end-to-end capacities as a function of the router's coverage radius. We then consider how performance may be improved by reinforcing free-space networks with a small number of optimally placed fiber-based backbone nodes. We prove that any optimal backbone configuration must correspond to a capacity-maximizing Voronoi tessellation of the network region, and show that this can be efficiently approximated by a centroidal Voronoi tessellation via Lloyd's algorithm, with backbone nodes connected according to a Delaunay triangulation. Numerical results show that even a modest number of backbone nodes substantially improves end-to-end capacity and reduces edge consumption for both mobile and fixed users.

View source

Similar papers

Preprint Jul 2026

Efficient routing and spectrum allocation in arbitrary flex-grid entanglement networks

As practical quantum networks approach large-scale deployment, the need for efficient user-to-user frequency allocation is increasing, yet current approaches only provide partial solutions to the routing and spectrum allocation problem for an arbitrary quantum network. We address this challenge for repeater-less flex-g...

Zachary Goisman, M. L. Stevens, Maxwell Goisman et al. · 0 citations
Preprint Aug 2026

Interface Capacity and Architectural Replenishment Determine Entanglement-Generation Speed in Quantum Networks

We show that entanglement-generation speed across a fixed network interface is governed by two distinct resources: the entangling capacity of the interface itself and the ability of the surrounding architecture to replenish it with fresh degrees of freedom. For fermionic Gaussian dynamics, we derive the coefficient-sha...

Shi-Ju Ran · 0 citations
Preprint Aug 2026

Connectivity--Interference Competition in Coherent Transport on Percolated Hierarchical Small-World Networks

Adding links generally improves classical transport by increasing the number of available paths. We show that coherent quantum transport can display the opposite behavior. Using continuous-time quantum walks on a percolated hierarchical small-world network, we identify a coherent overconnectivity penalty: root-to-bound...

M. Cirino, M. C. de Oliveira · 1 citation
Open access Aug 2026

Coherence and fidelity aware routing in quantum networks

In this study, for the first time, a novel routing and purification approach for quantum networks is presented, using the end-to-end (E2E) relative entropy of coherence (REC) together with E2E fidelity to determine the purification level and the feasibility of candidate paths.

Hilal Sultan Duranoglu Tunc, Joy Halder, Azita Hajizade et al. · 0 citations
Preprint Aug 2026

Quantum Interconnects Part I: Strategic Quantum Network Formation

This work argues that the absence of utility-driven network formation is not solely a consequence of immature applications, but also of insufficient abstraction, and that quantum interconnects constitute the enabling technology required to decouple physical implementations from network functionalities.

Gustavo C. Amaral · 0 citations
Preprint Aug 2026

Spatio-temporal Path Optimization for Stabilizer-Code-Protected Quantum Networks

The framework developed in this paper can serve as an algorithmic building block for QEC-aware routing under logical-error and logical-lifetime constraints and reduces single-flow average routing cost and multi-flow throughput-normalized congestion by approximately 28--31\% over Greedy-Assignment.

Yuanbo Zhang, Qian-Fan Wang, Yang-Min Zhao et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.