Metraipolis › archive › dc_699ef3821934

A computational phase diagram for the transverse field Ising model — arXiv:2610.02079

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.02079
License (as archived)
CC0-1.0
Archived
2026-10-06T17:36:35.373Z
SHA-256 of the archived text
40e2d9e602a795ff22308fd1ed28f03c9f47cd17b16f08440c8e9de5fe549203
Stable URL of this page
https://metraipolis.com/documento/dc_699ef3821934

How to cite

A computational phase diagram for the transverse field Ising model — arXiv:2610.02079 — arXiv (en), https://arxiv.org/abs/2610.02079 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_699ef3821934 (Metraipolis archive dc_699ef3821934, sha256 40e2d9e602a795ff22308fd1ed28f03c9f47cd17b16f08440c8e9de5fe549203)
BibTeX
@misc{dc699ef3821934,
  title = {A computational phase diagram for the transverse field Ising model — arXiv:2610.02079},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.02079},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_699ef3821934; sha256 40e2d9e602a795ff22308fd1ed28f03c9f47cd17b16f08440c8e9de5fe549203},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.02079. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-02 in math.PR).
Categorie arXiv: Quantum Physics (quant-ph) ; Data Structures and Algorithms (cs.DS); Mathematical Physics (math-ph); Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2610.02079 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T16:02:27.514Z dalla pagina https://arxiv.org/catchup/math.PR/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).