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.
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.
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.
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.
Designing compact and accurate circuits for the variational quantum eigensolver (VQE) is a central challenge in near-term quantum chemistry. Existing adaptive methods such as ADAPT-VQE design circuits by iteratively selecting operators from a predefined pool guided by gradient information and greedy heuristics. In this work, we adopt differentiable quantum architecture search (DQAS) as a circuit design framework based on the UCCSD operator pool, and introduce two complementary strategies: a global mode that simultaneously optimizes all operator selections, and a layerwise mode that constructs circuits incrementally while preserving previously learned structure. By relaxing discrete operator selection into a continuous differentiable optimization, DQAS enables gradient-based exploration over the combinatorial space of UCC circuit architectures. Benchmarks on BeH2, H4, LiH, H6, and H2O (8-14 qubits) show that both strategies achieve higher accuracy and fewer CNOT gates than ADAPT-VQE in the compact circuit regime, with up to 2.7-fold accuracy improvement for H2O and CNOT reductions of 13-17% at equivalent circuit depths. Benchmarks on the qubit-excitation-based (QEB) operator pool confirm that both advantages generalize beyond UCCSD. These results demonstrate that differentiable architecture search provides an effective and generalizable framework for designing accurate and compact VQE circuits in near-term quantum chemistry.
By design, the variational quantum eigensolver (VQE) strives to recover the lowest-energy eigenvalue of a given Hamiltonian by preparing quantum states guided by the variational principle. In practice, the prepared quantum state is indirectly assessed by the value of the associated energy. Novel adaptive derivative-assembled pseudo-trotter (ADAPT) ansatz approaches and recent formal advances now establish a clear connection between the theory of quantum chemistry and the quantum state ansatz used to solve the electronic structure problem. Here we benchmark the accuracy of VQE and ADAPT-VQE to calculate the electronic ground states and potential energy curves for a few selected diatomic molecules, namely H2, NaH, and KH. Using numerical simulation, we find both methods provide good estimates of the energy and ground state, but only ADAPT-VQE proves to be robust to particularities in optimization methods. Another relevant finding is that gradient-based optimization is overall more economical and delivers superior performance than analogous simulations carried out with gradient-free optimizers. The results also identify small errors in the prepared state fidelity which show an increasing trend with molecular size.