Papers › A Divide-and-Conquer Algorithm for Disordered and Interacting Few-Particle Systems in...

A Divide-and-Conquer Algorithm for Disordered and Interacting Few-Particle Systems in One Dimension

23 Nov 2022arXiv:2211.13089links table onlyarchive 2025-07-28

Lluís Hernández-Mulà, Andreas M. Läuchli

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

We present an algorithm to solve very large one-dimensional disordered and interacting few-particle systems. Our approach exploits the localized nature of the eigenfunctions in real space to achieve a linear scaling with the total system size L. This allows us to solve for all eigenfunctions of single-particle systems with different types of disorder up to one billion sites. Based on this technology we collect very detailed histograms of properties of eigenfunctions, such as the localization length or the participation ratio as a function of their energy. These histograms reveal surprisingly rich fine structures, whose origins we discuss. We also apply the algorithm to single particle problems where not all eigenfunctions are localized and show how this is diagnosed. Finally we extend the algorithm to interacting two-particle problems in the presence of disorder and demonstrate that our algorithm is well suited to analyze the effect of interactions on wavefunctions.

PaperPDFCode

Code

lluisher/divide-and-conquer-solves-localization officialmentioned in papermentioned on GitHub report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections