Maximizing Qubit Throughput under Buffer Decoherence and Variability in Generation

• URL: http://arxiv.org/abs/2603.25482v1
• Date: Thu, 26 Mar 2026 14:23:52 GMT
• Title: Maximizing Qubit Throughput under Buffer Decoherence and Variability in Generation
• Abstract summary: Quantum communication networks require transmission of high-fidelity, uncoded qubits for applications such as entanglement distribution and quantum key distribution.<n>Current implementations are constrained by limited buffer capacity and qubit decoherence, which degrades qubit quality while waiting in the buffer.<n>We model this system as an admission control problem in a finite buffer queue, where the reward associated with each job is a decreasing function of its sojourn time.<n>We derive analytical conditions under which a simple "no lag" policy where a new qubit is generated immediately upon the availability of buffer space is optimal.
• Score: 14.554245554781367
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum communication networks require transmission of high-fidelity, uncoded qubits for applications such as entanglement distribution and quantum key distribution. However, current implementations are constrained by limited buffer capacity and qubit decoherence, which degrades qubit quality while waiting in the buffer. A key challenge arises from the stochastic nature of qubit generation, there exists a random delay (D) between the initiation of a generation request and the availability of the qubit. This induces a fundamental trade off early initiation increases buffer waiting time and hence decoherence, whereas delayed initiation leads to server idling and reduced throughput. We model this system as an admission control problem in a finite buffer queue, where the reward associated with each job is a decreasing function of its sojourn time. We derive analytical conditions under which a simple "no lag" policy where a new qubit is generated immediately upon the availability of buffer space is optimal. To address scenarios with unknown system parameters, we further develop a Bayesian learning framework that adaptively optimizes the admission policy. In addition to quantum communication systems, the proposed model is applicable to delay sensitive IoT sensing and service systems.

Related papers

• Centralizing Task-based Approach to Quantum Network Control [71.48385446560893]
  layered architectures impose stringent design and timing constraints on quantum networks.<n>We simulate a resource-centric, task-based approach to quantum network control by utilizing a centralized controller.
  arXiv  Detail & Related papers  (2026-05-05T03:57:17Z)
• QuIKS: Near-Zero Latency Key Supply with Adaptive Buffering for Resource-Efficient Quantum Key Distribution Networks [33.44123939361452]
  Quantum key distribution (QKD) networks provide information-theoretically secure keys for distant parties.<n>QIKS is built upon a novel analytical model that determines the minimum buffer size required to guarantee near-zero-latency key supply performance.<n>Experiments on a real QKD network testbed demonstrate that QuIKS achieves near-zero key supply latency while providing a more than 10-fold reduction in key buffer size.
  arXiv  Detail & Related papers  (2026-04-10T09:22:51Z)
• Adaptive Resource and Memory Control for Stability in Quantum Entanglement Distribution [0.0]
  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.
  arXiv  Detail & Related papers  (2026-03-25T23:36:38Z)
• FlowPrefill: Decoupling Preemption from Prefill Scheduling Granularity to Mitigate Head-of-Line Blocking in LLM Serving [13.856291757420012]
  Long-running requests monopolize resources and delay higher-priority ones, leading to widespread time-to-first-token (TTFT) service level violations.<n>We propose FlowPrefill, a TTFT-goodput-optimized serving system that balances execution granularity against scheduling overheads.<n>We show that FlowPrefill improves maximum goodput by up to 5.6$times$ compared to state-of-the-art systems.
  arXiv  Detail & Related papers  (2026-02-18T16:57:45Z)
• PASS-Enhanced MEC: Joint Optimization of Task Offloading and Uplink PASS Beamforming [67.78883135636657]
  pinching-antenna system (PASS)-enhanced mobile edge computing (MEC) architecture is investigated.<n>PASS establishes short-distance line-of-sight (LoS) links while effectively mitigating the significant path loss and potential signal blockage.<n>We formulate a network latency minimization problem to joint optimize uplink PASS beamforming and task offloading.
  arXiv  Detail & Related papers  (2025-10-27T03:04:46Z)
