Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2212.09719 · Physical Review Research

Mitigating the measurement overhead of ADAPT-VQE with optimized informationally complete generalized measurements

Anton Nykänen, Matteo A. C. Rossi, Elsi-Mari Borrelli, Sabrina Maniscalco, Guillermo García-Pérez, Adam Glos

Published Sep 16, 2025• 8 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/t1hr-y7c8

Related papers

How to really measure operator gradients in ADAPT-VQE

Panagiotis G. Anastasiou, Nicholas J. Mayhall, Edwin Barnes +1 more

ADAPT-VQE is a leading variational quantum algorithm as it circumvents the choice-of-ansatz conundrum by iteratively growing compact and arbitrarily accurate problem-tailored ansätze. However, for molecular Hamiltonians and hardware-efficient operator pools, the gradient-measurement step of the algorithm requires the estimation of $\mathcal{O}(N^8)$ observables, which may represent a bottleneck for relevant system sizes on real devices. We present an efficient strategy for measuring the gradients of the three best-performing hardware-efficient operator pools by partitioning the required observables into $\mathcal{O}(N^3)$-sized sets of commuting Paulis that can be simultaneously measured with an at most $N-3$ CNOT overhead. We argue that our approach is robust to shot-noise effects and show that measuring the pool gradients is, in fact, not $\mathcal{O}(N^4)$, but only about $4N$ times as expensive as measuring the energy once. Our proposed measurement strategy significantly ameliorates the measurement overhead of ADAPT-VQE and brings us one step closer to practical implementations on real devices.

arXiv:2306.03227•Jun 5, 2023•7 citations

Pruned-ADAPT-VQE: Compacting Molecular Ansätze by Removing Irrelevant Operators

Nonia Vaquero-Sabater, Abel Carreras, David Casanova

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.

Journal of Chemical Theory and Computation•Sep 6, 2025•9 citations

Pruned-ADAPT-VQE: compacting molecular ansätze by removing irrelevant operators

Nonia Vaquero-Sabater, Abel Carreras, Casanova, David

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.

arXiv:2504.04652•Apr 7, 2025•0 citations

Learning to Measure: Adaptive Informationally Complete Generalized Measurements for Quantum Algorithms

Guillermo García-Pérez, Matteo A. C. Rossi, Boris Sokolov +5 more

Many prominent quantum computing algorithms with applications in fields such as chemistry and materials science require a large number of measurements, which represents an important roadblock for future real-world use cases.We introduce a novel approach to tackle this problem through an adaptive measurement scheme.We present an algorithm that optimizes informationally complete positive operator-valued measurements (POVMs) on the fly in order to minimize the statistical fluctuations in the estimation of relevant cost functions.We show its advantage by improving the efficiency of the variational quantum eigensolver in calculating ground-state energies of molecular Hamiltonians with extensive numerical simulations.Our results indicate that the proposed method is competitive with state-of-the-art measurement-reduction approaches in terms of efficiency.In addition, the informational completeness of the approach offers a crucial advantage, as the measurement data can be reused to infer other quantities of interest.We demonstrate the feasibility of this prospect by reusing ground-state energy-estimation data to perform high-fidelity reduced state tomography.

arXiv:2104.00569•PRX Quantum•Nov 29, 2021•94 citations

Avoiding symmetry roadblocks and minimizing the measurement overhead of adaptive variational quantum eigensolvers

V. O. Shkolnikov, Nicholas J. Mayhall, Sophia E. Economou +1 more

Quantum simulation of strongly correlated systems is potentially the most feasible useful application of near-term quantum computers. Minimizing quantum computational resources is crucial to achieving this goal. A promising class of algorithms for this purpose consists of variational quantum eigensolvers (VQEs). Among these, problem-tailored versions such as ADAPT-VQE that build variational ansätze step by step from a predefined operator pool perform particularly well in terms of circuit depths and variational parameter counts. However, this improved performance comes at the expense of an additional measurement overhead compared to standard VQEs. Here, we show that this overhead can be reduced to an amount that grows only linearly with the number n of qubits, instead of quartically as in the original ADAPT-VQE. We do this by proving that operator pools of size 2n−2 can represent any state in Hilbert space if chosen appropriately. We prove that this is the minimal size of such "complete" pools, discuss their algebraic properties, and present necessary and sufficient conditions for their completeness that allow us to find such pools efficiently. We further show that, if the simulated problem possesses symmetries, then complete pools can fail to yield convergent results, unless the pool is chosen to obey certain symmetry rules. We demonstrate the performance of such symmetry-adapted complete pools by using them in classical simulations of ADAPT-VQE for several strongly correlated molecules. Our findings are relevant for any VQE that uses an ansatz based on Pauli strings.

