Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2409.17032

Space-Based Quantum Internet: Entanglement Distribution in Time-Varying LEO Constellations

Seid Koudia, Junaid ur Rehman, Symeon Chatzinotas

Published Sep 25, 2024• 0 citations
arXivHTMLPDF

Abstract

This paper addresses the complexities of entanglement distribution in LEO satellite networks, particularly those arising from their dynamic topology. Traditional static and dynamic entanglement distribution methods often result in high entanglement drop rates and reduced end-to-end throughput. We introduce a novel framework that leverages the dynamic nature of LEO satellite networks to enhance entanglement distribution efficiency. Employing a space-time graph model to represent the network's temporal evolution, we propose an entanglement distribution strategy based on path utility, incorporating pointing errors, non-ideal link transmittance for intersatellite links, and atmospheric effects for downlinks. Our approach demonstrates superior performance in reducing entanglement drop rates and improving throughput compared to conventional methods. This study advances the field of quantum communication in satellite networks, offering resilient and efficient entanglement distribution strategies that support practical applications such as distributed computing, quantum multipartite cryptography, and distributed quantum sensing. The findings underscore the potential of integrating dynamic satellite networks with quantum technologies to create a reliable and secure quantum internet.

DOI
10.48550/arxiv.2409.17032

Related papers

Markov Chain Model of Entanglement Setup in Noisy Dynamic LEO Satellite Networks

Yifan Gao, Alvin Valera, Winston K. G. Seah

Quantum entanglement routing in dynamic Low Earth Orbit (LEO) satellite networks is important for achieving scalable and high-fidelity quantum communication. However, the dynamic characteristics of satellite network topology, limited quantum resources, and strict coherence time constraints pose significant challenges to reliable entanglement routing. An entanglement distribution analysis model for this unique environment is critical and helpful for entanglement routing research. We address the fundamental challenge of establishing and maintaining quantum entanglement links between satellites operating in free space, where links are subject to both transmission losses and quantum memory decoherence. This paper presents a comprehensive Markov chain model with a state space defined by link storage age and physical distance for analyzing entanglement distribution in noisy dynamic LEO satellite quantum networks. We construct transition matrices that capture system dynamics under varying request arrival rates, and derive analytical expressions for key performance metrics, including request satisfaction rate, average waiting time, link utilization efficiency, and average consumed link fidelity. Our analysis reveals that the critical trade-offs of higher request rates lead to faster link consumption with higher fidelity but potentially lower satisfaction rates, while lower request rates allow longer storage times at the cost of lower fidelity of increased decoherence effect. Moreover, this paper proves it is reasonable to leave out polarization rotation when the transmission distance is very short (40-50 km). In summary, this work provides theoretical foundations for designing and optimizing quantum entanglement distribution strategies in satellite networks, with applications to global-scale quantum communications.

quant-pharXiv:2512.20047•Dec 24, 2025•0 citations

Quantum Communication in 6G Satellite Networks: Entanglement Distribution Across Changing Topologies

Arunabha Sen, Christopher Sumnicht, Sandipan Choudhuri +3 more

As LEO/VLEO satellites offer many attractive features, such as low transmission delay, they are expected to be an integral part of 6G. Global entanglement distribution over LEO and VLEO satellite network must reckon with satellite movement over time. Current studies do not fully capture the dynamic nature of satellite constellations. We model a dynamic LEO/VLEO satellite network as a time-varying graph and construct a sequence of static graphs to represent a dynamic network. We study the entanglement distribution problem between a set of source-destination node pairs in this dynamic network utilizing Multi-commodity Flow (MCF). Solving MCF over a sequence of graphs independently for each graph may produce a completely different set of paths. Changing the set of paths every time the graph topology changes may involve a significant amount of overhead, as an established set of paths must be taken down and a new set of paths established. We propose a technique that will avoid this overhead by computing only one set of paths P to be used over all the graphs in the sequence. The degraded performance offered by$P$may be viewed as the cost of using P. The benefit of using$P$is the overhead cost of path switching that can be avoided. We provide a cost-benefit analysis in a LEO/VLEO constellation for entanglement distribution between multiple source-destination pairs. Our extensive experimentation shows that a significant amount of savings in overhead can be achieved if one is willing to accept a slightly degraded performance.

