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:2507.22550 · Quantum Machine Intelligence

Hamiltonian expressibility for ansatz selection in variational quantum algorithms

Filippo Brozzi, Gloria Turati, Maurizio Ferrari Dacrema, Filippo Caruso, Paolo Cremonesi

Published Jul 3, 2026• 4 citations
arXivHTMLPDF

Abstract

Abstract In the context of Variational Quantum Algorithms (VQAs), selecting an appropriate ansatz is crucial for efficient problem-solving. Hamiltonian expressibility has been introduced as a metric to quantify a circuit’s ability to uniformly explore the energy landscape associated with a Hamiltonian ground state search problem. However, its influence on solution quality remains largely unexplored. In this work, we estimate the Hamiltonian expressibility of a well-defined set of circuits applied to various Hamiltonians using a Monte Carlo-based approach. We analyse how ansatz depth influences expressibility and identify the most and least expressive circuits across different problem types. We then train each ansatz using the Variational Quantum Eigensolver (VQE) and analyse the correlation between solution quality and expressibility. Our results indicate that, under ideal or low-noise conditions and particularly for small-scale problems, ansätze with high Hamiltonian expressibility yield better solution quality for problems with non-diagonal Hamiltonians and superposition state solutions. Conversely, circuits with low expressibility are more effective for problems whose solutions are basis states, including those defined by diagonal Hamiltonians. Under noisy conditions, low-expressibility circuits remain preferable for problems with solutions in a computational basis state, while intermediate expressibility yields better results for some problems involving superposition state solutions.

DOI
10.1007/s42484-026-00407-3

Related papers

Lower bound of the expressibility of ansatzes for Variational Quantum Algorithms

Tamojit Ghosh, Mandal, Arijit, Shreya Banerjee +2 more

The expressibility of an ansatz used in a variational quantum algorithm is defined as the uniformity with which it can explore the space of unitary matrices, i.e., its covering number. The expressibility of a particular ansatz has a well-defined upper bound [1]. In this work, we show that the expressibility also has a well-defined lower bound in the hypothesis space. We provide an analytical expression for the lower bound of the covering number, which is directly related to expressibility. Further, we provide numerical analysis to support our claim. By calculating the bond length of hydrogen molecule ($H_2$) using different ansatzes in a variational quantum eigensolver (VQE) setting, we study the variation of equilibrium energy error with circuit depths. We show that in each ansatz template, a plateau exists for a range of circuit depths, which we call the set of acceptable points, and the corresponding expressibility as the best expressive region. We report that the width of this best expressive region in the hypothesis space is inversely proportional to the average error. Our analysis reveals that alongside trainability, the lower bound of expressibility also plays a crucial role in selecting variational quantum ansatzes

arXiv:2311.01330•Nov 2, 2023•1 citation

The Effect of Noise on the Performance of Variational Algorithms for Quantum Chemistry

Waheeda Saib, Petros Wallden, Ismail Yunus Akhalwaya

Variational quantum algorithms are suitable for use on noisy quantum systems. One of the most important use-cases is the quantum simulation of materials, using the variational quantum eigensolver (VQE). To optimize VQE performance, a suitable parameterized quantum circuit (ansatz) must be selected. We investigate a class of ansatze that incorporates knowledge of the quantum hardware, namely the hardware efficient ansatze. The performance of hardware efficient ansatze is affected differently by noise, and our goal is to study the effect of noise on evaluating which ansatz gives more accurate results in practice. First, we study the effect of noise on the different hardware efficient ansatze by benchmarking and ranking the performance of each ansatz family (i) on a chemistry application using VQE and (ii) by the recently established metric of "expressibility". The results demonstrate the ranking of optimal circuits does not remain constant in the presence of noise. Second, we evaluate the suitability of the expressibility measure in this context by performing a correlation study between expressibility and the performance of the same circuits on a chemistry application using VQE. Our simulations reveal a weak correlation and therefore demonstrate that expressibility is not an adequate measure to quantify the effectiveness of parameterized quantum circuits for quantum chemistry. Third, we evaluate the effect of different quantum device noise models on the ordering of which ansatz family is best. Interestingly, we see that to decide which ansatz is optimal for use, one needs to consider the specific hardware used even within the same family of quantum hardware.

