Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2605.26261 · Computer Physics Communications

GPU-accelerated finite-temperature Lanczos method for spin Hamiltonians

Shadan Ghassemi Tabrizi, Thomas D. Kühne

Published Nov 1, 2026• 0 citations
arXivHTMLPDF
DOI
10.1016/j.cpc.2026.110517

Related papers

Ground State and Finite Temperature Lanczos Methods

Peter Prelovšek, J. Bonča

Springer series in solid-state sciences•Jan 1, 2013•68 citations

Parallelization of Lanczos algorithm applied for quantum spin systems

Tôru Sakai

•May 31, 2004•0 citations

GPU-accelerated finite-temperature Lanczos method for Heisenberg spin systems with non-Abelian permutation symmetries

Shadan Ghassemi Tabrizi, Thomas D. Kühne

We extend a recent GPU implementation of the finite-temperature Lanczos method (FTLM) for Heisenberg spin Hamiltonians, which uses only total-magnetization symmetry, to the full permutation symmetry, including non-Abelian point and space groups. For highly symmetric clusters such as icosahedral polyhedra, the multidimensional irreducible representations (irreps) of the permutation group reduce the block dimensions substantially further than any Abelian subgroup. Here, we provide a matrix-free formalism (avoiding explicit storage of the projected Hamiltonian) for using such symmetries. The implementation applies equally to Abelian groups, retaining the advantages of GPU acceleration. Several cluster topologies are built in; beyond these, symmetry groups can be supplied as site-permutation generators, with irrep matrices computed automatically, so that user-defined clusters run without any code changes. We demonstrate the approach in production runs on a single NVIDIA B200 accelerator for the s=3/2 Heisenberg antiferromagnet on the dodecahedron (Hilbert-space dimension 4^20 ~ 1.1x10^12) and for the s=1/2 square lattice of 5x8 sites (M=0 dimension 1.4x10^11). With R=24 random vectors per symmetry block and 60 Lanczos steps, the dodecahedron campaign (with the largest iterated symmetry block having a dimension of 3.6x10^9) requires about 50 GPU-hours. The code is openly available under the Apache-2.0 license at https://github.com/ghasdeke/ftlm-pg-gpu, archived at DOI: 10.5281/zenodo.21445872.

arXiv:2607.17429•Jul 19, 2026•2 citations

Finite-temperature quantum spin algorithms

James E. Gubernatis, Naoki Kawashima, Philipp Werner

Cambridge University Press eBooks•Jan 31, 2016•0 citations

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

Rok Pintar, Konrad Pawlik, Rafał Świętek +5 more

We present Polfed$.$jl, an open-source Julia package implementing the Polynomially Filtered Exact Diagonalization (POLFED) algorithm for computing mid-spectrum eigenvalues and eigenvectors (shortly, eigenpairs) of quantum many-body Hamiltonians. Access to such eigenpairs is essential for studying non-equilibrium many-body physics, but is hindered by the exponential growth of Hilbert-space dimension. POLFED addresses this challenge through a polynomial spectral transformation evaluated on the fly within a Lanczos iteration, preserving Hamiltonian sparsity and substantially reducing memory costs compared to other diagonalization methods. The package supports flexible energy targeting, automatic optimization of the spectral mapping for structured Hamiltonians, and GPU acceleration, which is particularly effective since the dominant computational cost reduces to repeated sparse matrix-vector multiplications. Benchmarks on disordered spin-chain and fermionic models demonstrate access to larger system sizes than alternative approaches, and CPU--GPU comparisons confirm significant speedups. In particular, we also provide code for constructing the quantum sun model Hamiltonian, a toy model of a many-body ergodicity-breaking transition. While our focus is on many-body Hamiltonians, Polfed$.$jl may be applied to any large sparse matrix.

cond-mat.stat-mechCross-listedarXiv:2605.10191•May 12, 2026•3 citations

An Improved Finite Temperature Lanczos Method and Its Application to the Spin-1/2 Heisenberg Model on the Kagome Lattice

