RELiQ: Scalable Entanglement Routing via Reinforcement Learning in Quantum Networks

• URL: http://arxiv.org/abs/2511.22321v1
• Date: Thu, 27 Nov 2025 10:52:43 GMT
• Title: RELiQ: Scalable Entanglement Routing via Reinforcement Learning in Quantum Networks
• Authors: Tobias Meuser, Jannis Weil, Aninda Lahiri, Marius Paraschiv,
• Abstract summary: We propose RELiQ, a reinforcement learning-based approach to entanglement routing.<n>Our method achieves similar or superior performance because of its rapid response to topology changes.
• Score: 0.41998444721319217
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum networks are becoming increasingly important because of advancements in quantum computing and quantum sensing, such as recent developments in distributed quantum computing and federated quantum machine learning. Routing entanglement in quantum networks poses several fundamental as well as technical challenges, including the high dynamicity of quantum network links and the probabilistic nature of quantum operations. Consequently, designing hand-crafted heuristics is difficult and often leads to suboptimal performance, especially if global network topology information is unavailable. In this paper, we propose RELiQ, a reinforcement learning-based approach to entanglement routing that only relies on local information and iterative message exchange. Utilizing a graph neural network, RELiQ learns graph representations and avoids overfitting to specific network topologies - a prevalent issue for learning-based approaches. Our approach, trained on random graphs, consistently outperforms existing local information heuristics and learning-based approaches when applied to random and real-world topologies. When compared to global information heuristics, our method achieves similar or superior performance because of its rapid response to topology changes.

Related papers

• Practical Routing and Criticality in Large-Scale Quantum Communication Networks [0.0]
  In quantum communications, there exists a fundamental rate-loss tradeoff for point-to-point quantum channels.<n>Quantum networks are the solution to overcome point-to-point limitations, but they simultaneously invite a challenging open question.<n>Our work reveals the weaknesses of applying single-path routing protocols within quantum networks.
  arXiv  Detail & Related papers  (2025-09-13T17:19:51Z)
• Quantum Recurrent Embedding Neural Network [11.54075064463256]
  We propose a quantum recurrent embedding neural network (QRENN) inspired by fast-track information pathways in ResNet.<n>We provide a rigorous proof of the trainability of QRENN circuits, demonstrating that this deep quantum neural network can avoid barren plateaus.<n>Our results highlight the power of recurrent data embedding in quantum neural networks and the potential for scalable quantum supervised learning.
  arXiv  Detail & Related papers  (2025-06-16T07:50:31Z)
• Inferring Quantum Network Topologies using Genetic Optimisation of Indirect Measurements [0.0]
  We use external probes to infer the network topology in the context of continuous-time quantum walks.<n>The probes act as decay channels for the excitation, and can be interpreted as performing an indirect measurement on the network dynamics.<n>We show that increasing the number of probes significantly simplifies the reconstruction task, revealing a tradeoff between the number of probes and the required computational power.
  arXiv  Detail & Related papers  (2025-06-12T20:46:41Z)
• Adaptive Entanglement Routing with Deep Q-Networks in Quantum Networks [0.19731444261635428]
  The quantum internet holds transformative potential for global communication.<n>The efficient distribution of critical resources, such as qubits, remains a persistent and unresolved challenge.<n>This study proposes a novel reinforcement learning-based adaptive entanglement routing framework.
  arXiv  Detail & Related papers  (2025-03-01T20:05:54Z)
• From Graphs to Qubits: A Critical Review of Quantum Graph Neural Networks [56.51893966016221]
  Quantum Graph Neural Networks (QGNNs) represent a novel fusion of quantum computing and Graph Neural Networks (GNNs) This paper critically reviews the state-of-the-art in QGNNs, exploring various architectures. We discuss their applications across diverse fields such as high-energy physics, molecular chemistry, finance and earth sciences, highlighting the potential for quantum advantage.
  arXiv  Detail & Related papers  (2024-08-12T22:53:14Z)
• Generative AI-enabled Quantum Computing Networks and Intelligent Resource Allocation [80.78352800340032]
  Quantum computing networks execute large-scale generative AI computation tasks and advanced quantum algorithms. efficient resource allocation in quantum computing networks is a critical challenge due to qubit variability and network complexity. We introduce state-of-the-art reinforcement learning (RL) algorithms, from generative learning to quantum machine learning for optimal quantum resource allocation.
  arXiv  Detail & Related papers  (2024-01-13T17:16:38Z)
• Entanglement-Assisted Quantum Networks: Mechanics, Enabling Technologies, Challenges, and Research Directions [66.27337498864556]
  This paper presents a comprehensive survey of entanglement-assisted quantum networks. It provides a detailed overview of the network structure, working principles, and development stages. It also emphasizes open research directions, including architecture design, entanglement-based network issues, and standardization.
  arXiv  Detail & Related papers  (2023-07-24T02:48:22Z)
• A Linear Algebraic Framework for Dynamic Scheduling Over Memory-Equipped Quantum Networks [2.5168553347063862]
  This work deals with the problem of scheduling in an arbitrary entanglement swapping quantum network. We introduce a linear algebraic framework that exploits quantum memory through the creation of intermediate entangled links. An additional class of Max-Weight inspired policies is proposed and benchmarked, reducing significantly the cost at the price of a slight performance degradation.
  arXiv  Detail & Related papers  (2023-07-12T08:41:17Z)
• Efficient and quantum-adaptive machine learning with fermion neural networks [8.537841858846082]
  We propose fermion neural networks (FNNs) whose physical properties serve as outputs, once the inputs are incorporated as an initial layer. We establish an efficient optimization, which entitles FNNs to competitive performance on challenging machine-learning benchmarks.
  arXiv  Detail & Related papers  (2022-11-10T19:00:02Z)
• QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional Networks [124.7972093110732]
  We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations. To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections. Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
  arXiv  Detail & Related papers  (2022-11-09T21:43:16Z)
• Optimizing Tensor Network Contraction Using Reinforcement Learning [86.05566365115729]
  We propose a Reinforcement Learning (RL) approach combined with Graph Neural Networks (GNN) to address the contraction ordering problem. The problem is extremely challenging due to the huge search space, the heavy-tailed reward distribution, and the challenging credit assignment. We show how a carefully implemented RL-agent that uses a GNN as the basic policy construct can address these challenges.
  arXiv  Detail & Related papers  (2022-04-18T21:45:13Z)
• Learning Connectivity of Neural Networks from a Topological Perspective [80.35103711638548]
  We propose a topological perspective to represent a network into a complete graph for analysis. By assigning learnable parameters to the edges which reflect the magnitude of connections, the learning process can be performed in a differentiable manner. This learning process is compatible with existing networks and owns adaptability to larger search spaces and different tasks.
  arXiv  Detail & Related papers  (2020-08-19T04:53:31Z)

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.