Autoregressive pairwise Graphical Models efficiently find ground state representations of stoquastic Hamiltonians

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Pang, Yuchen, Jayakumar, Abhijith, McKinney, Evan, Coffrin, Carleton, Vuffray, Marc, Lokhov, Andrey Y.
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866910937633521664
author Pang, Yuchen
Jayakumar, Abhijith
McKinney, Evan
Coffrin, Carleton
Vuffray, Marc
Lokhov, Andrey Y.
author_facet Pang, Yuchen
Jayakumar, Abhijith
McKinney, Evan
Coffrin, Carleton
Vuffray, Marc
Lokhov, Andrey Y.
contents We introduce Autoregressive Graphical Models (AGMs) as an Ansatz for modeling the ground states of stoquastic Hamiltonians. Exact learning of these models for smaller systems show the dominance of the pairwise terms in the autoregressive decomposition, which informs our modeling choices when the Ansatz is used to find representations for ground states of larger systems. We find that simple AGMs with pairwise energy functions trained using first-order stochastic gradient methods often outperform more complex non-linear models trained using the more expensive stochastic reconfiguration method. We also test our models on Hamiltonians with frustration and observe that the simpler linear model used here shows faster convergence to the variational minimum in a resource-limited setting.
format Preprint
id arxiv_https___arxiv_org_abs_2505_06798
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Autoregressive pairwise Graphical Models efficiently find ground state representations of stoquastic Hamiltonians
Pang, Yuchen
Jayakumar, Abhijith
McKinney, Evan
Coffrin, Carleton
Vuffray, Marc
Lokhov, Andrey Y.
Quantum Physics
We introduce Autoregressive Graphical Models (AGMs) as an Ansatz for modeling the ground states of stoquastic Hamiltonians. Exact learning of these models for smaller systems show the dominance of the pairwise terms in the autoregressive decomposition, which informs our modeling choices when the Ansatz is used to find representations for ground states of larger systems. We find that simple AGMs with pairwise energy functions trained using first-order stochastic gradient methods often outperform more complex non-linear models trained using the more expensive stochastic reconfiguration method. We also test our models on Hamiltonians with frustration and observe that the simpler linear model used here shows faster convergence to the variational minimum in a resource-limited setting.
title Autoregressive pairwise Graphical Models efficiently find ground state representations of stoquastic Hamiltonians
topic Quantum Physics
url https://arxiv.org/abs/2505.06798