量子算法在网络路由优化中的发展与挑战

郝苑辰; 解宇恒; 唐建军

doi:10.11959/j.issn.1000-0801.2025193

您当前的位置：

首页 >

文章列表页 >

量子算法在网络路由优化中的发展与挑战

专题：量子通信技术 | 更新时间：2026-01-08

- 量子算法在网络路由优化中的发展与挑战
- Development and challenges of quantum algorithms for routing optimization in networks
- 电信科学 2025年41卷第12期页码：44-52
- 作者机构：
  
  中国电信股份有限公司研究院，北京 102209
- 作者简介：
  
  [ "郝苑辰（1996- ），女，中国电信股份有限公司研究院量子技术与应用研究团队工程师，主要研究方向为网络协议、网络安全技术、量子计算。" ]
  [ "解宇恒（1993- ），男，博士，中国电信股份有限公司研究院量子技术与应用研究团队工程师，主要研究方向为光纤传输系统、特种光纤、量子计算。" ]
  [ "唐建军（1977- ），男，博士，中国电信股份有限公司研究院量子技术与应用研究团队总监、高级工程师，主要研究方向为光通信与量子信息技术。" ]
- 基金信息：
  
  科技创新2030—“量子通信与量子计算机”重大项目(2021ZD0301300)
- DOI：10.11959/j.issn.1000-0801.2025193
  中图分类号： TN915.02
- 收稿：2025-05-09，
  
  修回：2025-06-23，
  
  录用：2025-06-30，
  
  纸质出版：2025-12-20
- 稿件说明：
移动端阅览
郝苑辰,解宇恒,唐建军.量子算法在网络路由优化中的发展与挑战[J].电信科学,2025,41(12):44-52.

HAO Yuanchen,XIE Yuheng,TANG Jianjun.Development and challenges of quantum algorithms for routing optimization in networks[J].Telecommunications Science,2025,41(12):44-52.
郝苑辰,解宇恒,唐建军.量子算法在网络路由优化中的发展与挑战[J].电信科学,2025,41(12):44-52. DOI： 10.11959/j.issn.1000-0801.2025193.

HAO Yuanchen,XIE Yuheng,TANG Jianjun.Development and challenges of quantum algorithms for routing optimization in networks[J].Telecommunications Science,2025,41(12):44-52. DOI： 10.11959/j.issn.1000-0801.2025193.

摘要

在大规模异构通信网络中，路由优化问题涵盖高维状态空间、多重约束条件、动态实时性等复杂需求。以量子-经典混合计算为核心的新型范式，依托量子叠加与纠缠效应，为NP难路由问题提供了高效的潜在求解方案。梳理典型路由问题的量子算法建模框架，系统性归纳当前量子算法在网络路由优化中面临的核心挑战，包括结构性约束与算法建模表达冲突、多目标建模偏差与响应滞后、高维空间中多样性与收敛性矛盾以及动态环境下策略泛化能力不足等。为此，提出结构建模优化、演化设计与调度机制协同，增强量子算法的表达能力；结合多目标优化、模块解耦与量子-经典协作，提高计算精度与响应速度；基于混合架构构建、策略演化设计与结构约束控制，平衡收敛性与解空间多样性；引入元学习、任务分解与结构迁移方法，提升量子算法在动态网络中的适应性和泛化能力等发展方向。进一步地，推动算法设计与硬件架构的协同发展，为含噪中等规模量子（noisy intermediate-scale quantum，NISQ）时代量子计算在通信网络中的实用化部署提供理论支撑与技术实现路径。

Abstract

In large-scale heterogeneous communication networks

routing optimization involves complex demands such as high-dimensional state spaces

multiple constraints

and real-time dynamics. A quantum-classical hybrid computing paradigm

leveraging quantum superposition and entanglement

offers a promising pathway to efficiently address NP-hard routing problems. By analyzing representative routing scenarios

a modeling framework for quantum algorithms was outlined

and key technical obstacles in applying quantum approaches to network routing were systematically summarized. These include conflicts between structural constraints and model expressiveness

biases in multi-objective formulations and delayed responses

the trade-off between diversity and convergence in high-dimensional solution spaces

and limited generalization capability under dynamic conditions. To overcome these issues

several directions were proposed: algorithmic expressiveness was enhanced through improved structural modeling

evolutionary design

and integrated scheduling strategies; computational accuracy and responsiveness were improved via multi-objective optimization

modular decoupling

and tight quantum-classical interaction; convergence and diversity were balanced through hybrid architectural design

evolutionary policy adaptation

and structural constraint management; and adaptability and generalization in dynamic environments were boosted by incorporating meta-learning

task decomposition

and structural transfer techniques. Furthermore

the co-development of quantum algorithms and hardware architectures were advocated

