Improving Feasibility in Quantum Approximate Optimization Algorithm for Vehicle Routing via Constraint-Aware Initialization and Hybrid XY-X Mixing
Yuan-Zheng Lei, Yaobang Gong, Xianfeng Terry Yang, Nii Attoh-Okine

TL;DR
This paper enhances the Quantum Approximate Optimization Algorithm for vehicle routing by introducing a constraint-aware initialization and a hybrid XY-X mixer, leading to more feasible solutions across simulation and noisy hardware regimes.
Contribution
It proposes a novel framework combining constraint-aware initialization and a hybrid XY-X mixer to improve QAOA's feasibility for vehicle routing problems.
Findings
Consistently lower average energy in all regimes.
Higher feasible-solution ratios compared to standard QAOA.
Performance gap narrows under noisy conditions.
Abstract
The Quantum Approximate Optimization Algorithm (QAOA) is a leading framework for quantum combinatorial optimization. The Vehicle Routing Problem (VRP), a core problem in logistics and transportation, is a natural application target, but it poses a major feasibility challenge for standard QAOA because feasible solutions occupy only a tiny fraction of the search space, and the conventional Pauli- mixer can disrupt partial solution structures that satisfy key local constraints. To address this issue, we propose a constraint-aware QAOA framework with two complementary components. First, we design a lightweight initialization strategy that encodes a selected subset of simple yet informative local one-hot constraints into the initial state, thereby reducing the initial superposition space and increasing the probability mass on states with important local structure. Second, we introduce a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
