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:2005.09534 · Physical Review Letters

Polynomially Filtered Exact Diagonalization Approach to Many-Body Localization

Piotr Sierant, Maciej Lewenstein, Jakub Zakrzewski

Published Oct 9, 2020• 147 citations
arXivHTMLPDF

Abstract

Polynomially filtered exact diagonalization method (POLFED) for large sparse matrices is introduced. The algorithm finds an optimal basis of a subspace spanned by eigenvectors with eigenvalues close to a specified energy target by a spectral transformation using a high order polynomial of the matrix. The memory requirements scale better with system size than in the state-of-the-art shift-invert approach. The potential of POLFED is demonstrated examining many-body localization transition in 1D interacting quantum spin-1/2 chains. We investigate the disorder strength and system size scaling of Thouless time. System size dependence of bipartite entanglement entropy and of the gap ratio highlights the importance of finite-size effects. We discuss possible scenarios regarding the many-body localization transition obtaining estimates for the critical disorder strength.

DOI
10.1103/physrevlett.125.156601

Related papers

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•0 citations

Stability of many-body localization in Floquet systems

Piotr Sierant, Maciej Lewenstein, Antonello Scardicchio +1 more

We study many-body localization (MBL) transition in disordered Floquet systems using a polynomially filtered exact diagonalization (POLFED) algorithm. We focus on disordered kicked Ising model and quantitatively demonstrate that finite-size effects at the MBL transition are less severe than in the random field XXZ spin chains widely studied in the context of MBL. Our conclusions extend also to other disordered Floquet models, indicating smaller finite-size effects than those observed in the usually considered disordered autonomous spin chains. We observe consistent signatures of the transition to MBL phase for several indicators of ergodicity breaking in the kicked Ising model. Moreover, we show that an assumption of a power-law divergence of the correlation length at the MBL transition yields a critical exponent $\ensuremath{\nu}\ensuremath{\approx}2$, consistent with the Harris criterion for one-dimensional disordered systems.

arXiv:2203.15697•Physical review. B./Physical review. B•Mar 14, 2023•52 citations

Polynomial filter diagonalization of large Floquet unitary operators

David J. Luitz

Periodically driven quantum many-body systems play a central role for our understanding of nonequilibrium phenomena. For studies of quantum chaos, thermalization, many-body localization and time crystals, the properties of eigenvectors and eigenvalues of the unitary evolution operator, and their scaling with physical system size L L are of interest. While for static systems, powerful methods for the partial diagonalization of the Hamiltonian were developed, the unitary eigenproblem remains daunting. % In this paper, we introduce a Krylov space diagonalization method to obtain exact eigenpairs of the unitary Floquet operator with eigenvalue closest to a target on the unit circle. Our method is based on a complex polynomial spectral transformation given by the geometric sum, leading to rapid convergence of the Arnoldi algorithm. We demonstrate that our method is much more efficient than the shift invert method in terms of both runtime and memory requirements, pushing the accessible system sizes to the realm of 20 qubits, with Hilbert space dimensions \geq 10^6 ≥ 10 6 .

arXiv:2102.05054•SciPost Physics•Aug 3, 2021•14 citations

Many-body localization in XY spin chains with long-range interactions: An exact-diagonalization study

Sebastian Schiffer, Jia Wang, Xia-Ji Liu +1 more