arXiv:2109.05340•Quantum•Jun 12, 2023•35 citations

Constructing Compact ADAPT Unitary Coupled-Cluster Ansatz with Parameter-Based Criterion

Runhong He, Xin Hong, Qiaozhen Chai +5 more

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.

quant-pharXiv:2602.04253•Feb 5, 2026•0 citations
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.
ADAPT-VQE is a leading variational quantum algorithm as it circumvents the choice-of-ansatz conundrum by iteratively growing compact and arbitrarily accurate problem-tailored ansätze. However, for molecular Hamiltonians and hardware-efficient operator pools, the gradient-measurement step of the algorithm requires the estimation of O(N8)\mathcal{O}(N^8)O(N8) observables, which may represent a bottleneck for relevant system sizes on real devices. We present an efficient strategy for measuring the gradients of the three best-performing hardware-efficient operator pools by partitioning the required observables into O(N3)\mathcal{O}(N^3)O(N3)-sized sets of commuting Paulis that can be simultaneously measured with an at most N−3N-3N−3 CNOT overhead. We argue that our approach is robust to shot-noise effects and show that measuring the pool gradients is, in fact, not O(N4)\mathcal{O}(N^4)O(N4), but only about 4N4N4N times as expensive as measuring the energy once. Our proposed measurement strategy significantly ameliorates the measurement overhead of ADAPT-VQE and brings us one step closer to practical implementations on real devices.
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.
Many prominent quantum computing algorithms with applications in fields such as chemistry and materials science require a large number of measurements, which represents an important roadblock for future real-world use cases.We introduce a novel approach to tackle this problem through an adaptive measurement scheme.We present an algorithm that optimizes informationally complete positive operator-valued measurements (POVMs) on the fly in order to minimize the statistical fluctuations in the estimation of relevant cost functions.We show its advantage by improving the efficiency of the variational quantum eigensolver in calculating ground-state energies of molecular Hamiltonians with extensive numerical simulations.Our results indicate that the proposed method is competitive with state-of-the-art measurement-reduction approaches in terms of efficiency.In addition, the informational completeness of the approach offers a crucial advantage, as the measurement data can be reused to infer other quantities of interest.We demonstrate the feasibility of this prospect by reusing ground-state energy-estimation data to perform high-fidelity reduced state tomography.
Quantum simulation of strongly correlated systems is potentially the most feasible useful application of near-term quantum computers. Minimizing quantum computational resources is crucial to achieving this goal. A promising class of algorithms for this purpose consists of variational quantum eigensolvers (VQEs). Among these, problem-tailored versions such as ADAPT-VQE that build variational ansätze step by step from a predefined operator pool perform particularly well in terms of circuit depths and variational parameter counts. However, this improved performance comes at the expense of an additional measurement overhead compared to standard VQEs. Here, we show that this overhead can be reduced to an amount that grows only linearly with the number n of qubits, instead of quartically as in the original ADAPT-VQE. We do this by proving that operator pools of size 2n−2 can represent any state in Hilbert space if chosen appropriately. We prove that this is the minimal size of such "complete" pools, discuss their algebraic properties, and present necessary and sufficient conditions for their completeness that allow us to find such pools efficiently. We further show that, if the simulated problem possesses symmetries, then complete pools can fail to yield convergent results, unless the pool is chosen to obey certain symmetry rules. We demonstrate the performance of such symmetry-adapted complete pools by using them in classical simulations of ADAPT-VQE for several strongly correlated molecules. Our findings are relevant for any VQE that uses an ansatz based on Pauli strings.
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.