pith. sign in

arxiv: 1101.3281 · v1 · pith:CHPFKIYTnew · submitted 2011-01-17 · ❄️ cond-mat.str-el · hep-lat

Computational Studies of Quantum Spin Systems

classification ❄️ cond-mat.str-el hep-lat
keywords quantumspinsystemscarlocomputationaldiscussedmethodsmodels
0
0 comments X
read the original abstract

These lecture notes introduce quantum spin systems and several computational methods for studying their ground-state and finite-temperature properties. Symmetry-breaking and critical phenomena are first discussed in the simpler setting of Monte Carlo studies of classical spin systems, to illustrate finite-size scaling at continuous and first-order phase transitions. Exact diagonalization and quantum Monte Carlo (stochastic series expansion) algorithms and their computer implementations are then discussed in detail. Applications of the methods are illustrated by results for some of the most essential models in quantum magnetism, such as the S=1/2 Heisenberg antiferromagnet in one and two dimensions, as well as extended models useful for studying quantum phase transitions between antiferromagnetic and magnetically disordered states.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Tensor renormalization group approach to critical phenomena via symmetry-twisted partition functions

    hep-lat 2026-01 unverdicted novelty 7.0

    Tensor renormalization group computes symmetry-twisted partition functions to identify critical points solely from them, yielding Tc=2.2017(2) and nu=0.663(33) for the 3D O(2) model plus TBKT=0.8928(2) for the 2D O(2)...

  2. Computing eigenpairs of quantum many-body systems with Polfed.jl

    cond-mat.stat-mech 2026-05 accept novelty 6.0

    Polfed.jl provides a GPU-accelerated Julia implementation of polynomially filtered exact diagonalization that accesses larger mid-spectrum eigenpairs of quantum many-body Hamiltonians than prior methods.

  3. Computing eigenpairs of quantum many-body systems with Polfed.jl

    cond-mat.stat-mech 2026-05 conditional novelty 5.0

    Polfed.jl provides an efficient implementation of polynomially filtered Lanczos diagonalization for mid-spectrum eigenpairs in quantum many-body systems, supporting larger sizes via on-the-fly polynomial transformatio...

  4. The Complexity of Local Stoquastic Hamiltonians on 2D Lattices

    quant-ph 2025-02 unverdicted novelty 5.0

    The 2-local stoquastic Hamiltonian problem on 2D square qubit lattices is StoqMA-complete.