2019
DOI: 10.1016/j.cpc.2018.08.010
|View full text |Cite
|
Sign up to set email alerts
|

Massively parallel implementation and approaches to simulate quantum dynamics using Krylov subspace techniques

Abstract: We have developed an application and implemented parallel algorithms in order to provide a computational framework suitable for massively parallel supercomputers to study the unitary dynamics of quantum systems. We use renowned parallel libraries such as PETSc/SLEPc combined with high-performance computing approaches in order to overcome the large memory requirements to be able to study systems whose Hilbert space dimension comprises over 9 billion independent quantum states. Moreover, we provide descriptions … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
13
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
9
1

Relationship

1
9

Authors

Journals

citations
Cited by 17 publications
(13 citation statements)
references
References 30 publications
0
13
0
Order By: Relevance
“…where |e 1 is the first unit vector of the Krylov subspace. The approximation becomes an exact solution when m ≥ D, however, the method has been proven to be accurate even if m D for short enough time-steps [228,229]. For the particular case when m D, the much smaller matrix exponential exp(−itA m ) can be evaluated using standard numerical techniques, such as a Padè approximation with a scaling-andsquaring algorithm.…”
Section: I62 High-order Correlation Functions In Time 137mentioning
confidence: 99%
“…where |e 1 is the first unit vector of the Krylov subspace. The approximation becomes an exact solution when m ≥ D, however, the method has been proven to be accurate even if m D for short enough time-steps [228,229]. For the particular case when m D, the much smaller matrix exponential exp(−itA m ) can be evaluated using standard numerical techniques, such as a Padè approximation with a scaling-andsquaring algorithm.…”
Section: I62 High-order Correlation Functions In Time 137mentioning
confidence: 99%
“…For our simulations we choose the parameters (h x /J, h z /J) = (0.9045, 0.809), corresponding to a nonintegrable regime in which thermalization is known to be fast [25,26] (in what follows we set J = 1 as the unit of energy for Hamiltonian dynamics). We use a Krylov-space method to efficiently time-evolve the state [27].…”
mentioning
confidence: 99%
“…To treat the many-body problem and considering the interacting term ∆ = 0.0, we choose the exact diagonalizing (ED) method but note that ED is limited to small system size L ≈ 14 due to exponential growth of the Hilbert space dimension 2 L . However, to study the dynamic of many-body systems, the Krylov-space technique with exploiting the sparse structure of Hamiltonian can push limit bigger system size [26][27][28]. We notice for the long-range interaction the Hamiltonian matrix is not sparse as a short-range case.…”
Section: Resultsmentioning
confidence: 96%