Papers
Topics
Authors
Recent
Search
2000 character limit reached

Efficient simulation of wave-packet dynamics on multiple coupled potential surfaces with split potential propagation

Published 23 Mar 2016 in physics.chem-ph and physics.comp-ph | (1603.07242v1)

Abstract: We present a simple method to expedite simulation of quantum wave-packet dynamics by more than a factor of $2$ with the Strang split-operator propagation. Dynamics of quantum wave-packets are often evaluated using the the \emph{Strang} split-step propagation, where the kinetic part of the Hamiltonian T^\hat{T} and the potential part V^\hat{V} are piecewise integrated according to e<sup>−</sup>iH^δt≈e<sup>−</sup>iV^δt/2e<sup>−</sup>iT^δte<sup>−</sup>iV^δt/2e<sup>{-</sup> i \hat{H} \delta t} \approx e<sup>{-</sup> i \hat{V} \delta t/2} e<sup>{-</sup> i \hat{T}\delta t} e<sup>{-</sup> i \hat{V} \delta t/2}, which is accurate to second order in the propagation time δt\delta t. In molecular quantum dynamics, the potential propagation occurs over multiple coupled potential surfaces and requires matrix exponentiation for each position in space and time which is computationally demanding. Our method employs further splitting of the potential matrix V^\hat{V} into a diagonal space dependent part V^<em>D(R)\hat{V}<em>{D}(R) and an off-diagonal time-dependent coupling-field V^</em>OD(t)\hat{V}</em>{OD}(t), which then requires only a single matrix exponentiation for each time-step, considerably reducing the calculation time even in the simplest two-surface interaction (∼\sim70\% reduction observed in potential propagation time). We analyze the additional error due to the potential splitting and show it to be small compared to the inherent error associated with the kinetic/potential splitting.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.