.png){kind=icon}
.png){kind=icon}
Return
Parallel time-dependent variational principle algorithm for matrix product states
.png){kind=icon}
OA
AI
DOI：10.1103/PhysRevB.101.235123.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Combining the time-dependent variational principle (TDVP) algorithm with the parallelization scheme introduced by Stoudenmire and White for the density matrix renormalization group (DMRG), we present the first parallel matrix product state (MPS) algorithm capable of time evolving one-dimensional (1D) quantum lattice systems with long-range interactions. We benchmark the accuracy and performance of the algorithm by simulating quenches in the long-range Ising and XY models. We show that our code scales well up to 32 processes, with parallel efficiencies as high as 86%. Finally, we calculate the dynamical correlation function of a 201-site Heisenberg XXX spin chain with 1/r(2) interactions, which is challenging to compute sequentially. These results pave the way for the application of tensor networks to increasingly complex many-body systems.
Keywords:
ANTIFERROMAGNETIC HEISENBERG CHAIN
RENORMALIZATION-GROUP ALGORITHMS
RANGE INTERACTIONS
QUANTUM SIMULATOR
GROUND-STATE
SYSTEMS
IMPLEMENTATION
EQUIVALENCE
PROPAGATION
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.7
Papers:
15.4W
Citations:
41.0W
View more organizations