arXiv subjects

Gongyu Ni

Publications and source records attributed to Gongyu Ni.

4 recordsLinked to original sources

arXiv2026

Scheduling Concurrent Entanglement Requests in Quantum Networks

This paper investigates resource allocation for entanglement distribution in multi-node, multi-channel quantum networks at the metropolitan scale. A multi-slot quantum network simulation framework is developed across physical and network layers, incorporating heterogeneous link characteristics, limited quantum memories, request queuing, retry mechanisms, and concurrent entanglement distribution. Based on this framework, a centralized scheduling architecture is proposed to coordinate quantum memories, communication channels, and routing paths for multiple simultaneous entanglement requests. Three classes of resource allocation strategies are evaluated: heuristic approaches, a mixed-integer linear programming (MILP) optimization method, and a Proximal Policy Optimization (PPO)-based reinforcement learning approach. The heuristic schemes reveal fundamental trade-offs between request delay and entanglement success rate: Dynamic Efficient minimizes delay, Success Enhancement improves success probability through adaptive multi-path allocation, and Static Efficient provides a balance between these objectives. The MILP approach achieves optimized resource allocation by jointly considering request handling and multi-path assignment, while the PPO-based method learns adaptive scheduling policies to improve overall performance. Simulation results demonstrate that these approaches provide different performance advantages in terms of request delay, entanglement success rate, capacity utilization, and request handling rate, highlighting the trade-offs between efficiency and reliability in metropolitan-scale quantum network scheduling.

quant-ph↗

arXiv2026

Advanced Scheduling Strategies for Distributed Quantum Computing Jobs

Distributed quantum computing (DQC) is being actively investigated as a means of scaling the number of qubits across multiple connected quantum devices. This includes quantum circuit compilation and execution management on multiple quantum devices in the network. The latter aspect is very challenging because, while reducing the makespan of job batches remains a relevant objective, novel quantum-specific constraints must be considered, including QPU utilization, non-local gate rate, and the latency associated with queued DQC jobs. In this work, a range of scheduling strategies is proposed, simulated, and evaluated, including heuristics that prioritize resource maximization for QPU utilization, node selection based on heterogeneous network connectivity, asynchronous node release upon job completion, and a scheduling strategy based on reinforcement learning with proximal policy optimization. These approaches are benchmarked against traditional FIFO and LIST schedulers under varying DQC job types and network conditions for the allocation of DQC jobs to devices within a network.

quant-ph↗

arXiv2026

Joint Optimization of Routing and Purification to Meet Fidelity Targets in Quantum Networks

Quantum networks rely on high-fidelity entanglement links, but achieving target fidelity often increases latency and Bell pair consumption due to purification. This paper proposes a cost-based scheduler that jointly optimizes path selection and purification round, along with two hop-level estimators (a Deep Neural Network classifier and a Bayesian optimizer) to predict the minimal purification rounds needed for target hop fidelity. The scheme flexibly adjusts final entanglement fidelity while minimizing latency, improving request success rates and efficient Bell pair usage. Simulations integrating purification, entanglement generation, and network-level scheduling show that our approach reduces mean latency by up to 8% and increases success rates by 14% compared to fixed-round purification with FIFO scheduling.

quant-ph↗

arXiv2025

Entanglement Request Scheduling in Quantum Networks Using Deep Q-Network

In this paper, a novel Deep Q-Network (DQN) based scheduling method to optimize delay time and fairness among entanglement requests in quantum repeater networks is proposed. The scheduling of requests determines which pairs of end nodes should be entangled during the current time slot, while other pairs are placed in a queue for future slots. However, existing research on quantum networking often relies on simple statistical models to capture the behavior of quantum hardware, such as the failure rate of establishing entanglement. Moreover, current quantum simulators do not support network behaviors, including handling, pending, and dropping requests. To bridge the gap between quantum deployments and network behaviors, in this paper a dynamic network model is presented, encompassing quantum simulations, random topologies, and user modeling. The DQN based scheduling scheme allows us to balance the conflicting objectives of minimizing delay time and maximizing fairness among these entanglement requests. The proposed technique was evaluated using simulations, with results showing that the proposed DQN achieves higher performance compared to Greedy, Proportional fair and FIFO scheduling schemes.

quant-ph↗