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

Globecom

Socially-Aware Opportunistic Routing with Path Segment Selection in Quantum Networks

Shao-Min Huang, Cheng-Yang Cheng, Ming-Huang Chien, Ting-Yuan Wen, Qian-Jing Wang, Jian-Jhih Kuo

Published Dec 4, 2023• 2 citations
Publisher

Abstract

The conventional quantum teleportation schemes enable high-security network communications by establishing end-to-end entangled paths. However, those schemes focus on time synchronization and thus cause lots of idle time. Recent research suggests adopting an opportunistic scheme to forward data qubits as far as it can. However, this scheme lacks security since data qubits may be stored at malicious repeaters, which may peek at, destroy, or fake the data qubits. To this end, we design a new scheme called SOAR that considers trusted repeaters via social networks. Moreover, SOAR promotes the parallelism of swapping processes and thus leads to a less idle time of network resources than the other existing schemes. Furthermore, we design an algorithm called SAGE that can best fit SOAR by linking multiple subpaths via appropriate trusted repeaters to get an ideal path and augmenting least-hop paths to utilize the resources in quantum networks better. Simulation results manifest that SOAR outperforms the other schemes by 54%-89%; SAGE outperforms the other routing algorithms by 50% on average on SOAR.

DOI
10.1109/globecom54140.2023.10437536

Related papers

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

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

Opportunistic Routing in Quantum Networks

Farahbakhsh, Ali, Chen Feng

Unlike classical routing algorithms, quantum routing algorithms make use of entangled states - a type of resources that have a limited lifetime and need to be regenerated after consumption. In a nutshell, quantum routing algorithms have to use these resources efficiently, while optimizing some objectives such as the total waiting time. Current routing algorithms tend to keep a routing request waiting until all of the resources on its path are available. In this paper, we introduce a new way of managing entanglement resources in an opportunistic fashion: a request can move forward along its path as soon as possible (even if some resources on its path are not ready). We show that this opportunistic approach is fundamentally better than conventional approaches. In particular, our results indicate that this new approach achieves a 30-50% improvement in the average total waiting time and average link waiting time compared with several state-of-the-art routing algorithms. As a by-product of this work, we develop a new simulator for quantum routing, which can be used to evaluate various design choices under different scenarios.

arXiv:2205.08479•May 17, 2022•1 citation

Opportunistic Routing in Quantum Networks

Ali Farahbakhsh, Chen Feng

Unlike classical routing algorithms, quantum routing algorithms make use of entangled states—a type of resources that have a limited lifetime and need to be regenerated after consumption. In a nutshell, quantum routing algorithms have to use these resources efficiently, while optimizing some objectives such as the total waiting time. Current routing algorithms tend to keep a routing request waiting until all of the resources on its path are available. In this paper, we introduce a new way of managing entanglement resources in an opportunistic fashion: a request can move forward along its path as soon as possible (even if some resources on its path are not ready). We show that this opportunistic approach is fundamentally better than conventional approaches. In particular, our results indicate that this new approach achieves a 30-50% improvement in the average total waiting time and average link waiting time compared with several state-of-the-art routing algorithms. As a by-product of this work, we develop a new simulator for quantum routing, which can be used to evaluate various design choices under different scenarios.

IEEE Conference on Computer Communications (INFOCOM)•May 2, 2022•55 citations

E2E Fidelity Aware Routing and Purification for Throughput Maximization in Quantum Networks

Yangming Zhao, Gongming Zhao, Chunming Qiao

This paper studies reliable teleportation of quantum bits (called qubits) in a quantum data network with multiple sources (S) and destinations (D) as well as repeaters. To teleport qubits for a SD pair reliably, not only an entanglement path for the SD pair, but also appropriate purification of the links along the path is required to ensure that the end-to-end (E2E) fidelity of the established entanglement connections is high enough.This is the first work on quantifying the E2E fidelity, and also using this E2E fidelity to determine critical links to achieve the most resource efficient purification. A novel approach called E2E Fidelity aware Routing and Purification (EFiRAP) is proposed to maximize network throughput, i.e., the number of entanglement connections among multiple SD pairs, with each connection having an E2E fidelity above a given required threshold. EFiRAP accomplishes this goal by first preparing multiple candidate entanglement paths and determining optimal purification schemes, and then selecting the final set of entanglement paths that can maximize network throughput under the given quantum resource constraints. Existing works only ensured the fidelity of individual links, rather than the E2E fidelity is above a given threshold. Extensive simulations show that the proposed EFiRAP can enhance network throughput by about 50% when compared with the state-of-the-art approach.

IEEE Conference on Computer Communications (INFOCOM)•May 2, 2022•102 citations

Fragmentation-Aware Entanglement Routing for Quantum Networks

Shengyu Zhang, Shouqian Shi, Chen Qian +1 more

