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

Parallelization of Lanczos algorithm applied for quantum spin systems

Tôru Sakai

Published May 31, 2004• 0 citations
OpenAlex

Related papers

Finite Temperature Simulation Based on Lanczos Algorithm for Low-Dimensional Quantum Systems

Tôru Sakai

Springer proceedings in physics•Jan 1, 2004•0 citations

Infinite-Size Density Matrix Renormalization Group with Parallel Hida’s Algorithm

Hiroshi Ueda

In this study, we report a parallel algorithm for the infinite-size density matrix renormalization group (iDMRG) that is applicable to one-dimensional (1D) quantum systems with $\ell$-site periods, where $\ell$ is an even number. It combines Hida's iDMRG applied to random 1D spin systems with a variant of McCulloch's wavefunction prediction. This allows us to apply $\ell/2$ times of computational power to accelerate the investigation of multi-leg frustrated quantum systems in the thermodynamic limit, which is a challenging simulation. We performed benchmark calculations for a spin-1/2 Heisenberg model on a Kagome cylinder YC8 using the parallel iDMRG, and found that the proposed iDMRG was efficiently parallelized for shared memory and distributed memory systems, and provided such bulk physical quantities as total energy, bond strength on nearest neighbor spins, and spin--spin correlation functions and their correlation lengths without finite-size effects. Moreover, the variant of the wavefunction prediction sped up Lanczos methods in the parallel iDMRG by approximately three times.

arXiv:1606.06790•Journal of the Physical Society of Japan•Jul 2, 2018•4 citations

Study of Quantum Spin Systems by Largescale Parallel Calculatios

Hideyuki Nakano, Hibiki Nakamura

Annual report of National Institute for Fusion Science/Annual report•Jan 1, 2015•0 citations

Sublattice coding algorithm and distributed memory parallelization for large-scale exact diagonalizations of quantum many-body systems

Alexander Wietek, Andreas Martin Läuchli

We present algorithmic improvements for fast and memory-efficient use of discrete spatial symmetries in exact diagonalization computations of quantum many-body systems. These techniques allow us to work flexibly in the reduced basis of symmetry-adapted wave functions. Moreover, a parallelization scheme for the Hamiltonian-vector multiplication in the Lanczos procedure for distributed memory machines avoiding load-balancing problems is proposed. We demonstrate that using these methods low-energy properties of systems of up to 50 spin-$1/2$ particles can be successfully determined.

arXiv:1804.05028•Physical review. E•Sep 26, 2018•60 citations

Diagonalizing Quantum Spin Models on Parallel Machine

Yuk-Lin Chan, Hai‐Qing Lin

APS•Mar 1, 2004•0 citations

Massively parallel simulations of strong electronic correlations: Realistic Coulomb vertex and multiplet effects

M. Baumgärtel, Khaldoon Ghanem, Amin Kiani +4 more

We discuss the efficient implementation of general impurity solvers for dynamical mean-field theory. We show that both Lanczos and quantum Monte Carlo in different flavors (Hirsch-Fye, continuous-time hybridization- and interaction-expansion) exhibit excellent scaling on massively parallel supercomputers. We apply these algorithms to simulate realistic model Hamiltonians including the full Coulomb vertex, crystal-field splitting, and spin-orbit interaction. We discuss how to remove the sign problem in the presence of non-diagonal crystal-field and hybridization matrices. We show how to extract the physically observable quantities from imaginary time data, in particular correlation functions and susceptibilities. Finally, we present benchmarks and applications for representative correlated systems.

The European Physical Journal Special Topics•Jul 1, 2017•2 citations
In this study, we report a parallel algorithm for the infinite-size density matrix renormalization group (iDMRG) that is applicable to one-dimensional (1D) quantum systems with ℓ\ellℓ-site periods, where ℓ\ellℓ is an even number. It combines Hida's iDMRG applied to random 1D spin systems with a variant of McCulloch's wavefunction prediction. This allows us to apply ℓ/2\ell/2ℓ/2 times of computational power to accelerate the investigation of multi-leg frustrated quantum systems in the thermodynamic limit, which is a challenging simulation. We performed benchmark calculations for a spin-1/2 Heisenberg model on a Kagome cylinder YC8 using the parallel iDMRG, and found that the proposed iDMRG was efficiently parallelized for shared memory and distributed memory systems, and provided such bulk physical quantities as total energy, bond strength on nearest neighbor spins, and spin--spin correlation functions and their correlation lengths without finite-size effects. Moreover, the variant of the wavefunction prediction sped up Lanczos methods in the parallel iDMRG by approximately three times.
We present algorithmic improvements for fast and memory-efficient use of discrete spatial symmetries in exact diagonalization computations of quantum many-body systems. These techniques allow us to work flexibly in the reduced basis of symmetry-adapted wave functions. Moreover, a parallelization scheme for the Hamiltonian-vector multiplication in the Lanczos procedure for distributed memory machines avoiding load-balancing problems is proposed. We demonstrate that using these methods low-energy properties of systems of up to 50 spin-1/21/21/2 particles can be successfully determined.
We discuss the efficient implementation of general impurity solvers for dynamical mean-field theory. We show that both Lanczos and quantum Monte Carlo in different flavors (Hirsch-Fye, continuous-time hybridization- and interaction-expansion) exhibit excellent scaling on massively parallel supercomputers. We apply these algorithms to simulate realistic model Hamiltonians including the full Coulomb vertex, crystal-field splitting, and spin-orbit interaction. We discuss how to remove the sign problem in the presence of non-diagonal crystal-field and hybridization matrices. We show how to extract the physically observable quantities from imaginary time data, in particular correlation functions and susceptibilities. Finally, we present benchmarks and applications for representative correlated systems.