Quantum networks are designed to transmit quantum bits (qubits) among quantum devices to enable new network resources for the applications. Entanglement distribution and entanglement swapping are fundamental procedures that are required in several network operations. However, they are probabilistic operations, which can lead to severe network performance degradation. This article investigates the engineering problem of resource allocation in quantum networks, considering factors like entanglement distribution probability, quantum memory characteristics, and fidelity. We model this as an optimization model to obtain an optimal solution. In particular, we formulate an integer linear programming (ILP) and develop a heuristic algorithm, aiming to minimize the number of required entangled qubit pairs (Bell pairs or EPR pairs) in any adjacent pair in the quantum network. Extensive simulations are performed to compare the performance of proposed ILP and heuristic. In all the cases, the heuristic produces a comparable solution to the optimal one. Simulation results ensure that the value of maximum utilized Bell pairs in a quantum network highly depends on the value of the probability of entangled pairs established, considering the time in the quantum memory besides the number of incoming requests.
Quantum networks are designed to transmit quantum bits (qubits) among quantum devices to enable new network resources for the applications. Entanglement distribution and entanglement swapping are fundamental procedures that are required in several network operations. However, they are probabilistic operations, which can lead to severe network performance degradation. This article investigates the engineering problem of resource allocation in quantum networks, considering factors like entanglement distribution probability, quantum memory characteristics, and fidelity. We model this as an optimization model to obtain an optimal solution. In particular, we formulate an integer linear programming (ILP) and develop a heuristic algorithm, aiming to minimize the number of required entangled qubit pairs (Bell pairs or EPR pairs) in any adjacent pair in the quantum network. Extensive simulations are performed to compare the performance of proposed ILP and heuristic. In all the cases, the heuristic produces a comparable solution to the optimal one. Simulation results ensure that the value of maximum utilized Bell pairs in a quantum network highly depends on the value of the probability of entangled pairs established, considering the time in the quantum memory besides the number of incoming requests.
In this paper, we consider the problem of concurrent multipath routing and end-to-end entanglement distribution for online resource allocation in quantum networks. We propose a heuristic algorithm to solve this problem, considering quantum memory, decoherence time, entanglement distribution probability, and fidelity. A time-slotted quantum network operation model is considered based on the cut-off decoherence time of quantum memories. The proposed heuristic is designed for a quantum network with noisy intermediate scale quantum (NISQ) constraints, including fixed quantum memory decoherence time, and probabilistic entanglement generation and swapping. It considers integer linear programming (ILP)-based and heuristic approaches to select multiple paths and resource allocation in the network. Simulations are performed to evaluate the performance of ILP and heuristic based approaches in terms of requests using multipath approach, blocking ratio, and computation time in a small sized quantum network with few requests. Next, the performance of heuristic based approaches are evaluated for a large problem size. The obtained results ensure that performance of ILP and heuristic based approaches are comparable, and multipath routing outperforms single path routing in terms of blocking ratio.
We consider the problem of optimizing the achievable EPR-pair distribution rate between multiple source-destination pairs in a quantum Internet, where the repeaters may perform a probabilistic Bell-state measurement and we may impose a minimum end-to-end fidelity as a requirement. We construct an efficient linear programming (LP) formulation that computes the maximum total achievable entanglement distribution rate, satisfying the end-to-end fidelity constraint in polynomial time (in the number of nodes in the network). Our LP formulation gives the optimal rate for a class of entanglement generation protocols where the repeaters have very short-lived quantum memories. We also propose an efficient algorithm that takes the output of the LP solver as an input and runs in polynomial time (in the number of nodes) to produce the set of paths to be used to achieve the entanglement distribution rate. Moreover, we point out a practical entanglement generation protocol that can achieve those rates.
In quantum networks, effective entanglement routing facilitates remote entanglement communication between quantum source and quantum destination nodes. Unlike routing in classical networks, entanglement routing in quantum networks must consider the quality of entanglement qubits (i.e., entanglement fidelity), presenting a challenge in ensuring entanglement fidelity over extended distances. To address this issue, we propose a resource allocation model for entangled pairs and an entanglement routing model with a fidelity guarantee. This approach jointly optimizes entangled resources (i.e., entangled pairs) and entanglement routing to support applications in quantum networks. Our proposed model is formulated using two-stage stochastic programming, taking into account the uncertainty of quantum application requirements. Aiming to minimize the total cost, our model ensures efficient utilization of entangled pairs and energy conservation for quantum repeaters under uncertain fidelity requirements. Experimental results demonstrate that our proposed model can reduce the total cost by at least 20% compared to the baseline model.
Future quantum networks will support not only point-to-point communication but also multiparty applications, such as multiparty quantum key distribution and quantum secret sharing. While bipartite entanglement routing has been studied extensively, multipartite routing with probabilistic link generation and fusion operations has not been previously addressed. This paper proposes a routing model for multipartite entanglement distribution, formulated as an optimization problem using a mixed-integer linear programming problem. This model explicitly incorporates the probabilistic nature of quantum operations, aiming to maximize the probability of successfully distributing a multipartite entangled state, particularly the Greenberger-Horne-Zeilinger state, to all requesting users. Maximizing this probability is essential for ensuring the feasibility and robustness of multiparty quantum communication in practical networks, thereby enabling the reliable execution of multiparty quantum applications. Numerical results show that the proposed model improves the success probability and maintains robustness across diverse network conditions, including scenarios with stringent quantum memory limitations and relatively large terminal sets.
Entanglement distribution, which relies on entanglement routing and swapping strategies, is a fundamental task in quantum networks. However, existing routing algorithms often overutilize the quantum memory of nodes along shortest paths and neglect imbalanced memory utilization across different nodes, thereby increasing the risk of end-to-end (E2E) entanglement failures for subsequent requests. Moreover, suboptimal swapping strategies can further exacerbate memory imbalance among nodes. In this paper, we study load-balanced entanglement distribution to improve the resilience of quantum networks. We first propose abottleneck node modelthat captures shared quantum memory constraints at each node. Based on this model, we formulate theload-balanced entanglement distributionproblem, which aims to optimize routing decisions and swapping strategies to balance memory utilization. We prove the problem to be NP-hard and develop a decomposition-based approach that separates path finding and quantum memory allocation for sequential request processing. Based on this decomposition, we propose LBER (Load-Balanced Entanglement Routing), a polynomial-time heuristic that distributes entanglement across multiple paths. We further design an adaptive swapping strategy, AdapSwap, to determine the optimal swapping order along each path. Extensive simulations show that our approach significantly improves load balance and increases the request satisfaction ratio by 7.69%∼32.14%.
The quantum network is designed to connect numerous quantum nodes and support various ground-breaking quantum applications. Most of these applications require communicating parties to share entangled pairs. Therefore, entanglement routing, a technology distributing entangled pairs between distant quantum nodes, plays a vital role in realizing quantum networks’ capability. However, due to the limitation of quantum memory size and quantum decoherence, the entangled pairs shared by adjacent quantum nodes can hardly satisfy concurrent entanglement routing requests, thus leading to severe network congestion. In this paper, we propose a novel congestion mitigation (CM) scheme to tackle such bottleneck problems. The basic idea of CM is to “recycle” idle link-level entanglement resources from well-resourced links to bottleneck links utilizing a unique enabling technology of quantum networks, called entanglement swapping. CM can increase the capacity of each bottleneck link, thus overcoming resource limitations to improve resource utilization and network throughput. To complete our work, we also propose a swapping-based entanglement routing design, including path selection and resource allocation algorithms. Extensive simulations show that our design can significantly alleviate network congestion and improve the request service rate of quantum networks compared to the traditional entanglement routing designs.