Graph-Theoretic Analysis of Phase Optimization Complexity in Variational Wave Functions for Heisenberg Antiferromagnets

arXiv:2602.04943 · cond-mat.str-el, cond-mat.dis-nn, cs.AI, cs.CC, quant-ph · Submitted 2026-02-04 · Read on arXiv

cond-mat.str-el, cond-mat.dis-nn, cs.AI, cs.CC, quant-ph

Submitted: 2026-02-04

Updated: 2026-10-19

Comments: The NP-hardness claim has been corrected, and the connection to variational Monte Carlo has been revised

License: http://creativecommons.org/licenses/by/4.0/

The gist: We study the computational complexity of learning the ground state phase structure of Heisenberg antiferromagnets.

Terminology

Abstract

We study the computational complexity of learning the ground state phase structure of Heisenberg antiferromagnets. Representing Hilbert space as a weighted graph, the variational energy defines a weighted XY model that, for Z 2 phases, reduces to a classical antiferromagnetic Ising model on that graph. For fixed amplitudes, reconstructing the signs of the ground state wavefunction thus reduces to a weighted Max-Cut instance. This links sign optimization of wavefunctions directly to combinatorial optimization.

Sources

Related papers