Saved in:
Bibliographic Details
Main Authors: Hu, Tianjie, Wu, Jindi, Li, Qun
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2501.10252
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915107931422720
author Hu, Tianjie
Wu, Jindi
Li, Qun
author_facet Hu, Tianjie
Wu, Jindi
Li, Qun
contents Quantum networks emerge as fundamental frameworks for addressing various large-scale problems. There are two primary architectures: space-based quantum networks, which deploy satellites with free space channels to interconnect users, and ground-based quantum networks, which utilize optical fibers to interconnect users. In this paper, we explore space-ground integrated quantum networks that incorporate both satellites and optical fibers into the infrastructure. This integrated network features three forms of communication: using only free space links, only ground links, or a hybrid usage of free space and ground links. We formulate the routing problem in space-ground integrated quantum networks as an integer programming and propose two solutions: using a linear relaxation and a greedy algorithm. The linear relaxation algorithm allows timely scheduling of additional entanglement purification, whereas the greedy algorithm enables quick scheduling. Simulation results demonstrate their effective balancing between network throughput and communication fidelity.
format Preprint
id arxiv_https___arxiv_org_abs_2501_10252
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Dynamic Routing in Space-Ground Integrated Quantum Networks
Hu, Tianjie
Wu, Jindi
Li, Qun
Quantum Physics
Emerging Technologies
Quantum networks emerge as fundamental frameworks for addressing various large-scale problems. There are two primary architectures: space-based quantum networks, which deploy satellites with free space channels to interconnect users, and ground-based quantum networks, which utilize optical fibers to interconnect users. In this paper, we explore space-ground integrated quantum networks that incorporate both satellites and optical fibers into the infrastructure. This integrated network features three forms of communication: using only free space links, only ground links, or a hybrid usage of free space and ground links. We formulate the routing problem in space-ground integrated quantum networks as an integer programming and propose two solutions: using a linear relaxation and a greedy algorithm. The linear relaxation algorithm allows timely scheduling of additional entanglement purification, whereas the greedy algorithm enables quick scheduling. Simulation results demonstrate their effective balancing between network throughput and communication fidelity.
title Dynamic Routing in Space-Ground Integrated Quantum Networks
topic Quantum Physics
Emerging Technologies
url https://arxiv.org/abs/2501.10252