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:2611.14986

From optimization to construction: Expanding quantum measurement designs

Taotao Zhao, Qianjun Yao, Mengdi Sun, He Li

Published Nov 11, 2026• 0 citations
arXivHTMLPDF

Abstract

Estimating molecular energies on quantum computers requires repeated measurements of many Pauli terms, making sampling a major resource cost. Measurement design chooses which compatible terms are measured together and allocates a finite shot budget among bases to minimize the variance of an energy estimator. We introduce variance-guided measurement group construction (VGMC), which reduces variance beyond optimization on existing measurement bases by changing which Hamiltonian terms share measurement shots. After including every Hamiltonian term measurable in each existing basis, we jointly optimize estimator coefficients and shot allocations to separate inefficient use of these measurements from limitations of their measurement combinations. We compare a candidate's benefit with the cost of withdrawing shots from existing bases, and use the resulting scores to guide greedy construction of qubit-wise commuting groups followed by joint re-optimization. With exact covariances, VGMC outperformed the state-of-the-art measurement design methods across the molecular benchmarks where it introduced additional measurement bases, achieving variance reductions of 18.19%-23.38%. The gains persisted with approximate covariances, and simulations with finite shots indicated lower estimated shot requirements near chemical accuracy. These results show that optimizing how measurements are combined can also guide which terms are measured together, offering a route to reducing the sampling overhead of variational quantum simulation while retaining local measurements on current and near-term devices.

DOI
10.48550/arxiv.2611.14986

Related papers

Binary Optimization of Measurement Groupings for Quantum Energy Estimation

Isaac L. Huidobro-Meezs, Rodrigo A. Vargas-Hernández

Repeated measurements can dominate the resources required for quantum energy estimation, making the choice of which Pauli observables to measure together a central optimization problem for variational quantum algorithms. We formulate fully commuting measurement grouping as a classical binary optimization problem based on clique selection and construct non-overlapping groups using mixed-integer linear programming (MILP). For a benchmark of molecular Hamiltonians, groupings optimized with approximate covariances reduce the non-overlapping measurement requirement $\varepsilon^2M$ by $51.8\%$ on average relative to sorted insertion (SI). Using the MILP groups to initialize iterative coefficient splitting (ICS), denoted MILP-ICS, yields an average $24.3\%$ reduction relative to ICS initialized from SI (SI-ICS). The optimized groups also transfer across nearby molecular geometries while preserving substantial measurement savings. We further introduce O-clique, which directly optimizes overlapping commuting supports through candidate-clique selection and coefficient profiles. Although O-clique provides only modest additional reductions beyond MILP-ICS, it reduces the measurement requirement by $27.3\%$ on average relative to SI-ICS with 100 iterations, despite using only five final coefficient refinement iterations, indicating improved support quality. Finally, we extend the comparison to Fermi--Hubbard, Kitaev--Heisenberg--$Γ$, and XYZ lattice Hamiltonians, where MILP-based groupings substantially outperform the corresponding SI-based strategies. Together, these results show that variance-informed optimization of measurement-group structure can substantially reduce sampling costs across molecular and lattice Hamiltonians, with optimized non-overlapping groups providing strong, transferable initializations and direct overlapping optimization offering further gains.

quant-pharXiv:2610.10339•Oct 8, 2026•0 citations

Reducing quantum measurements in qubit-based overlapping grouping methods for quantum energy estimation through better initializations

Isaac L. Huidobro-Meezs, Rodrigo A. Vargas-Hernández

The measurement cost for estimating expectation values of Hamiltonians is a central bottleneck in variational quantum algorithms. Grouping strategies significantly reduce this cost, with overlapping techniques being the state of the art in the field. Overlapping grouping methods require i) a non-overlapping grouping of the Hamiltonian, typically obtained from the Sorted Insertion (SI) algorithm as initialization, and ii) the construction of covariance dictionaries from approximate wavefunctions to guide the optimization. It was recently shown that different initializations can potentially reduce measurement costs for overlapping methods. Motivated by these findings, we introduce variance-aware SI (VarSI), a family of covariance-informed non-overlapping Pauli grouping heuristics to reduce measurement counts. VarSI grouping leverages the covariance dictionaries, already required by overlapping methods, to construct better non-overlapping groups. We propose three variants: a global greedy grouping insertion rule, a variance-informed SI analog, and a local refinement step initialized from SI or our variance-informed variant. We showcase the use of groupings generated by our VarSI heuristic algorithms to initialize overlapping methods using the iterative coefficient-splitting (ICS) algorithm. Molecular benchmarks with 130 Hamiltonians demonstrate consistent, non-overlapping measurement improvements over SI of 38\% and enhanced downstream ICS results when initialized from VarSI groups. We find that the initializations considered here achieve up to 70\% measurement reductions for ICS, compared to the standard SI initialization with mean reductions of 9--15.3\% depending on qubit mappings and covariance dictionaries used. These results show that non-overlapping grouping remains a consequential design step even when the final estimator uses overlapping fragments.

