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

International Conference on Communications

Socially-Aware Concurrent Entanglement Routing in Satellite-Assisted Multi-Domain Quantum Networks

Shao-Min Huang, Cheng-Yang Cheng, Yung-Hsuan Tsao, Hsiu-Ching Wang, Jian-Jhih Kuo

Published May 28, 2023• 4 citations
Publisher

Abstract

Quantum teleportation through quantum entanglement over optical fiber channels enables secure communications. However, physical obstacles such as oceans and mountains may block optical fiber channels, and thus quantum networks (QNs) may have multiple disjoint domains. To overcome the issue, in this paper, we first propose a promising framework termed SSR to leverage satellite-based Free-Space Optical (FSO) channels to create inter-domain entangled paths for long-distance requests. Still, FSO channels may be intermittent due to satellite sparsity and atmospheric turbulence. Then, we introduce two algorithms, named RAIN and IDOL, to efficiently utilize FSO channels in SSR. RAIN estimates the existence probability of FSO channels to plan an appropriate inter-domain routing for each request while balancing domain loads. IDOL selects desired intra-domain paths and trusted repeaters for each request to teleport data qubits. Finally, simulation results manifest that SSR runs efficiently and outperforms existing approaches by 31%–57% in throughput.

DOI
10.1109/icc45041.2023.10279832

Related papers

Socially-aware Concurrent Entanglement Routing with Path Decomposition in Quantum Networks

Shao-Min Huang, Ming-Huang Chien, Cheng-Yang Cheng +2 more

Quantum teleportation via quantum entanglement enables high-security communications in networks. However, if two quantum nodes are far away, it may be difficult to create an entangled path due to the low success probability. Besides, existing approaches neglect social relations among nodes' owners. In this paper, we propose a new framework SEER to minimize the waiting time of all source-destination (SD) pairs' requests. SEER has two promising features: 1) Social-relation Consideration. SEER makes the first attempt to select trusted owners' nodes via social networks as intermediate nodes for requests to temporarily store data qubits to increase the success probability. 2) Starvation Mitigation. SEER divides long SD pairs and slices resources reasonably to remedy starvation due to their low success probability. To this end, we design RATE and PLAN to find the proper intermediate nodes and reduce the average waiting time. Simulation results manifest SEER outperforms others by 37%.

Globecom•Dec 4, 2022•9 citations

Quantum Error Correction Based Entanglement Routing in Socially-Aware Quantum Networks

Shao-Min Huang, Ming-Huang Chien, Ting-Yuan Wen +2 more

Quantum teleportation enables high-security communications via quantum entanglement. However, decoherence, signal decay, and environmental interference may cause imperfect entangled pairs with low fidelity. Such entangled pairs may easily generate errors when used to teleport data qubits and cause fatal computation errors on quantum computers. Fortunately, data qubits can be encoded via quantum error correction (QEC) code to recover the detected error to some extent. Nevertheless, letting any repeaters process data qubits is dangerous because malicious repeaters may peep at, destroy, or fake the data qubits. Thus, in this paper, we propose a novel QEC-enabled routing framework MOON facilitated with the concept of social networks (SNs) for quantum networks (QNs). MOON selects only trusted repeaters to process data qubits and exhibits elastic routing with QEC to maximize the throughput without errors. Last, simulation results show that our framework can outperform existing approaches by up to 34% on network throughput without errors.

Globecom•Dec 8, 2024•1 citation

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

Efficient Entanglement Routing for Satellite-Aerial-Terrestrial Quantum Networks

Yu Zhang, Yanmin Gong, Lei Fan +3 more

In the era of 6G and beyond, space-aerial-terrestrial quantum networks (SATQNs) are poised to advance the development of a global-scale quantum Internet. These networks leverage free space optical satellite and aerial quantum networks to complement optical fiber-based terrestrial quantum networks to enable the distribution of high-fidelity quantum entanglement over long distances. However, establishing multi-hop end-to-end quantum entanglement remains highly challenging, not only due to time-varying link conditions and structural heterogeneity inherent in SATQNs, but also because noise in quantum channels and imperfections in quantum operations can degrade the quality of entanglement. To address this challenge, we formulate an optimization problem that maximizes SATQN throughput by jointly optimizing routing path selection and entanglement generation rates (PS-EGR) while ensuring high entanglement fidelity. The resulting problem is a mixed-integer linear programming (MILP) formulation, which is NP-hard. We propose a Benders’ decomposition (BD)-based approach to solve this problem efficiently. Specifically, the MILP is decomposed into a master problem for binary routing path selection and a subproblem for continuous entanglement generation rate optimization. Numerical results validate the effectiveness of the proposed PS-EGR scheme, offering critical insights into the optimization and deployment of SATQNs.

