CyberIntel ⬡ News
★ Saved ◆ Cyber Reads
← Back ◌ Quantum Computing Mar 27, 2026

Adaptive Resource and Memory Control for Stability in Quantum Entanglement Distribution

arXiv Quantum Archived Mar 27, 2026 ✓ Full text saved

arXiv:2603.24874v1 Announce Type: new 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 s

Full text archived locally
✦ AI Summary · Claude Sonnet


    Quantum Physics [Submitted on 25 Mar 2026] Adaptive Resource and Memory Control for Stability in Quantum Entanglement Distribution Nicolò Lo Piparo, William J. Munro, Kae Nemoto 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. Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2603.24874 [quant-ph]   (or arXiv:2603.24874v1 [quant-ph] for this version)   https://doi.org/10.48550/arXiv.2603.24874 Focus to learn more Submission history From: Nicolò Lo Piparo [view email] [v1] Wed, 25 Mar 2026 23:36:38 UTC (2,794 KB) Access Paper: HTML (experimental) view license Current browse context: quant-ph < prev   |   next > new | recent | 2026-03 References & Citations INSPIRE HEP NASA ADS Google Scholar Semantic Scholar Export BibTeX Citation Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Demos Related Papers About arXivLabs Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
    💬 Team Notes
    Article Info
    Source
    arXiv Quantum
    Category
    ◌ Quantum Computing
    Published
    Mar 27, 2026
    Archived
    Mar 27, 2026
    Full Text
    ✓ Saved locally
    Open Original ↗