arXiv:2108.12388•IEEE International Conference on Quantum Computing and Engineering (QCE)•Oct 1, 2021•14 citations

Expressibility, Noise, and Error Mitigation in VQE Ansatz Selection

Peter Annis, Abe Kassem, Evan Coleman

The variational quantum eigensolver (VQE) is a promising algorithm for near-term quantum chemistry applications, but selecting optimal ansatz circuits remains challenging. Expressibility, a metric quantifying a circuit's ability to explore the Hilbert space, has been proposed as a guide for ansatz selection, but recent work showed it inconsistently predicts VQE performance under realistic noise for $H_2$. We extend this investigation to cover both $H_2$ and $H_3^+$ under four execution scenarios: ideal, noisy, and noisy with zero-noise extrapolation (ZNE) or probabilistic error cancellation (PEC). We find that error mitigation does not reliably restore expressibility's predictive power. ZNE reduces error for only 4 of 12 $H_2$ circuits and 4 of 6 $H_3^+$ circuits, while PEC actually increases error in 11 of 12 $H_2$ circuits and all 6 $H_3^+$ circuits. We reproduce and extend Saib et al.'s key finding that circuit rankings scramble under noise (Spearman $ρ\approx -0.1$ between ideal and noisy rankings), and identify a new result: ZNE largely preserves noisy rankings ($ρ= +0.80$ for $H_2$) while PEC actively reorders them ($ρ= -0.22$). Noisy expressibility, computed from density matrix simulations, strongly predicts unmitigated performance for $H_3^+$ (Pearson $r = +0.91$, $p = 0.01$), but this metric is computationally intractable at scale. We demonstrate that zero-cost circuit topology metrics such as two-qubit gate count provide comparable or superior predictive power for PEC degradation ($r = +0.96$ for $H_3^+$), while standard expressibility best predicts noisy and ZNE performance for $H_2$ ($r = +0.74$ and $r = +0.77$).

quant-pharXiv:2606.04955•ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC)•Jun 4, 2026•0 citations

PANSATZ: pulse-based ansatz for variational quantum algorithms

Dekel Meirom, Steven H. Frankel

Quantum computers promise a great computational advantage over classical computers, which might help solve various computational challenges such as the simulation of complicated quantum systems, finding optimum in large optimization problems, and solving large-scale linear algebra problems. Current available quantum devices have only a limited amount of qubits and a high level of noise, limiting the size of problems that can be solved accurately with those devices. Variational quantum algorithms (VQAs) have emerged as a leading strategy to address these limitations by optimizing cost function based on measurement results of shallow depth circuits. Recently, various pulse engineering methods were suggested in order to improve VQA results, including optimizing pulse parameters instead of gate angles as part of the VQA optimization process. In this paper, we suggest a novel pulse-based ansatz, which is parameterized mainly by pulses’ duration of pre-defined pulse structures. This ansatz structure provides relatively low amounts of optimization parameters while maintaining high expressibility, allowing fast convergence. In addition, the ansatz has structured adaptivity to the entanglement level required by the problem, allowing low noise and accurate results. We tested this ansatz against quantum chemistry problems. Specifically, finding the ground-state energy associated with the electron configuration problem, using the variational quantum eigensolver (VQE) algorithm for several different molecules. We manage to achieve chemical accuracy both in simulation for several molecules and on one of IBM’s NISQ devices for the H2 molecule in the STO-3G basis, without the need for extensive error mitigation. Our results are compared to a common gate-based ansatz and show better accuracy and significant latency reduction—up to 7× shorter ansatz schedules.

arXiv:2212.12911•Frontiers in Quantum Science and Technology•Oct 9, 2023•30 citations

Neural-network-encoded variational quantum algorithms

