Table of Contents
Fetching ...

CVaR-Based Variational Quantum Optimization for User Association in Handoff-Aware Vehicular Networks

Zijiang Yan, Hao Zhou, Jianhua Pei, Aryan Kaushik, Hina Tabassum, Ping Wang

TL;DR

This work addresses assignment of vehicular network users to base stations (GAP) under handoff dynamics by formulating the problem as a QUBO and solving it with a CVaR-augmented variational quantum eigensolver. The authors implement a hybrid quantum-classical framework where a parameterized quantum circuit encodes binary association variables and a CVaR objective concentrates optimization on the lowest-energy tail to improve convergence on NISQ devices. They demonstrate a 23.5% improvement in average data rate over a deep neural network benchmark and analyze robustness across qubit counts, base-station counts, and circuit depths. The results suggest CVaR-VQE provides a practical, noise-tolerant path to near-optimal user association in dynamic vehicular networks, with clear directions for extending to more complex scenarios.

Abstract

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.

CVaR-Based Variational Quantum Optimization for User Association in Handoff-Aware Vehicular Networks

TL;DR

This work addresses assignment of vehicular network users to base stations (GAP) under handoff dynamics by formulating the problem as a QUBO and solving it with a CVaR-augmented variational quantum eigensolver. The authors implement a hybrid quantum-classical framework where a parameterized quantum circuit encodes binary association variables and a CVaR objective concentrates optimization on the lowest-energy tail to improve convergence on NISQ devices. They demonstrate a 23.5% improvement in average data rate over a deep neural network benchmark and analyze robustness across qubit counts, base-station counts, and circuit depths. The results suggest CVaR-VQE provides a practical, noise-tolerant path to near-optimal user association in dynamic vehicular networks, with clear directions for extending to more complex scenarios.

Abstract

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.
Paper Structure (16 sections, 18 equations, 4 figures)