Adaptive Resource and Memory Control for Stability in Quantum Entanglement Distribution

• URL: http://arxiv.org/abs/2603.24874v1
• Date: Wed, 25 Mar 2026 23:36:38 GMT
• Title: Adaptive Resource and Memory Control for Stability in Quantum Entanglement Distribution
• Abstract summary: congestion-aware control of quantum repeater nodes operating under traffic and finite memory coherence.<n>We analyze stability, delay, and fidelity trade-offs using a queueing-theoretic framework.<n>Results provide a queue-aware congestion-control perspective for adaptive resource management in quantum networks.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We investigate congestion-aware control of quantum repeater nodes operating under stochastic traffic and finite memory coherence. Entanglement generation is modeled as a probabilistic process producing Werner states subject to depolarizing memory decoherence, while entanglement requests arrive according to Poisson and bursty ON--OFF processes. Using a queueing-theoretic framework, we couple physical-layer memory dynamics with congestion-dependent service behavior to analyze stability, delay, and fidelity trade-offs. Operating regimes are characterized in terms of the load parameter, showing that fixed cutoff policies impose a fundamental fidelity--latency trade-off together with strict stability limits. Queue-aware adaptive control strategies are then introduced that dynamically adjust memory cutoff times and the number of parallel entanglement-generation channels. Cutoff adaptation restores stability near critical load by trading fidelity for service capacity, whereas resource scaling increases capacity without degrading entanglement quality. Under bursty traffic, joint adaptation suppresses delay spikes while activating additional channels only during congestion periods. The framework is further extended to a two-user shared-resource scenario in which independent traffic flows compete for a common resource pool. Stability is determined by aggregate load, while adaptive resource redistribution stabilizes queues that diverge under fixed partitioning. These results provide a queue-aware congestion-control perspective for adaptive resource management in quantum networks.

Related papers

• Federated Continual Learning as a Distributed Drift-Plus-Penalty Control Problem [12.498691027665332]
  Federated Continual Learning (FCL) is fundamental to real-world distributed learning systems.<n>FCL requires models to adapt to sequential, non-IID data across clients while mitigating catastrophic forgetting and client drift.<n>We propose Federated Queue-regulated Continual Learning (FedQCL), a framework based on Lynov drift-plus-penalty (DPP) optimization.
  arXiv  Detail & Related papers  (2026-08-21T18:21:19Z)
• AdaptiveSD A Stability-Aware, Runtime-Adaptive Speculative Decoding Framework with Multi-Policy Orchestration for CPU-Constrained LLM Inference [0.0]
  Fixed-depth speculative decoding has emerged as one promising technique, but in practice, it often leads to performance degradation due to bandwidth saturation, instability, or even catastrophic resource exhaustion resulting in system failure.<n>Our solution consists of four tightly-coupled components working together in a continuous feedback loop: an Adaptive Draft Controller, a Dynamic Policy Engine, a KV Cache Coordination Layer, and a Monitoring Engine.<n>While conventional approaches focus solely on maximizing throughput, we instead assess the effectiveness of our approach based on several key metrics including wasted drafted compute and inter-token latency dispersion alongside standard measures of speculative efficiency.
  arXiv  Detail & Related papers  (2026-07-04T13:39:40Z)
• Q-Flow: Stable and Expressive Reinforcement Learning with Flow-Based Policy [51.31164293751206]
  We introduce Q-Flow, a framework that leverages the deterministic nature of flow dynamics to explicitly propagate latent states along policy-induced flow.<n>We evaluate Q-Flow in the offline learning setting on the challenging OGBench suite, where it consistently outperforms state-of-the-art baselines by an average of 10.6 percentage points.
  arXiv  Detail & Related papers  (2026-05-13T12:31:02Z)
• Diffusion Controller: Framework, Algorithms and Parameterization [54.82539154511621]
  We present a unified control-theoretic view that casts reverse diffusion sampling as state-only control within (generalized) linearly-solvable Markov Decision Processes.<n>Under this framework, control acts by reweighting the pretrained reverse-time transition kernels, balancing terminal objectives against an $f$-divergence cost.<n>Experiments on Stable Diffusion v1.4 show consistent gains in preference-alignment win rates and improved quality-efficiency trade-offs.
  arXiv  Detail & Related papers  (2026-03-07T01:49:59Z)
