TY - JOUR

T1 - Iterative blip-summed path integral for quantum dynamics in strongly dissipative environments

AU - Makri, Nancy

N1 - Funding Information:
This material is based upon work supported by the National Science Foundation under Award No. CHE 13-62826.
Publisher Copyright:
© 2017 Author(s).

PY - 2017/4/7

Y1 - 2017/4/7

N2 - The iterative decomposition of the blip-summed path integral [N. Makri, J. Chem. Phys. 141, 134117 (2014)] is described. The starting point is the expression of the reduced density matrix for a quantum system interacting with a harmonic dissipative bath in the form of a forward-backward path sum, where the effects of the bath enter through the Feynman-Vernon influence functional. The path sum is evaluated iteratively in time by propagating an array that stores blip configurations within the memory interval. Convergence with respect to the number of blips and the memory length yields numerically exact results which are free of statistical error. In situations of strongly dissipative, sluggish baths, the algorithm leads to a dramatic reduction of computational effort in comparison with iterative path integral methods that do not implement the blip decomposition. This gain in efficiency arises from (i) the rapid convergence of the blip series and (ii) circumventing the explicit enumeration of between-blip path segments, whose number grows exponentially with the memory length. Application to an asymmetric dissipative two-level system illustrates the rapid convergence of the algorithm even when the bath memory is extremely long.

AB - The iterative decomposition of the blip-summed path integral [N. Makri, J. Chem. Phys. 141, 134117 (2014)] is described. The starting point is the expression of the reduced density matrix for a quantum system interacting with a harmonic dissipative bath in the form of a forward-backward path sum, where the effects of the bath enter through the Feynman-Vernon influence functional. The path sum is evaluated iteratively in time by propagating an array that stores blip configurations within the memory interval. Convergence with respect to the number of blips and the memory length yields numerically exact results which are free of statistical error. In situations of strongly dissipative, sluggish baths, the algorithm leads to a dramatic reduction of computational effort in comparison with iterative path integral methods that do not implement the blip decomposition. This gain in efficiency arises from (i) the rapid convergence of the blip series and (ii) circumventing the explicit enumeration of between-blip path segments, whose number grows exponentially with the memory length. Application to an asymmetric dissipative two-level system illustrates the rapid convergence of the algorithm even when the bath memory is extremely long.

UR - http://www.scopus.com/inward/record.url?scp=85016727720&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85016727720&partnerID=8YFLogxK

U2 - 10.1063/1.4979197

DO - 10.1063/1.4979197

M3 - Article

C2 - 28390349

AN - SCOPUS:85016727720

VL - 146

JO - Journal of Chemical Physics

JF - Journal of Chemical Physics

SN - 0021-9606

IS - 13

M1 - 134101

ER -