Robust Belief-State Policy Learning for Quantum Network Routing Under Decoherence and Time-Varying Conditions
Preprint
Abstract
This paper presents a feature-based Partially Observable Markov Decision Process (POMDP) framework for quantum network routing, combining belief-state planning with Graph Neural Networks (GNNs) to address partial observability, decoherence, and scalability challenges in dynamic quantum systems. Our approach encodes complex quantum network dynamics, including entanglement degradation and time-varying channel noise, into a low-dimensional feature space, enabling efficient belief updates and scalable policy learning. The core of our framework is a hybrid GNN-POMDP architecture that processes graph-structured representations of entangled links to learn routing policies, coupled with a noise-adaptive mechanism that fuses POMDP belief updates with GNN outputs for robust decision making. We provide a theoretical analysis establishing guarantees for belief convergence, policy improvement, and robustness to noise. Experiments on simulated quantum networks with up to 100 nodes demonstrate significant improvements in routing fidelity and entanglement delivery rates compared to state-of-the-art baselines, particularly under high decoherence and nonstationary conditions.Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Fidelity-Guaranteed Entanglement Routing in Quantum NetworksIEEE Transactions on Communications, 2022
- Realization of a multinode quantum network of remote solid-state qubitsScience, 2021
- Harnessing the Power of the Second Quantum RevolutionPRX Quantum, 2020
- A Comprehensive Survey on Graph Neural NetworksIEEE Transactions on Neural Networks and Learning Systems, 2020
- Quantum internet: A vision for the road aheadScience, 2018
- A quantum network of clocksNature Physics, 2014
- Exploring Network Structure, Dynamics, and Function using NetworkX2008