paving the way for practical deployment of quantum computing in communication networks within the NISQ era.

关键词

Keywords

references

ANDREWS J G , BUZZI S , CHOI W , et al . What will 5G be? [J ] . IEEE Journal on Selected Areas in Communications , 2014 , 32 ( 6 ): 1065 - 1082 .

LAGHARI A A , WU K S , LAGHARI R A , et al . A review and state of art of Internet of things (IoT) [J ] . Archives of Computational Methods in Engineering , 2022 , 29 ( 3 ): 1395 - 1413 .

PRATT T , ALLNUTT J E . Satellite communications, 3rd edition [M ] . Hoboken, New Jersey : John Wiley & Sons , 2019 .

JAMSA K . Cloud computing, 2nd edition [M ] . Burlington, Massachusetts : Jones & Bartlett Learning , 2022 .

CAO K Y , LIU Y F , MENG G J , et al . An overview on edge computing research [J ] . IEEE Access , 2020 , 8 : 85714 - 85728 .

PRESKILL J . Quantum computing in the NISQ era and beyond [J ] . Quantum , 2018 , 2 : 79 .

LI Y H , FEI Y Y , WANG W L , et al . Quantum random number generator using a cloud superconducting quantum computer based on source-independent protocol [J ] . Scientific Reports , 2021 , 11 : 23873 .

KOCHENBERGER G , HAO J K , GLOVER F , et al . The unconstrained binary quadratic programming problem: a survey [J ] . Journal of Combinatorial Optimization , 2014 , 28 ( 1 ): 58 - 81 .

LEWIS M , GLOVER F . Quadratic unconstrained binary optimization problem preprocessing: theory and empirical analysis [J ] . Networks , 2017 , 70 ( 2 ): 79 - 97 .

HERMAN D , GOOGIN C , LIU X Y , et al . Quantum computing for finance [J ] . Nature Reviews Physics , 2023 , 5 ( 8 ): 450 - 465 .

HIBAT-ALLAH M , MAURI M , CARRASQUILLA J , et al . A framework for demonstrating practical quantum advantage: comparing quantum against classical generative models [J ] . Communications Physics , 2024 , 7 : 68 .

WEST M T , TSANG S L , LOW J S , et al . Towards quantum enhanced adversarial robustness in machine learning [J ] . Nature Machine Intelligence , 2023 , 5 ( 6 ): 581 - 589 .

FARHI E , GOLDSTONE J , GUTMANN S , et al . A quantum approximate optimization algorithm [J ] . arXiv preprint , 2014 , arXiv: 1411.4028 .

Arrazola J M , Delgado A , Bardhan B R , et al . Quantum-inspired algorithms in practice [J ] . arXiv preprint , 2019 , arXiv: 1905.10415 .

Meyer N , Ufrecht C , Periyasamy M , et al . A survey on quantum reinforcement learning [J ] . arXiv preprint , 2022 , arXiv: 2211.03464 .

付耀斌 , 周辉 . 量超协同计算发展概述 [J ] . 信息通信技术与政策 , 2023 ( 7 ): 36 - 43 .

FU Y B , ZHOU H . Overview of hybrid quantum-classical computing development [J ] . Information and Communications Technology and Policy , 2023 ( 7 ): 36 - 43 .

LIAO J N , WEN J B , KANG J W , et al . Graph attention network-based block propagation with optimal AoB and reputation in Web 3.0 [J ] . IEEE Transactions on Cognitive Communications and Networking , 2024 , 10 ( 6 ): 2427 - 2441 .

JAISWAL A , KUMAR S , KAIWARTYA O , et al . Quantum learning-enabled green communication for next-generation wireless systems [J ] . IEEE Transactions on Green Communications and Networking , 2021 , 5 ( 3 ): 1015 - 1028 .

URGELLES H , PICAZO-MARTINEZ P , GARCIA-ROGER D , et al . Multi-objective routing optimization for 6G communication networks using a quantum approximate optimization algorithm [J ] . Sensors , 2022 , 22 ( 19 ): 7570 .

BAO S Y , TAWADA M , TANAKA S , et al . An Ising-machine-based solver of vehicle routing problem with balanced pick-up [J ] . IEEE Transactions on Consumer Electronics , 2024 , 70 ( 1 ): 445 - 459 .

KHUDAIR MADHLOOM J , ABD ALI H N , HASAN H A , et al . A quantum-inspired ant colony optimization approach for exploring routing gateways in mobile ad hoc networks [J ] . Electronics , 2023 , 12 ( 5 ): 1171 .

KUMAR S , KAIWARTYA O , RATHEE M , et al . Toward energy-oriented optimization for green communication in sensor enabled IoT environments [J ] . IEEE Systems Journal , 2020 , 14 ( 4 ): 4663 - 4673 .