arXiv:2307.11272•International Conference on Communications•Jun 9, 2024•2 citations

Entanglement Distribution in LEO Satellite-based Dynamic Quantum Networks

Alena Chang, Yinxin Wan, Xuanli Lin +2 more

Recent advances in space quantum communications envision Low Earth Orbit (LEO) satellites for global entanglement distribution. Entanglement distribution in such a network requires considerations such as satellite mobility, ground station mobility due to the Earth’s rotation, inter-satellite links, and multiple orbital shells, all of which have not been thoroughly studied in the networking literature. We ameliorate this deficit by defining a system model which accounts for all of the aforementioned factors. Using this system model, we formulate the dynamic optimal entanglement distribution (DOED) problem. We convert the DOED problem in a dynamic physical network to an instance of the problem in a static logical graph, the latter of which can be used to solve the former. We obtain a reduced logical graph from a logical graph, which can be used to reduce the complexity of solving the DOED problem. We propose two polynomial-time greedy algorithms for computing entanglement paths, as well as an integer linear programming (ILP)-based algorithm as a benchmark. We present evaluation results to demonstrate the advantages of our model and algorithms.

Globecom•Dec 8, 2024•0 citations

Optimal Entanglement Distribution Problem in Satellite-Based Quantum Networks

Xinliang Wei, Jiyao Liu, Lei Fan +3 more

Satellite-based quantum networks are emerging as a promising solution for the development of a global quantum internet in the near future. The ability to leverage the advantageous lower attenuation of optical signals from satellites to ground presents an exciting opportunity to establish a robust and secure quantum communication infrastructure on a global scale. By utilizing a constellation of satellites, it becomes feasible to continuously distribute high-fidelity quantum entanglements among ground stations over long distances, overcoming the limitations of traditional terrestrial-based quantum communication systems. In this article, we first provide a brief survey of existing solutions for satellite-based entanglement distribution, highlighting the various approaches and technologies that have been employed in this rapidly evolving field. We then delve into a formulated optimal entanglement distribution problem, aiming to optimize the distribution of quantum entanglement resources across the satellite network to maximize efficiency and reliability. This problem is addressed through a detailed exploration of several different methodologies and algorithms, each tailored to specific operational settings and constraints. Our experimental results confirm the efficiency of these approaches and provide valuable insights into their practical implementation and performance. Finally, we identify several key directions for further study and development in the realm of satellite-based quantum networks.

IEEE Network•May 8, 2024•20 citations

Entanglement Distribution in Satellite-Based Dynamic Quantum Networks

Alena Chang, Yinxin Wan, Guoliang Xue +1 more

Low Earth Orbit (LEO) satellites present a compelling opportunity for the establishment of a global quantum information network. However, satellite-based entanglement distribution from a networking perspective has not been fully investigated. Existing works often do not account for satellite movement over time when distributing entanglement and/or often do not permit entanglement distribution along inter-satellite links, which are two shortcomings we address in this paper. We first define a system model which considers both satellite movement over time and inter-satellite links. We next formulate the optimal entanglement distribution (OED) problem under this system model and show how to convert the OED problem in a dynamic physical network to one in a static logical graph which can be used to solve the OED problem in the dynamic physical network. We then propose a polynomial time greedy algorithm for computing satellite-assisted multi-hop entanglement paths. We also design an integer linear programming (ILP)-based algorithm to compute optimal solutions as a baseline to study the performance of our greedy algorithm. We present evaluation results to demonstrate the advantage of our model and algorithms.

arXiv:2306.08894•IEEE Network•Oct 13, 2023•10 citations

Adaptive Entanglement-Aware Routing for Satellite Quantum Networks under Orbital and Atmospheric Variability

Dhrumil Bhatt, Vidushi Kumar

