<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>preprint</genre>

<titleInfo><title>On the complexity of estimating ground state entanglement and free  energy</title></titleInfo>





<name type="personal">
  <namePart type="given">Sevag</namePart>
  <namePart type="family">Gharibian</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Jonas</namePart>
  <namePart type="family">Kamminga</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">7</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>

<name type="corporate">
  <namePart></namePart>
  <identifier type="local">623</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>








<abstract lang="eng">Understanding the entanglement structure of local Hamiltonian ground spaces
is a physically motivated problem, with applications ranging from tensor
network design to quantum error-correcting codes. To this end, we study the
complexity of estimating ground state entanglement, and more generally entropy
estimation for low energy states and Gibbs states. We find, in particular, that
the classes qq-QAM [Kobayashi, le Gall, Nishimura, SICOMP 2019] (a quantum
analogue of public-coin AM) and QMA(2) (QMA with unentangled proofs) play a
crucial role for such problems, showing: (1) Detecting a high-entanglement
ground state is qq-QAM-complete, (2) computing an additive error approximation
to the Helmholtz free energy (equivalently, a multiplicative error
approximation to the partition function) is in qq-QAM, (3) detecting a
low-entanglement ground state is QMA(2)-hard, and (4) detecting low energy
states which are close to product states can range from QMA-complete to
QMA(2)-complete. Our results make progress on an open question of [Bravyi,
Chowdhury, Gosset and Wocjan, Nature Physics 2022] on free energy, and yield
the first QMA(2)-complete Hamiltonian problem using local Hamiltonians (cf. the
sparse QMA(2)-complete Hamiltonian problem of [Chailloux, Sattath, CCC 2012]).</abstract>

<originInfo><dateIssued encoding="w3cdtf">2025</dateIssued>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>arXiv:2510.06796</title></titleInfo>
  <identifier type="arXiv">2510.06796</identifier>
<part>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<apa>Gharibian, S., &amp;#38; Kamminga, J. (2025). On the complexity of estimating ground state entanglement and free  energy. In &lt;i&gt;arXiv:2510.06796&lt;/i&gt;.</apa>
<short>S. Gharibian, J. Kamminga, ArXiv:2510.06796 (2025).</short>
<bibtex>@article{Gharibian_Kamminga_2025, title={On the complexity of estimating ground state entanglement and free  energy}, journal={arXiv:2510.06796}, author={Gharibian, Sevag and Kamminga, Jonas}, year={2025} }</bibtex>
<mla>Gharibian, Sevag, and Jonas Kamminga. “On the Complexity of Estimating Ground State Entanglement and Free  Energy.” &lt;i&gt;ArXiv:2510.06796&lt;/i&gt;, 2025.</mla>
<ama>Gharibian S, Kamminga J. On the complexity of estimating ground state entanglement and free  energy. &lt;i&gt;arXiv:251006796&lt;/i&gt;. Published online 2025.</ama>
<ieee>S. Gharibian and J. Kamminga, “On the complexity of estimating ground state entanglement and free  energy,” &lt;i&gt;arXiv:2510.06796&lt;/i&gt;. 2025.</ieee>
<chicago>Gharibian, Sevag, and Jonas Kamminga. “On the Complexity of Estimating Ground State Entanglement and Free  Energy.” &lt;i&gt;ArXiv:2510.06796&lt;/i&gt;, 2025.</chicago>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>61778</recordIdentifier><recordCreationDate encoding="w3cdtf">2025-10-10T13:45:28Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2026-04-20T13:53:47Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
