Hamiltonian Expressibility for Ansatz Selection in Variational Quantum Algorithms
Filippo Brozzi, Gloria Turati, Maurizio Ferrari Dacrema, Filippo Caruso, Paolo Cremonesi

TL;DR
This paper investigates how the expressibility of quantum circuits, measured by Hamiltonian expressibility, affects the performance of variational quantum algorithms in solving different types of Hamiltonian problems, especially under noise.
Contribution
It introduces a Monte Carlo-based method to estimate Hamiltonian expressibility and analyzes its impact on solution quality across various circuit depths and problem types.
Findings
High expressibility circuits perform better for non-diagonal Hamiltonians in ideal conditions.
Low expressibility circuits are more effective for basis state solutions, especially in noisy environments.
Intermediate expressibility circuits can outperform others for certain superposition solutions under noise.
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 analyze 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 analyze the correlation between solution quality and expressibility.Our results indicate that, under ideal or low-noise conditions…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