• Quantum Key Distribution for Virtual Power Plant Communication: A Lightweight Key-Aware Scheduler with Provable Stability [0.8122270502556375]
  Virtual power plants (VPPs) are becoming a cornerstone of future grids, aggregating distributed PV, wind, storage, and flexible loads for market participation and real-time balancing.<n> PKI and key-rotation schemes struggle with cross-domain, high-frequency messaging and face long-term quantum threats.<n>This paper proposes a key-aware priority and quota framework that treats quantum keys as first-class scheduling resources.
  arXiv  Detail & Related papers  (2025-10-20T01:29:44Z)
• CSGO: Generalized Optimization for Cold Start in Wireless Collaborative Edge LLM Systems [62.24576366776727]
  We propose a latency-aware scheduling framework to minimize total inference latency.<n>We show that the proposed method significantly reduces cold-start latency compared to baseline strategies.
  arXiv  Detail & Related papers  (2025-08-15T07:49:22Z)
• Entanglement Request Scheduling in Quantum Networks Using Deep Q-Network [3.1856756516735936]
  A novel Deep Q-Network (DQN) based scheduling method is proposed to optimize delay time and fairness among entanglement requests in quantum repeater networks.<n>Results show that the proposed technique achieves higher performance compared to Greedy, Proportional fair and FIFO scheduling schemes.
  arXiv  Detail & Related papers  (2025-05-18T15:32:21Z)
• Task-Oriented Feature Compression for Multimodal Understanding via Device-Edge Co-Inference [54.53508601749513]
  We propose a task-oriented feature compression (TOFC) method for multimodal understanding in a device-edge co-inference framework.<n>To enhance compression efficiency, multiple entropy models are adaptively selected based on the characteristics of the visual features.<n>Results show that TOFC achieves up to 52% reduction in data transmission overhead and 63% reduction in system latency.
  arXiv  Detail & Related papers  (2025-03-17T08:37:22Z)
• Optimized Generation of Entanglement by Real-Time Ordering of Swapping Operations [4.152766500389854]
  Long-distance quantum communication in quantum networks faces significant challenges due to the constraints imposed by the no-cloning theorem. Most existing quantum communication protocols rely on the a priori distribution of entanglement pairs (EPs) We present a greedy algorithm that iteratively determines the best route and/or entanglement-swapping operation to perform at each stage based on the current network.
  arXiv  Detail & Related papers  (2024-05-13T06:43:11Z)
• Reconfigurable Intelligent Surface (RIS)-Assisted Entanglement Distribution in FSO Quantum Networks [62.87033427172205]
  Quantum networks (QNs) relying on free-space optical (FSO) quantum channels can support quantum applications in environments where establishing an optical fiber infrastructure is challenging and costly. A reconfigurable intelligent surface (RIS)-assisted FSO-based QN is proposed as a cost-efficient framework providing a virtual line-of-sight between users for entanglement distribution.
  arXiv  Detail & Related papers  (2024-01-19T17:16:40Z)
• Adaptive, Continuous Entanglement Generation for Quantum Networks [59.600944425468676]
  Quantum networks rely on entanglement between qubits at distant nodes to transmit information. We present an adaptive scheme that uses information from previous requests to better guide the choice of randomly generated quantum links. We also explore quantum memory allocation scenarios, where a difference in latency performance implies the necessity of optimal allocation of resources for quantum networks.
  arXiv  Detail & Related papers  (2022-12-17T05:40:09Z)
• Non-Cooperative Game Theory Based Rate Adaptation for Dynamic Video Streaming over HTTP [89.30855958779425]
  Dynamic Adaptive Streaming over HTTP (DASH) has demonstrated to be an emerging and promising multimedia streaming technique. We propose a novel algorithm to optimally allocate the limited export bandwidth of the server to multi-users to maximize their Quality of Experience (QoE) with fairness guaranteed.
  arXiv  Detail & Related papers  (2019-12-27T01:19:14Z)

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.