New capabilities enabled by quantum networks, e.g. quantum key distribution, rely on the concurrent quantum entanglements via multiple untrusted repeaters between the source-destination pairs, which is known as quantum routing. Existing quantum routing algorithms pre-assign the free qubits to specific paths, in order to avoid resource contention in the process of entanglement swapping. Since not all pre-assigned qubits can be utilized, the resource fragmentation problem caused can limit the network throughout. In this paper, a new fragmentation-aware entanglement routing (FER) algorithm is proposed. With FER, the entangled qubits are shared by all the paths, and the resource contention problem is solved by a priority connection mechanism. Simulation results show that FER consistently outperforms existing algorithms under different network settings.

Journal of Lightwave Technology•Apr 28, 2021•38 citations
The conventional quantum teleportation schemes enable high-security network communications by establishing end-to-end entangled paths. However, those schemes focus on time synchronization and thus cause lots of idle time. Recent research suggests adopting an opportunistic scheme to forward data qubits as far as it can. However, this scheme lacks security since data qubits may be stored at malicious repeaters, which may peek at, destroy, or fake the data qubits. To this end, we design a new scheme called SOAR that considers trusted repeaters via social networks. Moreover, SOAR promotes the parallelism of swapping processes and thus leads to a less idle time of network resources than the other existing schemes. Furthermore, we design an algorithm called SAGE that can best fit SOAR by linking multiple subpaths via appropriate trusted repeaters to get an ideal path and augmenting least-hop paths to utilize the resources in quantum networks better. Simulation results manifest that SOAR outperforms the other schemes by 54%-89%; SAGE outperforms the other routing algorithms by 50% on average on SOAR.
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.
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%.
Unlike classical routing algorithms, quantum routing algorithms make use of entangled states - a type of resources that have a limited lifetime and need to be regenerated after consumption. In a nutshell, quantum routing algorithms have to use these resources efficiently, while optimizing some objectives such as the total waiting time. Current routing algorithms tend to keep a routing request waiting until all of the resources on its path are available. In this paper, we introduce a new way of managing entanglement resources in an opportunistic fashion: a request can move forward along its path as soon as possible (even if some resources on its path are not ready). We show that this opportunistic approach is fundamentally better than conventional approaches. In particular, our results indicate that this new approach achieves a 30-50% improvement in the average total waiting time and average link waiting time compared with several state-of-the-art routing algorithms. As a by-product of this work, we develop a new simulator for quantum routing, which can be used to evaluate various design choices under different scenarios.
Unlike classical routing algorithms, quantum routing algorithms make use of entangled states—a type of resources that have a limited lifetime and need to be regenerated after consumption. In a nutshell, quantum routing algorithms have to use these resources efficiently, while optimizing some objectives such as the total waiting time. Current routing algorithms tend to keep a routing request waiting until all of the resources on its path are available. In this paper, we introduce a new way of managing entanglement resources in an opportunistic fashion: a request can move forward along its path as soon as possible (even if some resources on its path are not ready). We show that this opportunistic approach is fundamentally better than conventional approaches. In particular, our results indicate that this new approach achieves a 30-50% improvement in the average total waiting time and average link waiting time compared with several state-of-the-art routing algorithms. As a by-product of this work, we develop a new simulator for quantum routing, which can be used to evaluate various design choices under different scenarios.
This paper studies reliable teleportation of quantum bits (called qubits) in a quantum data network with multiple sources (S) and destinations (D) as well as repeaters. To teleport qubits for a SD pair reliably, not only an entanglement path for the SD pair, but also appropriate purification of the links along the path is required to ensure that the end-to-end (E2E) fidelity of the established entanglement connections is high enough.This is the first work on quantifying the E2E fidelity, and also using this E2E fidelity to determine critical links to achieve the most resource efficient purification. A novel approach called E2E Fidelity aware Routing and Purification (EFiRAP) is proposed to maximize network throughput, i.e., the number of entanglement connections among multiple SD pairs, with each connection having an E2E fidelity above a given required threshold. EFiRAP accomplishes this goal by first preparing multiple candidate entanglement paths and determining optimal purification schemes, and then selecting the final set of entanglement paths that can maximize network throughput under the given quantum resource constraints. Existing works only ensured the fidelity of individual links, rather than the E2E fidelity is above a given threshold. Extensive simulations show that the proposed EFiRAP can enhance network throughput by about 50% when compared with the state-of-the-art approach.
New capabilities enabled by quantum networks, e.g. quantum key distribution, rely on the concurrent quantum entanglements via multiple untrusted repeaters between the source-destination pairs, which is known as quantum routing. Existing quantum routing algorithms pre-assign the free qubits to specific paths, in order to avoid resource contention in the process of entanglement swapping. Since not all pre-assigned qubits can be utilized, the resource fragmentation problem caused can limit the network throughout. In this paper, a new fragmentation-aware entanglement routing (FER) algorithm is proposed. With FER, the entangled qubits are shared by all the paths, and the resource contention problem is solved by a priority connection mechanism. Simulation results show that FER consistently outperforms existing algorithms under different network settings.