Warm Start of Variational Quantum Algorithms for Quadratic Unconstrained Binary Optimization Problems
Yahui Chai, Karl Jansen, Stefan Kühn, Tim Schwägerl, Tobias Stollenwerk
TL;DR
The paper tackles the trainability challenges of variational quantum algorithms for QUBO problems by introducing a warm-start strategy inspired by imaginary time evolution. It combines a structure-informed ansatz (SIA) with measurement-based (WS-M) and approximation-based (WS-A) parameter initialization to bias the initial state toward low-energy configurations, improving success rates and reducing iteration counts in CVaR-VQE. Through classical simulations on up to 24 qubits, the approach shows robustness to finite-shot errors and partial mitigation of barren plateaus, with WS-M delivering near-infinite-shot performance and WS-A offering a low-cost alternative for small-time evolutions. The work suggests that problem-structured initializations can substantially enhance near-term quantum optimization, and points to extensions to larger systems, hardware experiments, and broader quantum algorithms.
Abstract
Variational Quantum Eigensolver (VQE) is widely used in near-term hardware. However, their performances remain limited by the poor trainability and are dependent on random parameter initialization. In this work, we propose a warm start method inspired by imaginary time evolution, allowing for determining initial parameters that prioritize lower energy states in a resource-efficient way. Using classical simulations, we demonstrate that this warm start method significantly improves the success rate and reduces the number of iterations required for the convergence of VQE. The numerical results also indicate that the warm start approach effectively mitigates statistical errors arising from a finite number of measurements, and to a certain extent alleviates the effect of barren plateaus.
