The density matrix renormalization group algorithm on kilo-processor architectures: implementation and trade-offs
arXiv:1309.5571 · doi:10.1016/j.cpc.2014.02.021
Abstract
In the numerical analysis of strongly correlated quantum lattice models one of the leading algorithms developed to balance the size of the effective Hilbert space and the accuracy of the simulation is the density matrix renormalization group (DMRG) algorithm, in which the run-time is dominated by the iterative diagonalization of the Hamilton operator. As the most time-dominant step of the diagonalization can be expressed as a list of dense matrix operations, the DMRG is an appealing candidate to fully utilize the computing power residing in novel kilo-processor architectures. In the paper a smart hybrid CPU-GPU implementation is presented, which exploits the power of both CPU and GPU and tolerates problems exceeding the GPU memory size. Furthermore, a new CUDA kernel has been designed for asymmetric matrix-vector multiplication to accelerate the rest of the diagonalization. Besides the evaluation of the GPU implementation, the practical limits of an FPGA implementation are also discussed.
arXiv comment14 pages, 20 figures
References in corpus (17)
- The density-matrix renormalization group in the age of matrix product states
- The density-matrix renormalization group
- Efficient classical simulation of slightly entangled quantum computations
- Ultracold atomic gases in optical lattices: mimicking condensed matter physics and beyond
- Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
- Thermodynamic limit of the density matrix renormalization for the spin-1 Heisenberg chain
- A class of quantum many-body states that can be efficiently simulated
- Controlling the accuracy of the density matrix renormalization group method: The Dynamical Block State Selection approach
- Quantum information analysis of electronic states at different molecular structures
- Programming Languages for Scientific Computing
- Exploring frustrated spin-systems using Projected Entangled Pair States (PEPS)
- Diagonalization- and Numerical Renormalization-Group-Based Methods for Interacting Quantum Systems
- Real-Space Parallel Density Matrix Renormalization Group
- Density matrix numerical renormalization group for non-Abelian symmetries
- Parallelization Strategies for Density Matrix Renormalization Group Algorithms on Shared-Memory Systems
- Implementation of the SU(2) Hamiltonian Symmetry for the DMRG Algorithm
- Improved parallelization techniques for the density matrix renormalization group
Cited by in corpus (6)
- Tensor product methods and entanglement optimization for ab initio quantum chemistry
- Low communication high performance ab initio density matrix renormalization group algorithms
- Numerical Assessment for Accuracy and GPU Acceleration of TD-DMRG Time Evolution Schemes
- Parallel time-dependent variational principle algorithm for matrix product states
- Density Matrix Renormalization Group with Tensor Processing Units
- Effective dimension reduction with mode transformations: Simulating two-dimensional fermionic condensed matter systems