量子算法在卫星网络动态路由中难有突破，因优化困境与学习不稳。
Challenges in Applying Variational Quantum Algorithms to Dynamic Satellite Network Routing
- 用经典易解的4节点最短路径测试静态量子优化器，结果失败
- 8节点动态环境中的量子强化学习无法学出有效策略，等同随机决策
- 揭示了量子算法在通信网络应用中的核心瓶颈，适合关注量子实用性的研究者
将近期变分量子算法应用于动态卫星网络路由是一个有前景的方向。本文对两类方法进行了批判性评估：用于离线路由计算的静态量子优化器（如变分量子本征值求解器VQE和量子近似优化算法QAOA），以及用于在线决策的量子强化学习（QRL）方法。通过理想无噪声仿真发现，这些算法面临显著挑战。具体而言，静态优化器连经典上简单的4节点最短路径问题都无法解决，原因在于优化景观过于复杂；同样，基于策略梯度的简单QRL代理在8节点动态环境中无法学习出有效路由策略，表现不优于随机动作。这些负面结果凸显了量子算法在通信网络中实现实际优势前需克服的关键障碍。我们分析了其根本原因，包括平庸高原现象和学习不稳定性，并提出了未来研究方向。
原文摘要 · Abstract (English)
Applying near-term variational quantum algorithms to the problem of dynamic satellite network routing represents a promising direction for quantum computing. In this work, we provide a critical evaluation of two major approaches: static quantum optimizers such as the Variational Quantum Eigensolver (VQE) and the Quantum Approximate Optimization Algorithm (QAOA) for offline route computation, and Quantum Reinforcement Learning (QRL) methods for online decision-making. Using ideal, noise-free simulations, we find that these algorithms face significant challenges. Specifically, static optimizers are unable to solve even a classically easy 4-node shortest path problem due to the complexity of the optimization landscape. Likewise, a basic QRL agent based on policy gradient methods fails to learn a useful routing strategy in a dynamic 8-node environment and performs no better than random actions. These negative findings highlight key obstacles that must be addressed before quantum algorithms can offer real advantages in communication networks. We discuss the underlying causes of these limitations, including barren plateaus and learning instability, and suggest future research directions to overcome them.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。