arXiv:2409.13517•International Conference on Computer Communications and Networks (ICCCN)•Aug 4, 2025•6 citations

Distillation-Enhanced Continuous-Variable Quantum Teleportation for Satellite Communication Networks

Lia Suci Waliani, Georges Kaddoum, Mahdi Chehimi +1 more

Quantum teleportation (QT) over satellite-based free-space optical (FSO) channels is a promising approach for long-distance quantum communication. However, its performance is significantly degraded by atmospheric loss and turbulence. In this paper, we investigate continuous-variable (CV) QT in a dual-downlink scenario, where a satellite distributes entangled states to two ground stations. To mitigate channel-induced degradation, we employ a non-Gaussian entanglement distillation protocol based on the sequential application of photon addition and photon subtraction (PA-PS) on the weaker channel. The results show that the proposed scheme improves teleportation fidelity by up to 7.7% and enhances entanglement negativity by approximately 105% in the low-to-moderate (below 600 km) loss regime. In addition, we identify an optimal squeezing parameter that balances entanglement strength and noise sensitivity. Taken together, these results demonstrate the effectiveness of PA-PS distillation for improving CV quantum communication in realistic satellite networks. We further characterize the trade-off between fidelity gain and the heralded success probability of the protocol.

quant-pharXiv:2607.08977•Jul 13, 2026•0 citations

Online Entanglement Routing in Quantum Networks

Lan Yang, Yangming Zhao, Hongli Xu +1 more

Quantum Data Networks (QDNs) typically leverage teleportation to reliably send data quantum bits (called qubits) to their destinations. To teleport a data qubit from Alice to Bob, one entanglement connection between Alice and Bob needs to be established. Accordingly, we have to establish as many entanglement connections as possible with limited quantum resources in order to maximize the network throughput. Conventional methods assume a known traffic matrix and calculate the paths to establish entanglement connections in one batch using a centralized algorithm. However, these methods are not scalable in large scale QDNs since it is time consuming to optimize the entanglement paths for a batch of requests, which may result in a long time slot duration and significantly reduce the network throughput. To address this issue, we propose an Online Entanglement Routing (OER) scheme which determines the entanglement paths for each request when it arrives. In addition, OER pursues work conservation and fairness among all requests in the QDNs. Through extensive simulations, we demonstrate that OER not only outperforms two representative heuristics by up to 61.27% and 52.79%, respectively, in terms of average request completion time, but also achieves a better fairness performance than these two counterparts.

