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

IEEE Transactions on Networking

Routing and Wavelength Assignment for Entanglement Swapping in Photonic Quantum Networks

Yangyu Wang, Yangming Zhao, Hongli Xu, Liusheng Huang, Chunming Qiao

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.1109/ton.2026.3735998

Related papers

Routing and wavelength assignment in quantum key distribution networks: Power control heuristics for quantum–classical multiplexing

Lidia Ruiz Pérez, Juan Carlos García-Escartín

•Jan 1, 2026•0 citations

Routing and Wavelength Assignment for Entanglement Swapping of Photonic Qubits

Yangyu Wang, Yangming Zhao, Liusheng Huang +1 more

Efficient entanglement routing in Quantum Data Networks (QDNs) is essential in order to concurrently establish as many Entanglement Connections (ECs) as possible, which in turn maximizes the network throughput. In this work, we consider a new class of QDNs with wavelength division multiplexed (WDM) quantum links where each quantum repeater will perform entanglement swapping by measuring two photonic qubits coming from some entangled photon sources directly on the same wavelength. To address unique challenges in achieving a high network throughput in such QDNs, we propose QuRWA to jointly optimize the entanglement routing and wavelength assignment. To this end, we introduce a key concept named Co-Path to improve fault-tolerance: all ELs in a Co-Path set will be assigned the same wavelength and this may serve as backup for some other ELs in the same Co-Path when establishing ECs. We design efficient algorithms to optimize the Co-Path selection and wavelength assignment to maximize resource utilization and fault tolerance. Extensive simulations demonstrate that compared with the methods without introducing Co-Path, QuRWA improves the network throughput by up to 122%.

IEEE Conference on Computer Communications (INFOCOM)•May 20, 2024•3 citations

Efficient Entanglement Routing for Enhancing Throughput in Quantum Networks

Yaliang Shi, Zhiwei Zhao, Geyong Min +2 more

IEEE Internet of Things Journal•Jan 1, 2026•0 citations

An Entanglement Swapping Throughput Analysis for Quantum Networks Using Linear Quantum Optics

Kurt T. Spranger, Michael R. Grimaila, Douglas D. Hodson

Communications in computer and information science•Jan 1, 2025•0 citations

Multiuser Time-Energy Entanglement Swapping Based on Dense Wavelength Division Multiplexed and Sum-Frequency Generation

Yuanhua Li, Yiwen Huang, Tong Xiang +4 more

Perfect entanglement swapping, which can be realized without the postselection by using the nonlinear optical technology, provides an important way toward generating the large-scale quantum network. We explore an entanglement-swapping-based dense wavelength division multiplexed network in the experiment. Four users receive single quantum states at different wavelengths, and we perform a time-energy entanglement swapping operation based on the sum-frequency generation to make users fully connected in the network. The results show that the fidelity of the entangled state is larger than 90% and is independent of the number of users. Our Letter demonstrates the feasibility of a proposed multiuser network, and hence paves a route toward a variety of quantum applications, including entanglement-swapping-based quantum direct communication.

Physical Review Letters•Dec 20, 2019•39 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
Efficient entanglement routing in Quantum Data Networks (QDNs) is essential in order to concurrently establish as many Entanglement Connections (ECs) as possible, which in turn maximizes the network throughput. In this work, we consider a new class of QDNs with wavelength division multiplexed (WDM) quantum links where each quantum repeater will perform entanglement swapping by measuring two photonic qubits coming from some entangled photon sources directly on the same wavelength. To address unique challenges in achieving a high network throughput in such QDNs, we propose QuRWA to jointly optimize the entanglement routing and wavelength assignment. To this end, we introduce a key concept named Co-Path to improve fault-tolerance: all ELs in a Co-Path set will be assigned the same wavelength and this may serve as backup for some other ELs in the same Co-Path when establishing ECs. We design efficient algorithms to optimize the Co-Path selection and wavelength assignment to maximize resource utilization and fault tolerance. Extensive simulations demonstrate that compared with the methods without introducing Co-Path, QuRWA improves the network throughput by up to 122%.
Perfect entanglement swapping, which can be realized without the postselection by using the nonlinear optical technology, provides an important way toward generating the large-scale quantum network. We explore an entanglement-swapping-based dense wavelength division multiplexed network in the experiment. Four users receive single quantum states at different wavelengths, and we perform a time-energy entanglement swapping operation based on the sum-frequency generation to make users fully connected in the network. The results show that the fidelity of the entangled state is larger than 90% and is independent of the number of users. Our Letter demonstrates the feasibility of a proposed multiuser network, and hence paves a route toward a variety of quantum applications, including entanglement-swapping-based quantum direct communication.
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.