Entanglement generation and swapping are key techniques for enabling long-distance quantum communication, allowing the creation of end-to-end entangled pairs and making teleportation between non-adjacent nodes possible. However, fidelity loss and decoherence effects must be carefully considered, as they can degrade the quality of the transmitted data. Swapping operations inherently reduce fidelity, while the data to be teleported may also suffer decoherence during the wait for an end-to-end entangled pair to be established. Although the former issue is frequently examined in existing literature, the latter (i.e., decoherence of waiting data) remains largely overlooked. Together, these effects pose significant scheduling challenges. To address this, we formulate a novel optimization problem, termed DAFSP, and propose a separation-oracle-based algorithm, DORA, which achieves a bi-criteria approximation ratio of (O(1),O(log|V||T|)). Finally, simulation results manifest that DORA can notably outperform existing approaches, achieving an average improvement of 495% in the sum of expected overall fidelity.
Entanglement generation and swapping are key techniques for enabling long-distance quantum communication, allowing the creation of end-to-end entangled pairs and making teleportation between non-adjacent nodes possible. However, fidelity loss and decoherence effects must be carefully considered, as they can degrade the quality of the transmitted data. Swapping operations inherently reduce fidelity, while the data to be teleported may also suffer decoherence during the wait for an end-to-end entangled pair to be established. Although the former issue is frequently examined in existing literature, the latter (i.e., decoherence of waiting data) remains largely overlooked. Together, these effects pose significant scheduling challenges. To address this, we formulate a novel optimization problem, termed DAFSP, and propose a separation-oracle-based algorithm, DORA, which achieves a bi-criteria approximation ratio of (O(1),O(log|V||T|)). Finally, simulation results manifest that DORA can notably outperform existing approaches, achieving an average improvement of 495% in the sum of expected overall fidelity.
Quantum teleportation channels can overcome the effects of photonic loss, a major challenge in the implementation of a quantum network over fiber. Teleportation channels are created by distributing an entangled state between two nodes, which is a probabilistic process requiring classical communication. This causes critical delays that can cause information loss as quantum data suffers from decoherence when stored in memory. In this work, we quantify the effect of decoherence on fidelity at a node in a quantum network due to the storage of qubits in noisy memory platforms. We model a memory platform as a buffer that stores incoming qubits waiting for the creation of a teleportation channel. Memory platforms are parameterized with decoherence rate and buffer size. We show that fidelity at a node is a linear sum of terms, exponentially decaying with time, where the decay rate depends on the decoherence rate of the memory platform. This allows us to utilize Laplace transforms to derive computable functions of average fidelity with respect to the load, buffer size, and decoherence rate of the memory platform. We prove that serving qubits in a Last In First Out order with pushout for buffer overflow management maximizes average fidelity. Last, we apply this framework to model a single repeater node to calculate the average fidelity of the end-to-end entanglement created by this repeater assuming perfect gate operations.
Entanglement-based quantum networks provide unconditionally secure quantum communication by distributing end-to-end entangled pairs. To reach such goal, entanglement swapping and purification are two necessary operations, which can expand the entanglement distance and improve the fidelity of entangled pairs, respectively. During the end-to-end entanglement distribution process, the execution sequence of these two operations has a significant impact on the final performance, such as throughput and fidelity. Thus, how to schedule the sequence of swapping and purification becomes a critical problem in quantum networks. Our work focuses on such scheduling problem and we devise an efficient solution with fidelity maintenance. In our article, we first propose a concurrent swapping method for any-length path to reduce delay. Secondly, by modeling the scheduling sequence as a permutation problem, we obtain an optimal scheduling principle called “prioritized purification (PP)”. Finally, to meet the fidelity requirement of the end-to-end entangled pairs, we propose a fidelity maintenance scheme based on PP (FMSPP). The simulation results show that the proposed FMSPP can achieve higher distribution rates and less resource overhead than other scheduling solutions, and the advantages are more significant when there are more hops on the path.
Quantumnetworking is emerging as a new research area to explore the opportunities of interconnecting quantum systems through end-to-end entanglement of qubits at geographical distance via quantum repeaters. A promising architecture has been proposed in the literature that decouples entanglement between adjacent quantum nodes/repeaters from establishing end-to-end paths by adopting a time slotted approach. Within this model, we destructure further end-to-end path establishment into two subproblems: path selection and scheduling. The former is set to determine the best repeaters to connect two end nodes, provided that all their local entanglements have succeeded. On the other hand, scheduling is concerned with deciding, which pairs of end nodes are served in the current time slot, while the others remain queued for later time slots. Unlike path selection, scheduling has not been investigated so far in the literature, particularly in presence of quantum noise, which makes both problems even more challenging. In this article, we propose to address it via a general framework of heuristic algorithms, for which we propose three illustrative instances with the objective of keeping the application delay small while achieving a good system utilization, in terms of high entanglement rate and fidelity of remotely entangled qubits. The system proposed is evaluated extensively via event-driven quantum network simulations, with noisy repeaters, in different node topologies under a Poisson arrival of requests from quantum applications. The results show the existence of a fundamental tradeoff between system- and application-level metrics, such as fairness versus entanglement and fidelity, which lays the foundations for further studies in this thriving research area.
Quantum networks have the potential to revolutionize communication and computation by outperforming their classical counterparts. Many quantum applications depend on the reliable distribution of high-fidelity entangled pairs between distant nodes. However, due to decoherence and channel noise, entanglement fidelity degrades exponentially with distance, posing a significant challenge to maintaining robust quantum communication. To address this, we propose two strategies to enhance end-to-end (E2E) fidelity and information preservation in quantum networks. First, we employ closeness centrality to identify optimal intermediary nodes that minimize average path length. Second, we introduce the Trace-Distance based Path Purification (TDPP) algorithm, which fuses topological and quantum state information to support fidelity-aware routing decisions. TDPP leverages closeness centrality and trace-distance to identify paths that optimize both network efficiency and entanglement fidelity. Simulation results demonstrate that our approach significantly improves network throughput and E2E entanglement fidelity, outperforming existing routing methods while enhancing information preservation.
Abstract Quantum communication plays a key role in enabling distributed Noisy Intermediate-Scale Quantum (NISQ) systems; however, practical quantum networks are often affected by link fluctuations, limited quantum resources, and entanglement degradation. These factors make reliable routing and scheduling difficult, particularly in large-scale and dynamically changing environments. Classical methods such as Historical Weighted Fidelity Routing (HWFR) and Dynamic Multi-Priority Quantum Scheduling (DMPQS) generally perform well only when network conditions remain stable, and their performance degrades when entanglement success rates vary or relay nodes become congested. A major challenge therefore lies in operating under uncertain and time-varying fidelity conditions. Most existing approaches focus on either routing or scheduling in isolation and do not explicitly consider future fidelity variations, which can lead to inefficient resource usage and increased end-to-end latency. In this work, we propose a Deep Reinforcement Learning-based Quantum Communication Optimization Framework (DRL-QCOF) that jointly addresses routing and scheduling. The framework employs a Bi-LSTM-based Quantum Fidelity Prediction Network (QFPN) to estimate future link fidelity F_"pred" (t)from time-series features including link length, noise coefficient, entanglement success probability, and relay utilization. These predictions are then used by a Deep Reinforcement Learning-based Adaptive Quantum Scheduling Agent (DRAQS-Agent), implemented using an Actor–Critic architecture with a continuous reward formulation, to guide routing and scheduling decisions across distributed nodes. Simulation results indicate that the proposed approach improves the average link fidelity to a maximum of 0.88, compared to 0.78–0.86 achieved by existing methods. The end-to-end latency is reduced from 104 ms to 83 ms, while baseline schemes remain above 110 ms under the same conditions. In addition, the average response time is reduced to approximately 147 ms, resource utilization increases to 71–83%, and the success ratio improves from 93% to 97%, resulting in improved end-to-end reliability. The cumulative reward stabilizes at around 16.0, with convergence observed within 300 training episodes, and the achieved throughput reaches 118–121 entangled pairs per second, confirming the effectiveness of the proposed framework in dynamic NISQ network scenarios.
Quantum network communication is challenging, as the no-cloning theorem in the quantum regime makes many classical techniques inapplicable; in particular, the direct transmission of qubit states over long distances is infeasible due to unrecoverable errors. For the long-distance communication of unknown quantum states, the only viable communication approach (assuming local operations and classical communications) is the teleportation of quantum states, which requires a prior distribution of the entangled pairs (EPs) of qubits. The establishment of EPs across remote nodes can incur significant latency due to the low probability of success of the underlying physical processes. The focus of our work is to develop efficient techniques that minimize EP generation latency. Prior works have focused on selecting entanglementpaths; in contrast, we selectentanglement swapping trees—a more accurate representation of the entanglement generation structure. We develop a dynamic programming algorithm to select an optimal swapping tree for a single pair of nodes, under the given capacity and fidelity constraints. For the general setting, we develop an efficient iterative algorithm to compute a set of swapping trees. We present simulation results, which show that our solutions outperform the prior approaches by an order of magnitude and are viable for long-distance entanglement generation.