Jiaqi Miao, Chang‐Yu Hsieh, Shi‐Xin Zhang

We introduce a general framework called neural-network- (NN) encoded variational quantum algorithms (VQAs), or NNVQA for short, to address the challenges of implementing VQAs on noisy intermediate-scale quantum (NISQ) computers. Specifically, NNVQA feeds input (such as parameters of a Hamiltonian) from a given problem to a neural network and uses its outputs to parameterize an ansatz circuit for the standard VQA. Combining the strengths of NN and parameterized quantum circuits, NNVQA can accelerate the training process of VQAs and handle a broad family of related problems with varying input parameters with the pretrained NN. To concretely illustrate the merits of NNVQA, we present results on a NN variational quantum eigensolver (VQE) for solving the ground state of parameterized $XXZ$ spin models in one and two dimensions. Our results demonstrate that NNVQE is able to estimate the ground-state energies of parameterized Hamiltonians with high precision without fine tuning, and significantly reduce the overall training cost to estimate ground-state properties across the phases of the given Hamiltonian. We also employ an active learning strategy to further increase the training efficiency while maintaining prediction accuracy. These encouraging results demonstrate that NNVQAs offer an alternative hybrid quantum-classical paradigm to utilize NISQ resources for solving more realistic and challenging computational problems.

arXiv:2308.01068•Physical Review Applied•Jan 26, 2024•30 citations

Learning the Expressibility of Quantum Circuit Ansatz Using Transformer

Fei Zhang, Jie Li, Zhimin He +1 more

Abstract With the exponentially faster computation for certain problems, quantum computing has garnered significant attention in recent years. Variational quantum algorithms are crucial methods to implement quantum computing, and an appropriate task‐specific quantum circuit ansatz can effectively enhance the quantum advantage of VQAs. However, the vast search space makes it challenging to find the optimal task‐specific ansatz. Expressibility, quantifying the diversity of quantum circuit ansatz states to explore the Hilbert space effectively, can be used to evaluate whether one ansatz is superior to another. In this work, using a transformer model to predict the expressibility of quantum circuit ansatze is proposed. A dataset containing random PQCs generated by the gatewise pipeline, with varying numbers of qubits and gates is constructed. The expressibility of the circuits is calculated using three measures: KL divergence, relative KL divergence, and maximum mean discrepancy. A transformer model is trained on the dataset to capture the intricate relationships between circuit characteristics and expressibility. Four evaluation metrics are employed to assess the performance of the transformer. Numerical results demonstrate that the trained model achieves high performance and robustness across various expressibility measures. This research can enhance the understanding of the expressibility of quantum circuit ansatze and advance quantum architecture search algorithms.

