CVaR-Based Variational Quantum Optimization for User Association in Handoff-Aware Vehicular Networks
Efficient resource allocation is essential for optimizing various tasks in wireless networks, which are usually formulated as generalized assignment problems (GAP). GAP, as a generalized version of the linear sum assignment problem, involves both equality and inequality constraints that add computational challenges. In this work, we present a novel Conditional Value at Risk (CVaR)-based Variational Quantum Eigensolver (VQE) framework to address GAP in vehicular networks (VNets). Our approach leverages a hybrid quantum-classical structure, integrating a tailored cost function that balances both objective and constraint-specific penalties to improve solution quality and stability. Using the CVaR-VQE model, we handle the GAP efficiently by focusing optimization on the lower tail of the solution space, enhancing both convergence and resilience on noisy intermediate-scale quantum (NISQ) devices. We apply this framework to a user-association problem in VNets, where our method achieves 23.5% improvement compared to the deep neural network (DNN) approach.
Authors
- Hao Zhou (ORCID: https://orcid.org/0000-0001-9779-7703)
- Hina Tabassum (ORCID: https://orcid.org/0000-0002-1201-478X)
- Aryan Kaushik (ORCID: https://orcid.org/0000-0001-6252-4641)
- Jianhua Pei (ORCID: https://orcid.org/0000-0002-4066-9230)
- Zijiang Yan (ORCID: https://orcid.org/0000-0002-7959-8329)
- Ping Wang (ORCID: https://orcid.org/0000-0002-8854-2079)
Institutions
- Manchester Metropolitan University (GB)
- York University (CA)
- McGill University (CA)
Publication Details
- Published
- 2025-06-08
- DOI
- https://doi.org/10.1109/icc52391.2025.11161596
- Primary Topic
- Advanced Queuing Theory Analysis
- Type
- article
- Field-Weighted Citation Impact
- 0.00