Entanglement routing plays a vital role in quantum networks. Previous works on entanglement routing did not note that all-optical switching capacity can be used to improve the network throughput or ignored that the placement of Entangled Photon Sources (EPS), another type of precious (and costly) quantum source, which also limits the network throughput. In this paper, we propose OptEPS to jointly optimize all-optical switching and EPS placement in entanglement routing to maximize the quantum network throughput. The main challenge of OptEPS lies in two folds: i). an entanglement may fail to be created; ii). the joint optimization problem suffers from a large time complexity. To overcome these challenges, we first formulate the joint optimization problem as a link-path based model and prune out some candidate paths in order to reduce the time complexity. Then, efficient algorithms are proposed to derive a near-optimal solution in a timely manner. Extensive simulations show that compared with the solutions ignoring EPS placement or without introducing all-optical switching, OptEPS will increase the network throughput by 1557% and 109%, respectively.
Entanglement routing plays a vital role in quantum networks. Previous works on entanglement routing did not note that all-optical switching capacity can be used to improve the network throughput or ignored that the placement of Entangled Photon Sources (EPS), another type of precious (and costly) quantum source, which also limits the network throughput. In this paper, we propose OptEPS to jointly optimize all-optical switching and EPS placement in entanglement routing to maximize the quantum network throughput. The main challenge of OptEPS lies in two folds: i). an entanglement may fail to be created; ii). the joint optimization problem suffers from a large time complexity. To overcome these challenges, we first formulate the joint optimization problem as a link-path based model and prune out some candidate paths in order to reduce the time complexity. Then, efficient algorithms are proposed to derive a near-optimal solution in a timely manner. Extensive simulations show that compared with the solutions ignoring EPS placement or without introducing all-optical switching, OptEPS will increase the network throughput by 1557% and 109%, respectively.
Entanglement routing plays a vital role in distributed quantum computing and quantum networks. Previous works on entanglement routing have addressed several design challenges due to limited quantum resources, failures to establish entanglement, and decoherence of established entanglement, but considered neither the limitations imposed by having a limited number of entangled photon sources (EPSes), nor the benefits of using all-optical (or quantum) switching to distribute entangled photons. In this paper, we first explore the problem of jointly optimizing entanglement routing and EPS assignment, assuming no all-optical switching capability. In other words, a pair of entangled photons generated by one EPS can be distributed to two neighboring quantum nodes. We then relax the above assumption so as to allow a pair of entangled photons generated by one EPS to be distributed to non-adjacent nodes using all-optical switching. We propose two corresponding solutions, namely, entanglement routing and EPS assignment (or ERSA), and ERSA with all-optical switching-based distribution (or ERSA+D) that aim to maximize the number of entanglement connections between the given set of source-destination (SD) pairs while avoiding starvation and achieving fairness among the SD pairs. In order to obtain efficient solutions in a large discrete solution space in a timely manner, we first formulate each optimization problem as an Integer Linear Programming (ILP), and then propose efficient algorithms to derive near-optimal solutions based on relaxation, Lagrangian decomposition, duality iteration, and rounding techniques. Extensive simulations show that ERSA+D can increase network throughput by up to 1652% and 113%, respectively, thanks to EPS assignment optimization, and all-optical switching based entanglement distribution.
Entanglement routing in quantum data networks plays a vital role to support various quantum applications. Existing works on entanglement routing either ignored the Entangled Photon Source (EPS) placement issue or simply assumed a pool of EPSes at a centralized location that can provision entanglement over arbitrary quantum links. In this paper, we propose LightER to solve the joint EPS placement and entanglement routing problem based on the assumption that EPSes are distributed over a quantum network, where an EPS, which is co-located with a quantum node, can send one entangled photon at a time to one of the adjacent nodes only. The salient features of LightER include (i) LightER uses a demand-agnostic EPS placement scheme to maximize network throughput and fairness for all feasible entanglement connection (EC) establishment demands, and (ii) most of the requested ECs can be established over their corresponding Entanglement Paths (EPs) determined offline, and only a small percentage of the ECs will be established over EPs that need to be calculated online, resulting in fast and efficient entanglement routing. Extensive simulations show that compared with schemes without proper EPS placement or entanglement routing, LightER can improve the network throughput by up to 215% and 56.2%, respectively.
Entanglement routing plays a vital role in supporting various applications in quantum networks. Existing works on entanglement routing either ignored the Entangled Photon Source (EPS) placement issue or simply assumed a pool of EPSes at a centralized location that can provision entanglement over arbitrary quantum links. In this paper, we propose LIGHTER and fidelity-aware LIGHTER (named F-LIGHTER) to solve the joint EPS placement and entanglement routing problem based on the assumption that EPSes are co-located with quantum nodes and each EPS can send one entangled photon at a time to one of its adjacent nodes only. The salient features of LIGHTER and F-LIGHTER include (i) LIGHTER and F-LIGHTER use a demand-agnostic EPS placement scheme to maximize network throughput and fairness for all feasible Entanglement Connection EC) establishment demands, and (ii) most requested ECs can be established over Entanglement Paths (EPs) determined offline, and only a small percentage of them will be established over online calculated EPs, resulting in fast and efficient entanglement routing. Extensive simulations show that compared with schemes without proper EPS placement or entanglement routing, LIGHTER can improve the network throughput by up to 175.6% and 37.0%, respectively. When the fidelity is considered, the network throughput improvement achieved by F-LIGHTER will be up to 135.0% and 21.5%, respectively.
Entanglement distribution is a key problem in quantum networks. Conventional works on entanglement distribution either ignored that Entangled Photon Sources (EPSes) are precious resources or organized EPSes in an unscalable way. In this work, we propose an EPS Pooling and Entanglement Distribution (EPED) approach to efficiently utilize EPSes. The salient features of EPED include (i) EPSes are organized as several EPS pools; (ii) each EPS pool distributes entanglements only in its coverage area; and (iii) EPSes are dynamically assigned to create different entanglement links. There are two challenges in EPED: (i) when deploying EPS pools, we do not have any demand information; and (ii) we have to calculate the Entanglement Path (EP) for each demand as quickly as possible. To tackle these challenges, we design an algorithm with a constant approximation ratio to minimize the number of EPS pools required, and determine the number of EPSes provisioned to each pool using a primal-dual technique. By preparing candidate EPs for each demand, we solve the online EP selection problem for tens of demands in a network with hundreds of nodes in 6.5 ms. Extensive simulations show that EPED can save up to 8% EPS pools and enhance network throughput by up to 48%.
Efficient entanglement routing in quantum data networks is essential for concurrently establishing as many entanglement connections as possible, maximizing network throughput. We consider networks with wavelength-division multiplexed quantum links where each quantum repeater performs entanglement swapping by directly measuring two photonic qubits from entangled photon sources on the same wavelength. To address unique challenges in achieving a high network throughput in such networks, we propose QuRWA to jointly optimize the entanglement routing and wavelength assignment. QuRWA introduces the Co-Path concept to improve fault-tolerance: we assign all entanglement links in a Co-Path set to the same wavelength, allowing them to serve as backup resources for other links within the same Co-Path during connection establishment. To exploit this redundancy, we design efficient algorithms to optimize the Co-Path selection and wavelength assignment to maximize resource utilization and fault tolerance. We further extend QuRWA to QuRWA-AO by adding all-optical switches at quantum nodes. This extension enables direct entanglement establishment between non-adjacent nodes through photonic Bell pair distribution across physical segments (interconnected physical links sharing wavelength consistency) while bypassing operations dependent on fiber delay lines at selected intermediate nodes. By reducing intermediate fiber delay line consumption, QuRWA-AO can admit additional feasible connections. Extensive simulations demonstrate that QuRWA improves throughput over schemes without the Co-Path abstraction or with sub-optimal wavelength assignment, and also maintains a consistent margin over a more advanced concurrent-routing baseline. By integrating all-optical switching, QuRWA-AO further improves throughput over QuRWA by 25.2% on average across the evaluation groups.
The evolution of quantum networks towards distributed quantum computing and sensing necessitates the efficient distribution of multipartite entangled states among multiple users. However, most existing entanglement routing studies primarily focus on efficient entanglement distribution and typically assume that quantum sources are either fixed or available on all network edges. Due to the scarcity and high cost of quantum sources, some prior studies have focused on optimized source placement strategies, but these existing studies are confined to bipartite state distributions. Consequently, how to jointly optimize quantum source placement and entanglement routing for efficient multipartite state distribution under realistic resource constraints remains an open problem. In this work, we propose an Optimized source Placement and Reactive entanglement Routing (OP-RR) framework to maximize the multipartite state distribution rate given a limited amount of quantum sources. Numerical results on a grid and on the Tokyo topology demonstrate that OP-RR consistently outperforms baseline algorithms with non-optimized source placement, achieving an improvement of up to 16.7× in the multipartite distribution rate, while maintaining robustness under varying operation probabilities and scalability as the size of multipartite states increases.