quant-pharXiv:2607.02794•Jul 6, 2026•2 citations

Measurement cost reduction in ADAPT-VQE via variance-based shot allocation and Pauli-measurement reuse

Azhar Ikhtiarudin, Gagus Ketut Sunnardianto, Fadjar Fathurrahman +2 more

Abstract The adaptive variational quantum eigensolver (ADAPT-VQE) is a promising approach for quantum simulation in the noisy intermediate-scale quantum era, offering advantages over traditional VQE methods by reducing circuit depth and mitigating challenges in classical optimisation. Although ADAPT-VQE can require fewer total measurements than fixed ansätze for matched precision, the combined cost of repeated energy and gradient evaluations still leads to a substantial measurement overhead in practice, motivating strategies to reduce it further. In this work, we study two complementary strategies to reduce this cost using only standard projective Pauli measurements. First, we apply variance-based shot allocation (variance-minimised shot assignment and variance-preserved shot reduction (VPSR)) to both Hamiltonian energy and operator-gradient measurements, extending techniques previously studied only for energy estimation in standard VQE. VPSR achieves shot reductions of up to 43% for H 2 and 51% for LiH relative to uniform allocation while maintaining chemical accuracy. Second, we introduce a Pauli-measurement reuse protocol that stores outcomes from VQE optimisation and reuses them for gradient evaluation in the next ADAPT iteration. Across six molecular benchmarks (4–14 qubits), measurement reuse yields only marginal savings confined to the smallest systems and is effectively negligible for larger sizes, pivot-based grouping alone provides the dominant reduction and should be considered the practical baseline. These results characterise the interplay between shot allocation, measurement grouping, and cross-iteration reuse, offering practical guidance on when each strategy is most beneficial.

arXiv:2507.16879•Physica Scripta•Jun 5, 2026•10 citations

Overlapped groupings for quantum energy estimation: Maximal variance reduction and deterministic algorithms for reducing variance

Jeremiah Rowland, Rahul Sarkar, Nicolas PD Sawaya +2 more

Grouping-based measurement strategies are widely used to reduce measurement complexity in near-term quantum algorithms. While these schemes have typically produced disjoint groups, recently this has been relaxed in what is known as overlapped grouping or coefficient splitting where operators may appear in more than one compatible group. In recent work, it has been numerically shown that this strategy can reduce the variance of energy estimates on small benchmark problems, motivating both the application and further analysis of the method. Here we prove that overlapped grouping for energy estimation can lead to a maximal variance reduction that is linear in the number of Hamiltonian terms. We introduce a new algorithm which we call repacking to transform existing groups into overlapped groups, and we show this repacking procedure iteratively reduces variance under mild assumptions. We also perform numerical simulations with Hamiltonians up to $44$ qubits and $575 \cdot 10^{3}$ terms, assessing overlapped grouping at scale on problems of practical importance. Our numerics show that the variance reduction relative to state-of-the-art (disjoint) grouping increases linearly with the problem size, suggesting that overlapped grouping methods can be a powerful strategy for quantum energy estimation at the scale of Megaquop computers and beyond.

quant-pharXiv:2604.07156•Apr 9, 2026•3 citations

Optimizing Shot Assignment in Variational Quantum Eigensolver Measurement

Linghua Zhu, Senwei Liang, Chao Yang +1 more

Variational quantum eigensolvers (VQEs) show promise for tackling complex quantum chemistry challenges and realizing quantum advantages. However, in VQE, the measurement step encounters difficulties due to errors in objective function evaluation, e.g., the energy of a quantum state. While increasing the number of measurement shots can mitigate measurement errors, this approach leads to higher costs. Strategies for shot assignment have been investigated, allowing for the allocation of varying shot numbers to different Hamiltonian terms and reducing measurement variance through term-specific insights. In this paper, we introduce a dynamic approach, the Variance-Preserved Shot Reduction (VPSR) method. This technique strives to minimize the total number of measurement shots while preserving the variance of measurements throughout the VQE process. Our numerical experiments on H 2 and LiH molecular ground states demonstrate the effectiveness of VPSR in achieving VQE convergence with a notably lower shot count.

arXiv:2307.06504•Journal of Chemical Theory and Computation•Mar 14, 2024•28 citations

Observable-targeted variational quantum simulation of Hamiltonian dynamics

