Quantum Deep Reinforcement Learning for URLLC Satellite-Air-Ground Integrated Networks With Digital Twin Applications
Bibliographic record
Abstract
In this paper, we explore a maritime 6G-enhanced satellite-air-ground integrated network (SAGIN) that incorporates a UAV-carried reconfigurable intelligent surface (UCR) relay, and low Earth orbit (LEO) satellites equipped with mobile edge computing (MEC) facilities. The system captures dynamic maritime conditions, including ultra-reliable low-latency communication (URLLC) user mobility and UCR movements across harbor environments. The primary objective is to minimize the total system cost by jointly optimizing task offloading decisions, bandwidth allocation, local computational resource distribution, transmission power control, and caching management, while satisfying strict latency and resource constraints. To address this, we formulate a mixed-integer nonlinear programming (MINLP) problem that captures the complexity of resource optimization in the maritime 6G-enhanced SAGIN. Two quantum-enhanced deep reinforcement learning algorithms, namely quantum-enhanced deep deterministic policy gradient (QEDDPG) and quantum-enhanced proximal policy optimization (QEPPO), are proposed to solve the formulated MINLP problem. Moreover, higher-order quantum feature encoding and quantum neural networks are utilized to accelerate learning and enhance decision-making. Simulation results demonstrate that QEDDPG and QEPPO significantly outperform conventional deep reinforcement learning methods by achieving lower system costs and more efficient resource allocation. These findings shows that the potential of quantum-driven reinforcement learning for enabling scalable, efficient, and intelligent resource management in future 6G-enhanced SAGINs.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".