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

• URL: http://arxiv.org/abs/2512.20047v1
• Date: Tue, 23 Dec 2025 04:46:40 GMT
• Title: Markov Chain Model of Entanglement Setup in Noisy Dynamic LEO Satellite Networks
• Authors: Yifan Gao, Alvin Valera, Winston K. G. Seah,
• Abstract summary: This paper presents a comprehensive Markov chain model with a state space defined by link storage age and physical distance.<n>We derive analytical expressions for key performance metrics, including request satisfaction rate, average waiting time, link utilization efficiency, and average consumed link fidelity.<n>This work provides theoretical foundations for designing and optimizing quantum entanglement distribution strategies in satellite networks, with applications to global-scale quantum communications.
• Score: 4.736563450033072
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Dynamic Scheduling in Fiber and Spaceborne Quantum Repeater Networks [0.0]
  We present a framework to mathematically formulate the scheduling problem over quantum networks.<n>By leveraging the framework, we apply Lyapunov drift minimization to derive a novel class of quadratic optimization based scheduling policies.<n>We also report on the development of numerous extensions to QuISP, an established quantum network simulator.
  arXiv  Detail & Related papers  (2025-10-07T12:23:46Z)
• Joint AoI and Handover Optimization in Space-Air-Ground Integrated Network [48.485907216785904]
  Low Earth orbit (LEO) satellite constellations offer promising solutions with global coverage and reduced latency.<n>Yet struggle with intermittent coverage and intermittent communication windows due to orbital dynamics.<n>Our three-layer design employs hybrid free-space optical (FSO) links for high-capacity satellite-to-ground communication and reliable radio frequency (RF) links for HAP-to-ground transmission.
  arXiv  Detail & Related papers  (2025-09-16T06:16:56Z)
• Reinforcement Learning for Quantum Network Control with Application-Driven Objectives [53.03367590211247]
  Dynamic programming and reinforcement learning offer promising tools for optimizing control strategies.<n>We propose a novel RL framework that directly optimize non-linear, differentiable objective functions.<n>Our work comprises the first step towards non-linear objective function optimization in quantum networks with RL, opening a path towards more advanced use cases.
  arXiv  Detail & Related papers  (2025-09-12T18:41:10Z)
• Space-Based Quantum Internet: Entanglement Distribution in Time-Varying LEO Constellations [36.80897914664451]
  We introduce a novel framework that leverages the dynamic nature of LEO satellite networks to enhance entanglement distribution efficiency. Our approach demonstrates superior performance in reducing entanglement drop rates and improving throughput compared to conventional methods.
  arXiv  Detail & Related papers  (2024-09-25T15:33:08Z)
• Satellite Federated Edge Learning: Architecture Design and Convergence Analysis [47.057886812985984]
  This paper introduces a novel FEEL algorithm, named FEDMEGA, tailored to mega-constellation networks. By integrating inter-satellite links (ISL) for intra-orbit model aggregation, the proposed algorithm significantly reduces the usage of low data rate and intermittent GSL. Our proposed method includes a ring all-reduce based intra-orbit aggregation mechanism, coupled with a network flow-based transmission scheme for global model aggregation.
  arXiv  Detail & Related papers  (2024-04-02T11:59:58Z)
• Elastic Entangled Pair and Qubit Resource Management in Quantum Cloud Computing [73.7522199491117]
  Quantum cloud computing (QCC) offers a promising approach to efficiently provide quantum computing resources. The fluctuations in user demand and quantum circuit requirements are challenging for efficient resource provisioning. We propose a resource allocation model to provision quantum computing and networking resources.
  arXiv  Detail & Related papers  (2023-07-25T00:38:46Z)
• Scaling Limits of Quantum Repeater Networks [62.75241407271626]
  Quantum networks (QNs) are a promising platform for secure communications, enhanced sensing, and efficient distributed quantum computing. Due to the fragile nature of quantum states, these networks face significant challenges in terms of scalability. In this paper, the scaling limits of quantum repeater networks (QRNs) are analyzed.
  arXiv  Detail & Related papers  (2023-05-15T14:57:01Z)
• Entangled Pair Resource Allocation under Uncertain Fidelity Requirements [59.83361663430336]
  In quantum networks, effective entanglement routing facilitates communication between quantum source and quantum destination nodes. We propose a resource allocation model for entangled pairs and an entanglement routing model with a fidelity guarantee. Our proposed model can reduce the total cost by at least 20% compared to the baseline model.
  arXiv  Detail & Related papers  (2023-04-10T07:16:51Z)
• Analytical Methods for High-Rate Global Quantum Networks [0.0]
  Ground-based quantum networks employ photons as information carriers through optical-fibres. We introduce a large-scale quantum network model called weakly-regular architectures. This allows us to investigate the effectiveness of large-scale networks with consistent connective properties.
  arXiv  Detail & Related papers  (2021-04-21T18:01:43Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.