A computational phase diagram for the transverse field Ising model

arXiv:2610.02079v1 Announce Type: new 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 + \eta\sum_{i} X_i$ where $J $ is the symmetric interaction matrix, and $\eta$ is the transverse field strength. Let $\Delta(J)=\lambda_{\max}(J)-\lambda_{\min}(J)$ be the spectral width of $J.$ When the inverse temperature $\beta\geq0$ satisfies $\Delta(J)\cdot\frac{\tanh(\beta\eta)}{\eta}\leq1$, we give a randomized classical algorithm that approximates the partition function $Z(\beta)=\operatorname{Tr}(e^{-\beta H})$ to a given relative error $\epsilon\in(0,1)$ in time polynomial in $n$, $\beta$, the model parameters, and $\epsilon^{-1}$. When $ \Delta(J) \cdot \frac{\tanh(\beta \eta)}{\eta} > 1 ,$ we show that approximating $ Z(\beta)$ 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 $\Delta (J)\cdot \frac{\tanh(\beta \eta)}{\eta}\leq 1,$ we provide an efficient randomized classical algorithm that approximates Pauli string observables of the Gibbs state $ \rho_\beta = \frac{e^{-\beta H}}{\operatorname{Tr}(e^{-\beta 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.

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 + \eta\sum_{i} X_i$ where $J $ is the symmetric interaction matrix, and $\eta$ is the transverse field strength. Let $\Delta(J)=\lambda_{\max}(J)-\lambda_{\min}(J)$ be the spectral width of $J.$ When the inverse temperature $\beta\geq0$ satisfies $\Delta(J)\cdot\frac{\tanh(\beta\eta)}{\eta}\leq1$, we give a randomized classical algorithm that approximates the partition function $Z(\beta)=\operatorname{Tr}(e^{-\beta H})$ to a given relative error $\epsilon\in(0,1)$ in time polynomial in $n$, $\beta$, the model parameters, and $\epsilon^{-1}$. When $ \Delta(J) \cdot \frac{\tanh(\beta \eta)}{\eta} > 1 ,$ we show that approximating $ Z(\beta)$ 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 $\Delta (J)\cdot \frac{\tanh(\beta \eta)}{\eta}\leq 1,$ we provide an efficient randomized classical algorithm that approximates Pauli string observables of the Gibbs state $ \rho_\beta = \frac{e^{-\beta H}}{\operatorname{Tr}(e^{-\beta 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.

Quantum Physics (quant-ph); Data Structures and Algorithms (cs.DS); Mathematical Physics (math-ph); Probability (math.PR)

arXiv:2610.02079 [quant-ph]

(or arXiv:2610.02079v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2610.02079 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

aiqbench analysis

A computational phase diagram for the transverse field Ising model

Related coverage