Table of Contents
Fetching ...

Optimizing Orbital Parameters of Satellites for a Global Quantum Network

Athul Ashok, Owen DePoint, Jackson MacDonald, Albert Williams, Don Towsley

Abstract

Due to fundamental limitations on terrestrial quantum links, satellites have received considerable attention for their potential as entanglement generation sources in a global quantum internet. In this work, we focus on the problem of designing a constellation of satellites for such a quantum network. We find satellite inclination angles and satellite cluster allocations to achieve maximal entanglement generation rates to fixed sets of globally distributed ground stations. Exploring two black-box optimization frameworks: a Bayesian Optimization (BO) approach and a Genetic Algorithm (GA) approach, we find comparable results, indicating their effectiveness for this optimization task. While GA and BO often perform remarkably similar, BO often converges more efficiently, while later growth noted in GAs is indicative of less susceptibility towards local maxima. In either case, they offer substantial improvements over naive approaches that maximize coverage with respect to ground station placement.

Optimizing Orbital Parameters of Satellites for a Global Quantum Network

Abstract

Due to fundamental limitations on terrestrial quantum links, satellites have received considerable attention for their potential as entanglement generation sources in a global quantum internet. In this work, we focus on the problem of designing a constellation of satellites for such a quantum network. We find satellite inclination angles and satellite cluster allocations to achieve maximal entanglement generation rates to fixed sets of globally distributed ground stations. Exploring two black-box optimization frameworks: a Bayesian Optimization (BO) approach and a Genetic Algorithm (GA) approach, we find comparable results, indicating their effectiveness for this optimization task. While GA and BO often perform remarkably similar, BO often converges more efficiently, while later growth noted in GAs is indicative of less susceptibility towards local maxima. In either case, they offer substantial improvements over naive approaches that maximize coverage with respect to ground station placement.
Paper Structure (21 sections, 4 equations, 5 figures, 2 algorithms)

This paper contains 21 sections, 4 equations, 5 figures, 2 algorithms.

Figures (5)

  • Figure 1: Example of a constellation with the hyperparameter $D=3$ and the following parameters: $\theta_1=25^\circ, \theta_2=75^\circ, \theta_3=150^\circ, x_1=2, x_2=3, x_3=5$
  • Figure 2: (a) 100 ground stations placed at high-density population centers (b) 100 ground stations placed randomly with a fixed seed exclusively on land
  • Figure 3: An example of a Gaussian Process
  • Figure 4: Map visualizations of the optimal satellite configurations yielded by GA (red) and BO (purple) for 2 orbits over population clusters.
  • Figure 5: Performance comparison of optimization methods and baselines across different orbit counts and ground station distributions. (a)–(b): Average entanglement distribution rate (EPR pairs/second) across 1, 2, 3, and 5 orbits using population-based (a) and random (b) land-based ground station placements. The single orbit case benchmarks against a brute-force baseline, while multi-orbit results are compared against equispaced inclination angles. (c)–(d): Optimization progress over simulation calls for population-based (c) and random (d) ground stations, showing the maximum rate by the time of a call. (e): Comparative performance across methods (BO, GA, equispaced) under different ground station distributions for 5 orbits. (f): Simulation call at which each optimization method first achieved its final best solution, compared across orbit counts (2, 3, and 5) and ground station distribution types (random and population-based).