Energy Landscape Plummeting in Variational Quantum Eigensolver: Subspace Optimization, Non-iterative Corrections and Generator-informed Initialization for Improved Quantum Efficiency
Chayan Patra, Rahul Maitra
TL;DR
This paper tackles the resource-related bottlenecks of variational quantum eigenproblem solvers (VQE) on NISQ devices by introducing AD(X)-ASC, a framework that decouples the variational parameter space into a low-dimensional principal subspace and a high-dimensional auxiliary subspace via a temporal hierarchy and an adiabatic approximation. It reconstructs the effects of auxiliary parameters through a principal-to-auxiliary mapping and incorporates them as one-step posteriori auxiliary subspace corrections (ASC) in the cost function, avoiding extra quantum hardware or iterative optimization. The authors demonstrate two practical implementations for selecting the principal subspace: ADAPT-VQE and MP2-based MP2S-VQE, showing up to 1–2 orders of magnitude improvements in energy minima on PES for molecular systems, both in noiseless and noisy simulations. Additionally, they introduce a generator-informed initialization to accelerate convergence, further reducing quantum-measurement costs. Overall, AD(X)-ASC constitutes a general, resource-efficient strategy to mitigate local traps and barren plateaus in VQE, with significant practical implications for scalable quantum chemistry on near-term devices.
Abstract
Variational Quantum Eigensolver (VQE) faces significant challenges due to hardware noise and the presence of barren plateaus and local traps in the optimization landscape. To mitigate the detrimental effects of these issues, we introduce a general formalism that optimizes hardware resource utilization and accuracy by projecting VQE optimizations on to a reduced-dimensional subspace, followed by a set of posteriori corrections. Our method partitions the ansatz into a lower dimensional principal subspace and a higher-dimensional auxiliary subspace based on a conjecture of temporal hierarchy present among the parameters during optimization. The adiabatic approximation exploits this hierarchy, restricting optimization to the lower dimensional principal subspace only. This is followed by an efficient higher dimensional auxiliary space reconstruction without the need to perform variational optimization. These reconstructed auxiliary parameters are subsequently included in the cost-function via a set of auxiliary subspace corrections (ASC) leading to a "plummeting effect" in the energy landscape toward a more optimal minima without utilizing any additional quantum hardware resources. Numerical simulations show that, when integrated with any chemistry-inspired ansatz, our method can provide one to two orders of magnitude better estimation of the minima. Additionally, based on the adiabatic approximation, we introduce a novel initialization strategy driven by unitary rotation generators for accelerated convergence of gradient-informed dynamic quantum algorithms. Our method shows heuristic evidences of alleviating the effects of local traps, facilitating convergence toward a more optimal minimum.
