<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Exploring the Role of Hamiltonian Expressibility in Ansatz Selection for Variational Quantum Algorithms</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Filippo Brozzi</string-name>
          <email>filippo.brozzi@mail.polimi.it</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Gloria Turati</string-name>
          <email>gloria.turati@polimi.it</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Maurizio Ferrari Dacrema</string-name>
          <email>maurizio.ferrari@polimi.it</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Paolo Cremonesi</string-name>
          <email>paolo.cremonesi@polimi.it</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Politecnico di Milano</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Italy</string-name>
        </contrib>
      </contrib-group>
      <abstract>
        <p>A key challenge in Variational Quantum Algorithms (VQAs) consists in designing efective parametric quantum circuits, or ansatzes, that account for both the specific problem and the limitations of quantum hardware. While Machine Learning-based methods for circuit construction have been developed, selecting the appropriate metrics to include in the cost function to ensure the circuit has the desired properties remains a non-trivial task. Hamiltonian expressibility has been proposed as a metric to quantify a circuit ability to explore the problem energy landscape. However, its potential to enhance the likelihood of obtaining high-quality solutions remains underexplored. In this work, we investigate the correlation between an ansatz Hamiltonian expressibility and the quality of solutions found using the Variational Quantum Eigensolver (VQE), aiming to determine whether such metric could enhance Machine Learning methods for ansatz design. Specifically, we propose a protocol to estimate the Hamiltonian expressibility of a given ansatz and Hamiltonian, and employ VQE to solve the associated optimization problem. By conducting a correlation analysis, we assess the relationship between Hamiltonian expressibility and solution quality. Our results suggest that Hamiltonian expressibility could serve as a valuable metric to enhance Machine Learning techniques used for ansatz design.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Variational Quantum Algorithms</kwd>
        <kwd>Expressibility</kwd>
        <kwd>Ansatz</kwd>
        <kwd>Correlation Analysis</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Variational Quantum Algorithms (VQAs) are a class of hybrid quantum-classical algorithms that use
