arXiv:2610.02079
A computational phase diagram for the transverse field Ising model
Thuy-Duong Vuong
Abstract
We study the transverse field Ising model, defined by the Hamiltonian $H =\frac{1}{2}\sum_{i, j\in [n]} J_{ij} Z_i Z_j +\sum_{i=1}^n h_i^z Z_i + η\sum_{i} X_i$ where $J $ is the symmetric interaction matrix, and $η$ is the transverse field strength. Let $Δ(J)=λ_{\max}(J)-λ_{\min}(J)$ be the spectral width of $J.$ When the inverse temperature $β\geq0$ satisfies $Δ(J)\cdot\frac{\tanh(βη)}η\leq1$, we give a randomized classical algorithm that approximates the partition function $Z(β)=\operatorname{Tr}(e^{-βH})$ to a given relative error $ε\in(0,1)$ in time polynomial in $n$, $β$, the model parameters, and $ε^{-1}$. When $ Δ(J) \cdot \frac{\tanh(βη)}η > 1 ,$ we show that approximating $ Z(β)$ within an $\exp(o(n))$-multiplicative factor is $\textbf{NP}$-hard, and thus unlikely to admit an efficient classical or quantum algorithms under standard complexity theoretic assumptions. Furthermore, in the regime $Δ(J)\cdot \frac{\tanh(βη)}η\leq 1,$ we provide an efficient randomized classical algorithm that approximates Pauli string observables of the Gibbs state $ ρ_β= \frac{e^{-βH}}{\operatorname{Tr}(e^{-βH})}$ within an arbitrarily small additive error. In the special case when the observable is also diagonal in the $X$-basis, i.e. $P \in \{I, X\}^{\otimes n}$, the algorithm further achieves arbitrarily small relative error.
AI Summary
The paper characterizes worst-case classical approximability of the transverse-field Ising model’s partition function as a function of temperature, transverse field, and interaction spectral width $\Delta(J)=\lambda_{\max}(J)-\lambda_{\min}(J)$. It treats arbitrary signed interactions and longitudinal fields, extending a previous tractability condition $\beta\Delta(J)\leq1$ to include strong transverse fields. When $\Delta(J)\tanh(\beta\eta)/\eta\leq1$, a randomized classical algorithm approximates $Z(\beta)$ to relative error $\epsilon$ in time polynomial in system size, $\beta$, coefficient magnitudes, and $\epsilon^{-1}$. The boundary is included. In this regime, arbitrary Pauli-string Gibbs expectations admit additive-error estimates; strings in $\{I,X\}^{\otimes n}$ admit relative-error estimates. Quantum Gibbs-state preparation is also obtained. If $\Delta(J)\leq|\eta|$, tractability holds at every temperature, enabling arbitrary additive-precision ground-energy approximation. For every fixed $\beta,\eta>0$, NP-hard instances occur arbitrarily close above the threshold: approximation within $e^{cn}$ is NP-hard for a parameter-dependent constant $c>0$. This is a worst-case statement, not hardness of every instance above the boundary. The algorithms use a Trotterized worldline representation and block Glauber dynamics. A covariance bound for one-dimensional Ising cycles under arbitrary fields, combined with stochastic-localization mixing results, gives efficient sampling. Hardness follows from Curie–Weiss gadgets whose two-phase concentration is established through large deviations, followed by a reduction from bounded-degree MAXCUT. Runtime depends polynomially on numerical parameter magnitudes rather than solely their encoding lengths; site-dependent transverse fields are covered through a condition using their minimum magnitude.
AI tools assisted with proofreading and typesetting. The author retains full responsibility for the paper's content.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.