Tomo Munehisa

We present an improvement of the finite temperature Lanczos method in order to apply this method to systems at very low temperature. One proposal is to introduce two steps in this method. In the first step, we use the Chebyshev polynomial expansion to calculate exp(-H/T1) random vector> at moderate temperature T1. In the second step, we apply the ordinary finite temperature Lanczos method using the calculated state as the initial state of the Lanczos method. Another proposal is to employ a sampling method for selecting a random vector. By this sampling, we can improve an efficiency of calculations. Using the improved finite temperature Lanczos method, we calculate the specific heat of the spin-1/2 Heisenberg model on the kagome lattices of 27 and 30 sites.

World Journal of Condensed Matter Physics•Jan 1, 2014•12 citations
We extend a recent GPU implementation of the finite-temperature Lanczos method (FTLM) for Heisenberg spin Hamiltonians, which uses only total-magnetization symmetry, to the full permutation symmetry, including non-Abelian point and space groups. For highly symmetric clusters such as icosahedral polyhedra, the multidimensional irreducible representations (irreps) of the permutation group reduce the block dimensions substantially further than any Abelian subgroup. Here, we provide a matrix-free formalism (avoiding explicit storage of the projected Hamiltonian) for using such symmetries. The implementation applies equally to Abelian groups, retaining the advantages of GPU acceleration. Several cluster topologies are built in; beyond these, symmetry groups can be supplied as site-permutation generators, with irrep matrices computed automatically, so that user-defined clusters run without any code changes. We demonstrate the approach in production runs on a single NVIDIA B200 accelerator for the s=3/2 Heisenberg antiferromagnet on the dodecahedron (Hilbert-space dimension 4^20 ~ 1.1x10^12) and for the s=1/2 square lattice of 5x8 sites (M=0 dimension 1.4x10^11). With R=24 random vectors per symmetry block and 60 Lanczos steps, the dodecahedron campaign (with the largest iterated symmetry block having a dimension of 3.6x10^9) requires about 50 GPU-hours. The code is openly available under the Apache-2.0 license at https://github.com/ghasdeke/ftlm-pg-gpu, archived at DOI: 10.5281/zenodo.21445872.
We present Polfed...jl, an open-source Julia package implementing the Polynomially Filtered Exact Diagonalization (POLFED) algorithm for computing mid-spectrum eigenvalues and eigenvectors (shortly, eigenpairs) of quantum many-body Hamiltonians. Access to such eigenpairs is essential for studying non-equilibrium many-body physics, but is hindered by the exponential growth of Hilbert-space dimension. POLFED addresses this challenge through a polynomial spectral transformation evaluated on the fly within a Lanczos iteration, preserving Hamiltonian sparsity and substantially reducing memory costs compared to other diagonalization methods. The package supports flexible energy targeting, automatic optimization of the spectral mapping for structured Hamiltonians, and GPU acceleration, which is particularly effective since the dominant computational cost reduces to repeated sparse matrix-vector multiplications. Benchmarks on disordered spin-chain and fermionic models demonstrate access to larger system sizes than alternative approaches, and CPU--GPU comparisons confirm significant speedups. In particular, we also provide code for constructing the quantum sun model Hamiltonian, a toy model of a many-body ergodicity-breaking transition. While our focus is on many-body Hamiltonians, Polfed...jl may be applied to any large sparse matrix.
We present an improvement of the finite temperature Lanczos method in order to apply this method to systems at very low temperature. One proposal is to introduce two steps in this method. In the first step, we use the Chebyshev polynomial expansion to calculate exp(-H/T1) random vector> at moderate temperature T1. In the second step, we apply the ordinary finite temperature Lanczos method using the calculated state as the initial state of the Lanczos method. Another proposal is to employ a sampling method for selecting a random vector. By this sampling, we can improve an efficiency of calculations. Using the improved finite temperature Lanczos method, we calculate the specific heat of the spin-1/2 Heisenberg model on the kagome lattices of 27 and 30 sites.