Scheduling Entanglement Flows in Multi-channel Quantum Networks

• URL: http://arxiv.org/abs/2605.04767v1
• Date: Wed, 06 May 2026 11:15:29 GMT
• Title: Scheduling Entanglement Flows in Multi-channel Quantum Networks
• Abstract summary: This paper addresses resource allocation for entanglement distribution in multi-channel quantum networks.<n>A system model is proposed that integrates a multi-channel quantum network architecture with heterogeneous link characteristics.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper addresses resource allocation for entanglement distribution in multi-channel quantum networks. A system model is proposed that integrates a multi-channel quantum network architecture with heterogeneous link characteristics and user-centric entanglement request handling, including queuing and retry mechanisms. Classical allocation methods for assigning channels and quantum processors to generate entanglement between end nodes are implemented, including the Dynamic Efficient algorithm, Static Efficient algorithm, and the Success Enhancement algorithm. In addition, a Proximal Policy Optimization (PPO)-based allocation approach driven by a reward function is proposed. These methods are evaluated through multi-slot simulations using metrics such as request delay, total number of successful entanglement requests, network capacity utilization, and the entanglement request handling rate. The results show that Dynamic Efficient achieves the lowest delay, while Success Enhancement improves the number of successful requests through multipath allocation. The PPO-based method provides the best overall balance by improving capacity utilization and achieving both low delay and a high number of successful entanglement requests.

Related papers

• Efficient routing and spectrum allocation in arbitrary flex-grid entanglement networks [11.448612804302783]
  We present a three-stage pipeline for efficient user-to-user frequency allocation in a quantum network.<n>We numerically demonstrate this approach on a representative ring network and a Manhattan incumbent local exchange carrier topology.
  arXiv  Detail & Related papers  (2026-07-16T21:20:35Z)
• Reinforcement Learning for Quantum Network Control with Application-Driven Objectives [53.03367590211247]
  Dynamic programming and reinforcement learning offer promising tools for optimizing control strategies.<n>We propose a novel RL framework that directly optimize non-linear, differentiable objective functions.<n>Our work comprises the first step towards non-linear objective function optimization in quantum networks with RL, opening a path towards more advanced use cases.
  arXiv  Detail & Related papers  (2025-09-12T18:41:10Z)
• Adaptive Optimization of Latency and Throughput with Fidelity Constraints in Quantum Networks Using Deep Neural Networks [3.1856756516735936]
  We propose a semi-supervised adaptive purification approach employing Deep Neural Networks (DNNs) to optimize the balance between latency, throughput, entanglement resource utilization and fidelity thresholds.<n>Our results underline the potential of deep learning techniques for achieving adaptive, optimized performance in future quantum networking applications.
  arXiv  Detail & Related papers  (2025-05-18T15:23:18Z)
• Resource Management and Circuit Scheduling for Distributed Quantum Computing Interconnect Networks [5.239117416189216]
  Distributed quantum computing (DQC) has emerged as a promising approach to overcome the scalability limitations of monolithic quantum processors.<n>This paper addresses resource management and circuit scheduling in such settings.<n>We propose circuit scheduling algorithms based on Mixed-Integer Linear Programming (MILP)
  arXiv  Detail & Related papers  (2024-09-19T11:39:46Z)
• Multi-User Entanglement Distribution in Quantum Networks Using Multipath Routing [55.2480439325792]
  We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing. The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
  arXiv  Detail & Related papers  (2023-03-06T18:06:00Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Fidelity-Guarantee Entanglement Routing in Quantum Networks [64.49733801962198]
  Entanglement routing establishes remote entanglement connection between two arbitrary nodes. We propose purification-enabled entanglement routing designs to provide fidelity guarantee for multiple Source-Destination (SD) pairs in quantum networks.
  arXiv  Detail & Related papers  (2021-11-15T14:07:22Z)
• Purification and Entanglement Routing on Quantum Networks [55.41644538483948]
  A quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users. We introduce effectives enabling fast path-finding algorithms for maximizing entanglement shared between two nodes on a quantum network.
  arXiv  Detail & Related papers  (2020-11-23T19:00:01Z)
• Iterative Algorithm Induced Deep-Unfolding Neural Networks: Precoding Design for Multiuser MIMO Systems [59.804810122136345]
  We propose a framework for deep-unfolding, where a general form of iterative algorithm induced deep-unfolding neural network (IAIDNN) is developed. An efficient IAIDNN based on the structure of the classic weighted minimum mean-square error (WMMSE) iterative algorithm is developed. We show that the proposed IAIDNN efficiently achieves the performance of the iterative WMMSE algorithm with reduced computational complexity.
  arXiv  Detail & Related papers  (2020-06-15T02:57:57Z)
• Entanglement Distribution in a Quantum Network, a Multi-Commodity Flow-Based Approach [0.0]
  We consider the problem of optimising the achievable EPR-pair distribution rate between multiple source-destination pairs in a quantum internet. We construct an efficient linear programming formulation that computes the maximum achievable entanglement distribution rate. We point out a practical entanglement generation protocol which can achieve those rates.
  arXiv  Detail & Related papers  (2020-05-28T21:30:09Z)
• Effective routing design for remote entanglement generation on quantum networks [6.695045642641268]
  Efficient entanglement generation on quantum networks with relatively limited resources such as quantum memories is essential to fully realize the network's capabilities. We propose an effective routing scheme to enable automatic responses for multiple requests of entanglement generation between source-terminal stations. Multiple connection paths are exploited for each connection request while entanglement fidelity is ensured for each path by performing entanglement purification.
  arXiv  Detail & Related papers  (2020-01-07T18:16:55Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.