Quantum Key Distribution for Virtual Power Plant Communication: A Lightweight Key-Aware Scheduler with Provable Stability

• URL: http://arxiv.org/abs/2510.17087v1
• Date: Mon, 20 Oct 2025 01:29:44 GMT
• Title: Quantum Key Distribution for Virtual Power Plant Communication: A Lightweight Key-Aware Scheduler with Provable Stability
• Abstract summary: 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.
• Score: 0.8122270502556375
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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. As operations move to minute-- and second--level feedback, communication security shifts from a compliance item to an operational constraint: latency, reliability, and confidentiality jointly determine whether dispatch, protection, and settlement signals arrive on time. Conventional PKI and key-rotation schemes struggle with cross-domain, high-frequency messaging and face long-term quantum threats. Quantum key distribution (QKD) offers information-theoretic key freshness, but its key yield is scarce and stochastic, often misaligned with bursty VPP traffic. This paper proposes a key-aware priority and quota framework that treats quantum keys as first-class scheduling resources. The design combines (i) forecast-driven long-term quotas and short-term tokens, (ii) key-aware deficit-round-robin arbitration, (iii) a preemptive emergency key reserve, and (iv) graceful degradation via encryption-mode switching and controlled down-sampling for non-critical traffic. A drift-plus-penalty analysis establishes strong stability under average supply--demand balance with quantifiable bounds on backlog and tail latency, providing interpretable operating guarantees. We build a reproducible testbed on IEEE 33- and 123-bus VPP systems and evaluate normal, degraded, and outage regimes with industry-consistent message classes and TTLs. Against FIFO, fixed-priority, and static-quota baselines, the proposed scheme consistently reduces tail delay and passive timeouts for critical messages, improves per-bit key utility, and enhances power-tracking reliability during key scarcity and regime switches.

Related papers

• The Capacity of Information-Theoretic Secure Aggregation in Federated Learning [38.64656884737012]
  We study the $T$-colluding information-theoretic secure aggregation problem with $N$ users.<n>Unlike prior work, we model key distribution through user-to-user communication.<n>We show that the optimal performance can be achieved using only pairwise shared keys.
  arXiv  Detail & Related papers  (2026-06-05T13:53:27Z)
• Composable Post-Quantum Security for FADEC-Coupled Dual-Spool Turbofan Cyber-Physical Systems [0.2864713389096699]
  We develop a unified mathematical formulation for post-quantum authenticated telemetry and actuation in FADEC-coupled turbofan cyber-physical systems.<n>Results characterize how post-quantum security, real-time schedulability, and closed-loop stability interact in safety-critical aerospace control architectures.
  arXiv  Detail & Related papers  (2026-05-01T13:59:38Z)
• 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)
• Quantum Clock Synchronization Networks: A Survey [44.015977790437454]
  Quantum clock synchronization (QCS) aims to establish a shared temporal reference between distant nodes.<n>QCS protocols offer the potential to surpass classical precision bounds and enhance resilience against adversarial manipulations.<n>This survey provides a unified and critical overview of the rapidly growing QCS research landscape.
  arXiv  Detail & Related papers  (2026-04-06T05:30:54Z)
• Solving the Post-Quantum Control Plane Bottleneck: Energy-Aware Cryptographic Scheduling in Open RAN [8.221622045367923]
  Post-Quantum Cryptography (PQC) is the primary scalable defence but introduces a significant bottleneck for the RAN control plane.<n>This paper proposes energy-aware framework to solve this PQC bottleneck, ensuring quantum resilience without sacrificing operational energy efficiency.
  arXiv  Detail & Related papers  (2026-02-12T10:58:54Z)
• 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)
• 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)
• 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)
• High-rate discrete-modulated continuous-variable quantum key distribution with composable security [17.348175817014234]
  We report a discrete-modulated continuous-variable quantum key distribution system with a composable secret key rate of 18.93 Mbps against collective attacks over a 25 km fiber channel.<n>This record breaking rate is achieved through the probability shaped 16QAM-modulated protocol, which employs semidefinite programming to ensure its composable security.
  arXiv  Detail & Related papers  (2025-03-19T03:59:19Z)
• High-rate discrete-modulated continuous-variable quantum key distribution with composable security [17.348175817014234]
  We report a continuous-variable quantum key distribution system with a composable secret key rate of 18.93 Mbps against collective attacks over a 25 km fiber channel.<n>This record-breaking rate is achieved through the probability shaped 16QAM-modulated protocol, which employs semidefinite programming to ensure its composable security.
  arXiv  Detail & Related papers  (2025-03-14T14:21:08Z)
• Application of $α$-order Information Metrics for Secure Communication in Quantum Physical Layer Design [45.41082277680607]
  We study the $alpha$-order information-theoretic metrics based on R'enyi entropy.<n>We apply our framework to a practical scenario involving BPSK modulation over a lossy bosonic channel.
  arXiv  Detail & Related papers  (2025-02-07T03:44:11Z)
• Digital Twin-Assisted Federated Learning with Blockchain in Multi-tier Computing Systems [67.14406100332671]
  In Industry 4.0 systems, resource-constrained edge devices engage in frequent data interactions. This paper proposes a digital twin (DT) and federated digital twin (FL) scheme. The efficacy of our proposed cooperative interference-based FL process has been verified through numerical analysis.
  arXiv  Detail & Related papers  (2024-11-04T17:48:02Z)
• Practical quantum secure direct communication with squeezed states [37.69303106863453]
  We report the first table-top experimental demonstration of a CV-QSDC system and assess its security.<n>This realization paves the way into future threat-less quantum metropolitan networks, compatible with coexisting advanced wavelength division multiplexing (WDM) systems.
  arXiv  Detail & Related papers  (2023-06-25T19:23:42Z)
• 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)
• Deep Reinforcement Learning for Wireless Scheduling in Distributed Networked Control [37.10638636086814]
  We consider a joint uplink and downlink scheduling problem of a fully distributed wireless control system (WNCS) with a limited number of frequency channels.<n>We develop a deep reinforcement learning (DRL) based framework for solving it.<n>To tackle the challenges of a large action space in DRL, we propose novel action space reduction and action embedding methods.
  arXiv  Detail & Related papers  (2021-09-26T11:27:12Z)
• Fast and Secure Routing Algorithms for Quantum Key Distribution Networks [5.659290426197763]
  We consider the problem of secure packet routing at the maximum achievable rate in Quantum Key Distribution (QKD) networks. We propose a new secure throughput-optimal policy called Tandem Queue Decomposition (TQD) We show that the TQD policy solves the problem of secure and efficient packet routing for a broad class of traffic, including unicast, broadcast, multicast, and anycast.
  arXiv  Detail & Related papers  (2021-09-16T12:29:41Z)

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.