OH E , LEE H . Effective route generation framework using quantum mechanism-based multi-directional and parallel ant colony optimization [J ] . Computers & Industrial Engineering , 2022 , 169 : 108308 .

SUN J , FANG W , WU X J , et al . QoS multicast routing using a quantum-behaved particle swarm optimization algorithm [J ] . Engineering Applications of Artificial Intelligence , 2011 , 24 ( 1 ): 123 - 131 .

GHORPADE S N , ZENNARO M , CHAUDHARI B S , et al . A novel enhanced quantum PSO for optimal network configuration in heterogeneous industrial IoT [J ] . IEEE Access , 2021 , 9 : 134022 - 134036 .

SONG L , CHAI K K , CHEN Y , et al . Energy efficient cooperative coalition selection in cluster-based capillary networks for CMIMO IoT systems [J ] . Computer Networks , 2019 , 153 : 92 - 102 .

ZHANG D G , CUI Y Y , ZHANG T . New quantum-genetic based OLSR protocol (QG-OLSR) for Mobile Ad hoc Network [J ] . Applied Soft Computing , 2019 , 80 : 285 - 296 .

ZHANG D G , ZHANG T , DONG Y , et al . Novel optimized link state routing protocol based on quantum genetic strategy for mobile learning [J ] . Journal of Network and Computer Applications , 2018 , 122 : 37 - 49 .

SYMONS B C B , GALVIN D , SAHIN E , et al . A practitioner’s guide to quantum algorithms for optimisation problems [J ] . Journal of Physics A: Mathematical and Theoretical , 2023 , 56 ( 45 ): 453001 .

KOTIL A , PELOFSKE E , RIEDMĂŹLLER S , et al . Quantum approximate multi-objective optimization [J ] . arXiv preprint , 2025 , arXiv: 2503.22797 .

ROVARA D , QUETSCHLICH N , WILLE R . A framework to formulate pathfinding problems for quantum computing [J ] . arXiv preprint , 2024 , arXiv: 2404.10820 .

MCCLEAN J R , BOIXO S , SMELYANSKIY V N , et al . Barren plateaus in quantum neural network training landscapes [J ] . Nature Communications , 2018 , 9 ( 1 ): 4812 .

ZHAO R , WANG S . A review of quantum neural networks: methods, models, dilemma [J ] . arXiv preprint , 2021 , arXiv: 2109.01840 .

SHAYDULIN R , LOTSHAW P C , LARSON J , et al . Parameter transfer for quantum approximate optimization of weighted MaxCut [J ] . ACM Transactions on Quantum Computing , 2023 , 4 ( 3 ): 1 - 15 .

SULEIMAN H , BASIR O . SLA-driven load scheduling in multi-tier cloud computing: financial impact considerations [J ] . arXiv preprint , 2021 , arXiv: 2111.03488 .

EKSTRØM L , WANG H , SCHMITT S . Variational quantum multi-objective optimization [J ] . arXiv preprint , 2023 , arXiv: 2312.14151 .

HIGGINS E , PITT J , PATERSON E . Multi-scale localized perturbation method in OpenFOAM [J ] . Fluids , 2020 , 5 ( 4 ): 250 .

DUBERTRAND R , GARCÍA-MATA I , GEORGEOT B , et al . Multifractality of quantum wave functions in the presence of perturbations [J ] . Physical Review E: Statistical, Nonlinear, and Soft Matter Physics , 2015 , 92 ( 3 ): 032914 .

ABADAL S , JAIN A , GUIRADO R , et al . Computing graph neural networks: a survey from algorithms to accelerators [J ] . ACM Computing Surveys , 2022 , 54 ( 9 ): 1 - 38 .

YUN W J , PARK J , KIM J . Quantum multi-agent meta reinforcement learning [J ] . Proceedings of the AAAI Conference on Artificial Intelligence , 2023 , 37 ( 9 ): 11087 - 11095 .

VIDAL G . Class of quantum many-body states that can be efficiently simulated [J ] . Physical Review Letters , 2008 , 101 ( 11 ): 110501 .

SULZ D , LUBICH C , CERUTI G , et al . Numerical simulation of long-range open quantum many-body dynamics with tree tensor networks [J ] . Physical Review A , 2024 , 109 ( 2 ): 022420 .

FALLA J , LANGFITT Q , ALEXEEV Y , et al . Graph representation learning for parameter transferability in quantum approximate optimization algorithm [J ] . Quantum Machine Intelligence , 2024 , 6 ( 2 ): 46 .

浏览量

921

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

量子计算云平台的技术演进与发展趋势

算力基础设施发展现状与趋势展望

基于未来应用的未来网络固定特征

基于量子布谷鸟搜索的认知无线网络频谱分配