---
res:
  bibo_abstract:
  - "Understanding the entanglement structure of local Hamiltonian ground spaces\r\nis
    a physically motivated problem, with applications ranging from tensor\r\nnetwork
    design to quantum error-correcting codes. To this end, we study the\r\ncomplexity
    of estimating ground state entanglement, and more generally entropy\r\nestimation
    for low energy states and Gibbs states. We find, in particular, that\r\nthe classes
    qq-QAM [Kobayashi, le Gall, Nishimura, SICOMP 2019] (a quantum\r\nanalogue of
    public-coin AM) and QMA(2) (QMA with unentangled proofs) play a\r\ncrucial role
    for such problems, showing: (1) Detecting a high-entanglement\r\nground state
    is qq-QAM-complete, (2) computing an additive error approximation\r\nto the Helmholtz
    free energy (equivalently, a multiplicative error\r\napproximation to the partition
    function) is in qq-QAM, (3) detecting a\r\nlow-entanglement ground state is QMA(2)-hard,
    and (4) detecting low energy\r\nstates which are close to product states can range
    from QMA-complete to\r\nQMA(2)-complete. Our results make progress on an open
    question of [Bravyi,\r\nChowdhury, Gosset and Wocjan, Nature Physics 2022] on
    free energy, and yield\r\nthe first QMA(2)-complete Hamiltonian problem using
    local Hamiltonians (cf. the\r\nsparse QMA(2)-complete Hamiltonian problem of [Chailloux,
    Sattath, CCC 2012]).@eng"
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Sevag
      foaf_name: Gharibian, Sevag
      foaf_surname: Gharibian
  - foaf_Person:
      foaf_givenName: Jonas
      foaf_name: Kamminga, Jonas
      foaf_surname: Kamminga
  dct_date: 2025^xs_gYear
  dct_language: eng
  dct_title: On the complexity of estimating ground state entanglement and free  energy@
...