International Journal of Intelligent Systems and Applications in Engineering

Hybrid Classical–Quantum Optimization of Wireless Routing Using QAOA and Quantum Walks

Eric M. Howard

Published Mar 28, 2026• 0 citations

Abstract

Routing in wireless communication networks is shaped by mobility, interference, congestion, and competing service requirements, making route selection a high-dimensional constrained optimization problem rather than a simple shortest path task. This paper investigates the use of hybrid classical–quantum methods for wireless routing, focusing on the Quantum Approximate Optimization Algo-rithm (QAOA) and quantum walks as candidate mechanisms for exploring complex routing spaces. The paper examines how wireless routing can be expressed as a constrained graph optimization problem in which routing objectives, flow constraints, connectivity requirements, and interference effects are mapped into quantum-compatible Hamiltonian representations. It then discusses how these approaches can be integrated into a hybrid architecture in which classical systems perform network monitoring, graph construction, pre-processing, and deployment, while quantum subroutines are used for selected optimization components. The analysis shows that the potential value of quantum routing lies primarily in the treatment of difficult combinatorial subproblems rather than end-to-end replace-ment of classical routing frameworks. The paper also highlights practical limitations arising from state preparation, constraint encoding, oracle construction, hardware noise, limited qubit resources, and hybrid execution overhead. It is argued that any meaningful near-term advantage will depend on careful problem decomposition, compact encoding, and tight classical–quantum integration. DOI: https://doi.org/10.17762/ijisae.v14i1s.8149

DOI: 10.17762/ijisae.v14i1s.8149

Related papers

Hybrid Classical--Quantum Optimization of Wireless Routing Using QAOA and Quantum Walks

Eric Howard, Hardique Dasore, Hom Nath Dhungana +4 more

Routing in wireless communication networks is shaped by mobility, interference, congestion, and competing service requirements, making route selection a high-dimensional constrained optimization problem rather than a simple shortest-path task. This paper investigates the use of hybrid classical--quantum methods for wireless routing, focusing on the Quantum Approximate Optimization Algorithm (QAOA) and quantum walks as candidate mechanisms for exploring complex routing spaces. The paper examines how wireless routing can be expressed as a constrained graph optimization problem in which routing objectives, flow constraints, connectivity requirements, and interference effects are mapped into quantum-compatible Hamiltonian representations. It then discusses how these approaches can be integrated into a hybrid architecture in which classical systems perform network monitoring, graph construction, pre-processing, and deployment, while quantum subroutines are used for selected optimization components. The analysis shows that the potential value of quantum routing lies primarily in the treatment of difficult combinatorial subproblems rather than end-to-end replacement of classical routing frameworks. The paper also highlights practical limitations arising from state preparation, constraint encoding, oracle construction, hardware noise, limited qubit resources, and hybrid execution overhead. It is argued that any meaningful near-term advantage will depend on careful problem decomposition, compact encoding, and tight classical--quantum integration.

quant-pharXiv:2604.01250International Journal of Intelligent Systems and Applications in EngineeringApr 2, 20260 citations

HYBRID QUANTUM ALGORITHMS FOR AUTONOMOUS VEHICLE NAVIGATION: DIRECTED PATH PLANNING WITH GROVER-QAOA

IDRIS KAGAN DEMIR, Seda Nur Gungor, Mehmet Karaköse

Path planning in complex and obstacle-constrained environments remains a challenging combinatorial optimization problem due to the exponential growth of the solution space and the limitations of classical algorithms in dynamic decision-making scenarios. Traditional approaches such as Dijkstra or A* may experience high computational costs and susceptibility to local optima when dealing with large-scale directed graphs containing obstacles. This study proposes a hybrid quantum computing approach that integrates the Grover Search Algorithm and the Quantum Approximate Optimization Algorithm (QAOA) to address optimal path planning on obstacle-oriented directed graphs. The Grover algorithm is first employed as an oracle-based filtering mechanism to detect and eliminate obstacle-containing edges, thereby generating a valid subgraph of feasible paths. Following this preprocessing step, QAOA is applied to the filtered graph within a nonlinear optimization framework to determine the minimum-cost path between source and destination nodes. The optimization model represents the graph as G=(V,E), where binary decision variables indicate whether an edge is included in the selected route while satisfying flow conservation constraints. By narrowing the solution space through Grover-based obstacle detection and performing optimization only on valid edges, the proposed method significantly reduces computational complexity compared to conventional approaches. Experimental analysis demonstrates that the hybrid quantum model effectively identifies optimal routes and adapts to different obstacle configurations while maintaining efficient convergence behavior. The results highlight the potential of integrating quantum search and quantum optimization techniques for solving combinatorial graph problems. This work contributes to the growing body of research on quantum-assisted optimization and demonstrates the feasibility of applying hybrid quantum algorithms to directed path planning problems relevant to autonomous navigation systems.

