The adaptive derivative-assembled problem-tailored variational quantum eigensolver (ADAPT-VQE) is one of the most widely used algorithms for electronic structure calculations in quantum computers. It adaptively selects operators based on their gradient, constructing ansätze that continuously evolve to match the energy landscape, helping avoid local traps and barren plateaus. However, this flexibility in reoptimization can lead to the inclusion of redundant or inefficient operators that have almost zero parameter value, barely contributing to the ansatz. We identify three phenomena responsible for the appearance of these operators: poor operator selection, operator reordering, and fading operators. In this work, we propose an automated, cost-free refinement method that removes unnecessary operators from the ansatz without disrupting convergence. Our approach evaluates each operator after ADAPT-VQE optimization by using a function that considers both its parameter value and position in the ansatz, striking a balance between eliminating low-coefficient operators while preserving the natural reduction of coefficients as the ansatz grows. Additionally, a dynamic threshold based on the parameters of recent operators enables efficient convergence. We apply this method to several molecular systems and find that it reduces ansatz size and accelerates convergence, particularly in cases with flat energy landscapes. The refinement process incurs, at most, a small additional computational cost and consistently improves or maintains ADAPT-VQE performance.
The adaptive derivative-assembled problem-tailored variational quantum eigensolver (ADAPT-VQE) is one of the most widely used algorithms for electronic structure calculations in quantum computers. It adaptively selects operators based on their gradient, constructing ansätze that continuously evolve to match the energy landscape, helping avoid local traps and barren plateaus. However, this flexibility in reoptimization can lead to the inclusion of redundant or inefficient operators that have almost zero parameter value, barely contributing to the ansatz. We identify three phenomena responsible for the appearance of these operators: poor operator selection, operator reordering, and fading operators. In this work, we propose an automated, cost-free refinement method that removes unnecessary operators from the ansatz without disrupting convergence. Our approach evaluates each operator after ADAPT-VQE optimization by using a function that considers both its parameter value and position in the ansatz, striking a balance between eliminating low-coefficient operators while preserving the natural reduction of coefficients as the ansatz grows. Additionally, a dynamic threshold based on the parameters of recent operators enables efficient convergence. We apply this method to several molecular systems and find that it reduces ansatz size and accelerates convergence, particularly in cases with flat energy landscapes. The refinement process incurs, at most, a small additional computational cost and consistently improves or maintains ADAPT-VQE performance.
Designing compact ansätze in Variational Quantum Eigensolver (VQE) is crucial for solving energetic problems of practical molecules on near-term quantum devices. However, existing Adaptive Derivative-Assembled Pseudo-Trotter (ADAPT) ansätze face two challenges: improper operator selection and accumulation of degraded operators. In this paper, we propose the Hamiltonian-Aware (HA) ADAPT-VQE algorithm to address these issues. First, we establish a novel excitation operator selection criterion. It breaks the local constraint of existing criteria by incorporating Hamiltonian information, prioritizes physically meaningful excitation operators, and incurs no extra classical or quantum computational overhead. Furthermore, we develop a problem-adaptive method for discriminating and pruning redundant excitation operators stemming from improper selection and inevitable degradation. This method balances redundant operator pruning and convergence guarantee, and is applicable to ansätze with arbitrary scales. Systematic numerical experiments on typical strongly correlated molecular systems demonstrate that our HA-ADAPT-VQE avoids energy plateaus and outperforms baseline algorithms in terms of energy error, ansatz size, and measurement cost. This work offers an efficient, robust ansatz construction paradigm, facilitating the development and practical deployment of large-scale VQE in quantum chemistry.
The adaptive derivative-assembled pseudo-trotter variational quantum eigensolver (ADAPT-VQE) is a promising hybrid quantum-classical algorithm for molecular ground state energy calculation, yet its practical scalability is hampered by redundant excitation operators and excessive measurement costs. To address these challenges, we propose Param-ADAPT-VQE, a novel improved algorithm that selects excitation operators based on a parameter-based criterion instead of the traditional gradient-based metric. This strategy effectively eludes redundant operators. We further develop a sub-Hamiltonian technique and integrate a hot-start VQE optimization strategy, achieving a significant reduction in measurement costs. Numerical experiments on typical molecular systems demonstrate that Param-ADAPT-VQE outperforms the original ADAPT-VQE in computational accuracy, ansatz size, and measurement costs. Furthermore, our scheme retains the fundamental framework of ADAPT-VQE and is thus fully compatible with its various modified versions, enabling further performance improvements in specific aspects. This work presents an efficient and scalable enhancement to ADAPT-VQE, mitigating the core obstacles that impede its practical implementation in the field of molecular quantum chemistry.
Adaptive derivative-assembled problem-tailored ansatz variational quantum eigensolver (ADAPT-VQE) stands out as a robust algorithm for constructing compact ansätze for molecular simulation. It enables to significantly reduce the circuit depth with respect to other methods, such as unitary coupled cluster singles and doubles, while achieving higher accuracy and not suffering from so-called barren plateaus that hinder the variational optimization of many hardware-efficient ansätze. In its standard implementation, however, it introduces a considerable measurement overhead in the form of gradient evaluations through estimations of many commutator operators. In this work, we mitigate this measurement overhead by exploiting a recently introduced method for energy evaluation relying on adaptive informationally complete generalized measurements (AIMs). Besides offering an efficient way to measure the energy itself, informationally complete (IC) measurement data can be reused to estimate all the commutators of the operators in the operator pool of ADAPT-VQE, using only classically efficient postprocessing. The framework is generic for any IC positive operator-valued measures (POVMs) implementation, and in this work, we demonstrate it’s effectiveness with dilation POVMs. We present the AIM-ADAPT-VQE scheme in detail, and investigate its performance with H 4 , N 2 , and 1,3,5,7-octatetraene Hamiltonians and several operator pools. Our numerical simulations indicate that the measurement data obtained to evaluate the energy can be reused to implement ADAPT-VQE with no additional measurement overhead for the systems considered here. In addition, we show that, if the energy is measured within chemical precision, the count in the resulting circuits is close to the ideal one. With scarce measurement data, AIM-ADAPT-VQE still converges to the ground state with high probability, albeit with an increased circuit depth in some cases.
Adaptive Derivative-Assembled Problem-Tailored variational quantum eigensolvers (ADAPT-VQE) represent one of the most promising approaches for quantum chemistry on near-term quantum devices. However, their optimization is slow and may stall due to vanishing parameters and redundant operators in the ansatz. In this work, we propose a simple strategy of operator elimination that removes non-contributing operators from the pool once they are detected, enabling the optimization to continue progressing toward convergence. We examine two variants, with and without pool restoration after elimination, and find that the former converges more smoothly and faster than the latter and the standard ADAPT-VQE. To capture dynamical correlations between the active space and its environment, we combine ADAPT-VQE with our recently developed downfolding approach, the one-body downfolding framework (OBDF). In OBDF, the bare molecular Hamiltonian in the active space is replaced by a correlated effective Hamiltonian that incorporates dynamical correlation effects outside the active space. We benchmark our implementation on a linear \ce{H_6} chain, an \ce{H_6} lattice, an \ce{H_6} ring, and the \ce{N_2} molecule using the OpenFermion simulator. Our results show that operator elimination significantly reduces circuit depth and iteration count, and that OBDF-ADAPT-VQE yields energies closer to the full configuration interaction (FCI) reference than the standard approach within the same active space.
Abstract Variational quantum eigensolvers (VQEs) represent a powerful class of hybrid quantum-classical algorithms for computing molecular energies. Various numerical issues exist for these methods, however, including barren plateaus and large numbers of local minima. In this work, we consider the Adaptive, Problem-Tailored Variational Quantum Eiegensolver (ADAPT-VQE) ansätze, and examine how they are impacted by these local minima. We find that while ADAPT-VQE does not remove local minima, the gradient-informed, one-operator-at-a-time circuit construction accomplishes two things: First, it provides an initialization strategy that can yield solutions with over an order of magnitude smaller error compared to random initialization, and which is applicable in situations where chemical intuition cannot help with initialization, i.e., when Hartree-Fock is a poor approximation to the ground state. Second, even if an ADAPT-VQE iteration converges to a local trap at one step, it can still “burrow” toward the exact solution by adding more operators, which preferentially deepens the occupied trap. This same mechanism helps highlight a surprising feature of ADAPT-VQE: It should not suffer optimization problems due to barren plateaus and random initialization. Even if such barren plateaus appear in the parameter landscape, our analysis suggests that ADAPT-VQE avoids such regions by design.
Adaptive ansatz construction has emerged as a powerful technique for reducing circuit depth and improving optimization efficiency in variational quantum eigensolvers. However, existing adaptive methods, including ADAPT-VQE, rely solely on first-order gradients and therefore ignore the underlying geometry of the quantum state space, limiting both convergence behavior and operator-selection efficiency. We introduce Geo-ADAPT-VQE, a geometry-aware adaptive VQE algorithm that selects operators from a pool using the natural gradient rule. The geometric operator-selection rule enables the ansatz to grow along directions aligned with the underlying quantum-state geometry, thereby improving convergence and reducing the algorithm's susceptibility to shallow local minima and saddle-point regions. We further provide an asymptotic convergence result. We present numerical simulations involving five molecules, which demonstrate that Geo-ADAPT-VQE achieves faster and more stable convergence compared to existing methods, while producing significantly shorter ansatz. In particular, Geo-ADAPT achieves up to 100-fold reduction in energy error compared to existing methods.