We investigate the transition from the many-body localized phase to the ergodic thermalized phase at an infinite temperature in an $XY$ spin chain with $L$ spins, which experiences power-law decaying interactions in the form of ${V}_{ij}\ensuremath{\propto}1/{\left|i\ensuremath{-}j\right|}^{\ensuremath{\alpha}}$ ($i,j=1,...,L$) and a random transverse field. By performing large-scale exact diagonalization for the chain size up to $L=18$, we systematically analyze the energy gap statistics, the half-chain entanglement entropy, and the uncertainty of the entanglement entropy of the system at different interaction exponents $\ensuremath{\alpha}$. The finite-size critical scaling allows us to determine the critical disorder strength ${W}_{c}$ and the critical exponent $\ensuremath{\nu}$ at the many-body-localization phase transition, as a function of the interaction exponent $\ensuremath{\alpha}$ in the limit $L\ensuremath{\rightarrow}\ensuremath{\infty}$. We find that both ${W}_{c}$ and $\ensuremath{\nu}$ diverge when $\ensuremath{\alpha}$ decreases to a critical power of ${\ensuremath{\alpha}}_{c}\ensuremath{\simeq}1.16\ifmmode\pm\else\textpm\fi{}0.17$, indicating the absence of many-body localization for $\ensuremath{\alpha}<{\ensuremath{\alpha}}_{c}$. Our result differs from the analytical prediction of ${\ensuremath{\alpha}}_{c}=3/2$ found in a previous work based on a scaling argument [A. L. Burin, Phys. Rev. B 92, 104428 (2015)], but is close to the recent numerical result ${\ensuremath{\alpha}}_{c}\ensuremath{\approx}1$ obtained from quantum dynamics simulation [A. Safavi-Naini, M. L. Wall, O. L. Acevedo, A. M. Rey, and R. M. Nandkishore, Phys. Rev. A 99, 033610 (2019)].

arXiv:1908.04031•Physical Review A•Dec 9, 2019•23 citations

Shift-invert diagonalization of large many-body localizing spin chains

Pietracaprina, F., Nicolas Macé, David J. Luitz +1 more

We provide a pedagogical review on the calculation of highly excited eigenstates of disordered interacting quantum systems which can undergo a many-body localization (MBL) transition, using shift-invert exact diagonalization. We also provide an example code at https://bitbucket.org/dluitz/sinvert_mbl. Through a detailed analysis of the simulational parameters of the random field Heisenberg spin chain, we provide a practical guide on how to perform efficient computations. We present data for mid-spectrum eigenstates of spin chains of sizes up to L = 26. This work is also geared towards readers with interest in efficiency of parallel sparse linear algebra techniques that will find a challenging application in the MBL problem.

•Nov 6, 2018•119 citations

Shift-invert diagonalization of large many-body localizing spin chains

Francesca Pietracaprina, Nicolas Macé, David J. Luitz +1 more

We provide a pedagogical review on the calculation of highly excited eigenstates of disordered interacting quantum systems which can undergo a many-body localization (MBL) transition, using shift-invert exact diagonalization. We also provide an example code at https://bitbucket.org/dluitz/sinvert_mbl. Through a detailed analysis of the simulational parameters of the random field Heisenberg spin chain, we provide a practical guide on how to perform efficient computations. We present data for mid-spectrum eigenstates of spin chains of sizes up to L=26 L = 26 . This work is also geared towards readers with interest in efficiency of parallel sparse linear algebra techniques that will find a challenging application in the MBL problem.

