Quantum-Inspired Hamiltonian Optimization, Stochastic Tensor Networks and Adaptive Congestion Routing for Large-Scale QKD Networks

• URL: http://arxiv.org/abs/2605.27425v1
• Date: Tue, 19 May 2026 22:05:10 GMT
• Title: Quantum-Inspired Hamiltonian Optimization, Stochastic Tensor Networks and Adaptive Congestion Routing for Large-Scale QKD Networks
• Abstract summary: We introduce a quantum-inspired framework for adaptive multi-demand routing in Quantum Key Distribution (QKD) communication networks.<n>The resulting framework establishes a scalable bridge between QKD network orchestration, statistical-physics-inspired optimization, tensor-network compression and future quantum-native routing systems.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum Key Distribution (QKD) networks require routing methodologies capable of jointly optimizing latency, secret key generation rate, congestion, finite capacity and operational security constraints under dynamically evolving traffic conditions. In this work we introduce a quantum-inspired optimization framework for adaptive multi-demand routing in QKD communication networks based on effective Hamiltonian modelling, Quantum Monte Carlo inspired annealing and stochastic Tensor-Network State (TNS) compression. The communication network is represented as a stochastic interacting graph whose routing configurations evolve under an effective Hamiltonian containing latency, keyrate, congestion, risk and capacity terms. The resulting optimization landscape is explored through two complementary approaches: a stochastic Metropolis annealer based on incremental local Hamiltonian updates, and a stochastic boundary-MPS tensor-network approximation that compresses the low-energy routing sector through thermal branch selection. The resulting framework establishes a scalable bridge between QKD network orchestration, statistical-physics-inspired optimization, tensor-network compression and future quantum-native routing systems.

Related papers

• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Optimizing Quantum Key Distribution Network Performance using Graph Neural Networks [0.0]
  This paper proposes an optimization of Quantum Key Distribution (QKD) Networks using Graph Neural Networks (GNN) framework.<n> Experimental results demonstrate that the GNN-optimized QKD network achieves a substantial increase in total key rate (from 27.1 Kbits/s to 470 Kbits/s)<n>We analyze network performance across varying scales (10 to 250 nodes), showing improved link prediction accuracy and enhanced key generation rate in medium-sized networks.
  arXiv  Detail & Related papers  (2025-11-20T15:36:57Z)
• 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)
• Robust Belief-State Policy Learning for Quantum Network Routing Under Decoherence and Time-Varying Conditions [5.246986428523558]
  This paper presents a framework for quantum network routing that combines belief-state planning with Graph Neural Networks (GNNs)<n>Our approach encodes complex quantum network dynamics, including entanglement degradation and time-varying channel noise, into a low-dimensional feature space.<n> Experiments on simulated quantum networks with up to 100 nodes demonstrate significant improvements in routing fidelity and entanglement delivery rates.
  arXiv  Detail & Related papers  (2025-09-10T14:50:03Z)
• 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)
• Pointer Networks with Q-Learning for Combinatorial Optimization [55.2480439325792]
  We introduce the Pointer Q-Network (PQN), a hybrid neural architecture that integrates model-free Q-value policy approximation with Pointer Networks (Ptr-Nets) Our empirical results demonstrate the efficacy of this approach, also testing the model in unstable environments.
  arXiv  Detail & Related papers  (2023-11-05T12:03:58Z)
• Scaling Limits of Quantum Repeater Networks [62.75241407271626]
  Quantum networks (QNs) are a promising platform for secure communications, enhanced sensing, and efficient distributed quantum computing. Due to the fragile nature of quantum states, these networks face significant challenges in terms of scalability. In this paper, the scaling limits of quantum repeater networks (QRNs) are analyzed.
  arXiv  Detail & Related papers  (2023-05-15T14:57:01Z)
• Dynamic Routing for Quantum Key Distribution Networks [2.913123182364138]
  In this paper, we consider quantum key distribution (QKD) in a quantum network with both quantum repeaters and a small number of trusted nodes. We develop a new dynamic routing strategy that makes routing decisions based on the current network state, as well as evaluate various classical/quantum post-processing techniques.
  arXiv  Detail & Related papers  (2022-12-06T17:17:12Z)
• Optimization of QKD Networks with Classical and Quantum Annealing [0.7827586118586438]
  Quantum Key Distribution (QKD) hardware is used in a tier 1 provider network. The ensemble of QKD systems needs to be able to exchange as many encryption keys. Redundancy and latency requirements add additional boundary conditions.
  arXiv  Detail & Related papers  (2022-06-28T16:08:12Z)
• Data-Driven Random Access Optimization in Multi-Cell IoT Networks with NOMA [78.60275748518589]
  Non-orthogonal multiple access (NOMA) is a key technology to enable massive machine type communications (mMTC) in 5G networks and beyond. In this paper, NOMA is applied to improve the random access efficiency in high-density spatially-distributed multi-cell wireless IoT networks. A novel formulation of random channel access management is proposed, in which the transmission probability of each IoT device is tuned to maximize the geometric mean of users' expected capacity.
  arXiv  Detail & Related papers  (2021-01-02T15:21:08Z)
• 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)

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.