- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies the scheduling of entanglement resources when multiple quantum experiments are executed concurrently in a quantum network. The goal is to improve the task success rate and shorten execution time under constraints such as random activation of physical links, the finite lifetime of entanglement resources, and the need to generate virtual links through entanglement swapping. The scheduling process is modeled as a Markov decision process and solved using double deep Q-networks (DQN) combined with Message Passing Neural Networks (MPNNs), experience replay buffers, and curriculum training. In addition, an LLM is used to extract interpretable policies from DQN trajectories. The paper has two main contributions. First, through reward function design, it guides the model to jointly consider link lifetime, topology structure, bottleneck nodes, and experiment complexity, and uses reinforcement learning to obtain an efficient policy. Second, it explores the use of large language models to extract interpretable policies, extending the solution to large-scale networks that are difficult to train with reinforcement learning. Simulation experiments are conducted on three network topologies, and the proposed method is compared with three greedy heuristic algorithms. The experimental results show that the proposed method achieves a higher task success rate and shorter average execution time under low link activation probability, and the performance of the policy extracted by the LLM is similar to that of the DQN-trained policy.
Critical strengths
- The task setup covers random link activation, lifetime, swapping consumption, experiment placement, and node compatibility, requiring a unified decision that trades off waiting against resource consumption.
2.Three behavioral metrics make waiting and path preferences observable, and the concise LLM-generated policy offers a low-cost deployment candidate.
Critical weaknesses
The experimental evidence is very limited and cannot prove that the method described in this paper is truly applicable. The experimental setup only uses a fixed number of nodes, entanglement lifetime, and workload, which does not support the effectiveness of the method in comparison to the baseline on other task sets, and the selected values have not been explained. Moreover, the lack of ablation experiments makes it difficult to evaluate the design of the reward component.
Questions for authors
- The current baseline consists of three simple heuristic greedy algorithms, which seem rather weak. Was it because there were no similar previous works available as the baseline?
- Could the author provide more evidence for different workloads?
- How stable are the strategies generated by LLM in terms of repeated generation, different prompts, or different LLMs?
Thank you for taking the time to review our work and for your questions.
The use of greedy baselines should not be interpreted as a claim that no relevant prior work exists. There are related optimization and learning-based approaches to quantum-network resource scheduling. In our introduction, we highlight the body of literature devoted to solving the problem of routing entanglement swaps through the network. We consider this problem a subroutine within distributed quantum computation. In our work, we do not optimize the route satisfying a virtual link request but instead optimize the timing and choice of endpoints to support subsequent experiment placement.
The three heuristics allow us to assess whether the learned policy improves on simple scheduling rules under our formulation. They were selected to represent complementary scheduling priorities of minimizing virtual-link age, minimizing virtual-link span, and incorporating an initial form of topology-aware decision-making through the DCTR baseline. However, we agree that covering these complementary priorities does not establish competitiveness against stronger optimization or learning-based methods that may combine them. We reference Ni et al. (2026) in our introduction as their work similarly formulates quantum job scheduling as a queue of jobs that need to be assigned to available QPUs on a network. Although their work motivates our application-level scheduling problem, the scheduling interfaces differ. Ni et al. consider a fully connected QPU network and abstract entanglement provision as a network service (Section 3.2). Their schedulers select jobs and allocate QPUs using quantities such as resource demand, EPR usage, and estimated execution time. In contrast, our policy explicitly chooses among waiting, virtual-link operations, and experiment placements, with placement feasibility depending on the current availability and age of the required entangled pairs. Their algorithms do not directly specify the intermediate virtual link requests required by our environment.
We agree that evaluation across a broader range of workloads would strengthen the evidence for our approach. The current experiments establish performance under the workload settings reported in the paper, but do not establish robustness to changes in workload size, experiment composition, or resource requirements. A systematic assessment of whether the observed advantages over the baselines persist for different workloads is left to future work.
We did not systematically evaluate stability across repeated LLM generations, prompt variations, or different models. Our results characterize the performance of the particular generated strategies evaluated, rather than the consistency of the generation procedure. We therefore regard generation stability as an open question and a limitation of the present evaluation.