Computing eigenpairs of quantum many-body systems with Polfed.jl
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914562411855872 |
|---|---|
| author | Pintar, Rok Pawlik, Konrad Świętek, Rafał Hopjan, Miroslav Šuntajs, Jan Zakrzewski, Jakub Sierant, Piotr Vidmar, Lev |
| author_facet | Pintar, Rok Pawlik, Konrad Świętek, Rafał Hopjan, Miroslav Šuntajs, Jan Zakrzewski, Jakub Sierant, Piotr Vidmar, Lev |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_10191 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Computing eigenpairs of quantum many-body systems with Polfed.jl Pintar, Rok Pawlik, Konrad Świętek, Rafał Hopjan, Miroslav Šuntajs, Jan Zakrzewski, Jakub Sierant, Piotr Vidmar, Lev Statistical Mechanics Disordered Systems and Neural Networks Strongly Correlated Electrons Quantum Physics 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. |
| title | Computing eigenpairs of quantum many-body systems with Polfed.jl |
| topic | Statistical Mechanics Disordered Systems and Neural Networks Strongly Correlated Electrons Quantum Physics |
| url | https://arxiv.org/abs/2605.10191 |