a parametric quantum circuit, or ansatz, and a classical optimizer which tunes the circuit parameters
with the goal of minimizing a cost function. Among the most widely used VQAs is the Variational
Quantum Eigensolver (VQE), specifically designed to find the ground state of a Hamiltonian operator by
minimizing its expectation value on the final state of the circuit. VQAs have recently gained significant
attention due to their resilience to noise and decoherence of the qubits, making them particularly
suitable for the currently available noisy intermediate-scale quantum (NISQ) devices. However, a
significant challenge in their application lies in the selection of an efective ansatz tailored to the specific
problem being addressed. This task is not straightforward, as it requires balancing solution accuracy,
computational time, and resource usage. To address this, researchers are exploring methods based
on adaptive algorithms and Reinforcement Learning [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. However, these approaches come with high
computational costs and require further investigation.
      </p>
      <p>
        In this context, expressibility has been proposed as a metric to quantify the ansatz ability to explore
the quantum state space or the problem energy space. Several definitions of expressibility exist in the
literature, including the problem-oriented Hamiltonian expressibility, which evaluates how efectively a
quantum circuit approximates the Haar uniform distribution in generating the final energies [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>Formally, given a parametric circuit  () acting on  qubits and a problem Hamiltonian  , the
Hamiltonian expressibility of the ansatz with respect to  is defined as:</p>
      <p>⃦ ∫︁
ℋ(,  ) := ⃦⃦
⃦ 
 ⊗ 2 ⊗ 2( †)⊗ 2 ( ) −
∫︁
Θ</p>
      <p>⃦
 ⊗ 2() ⊗ 2( †)⊗ 2() ⃦⃦
⃦ 2
(1)
where the first integral is computed over the Haar measure,  is a generic unitary operator,  ( ) is
the volume element of the Haar measure, and the second integral is over the parameter space Θ .</p>
      <p>
        While higher Hamiltonian expressibility allows the circuit to explore a broader range of quantum
states, it has been shown that high expressibility favours the occurrence of barren plateaus - regions
where the gradient of the cost function vanishes - making it dificult to train the ansatz as the system
size increases [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Therefore, a trade-of between exploration capability and trainability is crucial.
      </p>
      <p>In this work, we propose a method to evaluate Hamiltonian expressibility and investigate whether
this metric can guide the selection of a suitable ansatz within the VQE framework.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Experimental Protocol</title>
      <p>
        We propose a procedure to estimate the Hamiltonian expressibility of a circuit, taking inspiration from
the protocol in [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Specifically, we compute the contribution from the Haar measure in (1) by using a
closed-form expression and adopt a Monte Carlo approach to estimate the ansatz contribution, drawing
500,000 random parameters for each estimate.
      </p>
      <p>
        Our experimental dataset includes Hamiltonians from six specific problem classes: Maximum Cut,
Minimum Vertex Cover, Maximum Clique, Heisenberg XXZ, Transverse Ising Field, and Adiabatic.
Additionally, we include two random classes: Random Diagonal (diagonal matrix with random real
values) and Random Non-diagonal (non-diagonal matrix constructed as a linear combination of Pauli
string matrices with random real coeficients). These problem instances are generated for both 4 and
8-qubit systems. We evaluate the same ansatzes analyzed in [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] by computing their Hamiltonian
expressibility for each of the defined Hamiltonians. Each circuit is then trained using the VQE protocol
in a noiseless setting. We run VQE on each problem instance 10 times and use the average normalized
approximation ratio for evaluating the quality of the solutions found.
      </p>
      <p>Finally, we compute Pearson and Spearman correlation coeficients between Hamiltonian
expressibility and approximation ratio to assess the relationship between expressibility and VQE efectiveness.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Results</title>
      <p>Our results show that circuits with high Hamiltonian expressibility tend to perform better on problems
with non-diagonal Hamiltonians and superposition state solutions. In contrast, low Hamiltonian
expressibility circuits are more efective for diagonal Hamiltonians or problems with basis state solutions.
This trend is particularly evident in the Heisenberg XXZ problem, which contains both basis and
superposition state solutions, allowing us to directly observe this behavior.</p>
      <p>Moreover, the correlation between Hamiltonian expressibility and VQE efectiveness is stronger in
small problem instances (4 qubits), while, as the problem size increases (8 qubits), such correlation
diminishes, likely due to the increased occurrence of barren plateaus in highly expressive circuits.</p>
      <p>In conclusion, Hamiltonian expressibility can provide valuable insights for selecting ansatzes in VQE
protocols, particularly for small-scale systems. Therefore, it holds potential for guiding researchers in
choosing a suitable ansatz, for instance, by incorporating Hamiltonian expressibility as a penalty term
in the cost function of Machine Learning-based methods for ansatz design. However, further research
is needed to fully harness the power of this metric and explore its broader applications.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>S.</given-names>
            <surname>Foderà</surname>
          </string-name>
          , G. Turati,
          <string-name>
            <given-names>R.</given-names>
            <surname>Nembrini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. F.</given-names>
            <surname>Dacrema</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Cremonesi</surname>
          </string-name>
          ,
          <article-title>Reinforcement learning for variational quantum circuit design</article-title>
          , in: AIQxQIA,
          <year>2024</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Holmes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Sharma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Cerezo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. J.</given-names>
            <surname>Coles</surname>
          </string-name>
          ,
          <article-title>Connecting ansatz expressibility to gradient magnitudes and barren plateaus</article-title>
          ,
          <source>PRX Quantum 3</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>S.</given-names>
            <surname>Sim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. D.</given-names>
            <surname>Johnson</surname>
          </string-name>
          , A.
          <string-name>
            <surname>Aspuru-Guzik</surname>
          </string-name>
          ,
          <article-title>Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms</article-title>
          ,
          <source>Advanced Quantum Technologies</source>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>