arXiv:2405.18837•Advanced Quantum Technologies•Mar 4, 2025•8 citations
Abstract In the context of Variational Quantum Algorithms (VQAs), selecting an appropriate ansatz is crucial for efficient problem-solving. Hamiltonian expressibility has been introduced as a metric to quantify a circuit’s ability to uniformly explore the energy landscape associated with a Hamiltonian ground state search problem. However, its influence on solution quality remains largely unexplored. In this work, we estimate the Hamiltonian expressibility of a well-defined set of circuits applied to various Hamiltonians using a Monte Carlo-based approach. We analyse how ansatz depth influences expressibility and identify the most and least expressive circuits across different problem types. We then train each ansatz using the Variational Quantum Eigensolver (VQE) and analyse the correlation between solution quality and expressibility. Our results indicate that, under ideal or low-noise conditions and particularly for small-scale problems, ansätze with high Hamiltonian expressibility yield better solution quality for problems with non-diagonal Hamiltonians and superposition state solutions. Conversely, circuits with low expressibility are more effective for problems whose solutions are basis states, including those defined by diagonal Hamiltonians. Under noisy conditions, low-expressibility circuits remain preferable for problems with solutions in a computational basis state, while intermediate expressibility yields better results for some problems involving superposition state solutions.
The expressibility of an ansatz used in a variational quantum algorithm is defined as the uniformity with which it can explore the space of unitary matrices, i.e., its covering number. The expressibility of a particular ansatz has a well-defined upper bound [1]. In this work, we show that the expressibility also has a well-defined lower bound in the hypothesis space. We provide an analytical expression for the lower bound of the covering number, which is directly related to expressibility. Further, we provide numerical analysis to support our claim. By calculating the bond length of hydrogen molecule (H2H_2H2​) using different ansatzes in a variational quantum eigensolver (VQE) setting, we study the variation of equilibrium energy error with circuit depths. We show that in each ansatz template, a plateau exists for a range of circuit depths, which we call the set of acceptable points, and the corresponding expressibility as the best expressive region. We report that the width of this best expressive region in the hypothesis space is inversely proportional to the average error. Our analysis reveals that alongside trainability, the lower bound of expressibility also plays a crucial role in selecting variational quantum ansatzes
Variational quantum algorithms are suitable for use on noisy quantum systems. One of the most important use-cases is the quantum simulation of materials, using the variational quantum eigensolver (VQE). To optimize VQE performance, a suitable parameterized quantum circuit (ansatz) must be selected. We investigate a class of ansatze that incorporates knowledge of the quantum hardware, namely the hardware efficient ansatze. The performance of hardware efficient ansatze is affected differently by noise, and our goal is to study the effect of noise on evaluating which ansatz gives more accurate results in practice. First, we study the effect of noise on the different hardware efficient ansatze by benchmarking and ranking the performance of each ansatz family (i) on a chemistry application using VQE and (ii) by the recently established metric of "expressibility". The results demonstrate the ranking of optimal circuits does not remain constant in the presence of noise. Second, we evaluate the suitability of the expressibility measure in this context by performing a correlation study between expressibility and the performance of the same circuits on a chemistry application using VQE. Our simulations reveal a weak correlation and therefore demonstrate that expressibility is not an adequate measure to quantify the effectiveness of parameterized quantum circuits for quantum chemistry. Third, we evaluate the effect of different quantum device noise models on the ordering of which ansatz family is best. Interestingly, we see that to decide which ansatz is optimal for use, one needs to consider the specific hardware used even within the same family of quantum hardware.
The variational quantum eigensolver (VQE) is a promising algorithm for near-term quantum chemistry applications, but selecting optimal ansatz circuits remains challenging. Expressibility, a metric quantifying a circuit's ability to explore the Hilbert space, has been proposed as a guide for ansatz selection, but recent work showed it inconsistently predicts VQE performance under realistic noise for H2H_2H2​. We extend this investigation to cover both H2H_2H2​ and H3+H_3^+H3+​ under four execution scenarios: ideal, noisy, and noisy with zero-noise extrapolation (ZNE) or probabilistic error cancellation (PEC). We find that error mitigation does not reliably restore expressibility's predictive power. ZNE reduces error for only 4 of 12 H2H_2H2​ circuits and 4 of 6 H3+H_3^+H3+​ circuits, while PEC actually increases error in 11 of 12 H2H_2H2​ circuits and all 6 H3+H_3^+H3+​ circuits. We reproduce and extend Saib et al.'s key finding that circuit rankings scramble under noise (Spearman ρ≈−0.1ρ\approx -0.1ρ≈−0.1 between ideal and noisy rankings), and identify a new result: ZNE largely preserves noisy rankings (ρ=+0.80ρ= +0.80ρ=+0.80 for H2H_2H2​) while PEC actively reorders them (ρ=−0.22ρ= -0.22ρ=−0.22). Noisy expressibility, computed from density matrix simulations, strongly predicts unmitigated performance for H3+H_3^+H3+​ (Pearson r=+0.91r = +0.91r=+0.91, p=0.01p = 0.01p=0.01), but this metric is computationally intractable at scale. We demonstrate that zero-cost circuit topology metrics such as two-qubit gate count provide comparable or superior predictive power for PEC degradation (r=+0.96r = +0.96r=+0.96 for H3+H_3^+H3+​), while standard expressibility best predicts noisy and ZNE performance for H2H_2H2​ (r=+0.74r = +0.74r=+0.74 and r=+0.77r = +0.77r=+0.77).
Quantum computers promise a great computational advantage over classical computers, which might help solve various computational challenges such as the simulation of complicated quantum systems, finding optimum in large optimization problems, and solving large-scale linear algebra problems. Current available quantum devices have only a limited amount of qubits and a high level of noise, limiting the size of problems that can be solved accurately with those devices. Variational quantum algorithms (VQAs) have emerged as a leading strategy to address these limitations by optimizing cost function based on measurement results of shallow depth circuits. Recently, various pulse engineering methods were suggested in order to improve VQA results, including optimizing pulse parameters instead of gate angles as part of the VQA optimization process. In this paper, we suggest a novel pulse-based ansatz, which is parameterized mainly by pulses’ duration of pre-defined pulse structures. This ansatz structure provides relatively low amounts of optimization parameters while maintaining high expressibility, allowing fast convergence. In addition, the ansatz has structured adaptivity to the entanglement level required by the problem, allowing low noise and accurate results. We tested this ansatz against quantum chemistry problems. Specifically, finding the ground-state energy associated with the electron configuration problem, using the variational quantum eigensolver (VQE) algorithm for several different molecules. We manage to achieve chemical accuracy both in simulation for several molecules and on one of IBM’s NISQ devices for the H2 molecule in the STO-3G basis, without the need for extensive error mitigation. Our results are compared to a common gate-based ansatz and show better accuracy and significant latency reduction—up to 7× shorter ansatz schedules.
We introduce a general framework called neural-network- (NN) encoded variational quantum algorithms (VQAs), or NNVQA for short, to address the challenges of implementing VQAs on noisy intermediate-scale quantum (NISQ) computers. Specifically, NNVQA feeds input (such as parameters of a Hamiltonian) from a given problem to a neural network and uses its outputs to parameterize an ansatz circuit for the standard VQA. Combining the strengths of NN and parameterized quantum circuits, NNVQA can accelerate the training process of VQAs and handle a broad family of related problems with varying input parameters with the pretrained NN. To concretely illustrate the merits of NNVQA, we present results on a NN variational quantum eigensolver (VQE) for solving the ground state of parameterized XXZXXZXXZ spin models in one and two dimensions. Our results demonstrate that NNVQE is able to estimate the ground-state energies of parameterized Hamiltonians with high precision without fine tuning, and significantly reduce the overall training cost to estimate ground-state properties across the phases of the given Hamiltonian. We also employ an active learning strategy to further increase the training efficiency while maintaining prediction accuracy. These encouraging results demonstrate that NNVQAs offer an alternative hybrid quantum-classical paradigm to utilize NISQ resources for solving more realistic and challenging computational problems.
Abstract With the exponentially faster computation for certain problems, quantum computing has garnered significant attention in recent years. Variational quantum algorithms are crucial methods to implement quantum computing, and an appropriate task‐specific quantum circuit ansatz can effectively enhance the quantum advantage of VQAs. However, the vast search space makes it challenging to find the optimal task‐specific ansatz. Expressibility, quantifying the diversity of quantum circuit ansatz states to explore the Hilbert space effectively, can be used to evaluate whether one ansatz is superior to another. In this work, using a transformer model to predict the expressibility of quantum circuit ansatze is proposed. A dataset containing random PQCs generated by the gatewise pipeline, with varying numbers of qubits and gates is constructed. The expressibility of the circuits is calculated using three measures: KL divergence, relative KL divergence, and maximum mean discrepancy. A transformer model is trained on the dataset to capture the intricate relationships between circuit characteristics and expressibility. Four evaluation metrics are employed to assess the performance of the transformer. Numerical results demonstrate that the trained model achieves high performance and robustness across various expressibility measures. This research can enhance the understanding of the expressibility of quantum circuit ansatze and advance quantum architecture search algorithms.