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

On time-step bounds in unitary quantum evolution using the Lanczos method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
15
0

Year Published

2008
2008
2020
2020

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 25 publications
(15 citation statements)
references
References 10 publications
0
15
0
Order By: Relevance
“…In the presence of the external field A(t), the Hamiltonian is time dependent, Ĥ → Ĥ(t), and hence we have to solve the time dependent Schrödinger equation to evolve the state |Ψ(t) in time. For this purpose, we employ the time dependent ED method based on the Lanczos algorithm, where the time evolution with a short time step δt is calculated in the corresponding Krylov subspace generated by M L Lanczos iterations [31,32]. In our calculation, we use the finite-size clusters of L sites with periodic boundary conditions (PBC).…”
Section: Methods and Correlation Functionsmentioning
confidence: 99%
“…In the presence of the external field A(t), the Hamiltonian is time dependent, Ĥ → Ĥ(t), and hence we have to solve the time dependent Schrödinger equation to evolve the state |Ψ(t) in time. For this purpose, we employ the time dependent ED method based on the Lanczos algorithm, where the time evolution with a short time step δt is calculated in the corresponding Krylov subspace generated by M L Lanczos iterations [31,32]. In our calculation, we use the finite-size clusters of L sites with periodic boundary conditions (PBC).…”
Section: Methods and Correlation Functionsmentioning
confidence: 99%
“…In Table 2, we compare results obtained choosing t according to Eq. (20) and with the Park and Light [6] and the Mohankumar and Auerbach (MA) [17] criteria, for the same test problem. Both the other methods are based on the Taylor expansion of the matrix exponential.…”
Section: Calculationsmentioning
confidence: 99%
“…In this communication we propose new ideas for using the short iterative Lanczos (SIL) approach. The SIL algorithm was proposed by Park and Light [6] and has been developed by other authors [11][12][13][14][15][16][17][18]. To solve Eq.…”
Section: Introductionmentioning
confidence: 99%
“…We assume that for t = 0 the system is in the Mott insulating ground state and evolve the state forward in time usingĤ(t ), which isĤ with the time-dependent hopping. We employ the time-dependent exact diagonalization (ED) method [30,31] for a finite-size cluster with periodic boundary conditions (PBC), and the state at time t is indicated by | (t ) . For t − t 0 σ p , the resulting state is projected onto the eigenstates |ψ m (eigenenergies ε m ) of the unperturbed Hubbard model, obtained by full (exact) diagonalization.…”
mentioning
confidence: 99%