• Token Management in Multi-Tenant AI Inference Platforms [0.0]
  Multi-tenant AI inference platforms must balance resource utilization against service-level guarantees under variable demand.<n>We introduce emphtoken pools, a control-plane abstraction that represents capacity as explicit entitlements expressed in inference-native units.
  arXiv  Detail & Related papers  (2026-02-27T22:44:09Z)
• Harnessing Flexible Spatial and Temporal Data Center Workloads for Grid Regulation Services [8.460796912216642]
  We propose a unified day-ahead co-optimization framework that jointly decides workload distribution across geographically distributed DCs and regulation capacity commitments.<n>Case studies show that the proposed framework lowers system operating costs, enables more viable regulation capacity, and achieves better revenue-risk trade-offs.
  arXiv  Detail & Related papers  (2026-02-02T00:42:09Z)
• Lyapunov Stability-Aware Stackelberg Game for Low-Altitude Economy: A Control-Oriented Pruning-Based DRL Approach [37.51135101684223]
  Unmanned Aerial Vehicles (UAVs) serve as pivotal aerial base stations supporting diverse services from users.<n>The efficacy of such heterogeneous networks is often compromised by the conflict between limited onboard resources and stringent stability requirements.<n>We propose a Sensing-Communication-Computing-Control closed-loop framework that explicitly models the impact of communication latency on physical control stability.
  arXiv  Detail & Related papers  (2026-02-01T10:01:07Z)
• An Adaptive Purification Controller for Quantum Networks: Dynamic Protocol Selection and Multipartite Distillation [10.706268477180858]
  We propose an Adaptive Purification Controller (APC) that automatically optimize the entanglement distillation sequence to maximize the goodput.<n>We show that our approach mitigates the "fidelity cliffs" inherent in static protocols and reduces resource wastage in high-noise regimes.<n>We extend the controller to heterogeneous scenarios, and evaluate it for both multipartite GHZ state generation and continuous-variable systems.
  arXiv  Detail & Related papers  (2026-01-26T10:56:37Z)
• PowerGrow: Feasible Co-Growth of Structures and Dynamics for Power Grid Synthesis [75.14189839277928]
  We present PowerGrow, a co-generative framework that significantly reduces computational overhead while maintaining operational validity.<n> Experiments across benchmark settings show that PowerGrow outperforms prior diffusion models in fidelity and diversity.<n>This demonstrates its ability to generate operationally valid and realistic power grid scenarios.
  arXiv  Detail & Related papers  (2025-08-29T01:47:27Z)
• Leveraging Low-Rank and Sparse Recurrent Connectivity for Robust Closed-Loop Control [63.310780486820796]
  We show how a parameterization of recurrent connectivity influences robustness in closed-loop settings. We find that closed-form continuous-time neural networks (CfCs) with fewer parameters can outperform their full-rank, fully-connected counterparts.
  arXiv  Detail & Related papers  (2023-10-05T21:44:18Z)
• Compressed Regression over Adaptive Networks [58.79251288443156]
  We derive the performance achievable by a network of distributed agents that solve, adaptively and in the presence of communication constraints, a regression problem. We devise an optimized allocation strategy where the parameters necessary for the optimization can be learned online by the agents.
  arXiv  Detail & Related papers  (2023-04-07T13:41:08Z)
• Guaranteed Dynamic Scheduling of Ultra-Reliable Low-Latency Traffic via Conformal Prediction [72.59079526765487]
  The dynamic scheduling of ultra-reliable and low-latency traffic (URLLC) in the uplink can significantly enhance the efficiency of coexisting services. The main challenge is posed by the uncertainty in the process of URLLC packet generation. We introduce a novel scheduler for URLLC packets that provides formal guarantees on reliability and latency irrespective of the quality of the URLLC traffic predictor.
  arXiv  Detail & Related papers  (2023-02-15T14:09:55Z)

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.