Quantum Journal of Engineering Science and TechnologyMar 31, 20261 citation

Quantum Walk-Based Routing Protocols for Wireless Networks

Jincheng Zhang

This paper investigates the application of quantum walks to routing protocols within wireless networks. Traditional routing algorithms often struggle with efficiency and convergence speed, particularly in dynamic and complex network topologies. We propose a novel approach utilizing quantum walk principles to explore network connectivity and identify optimal routes. Our methodology employs a quantum walk algorithm to simulate network traversal, leveraging quantum superposition and interference to potentially achieve faster convergence and reduced latency compared to classical approaches. The core of the system relies on a discrete-time quantum walk on a graph representing the wireless network, where nodes are the walkers and edges represent communication links. The algorithm aims to minimize the walk length, effectively finding the shortest path between source and destination nodes. We present a theoretical framework and outline the key components of a quantum walk-based routing protocol. While this research focuses on the theoretical aspects and does not include experimental validation, it lays the foundation for future work exploring the practical feasibility and performance benefits of quantum walk routing in real-world wireless network scenarios.

Aug 31, 20260 citations

A UNIFIED BENCHMARKING FRAMEWORK FOR CLASSICAL AND QAOA-BASED MULTI-OBJECTIVE ROUTING IN COMMUNICATION NETWORKS

BALAMURUGAN N M KALAVATHI S

Multi-objective routing in communication networks requires simultaneous optimization of delay, congestion, and reliability—posing challenges for classical single-metric routing protocols. This paper presents a rigorous quantitative benchmarking framework comparing classical deterministic routing paradigms, namely Routing Information Protocol and Open Shortest Path First, against a quantum-assisted routing formulation based on the Quantum Approximate Optimization Algorithm (QAOA). The routing problem is encoded as a constrained Quadratic Unconstrained Binary Optimization (QUBO) model incorporating flow-conservation and path-continuity constraints. Random connected weighted graphs (10–20 nodes) were evaluated across 50 independent runs per topology size under a unified scalarized cost function (0.5D + 0.3C + 0.2L). Results demonstrate that deterministic link-state routing achieves optimal path selection with minimal computational complexity O(m log n), while QAOA attains near-optimal solutions (3–8% deviation) at significantly higher computational overhead due to qubit scaling and variational optimization loops. Scalability analysis reveals quadratic qubit growth with network size, limiting NISQ-era applicability. The study establishes a structured comparative benchmark and positions quantum routing as a complementary exploratory mechanism rather than a replacement for classical routing.

Journal of Theoretical and Applied Information TechnologyApr 15, 20260 citations

Development and challenges of quantum algorithms for routing optimization in networks

HAO Yuanchen, XIE Yuheng, TANG Jianjun

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.

Dec 1, 20250 citations

Multi-Objective Routing Optimization for 6G Communication Networks Using a Quantum Approximate Optimization Algorithm

Helen Urgelles, Pablo Picazo-Martínez, David García‐Roger +1 more

Sixth-generation wireless (6G) technology has been focused on in the wireless research community. Global coverage, massive spectrum usage, complex new applications, and strong security are among the new paradigms introduced by 6G. However, realizing such features may require computation capabilities transcending those of present (classical) computers. Large technology companies are already exploring quantum computers, which could be adopted as potential technological enablers for 6G. This is a promising avenue to explore because quantum computers exploit the properties of quantum states to perform certain computations significantly faster than classical computers. This paper focuses on routing optimization in wireless mesh networks using quantum computers, explicitly applying the quantum approximate optimization algorithm (QAOA). Single-objective and multi-objective examples are presented as robust candidates for the application of quantum machine learning. Moreover, a discussion about quantum supremacy estimation for this problem is provided.

SensorsOct 6, 202236 citations