The expansion of satellite-based quantum networks requires adaptive routing mechanisms that can sustain entanglement under dynamic orbital and atmospheric conditions. Conventional schemes, often tailored to static or idealised topologies, fail to capture the combined effects of orbital motion, fading, and trust variability in inter-satellite links. This work proposes an \textit{adaptive entanglement-aware routing framework} that jointly accounts for orbital geometry, atmospheric attenuation, and multi-parameter link evaluation. The routing metric integrates fidelity, trust, and key-rate weights to maintain connectivity and mitigate loss from turbulence and fading. Monte Carlo simulations across multiple orbital densities ($ρ= 10^{-6}$~km$^{-3}$) and environmental regimes, standard atmosphere, strong turbulence, and clear-sky LEO show up to a 275\% improvement in key generation rate and a 15\% increase in effective entanglement fidelity over existing adaptive methods. The framework achieves sub-linear path-length scaling with network size and remains robust for fading variances up to $σ_{\mathrm{fade}}=0.1$, demonstrating strong potential for future global quantum constellations.

quant-pharXiv:2511.05228•IEEE International Conference on Advanced Networks and Telecommunications Systems•Nov 10, 2025•0 citations
This paper addresses the complexities of entanglement distribution in LEO satellite networks, particularly those arising from their dynamic topology. Traditional static and dynamic entanglement distribution methods often result in high entanglement drop rates and reduced end-to-end throughput. We introduce a novel framework that leverages the dynamic nature of LEO satellite networks to enhance entanglement distribution efficiency. Employing a space-time graph model to represent the network's temporal evolution, we propose an entanglement distribution strategy based on path utility, incorporating pointing errors, non-ideal link transmittance for intersatellite links, and atmospheric effects for downlinks. Our approach demonstrates superior performance in reducing entanglement drop rates and improving throughput compared to conventional methods. This study advances the field of quantum communication in satellite networks, offering resilient and efficient entanglement distribution strategies that support practical applications such as distributed computing, quantum multipartite cryptography, and distributed quantum sensing. The findings underscore the potential of integrating dynamic satellite networks with quantum technologies to create a reliable and secure quantum internet.
Quantum entanglement routing in dynamic Low Earth Orbit (LEO) satellite networks is important for achieving scalable and high-fidelity quantum communication. However, the dynamic characteristics of satellite network topology, limited quantum resources, and strict coherence time constraints pose significant challenges to reliable entanglement routing. An entanglement distribution analysis model for this unique environment is critical and helpful for entanglement routing research. We address the fundamental challenge of establishing and maintaining quantum entanglement links between satellites operating in free space, where links are subject to both transmission losses and quantum memory decoherence. This paper presents a comprehensive Markov chain model with a state space defined by link storage age and physical distance for analyzing entanglement distribution in noisy dynamic LEO satellite quantum networks. We construct transition matrices that capture system dynamics under varying request arrival rates, and derive analytical expressions for key performance metrics, including request satisfaction rate, average waiting time, link utilization efficiency, and average consumed link fidelity. Our analysis reveals that the critical trade-offs of higher request rates lead to faster link consumption with higher fidelity but potentially lower satisfaction rates, while lower request rates allow longer storage times at the cost of lower fidelity of increased decoherence effect. Moreover, this paper proves it is reasonable to leave out polarization rotation when the transmission distance is very short (40-50 km). In summary, this work provides theoretical foundations for designing and optimizing quantum entanglement distribution strategies in satellite networks, with applications to global-scale quantum communications.
As LEO/VLEO satellites offer many attractive features, such as low transmission delay, they are expected to be an integral part of 6G. Global entanglement distribution over LEO and VLEO satellite network must reckon with satellite movement over time. Current studies do not fully capture the dynamic nature of satellite constellations. We model a dynamic LEO/VLEO satellite network as a time-varying graph and construct a sequence of static graphs to represent a dynamic network. We study the entanglement distribution problem between a set of source-destination node pairs in this dynamic network utilizing Multi-commodity Flow (MCF). Solving MCF over a sequence of graphs independently for each graph may produce a completely different set of paths. Changing the set of paths every time the graph topology changes may involve a significant amount of overhead, as an established set of paths must be taken down and a new set of paths established. We propose a technique that will avoid this overhead by computing only one set of paths P to be used over all the graphs in the sequence. The degraded performance offered byPPPmay be viewed as the cost of using P. The benefit of usingPPPis the overhead cost of path switching that can be avoided. We provide a cost-benefit analysis in a LEO/VLEO constellation for entanglement distribution between multiple source-destination pairs. Our extensive experimentation shows that a significant amount of savings in overhead can be achieved if one is willing to accept a slightly degraded performance.
Recent advances in space quantum communications envision Low Earth Orbit (LEO) satellites for global entanglement distribution. Entanglement distribution in such a network requires considerations such as satellite mobility, ground station mobility due to the Earth’s rotation, inter-satellite links, and multiple orbital shells, all of which have not been thoroughly studied in the networking literature. We ameliorate this deficit by defining a system model which accounts for all of the aforementioned factors. Using this system model, we formulate the dynamic optimal entanglement distribution (DOED) problem. We convert the DOED problem in a dynamic physical network to an instance of the problem in a static logical graph, the latter of which can be used to solve the former. We obtain a reduced logical graph from a logical graph, which can be used to reduce the complexity of solving the DOED problem. We propose two polynomial-time greedy algorithms for computing entanglement paths, as well as an integer linear programming (ILP)-based algorithm as a benchmark. We present evaluation results to demonstrate the advantages of our model and algorithms.
Satellite-based quantum networks are emerging as a promising solution for the development of a global quantum internet in the near future. The ability to leverage the advantageous lower attenuation of optical signals from satellites to ground presents an exciting opportunity to establish a robust and secure quantum communication infrastructure on a global scale. By utilizing a constellation of satellites, it becomes feasible to continuously distribute high-fidelity quantum entanglements among ground stations over long distances, overcoming the limitations of traditional terrestrial-based quantum communication systems. In this article, we first provide a brief survey of existing solutions for satellite-based entanglement distribution, highlighting the various approaches and technologies that have been employed in this rapidly evolving field. We then delve into a formulated optimal entanglement distribution problem, aiming to optimize the distribution of quantum entanglement resources across the satellite network to maximize efficiency and reliability. This problem is addressed through a detailed exploration of several different methodologies and algorithms, each tailored to specific operational settings and constraints. Our experimental results confirm the efficiency of these approaches and provide valuable insights into their practical implementation and performance. Finally, we identify several key directions for further study and development in the realm of satellite-based quantum networks.
Low Earth Orbit (LEO) satellites present a compelling opportunity for the establishment of a global quantum information network. However, satellite-based entanglement distribution from a networking perspective has not been fully investigated. Existing works often do not account for satellite movement over time when distributing entanglement and/or often do not permit entanglement distribution along inter-satellite links, which are two shortcomings we address in this paper. We first define a system model which considers both satellite movement over time and inter-satellite links. We next formulate the optimal entanglement distribution (OED) problem under this system model and show how to convert the OED problem in a dynamic physical network to one in a static logical graph which can be used to solve the OED problem in the dynamic physical network. We then propose a polynomial time greedy algorithm for computing satellite-assisted multi-hop entanglement paths. We also design an integer linear programming (ILP)-based algorithm to compute optimal solutions as a baseline to study the performance of our greedy algorithm. We present evaluation results to demonstrate the advantage of our model and algorithms.
The expansion of satellite-based quantum networks requires adaptive routing mechanisms that can sustain entanglement under dynamic orbital and atmospheric conditions. Conventional schemes, often tailored to static or idealised topologies, fail to capture the combined effects of orbital motion, fading, and trust variability in inter-satellite links. This work proposes an \textit{adaptive entanglement-aware routing framework} that jointly accounts for orbital geometry, atmospheric attenuation, and multi-parameter link evaluation. The routing metric integrates fidelity, trust, and key-rate weights to maintain connectivity and mitigate loss from turbulence and fading. Monte Carlo simulations across multiple orbital densities (ρ=10−6ρ= 10^{-6}ρ=10−6~km−3^{-3}−3) and environmental regimes, standard atmosphere, strong turbulence, and clear-sky LEO show up to a 275\% improvement in key generation rate and a 15\% increase in effective entanglement fidelity over existing adaptive methods. The framework achieves sub-linear path-length scaling with network size and remains robust for fading variances up to σfade=0.1σ_{\mathrm{fade}}=0.1σfade​=0.1, demonstrating strong potential for future global quantum constellations.