International Workshop on Quality of Service•Jun 10, 2022•40 citations
Quantum teleportation through quantum entanglement over optical fiber channels enables secure communications. However, physical obstacles such as oceans and mountains may block optical fiber channels, and thus quantum networks (QNs) may have multiple disjoint domains. To overcome the issue, in this paper, we first propose a promising framework termed SSR to leverage satellite-based Free-Space Optical (FSO) channels to create inter-domain entangled paths for long-distance requests. Still, FSO channels may be intermittent due to satellite sparsity and atmospheric turbulence. Then, we introduce two algorithms, named RAIN and IDOL, to efficiently utilize FSO channels in SSR. RAIN estimates the existence probability of FSO channels to plan an appropriate inter-domain routing for each request while balancing domain loads. IDOL selects desired intra-domain paths and trusted repeaters for each request to teleport data qubits. Finally, simulation results manifest that SSR runs efficiently and outperforms existing approaches by 31%–57% in throughput.
Quantum teleportation via quantum entanglement enables high-security communications in networks. However, if two quantum nodes are far away, it may be difficult to create an entangled path due to the low success probability. Besides, existing approaches neglect social relations among nodes' owners. In this paper, we propose a new framework SEER to minimize the waiting time of all source-destination (SD) pairs' requests. SEER has two promising features: 1) Social-relation Consideration. SEER makes the first attempt to select trusted owners' nodes via social networks as intermediate nodes for requests to temporarily store data qubits to increase the success probability. 2) Starvation Mitigation. SEER divides long SD pairs and slices resources reasonably to remedy starvation due to their low success probability. To this end, we design RATE and PLAN to find the proper intermediate nodes and reduce the average waiting time. Simulation results manifest SEER outperforms others by 37%.
Quantum teleportation enables high-security communications via quantum entanglement. However, decoherence, signal decay, and environmental interference may cause imperfect entangled pairs with low fidelity. Such entangled pairs may easily generate errors when used to teleport data qubits and cause fatal computation errors on quantum computers. Fortunately, data qubits can be encoded via quantum error correction (QEC) code to recover the detected error to some extent. Nevertheless, letting any repeaters process data qubits is dangerous because malicious repeaters may peep at, destroy, or fake the data qubits. Thus, in this paper, we propose a novel QEC-enabled routing framework MOON facilitated with the concept of social networks (SNs) for quantum networks (QNs). MOON selects only trusted repeaters to process data qubits and exhibits elastic routing with QEC to maximize the throughput without errors. Last, simulation results show that our framework can outperform existing approaches by up to 34% on network throughput without errors.
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.
In the era of 6G and beyond, space-aerial-terrestrial quantum networks (SATQNs) are poised to advance the development of a global-scale quantum Internet. These networks leverage free space optical satellite and aerial quantum networks to complement optical fiber-based terrestrial quantum networks to enable the distribution of high-fidelity quantum entanglement over long distances. However, establishing multi-hop end-to-end quantum entanglement remains highly challenging, not only due to time-varying link conditions and structural heterogeneity inherent in SATQNs, but also because noise in quantum channels and imperfections in quantum operations can degrade the quality of entanglement. To address this challenge, we formulate an optimization problem that maximizes SATQN throughput by jointly optimizing routing path selection and entanglement generation rates (PS-EGR) while ensuring high entanglement fidelity. The resulting problem is a mixed-integer linear programming (MILP) formulation, which is NP-hard. We propose a Benders’ decomposition (BD)-based approach to solve this problem efficiently. Specifically, the MILP is decomposed into a master problem for binary routing path selection and a subproblem for continuous entanglement generation rate optimization. Numerical results validate the effectiveness of the proposed PS-EGR scheme, offering critical insights into the optimization and deployment of SATQNs.
Quantum teleportation (QT) over satellite-based free-space optical (FSO) channels is a promising approach for long-distance quantum communication. However, its performance is significantly degraded by atmospheric loss and turbulence. In this paper, we investigate continuous-variable (CV) QT in a dual-downlink scenario, where a satellite distributes entangled states to two ground stations. To mitigate channel-induced degradation, we employ a non-Gaussian entanglement distillation protocol based on the sequential application of photon addition and photon subtraction (PA-PS) on the weaker channel. The results show that the proposed scheme improves teleportation fidelity by up to 7.7% and enhances entanglement negativity by approximately 105% in the low-to-moderate (below 600 km) loss regime. In addition, we identify an optimal squeezing parameter that balances entanglement strength and noise sensitivity. Taken together, these results demonstrate the effectiveness of PA-PS distillation for improving CV quantum communication in realistic satellite networks. We further characterize the trade-off between fidelity gain and the heralded success probability of the protocol.
Quantum Data Networks (QDNs) typically leverage teleportation to reliably send data quantum bits (called qubits) to their destinations. To teleport a data qubit from Alice to Bob, one entanglement connection between Alice and Bob needs to be established. Accordingly, we have to establish as many entanglement connections as possible with limited quantum resources in order to maximize the network throughput. Conventional methods assume a known traffic matrix and calculate the paths to establish entanglement connections in one batch using a centralized algorithm. However, these methods are not scalable in large scale QDNs since it is time consuming to optimize the entanglement paths for a batch of requests, which may result in a long time slot duration and significantly reduce the network throughput. To address this issue, we propose an Online Entanglement Routing (OER) scheme which determines the entanglement paths for each request when it arrives. In addition, OER pursues work conservation and fairness among all requests in the QDNs. Through extensive simulations, we demonstrate that OER not only outperforms two representative heuristics by up to 61.27% and 52.79%, respectively, in terms of average request completion time, but also achieves a better fairness performance than these two counterparts.