Leonardo Zambrano, Luciano Pereira, Antonio Acín

Standard variational quantum simulation seeks to reproduce the evolution of the full quantum state, although many applications require only the expectation values of a few observables. We study a variational method for pure-state Hamiltonian dynamics that updates circuit parameters to reproduce the evolution of selected expectation values. An exact error identity guides the choice of observables, motivating a construction based on repeated commutators of the target with the Hamiltonian. For Pauli observables and Pauli-rotation circuits, the update can be estimated without ancillary qubits or controlled operations for overlap estimation. Across six- and ten-qubit spin, fermionic, and molecular benchmarks, the observable-targeted update extends the median time within the target-error tolerance compared with standard variational quantum simulation with equal shot budgets. These results show that directing the variational update toward the target observable can extend accurate simulation without increasing the measurement cost per time step.

quant-pharXiv:2609.24794•Sep 22, 2026•0 citations
Estimating molecular energies on quantum computers requires repeated measurements of many Pauli terms, making sampling a major resource cost. Measurement design chooses which compatible terms are measured together and allocates a finite shot budget among bases to minimize the variance of an energy estimator. We introduce variance-guided measurement group construction (VGMC), which reduces variance beyond optimization on existing measurement bases by changing which Hamiltonian terms share measurement shots. After including every Hamiltonian term measurable in each existing basis, we jointly optimize estimator coefficients and shot allocations to separate inefficient use of these measurements from limitations of their measurement combinations. We compare a candidate's benefit with the cost of withdrawing shots from existing bases, and use the resulting scores to guide greedy construction of qubit-wise commuting groups followed by joint re-optimization. With exact covariances, VGMC outperformed the state-of-the-art measurement design methods across the molecular benchmarks where it introduced additional measurement bases, achieving variance reductions of 18.19%-23.38%. The gains persisted with approximate covariances, and simulations with finite shots indicated lower estimated shot requirements near chemical accuracy. These results show that optimizing how measurements are combined can also guide which terms are measured together, offering a route to reducing the sampling overhead of variational quantum simulation while retaining local measurements on current and near-term devices.
Repeated measurements can dominate the resources required for quantum energy estimation, making the choice of which Pauli observables to measure together a central optimization problem for variational quantum algorithms. We formulate fully commuting measurement grouping as a classical binary optimization problem based on clique selection and construct non-overlapping groups using mixed-integer linear programming (MILP). For a benchmark of molecular Hamiltonians, groupings optimized with approximate covariances reduce the non-overlapping measurement requirement ε2M\varepsilon^2Mε2M by 51.8%51.8\%51.8% on average relative to sorted insertion (SI). Using the MILP groups to initialize iterative coefficient splitting (ICS), denoted MILP-ICS, yields an average 24.3%24.3\%24.3% reduction relative to ICS initialized from SI (SI-ICS). The optimized groups also transfer across nearby molecular geometries while preserving substantial measurement savings. We further introduce O-clique, which directly optimizes overlapping commuting supports through candidate-clique selection and coefficient profiles. Although O-clique provides only modest additional reductions beyond MILP-ICS, it reduces the measurement requirement by 27.3%27.3\%27.3% on average relative to SI-ICS with 100 iterations, despite using only five final coefficient refinement iterations, indicating improved support quality. Finally, we extend the comparison to Fermi--Hubbard, Kitaev--Heisenberg--ΓΓΓ, and XYZ lattice Hamiltonians, where MILP-based groupings substantially outperform the corresponding SI-based strategies. Together, these results show that variance-informed optimization of measurement-group structure can substantially reduce sampling costs across molecular and lattice Hamiltonians, with optimized non-overlapping groups providing strong, transferable initializations and direct overlapping optimization offering further gains.
The measurement cost for estimating expectation values of Hamiltonians is a central bottleneck in variational quantum algorithms. Grouping strategies significantly reduce this cost, with overlapping techniques being the state of the art in the field. Overlapping grouping methods require i) a non-overlapping grouping of the Hamiltonian, typically obtained from the Sorted Insertion (SI) algorithm as initialization, and ii) the construction of covariance dictionaries from approximate wavefunctions to guide the optimization. It was recently shown that different initializations can potentially reduce measurement costs for overlapping methods. Motivated by these findings, we introduce variance-aware SI (VarSI), a family of covariance-informed non-overlapping Pauli grouping heuristics to reduce measurement counts. VarSI grouping leverages the covariance dictionaries, already required by overlapping methods, to construct better non-overlapping groups. We propose three variants: a global greedy grouping insertion rule, a variance-informed SI analog, and a local refinement step initialized from SI or our variance-informed variant. We showcase the use of groupings generated by our VarSI heuristic algorithms to initialize overlapping methods using the iterative coefficient-splitting (ICS) algorithm. Molecular benchmarks with 130 Hamiltonians demonstrate consistent, non-overlapping measurement improvements over SI of 38\% and enhanced downstream ICS results when initialized from VarSI groups. We find that the initializations considered here achieve up to 70\% measurement reductions for ICS, compared to the standard SI initialization with mean reductions of 9--15.3\% depending on qubit mappings and covariance dictionaries used. These results show that non-overlapping grouping remains a consequential design step even when the final estimator uses overlapping fragments.
Abstract The adaptive variational quantum eigensolver (ADAPT-VQE) is a promising approach for quantum simulation in the noisy intermediate-scale quantum era, offering advantages over traditional VQE methods by reducing circuit depth and mitigating challenges in classical optimisation. Although ADAPT-VQE can require fewer total measurements than fixed ansätze for matched precision, the combined cost of repeated energy and gradient evaluations still leads to a substantial measurement overhead in practice, motivating strategies to reduce it further. In this work, we study two complementary strategies to reduce this cost using only standard projective Pauli measurements. First, we apply variance-based shot allocation (variance-minimised shot assignment and variance-preserved shot reduction (VPSR)) to both Hamiltonian energy and operator-gradient measurements, extending techniques previously studied only for energy estimation in standard VQE. VPSR achieves shot reductions of up to 43% for H 2 and 51% for LiH relative to uniform allocation while maintaining chemical accuracy. Second, we introduce a Pauli-measurement reuse protocol that stores outcomes from VQE optimisation and reuses them for gradient evaluation in the next ADAPT iteration. Across six molecular benchmarks (4–14 qubits), measurement reuse yields only marginal savings confined to the smallest systems and is effectively negligible for larger sizes, pivot-based grouping alone provides the dominant reduction and should be considered the practical baseline. These results characterise the interplay between shot allocation, measurement grouping, and cross-iteration reuse, offering practical guidance on when each strategy is most beneficial.
Grouping-based measurement strategies are widely used to reduce measurement complexity in near-term quantum algorithms. While these schemes have typically produced disjoint groups, recently this has been relaxed in what is known as overlapped grouping or coefficient splitting where operators may appear in more than one compatible group. In recent work, it has been numerically shown that this strategy can reduce the variance of energy estimates on small benchmark problems, motivating both the application and further analysis of the method. Here we prove that overlapped grouping for energy estimation can lead to a maximal variance reduction that is linear in the number of Hamiltonian terms. We introduce a new algorithm which we call repacking to transform existing groups into overlapped groups, and we show this repacking procedure iteratively reduces variance under mild assumptions. We also perform numerical simulations with Hamiltonians up to 444444 qubits and 575⋅103575 \cdot 10^{3}575⋅103 terms, assessing overlapped grouping at scale on problems of practical importance. Our numerics show that the variance reduction relative to state-of-the-art (disjoint) grouping increases linearly with the problem size, suggesting that overlapped grouping methods can be a powerful strategy for quantum energy estimation at the scale of Megaquop computers and beyond.
Variational quantum eigensolvers (VQEs) show promise for tackling complex quantum chemistry challenges and realizing quantum advantages. However, in VQE, the measurement step encounters difficulties due to errors in objective function evaluation, e.g., the energy of a quantum state. While increasing the number of measurement shots can mitigate measurement errors, this approach leads to higher costs. Strategies for shot assignment have been investigated, allowing for the allocation of varying shot numbers to different Hamiltonian terms and reducing measurement variance through term-specific insights. In this paper, we introduce a dynamic approach, the Variance-Preserved Shot Reduction (VPSR) method. This technique strives to minimize the total number of measurement shots while preserving the variance of measurements throughout the VQE process. Our numerical experiments on H 2 and LiH molecular ground states demonstrate the effectiveness of VPSR in achieving VQE convergence with a notably lower shot count.
Standard variational quantum simulation seeks to reproduce the evolution of the full quantum state, although many applications require only the expectation values of a few observables. We study a variational method for pure-state Hamiltonian dynamics that updates circuit parameters to reproduce the evolution of selected expectation values. An exact error identity guides the choice of observables, motivating a construction based on repeated commutators of the target with the Hamiltonian. For Pauli observables and Pauli-rotation circuits, the update can be estimated without ancillary qubits or controlled operations for overlap estimation. Across six- and ten-qubit spin, fermionic, and molecular benchmarks, the observable-targeted update extends the median time within the target-error tolerance compared with standard variational quantum simulation with equal shot budgets. These results show that directing the variational update toward the target observable can extend accurate simulation without increasing the measurement cost per time step.