arXiv:1803.05395•SciPost Physics•Nov 6, 2018•119 citations
Polynomially filtered exact diagonalization method (POLFED) for large sparse matrices is introduced. The algorithm finds an optimal basis of a subspace spanned by eigenvectors with eigenvalues close to a specified energy target by a spectral transformation using a high order polynomial of the matrix. The memory requirements scale better with system size than in the state-of-the-art shift-invert approach. The potential of POLFED is demonstrated examining many-body localization transition in 1D interacting quantum spin-1/2 chains. We investigate the disorder strength and system size scaling of Thouless time. System size dependence of bipartite entanglement entropy and of the gap ratio highlights the importance of finite-size effects. We discuss possible scenarios regarding the many-body localization transition obtaining estimates for the critical disorder strength.
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 study many-body localization (MBL) transition in disordered Floquet systems using a polynomially filtered exact diagonalization (POLFED) algorithm. We focus on disordered kicked Ising model and quantitatively demonstrate that finite-size effects at the MBL transition are less severe than in the random field XXZ spin chains widely studied in the context of MBL. Our conclusions extend also to other disordered Floquet models, indicating smaller finite-size effects than those observed in the usually considered disordered autonomous spin chains. We observe consistent signatures of the transition to MBL phase for several indicators of ergodicity breaking in the kicked Ising model. Moreover, we show that an assumption of a power-law divergence of the correlation length at the MBL transition yields a critical exponent $\ensuremath{\nu}\ensuremath{\approx}2$, consistent with the Harris criterion for one-dimensional disordered systems.
Periodically driven quantum many-body systems play a central role for our understanding of nonequilibrium phenomena. For studies of quantum chaos, thermalization, many-body localization and time crystals, the properties of eigenvectors and eigenvalues of the unitary evolution operator, and their scaling with physical system size L L are of interest. While for static systems, powerful methods for the partial diagonalization of the Hamiltonian were developed, the unitary eigenproblem remains daunting. % In this paper, we introduce a Krylov space diagonalization method to obtain exact eigenpairs of the unitary Floquet operator with eigenvalue closest to a target on the unit circle. Our method is based on a complex polynomial spectral transformation given by the geometric sum, leading to rapid convergence of the Arnoldi algorithm. We demonstrate that our method is much more efficient than the shift invert method in terms of both runtime and memory requirements, pushing the accessible system sizes to the realm of 20 qubits, with Hilbert space dimensions \geq 10^6 ≥ 10 6 .
We investigate the transition from the many-body localized phase to the ergodic thermalized phase at an infinite temperature in an XYXYXY spin chain with LLL spins, which experiences power-law decaying interactions in the form of ${V}_{ij}\ensuremath{\propto}1/{\left|i\ensuremath{-}j\right|}^{\ensuremath{\alpha}}$ (i,j=1,...,Li,j=1,...,Li,j=1,...,L) and a random transverse field. By performing large-scale exact diagonalization for the chain size up to L=18L=18L=18, we systematically analyze the energy gap statistics, the half-chain entanglement entropy, and the uncertainty of the entanglement entropy of the system at different interaction exponents $\ensuremath{\alpha}$. The finite-size critical scaling allows us to determine the critical disorder strength Wc{W}_{c}Wc​ and the critical exponent $\ensuremath{\nu}$ at the many-body-localization phase transition, as a function of the interaction exponent $\ensuremath{\alpha}$ in the limit $L\ensuremath{\rightarrow}\ensuremath{\infty}$. We find that both Wc{W}_{c}Wc​ and $\ensuremath{\nu}$ diverge when $\ensuremath{\alpha}$ decreases to a critical power of ${\ensuremath{\alpha}}_{c}\ensuremath{\simeq}1.16\ifmmode\pm\else\textpm\fi{}0.17$, indicating the absence of many-body localization for $\ensuremath{\alpha}<{\ensuremath{\alpha}}_{c}$. Our result differs from the analytical prediction of ${\ensuremath{\alpha}}_{c}=3/2$ found in a previous work based on a scaling argument [A. L. Burin, Phys. Rev. B 92, 104428 (2015)], but is close to the recent numerical result ${\ensuremath{\alpha}}_{c}\ensuremath{\approx}1$ obtained from quantum dynamics simulation [A. Safavi-Naini, M. L. Wall, O. L. Acevedo, A. M. Rey, and R. M. Nandkishore, Phys. Rev. A 99, 033610 (2019)].
We provide a pedagogical review on the calculation of highly excited eigenstates of disordered interacting quantum systems which can undergo a many-body localization (MBL) transition, using shift-invert exact diagonalization. We also provide an example code at https://bitbucket.org/dluitz/sinvert_mbl. Through a detailed analysis of the simulational parameters of the random field Heisenberg spin chain, we provide a practical guide on how to perform efficient computations. We present data for mid-spectrum eigenstates of spin chains of sizes up to L = 26. This work is also geared towards readers with interest in efficiency of parallel sparse linear algebra techniques that will find a challenging application in the MBL problem.
We provide a pedagogical review on the calculation of highly excited eigenstates of disordered interacting quantum systems which can undergo a many-body localization (MBL) transition, using shift-invert exact diagonalization. We also provide an example code at https://bitbucket.org/dluitz/sinvert_mbl. Through a detailed analysis of the simulational parameters of the random field Heisenberg spin chain, we provide a practical guide on how to perform efficient computations. We present data for mid-spectrum eigenstates of spin chains of sizes up to L=26 L = 26 . This work is also geared towards readers with interest in efficiency of parallel sparse linear algebra techniques that will find a challenging application in the MBL problem.