Hybrid Classical–Quantum Optimization of Wireless Routing Using QAOA and Quantum Walks
Keywords:
decomposition, hybrid, frameworks, integrationAbstract
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.
Downloads
References
Farhi, E., Goldstone, J., and Gutmann, S. A Quantum Approximate Optimization Algorithm. arXiv preprint arXiv:1411.4028, 2014.
Cerezo, M., Arrasmith, A., Babbush, R., et al. Variational quantum algorithms. Nature Reviews Physics, 3:625–644, 2021.
Grover, L. K. A fast quantum mechanical algorithm for database search. Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pages 212–219, 1996.
Aharonov, D., Ambainis, A., Kempe, J., and Vazirani, U. Quantum walks on graphs. Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pages 50–59, 2001.
Preskill, J. Quantum Computing in the NISQ era and beyond. Quantum, 2:79, 2018.
Biamonte, J., Wittek, P., Pancotti, N., et al. Quantum machine learning. Nature, 549:195–202, 2017.
Alotaibi, E. and Mukherjee, B. A survey on routing algorithms for wireless ad-hoc and mesh networks. Computer Networks, 56(2):940–965, 2012.
Li, Y., Thai, M. T., and Wu, W. Wireless Sensor Networks and Applications. Springer, 2011.
Jiang, X., Yu, F. R., Song, M., and others. Toward 6G communications: visio, enabling technologies, and new paradigm shifts. IEEE Network, 2024.
Boukerche, A. Algorithms and Protocols for Wireless and Mobile Ad Hoc Networks. Wiley, 2011.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
All papers should be submitted electronically. All submitted manuscripts must be original work that is not under submission at another journal or under consideration for publication in another form, such as a monograph or chapter of a book. Authors of submitted papers are obligated not to submit their paper for publication elsewhere until an editorial decision is rendered on their submission. Further, authors of accepted papers are prohibited from publishing the results in other publications that appear before the paper is published in the Journal unless they receive approval for doing so from the Editor-In-Chief.
IJISAE open access articles are licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. This license lets the audience to give appropriate credit, provide a link to the license, and indicate if changes were made and if they remix, transform, or build upon the material, they must distribute contributions under the same license as the original.
