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.

In addition to their utility as simplified models of condensed phase phenomena,1–10 system-bath (also known as generalized spin-boson) Hamiltonians offer useful quantitative descriptions of a variety of processes, such as those in crystalline solids (where the harmonic bath consists of lattice phonons), chemical reactions (where the bath modes correspond to molecular vibrations orthogonal to the reaction path11,12), and even in some situations where anharmonicity at the microscopic level is quite significant. In the latter case, the harmonic bath13 is commonly associated with linear response (Gaussian statistics) and has been shown14 through a path integral analysis to emerge as the dominant term whenever the process of interest is affected by a large number of degrees of freedom. Recent mean-field calculations in crystals,15 as well as a rigorous quantum-classical path integral (QCPI) simulation of a charge transfer reaction in solution,16 corroborated the quantitative nature of effective harmonic bath descriptions for certain processes in strongly anharmonic environments.

Early studies of the dissipative effects from a harmonic bath on barrier crossing and tunneling were based largely on analytical approximations. The first comprehensive study of tunneling in two-level systems (TLSs) employed the non-interacting blip approximation,4 which allowed the approximate summation of the path integral with the dissipative effects from the harmonic bath included through the Feynman-Vernon influence functional.1 Analytical studies of barrier crossing established the turnover17,18 between weak and strong friction regimes, and energy relaxation was investigated using the Redfield approximations.19 Early numerical simulations using Monte Carlo sampling20,21 to evaluate the discretized path integral were able to capture the short-time behavior of dissipative tunneling systems.22–26 The development of quasi-adiabatic propagator path integral (QuAPI) methods with well behaved propagators,27,28 optimal grid representations,29 and numerically exact iterative decomposition schemes of the path sum,30–41 which do not suffer from the Monte Carlo sign problem,42,43 extended the feasibility of real-time path integral calculations to long times. Several alternative path integral-based and hybrid methods have also been reported in recent years (see, for example, Refs. 44–50). One of these approaches leads to hierarchical equations of motion46,47 (HEOMs) and requires computational effort that depends strongly on the form of the bath spectral density. Finally, the multiconfiguration time-dependent Hartree (MCTDH) methodology51 has also been used to propagate weakly dissipative systems at low temperatures.52 

The major task common to the numerical path integral schemes described above is the inclusion of the influence functional to alter the quantum mechanical amplitude of the bare system. When the system-bath coupling is weak, the dissipative effects captured in the influence functional are rather subtle, amounting to a modest modification of the dynamics from purely coherent to underdamped oscillations. On the other hand, strong system-bath coupling leads to a qualitatively different behavior, characterized by monotonic decay. The dissipative effects of the bath are so strong in this regime that the coherent dynamics of the isolated system no longer serves as a reasonable zeroth order description. Accounting for such a dramatic change of the dynamics is a challenging task that requires major computational effort. It is clear that a more efficient strategy would result from the use of an incoherent model as the starting point; rather than adding decoherence to the oscillatory system amplitude, one should start with a completely incoherent approximation and gradually include quantum coherence effects until convergence is achieved. Recent work53 pointed out that such a fully incoherent starting point is readily obtained by forcing the forward and backward branches of the path integral to be identical. In the semiclassical limit, such a procedure forms the basis of forward-backward semiclassical and linearized semiclassical treatments,54–65 which are quite adequate for systems (e.g., fluids) where quantum coherence effects are naturally quenched.66–71 

In the fully incoherent limit, the discretized double path sum is replaced by a single path sum where the quantum mechanical amplitude along each forward path is multiplied by its complex conjugate corresponding to the identical backward path, thus no phases survive. Quantum coherence arises from phases contributed by forward-backward path pairs that differ over at least one time step. Such elementary time intervals (of length equal to the path integral time step) have been termed4 blips. Thus, the completely incoherent result is the zero-blip limit of the discretized path sum, and corrections are obtained by including path pairs that contain one or more blips.53 

These ideas led to the blip decomposition of the path integral53 for a discrete system coupled to a harmonic bath. The blip series was shown to converge rapidly when the process of interest is characterized by incoherent dynamics. In favorable regimes, converged full-memory results for propagation to a few hundred time steps can be obtained by including only a few blips (and thus an extremely small number of terms relative to the full path sum). In addition, it was shown53 that recasting the double path sum in terms of sum and difference coordinates maps entire segments of the inner between-blip sum on the time-local dynamics of an externally driven Hamiltonian. This mapping allows these portions to be evaluated by ordinary matrix procedures, reducing the computational effort dramatically. Even in the limit where all possible path pairs are included, producing the exact quantum mechanical result, the blip-summed path integral (BSPI) amounts to an exponential reduction of the number of operations compared to an explicit evaluation of the forward-backward path sum.

For a given total time, the contribution of forward-backward path pairs eventually decreases exponentially with the number of blips. Thus, once a sufficient number of blips have been included, the blip series converges rapidly. However, the required number bmax of blips increases with propagation time, such that the inclusion of all contributing path pairs eventually becomes impractical. The evaluation of the path integral for very long times is possible via iterative procedures,30–41 which exploit the decay of memory, i.e., the decreasing magnitude of the nonlocal influence functional interactions with time separation. If implemented within the BSPI formulation, memory truncation will reduce the value of bmax to the number of blips required for convergence only within the memory length, which usually is much shorter than the total propagation time. Conversely, the implementation of the blip decomposition within the iterative path integral methodology offers an excellent way of filtering out path segments of negligible weight and—most importantly—obviates the explicit enumeration of between-blip state sequences, leading to exponential reduction of the number of operations and required storage. Thus, the iterative blip-summed path integral (i-BSPI) leads to dramatic savings in the simulation of long-time incoherent dynamics of quantum dissipative systems.

Section II reviews the blip decomposition of the discretized path integral for a discrete system coupled to a harmonic bath and describes its iterative implementation. The convergence of the procedure is demonstrated in Section III with application to a strongly dissipative asymmetric TLS. Some concluding remarks, along with extensions of the iterative blip methodology, are given in Section IV.

Throughout this paper it is assumed that the quantum mechanical system can be represented in terms of M spin-type or discrete variable representation72–75 (DVR) states |σn, such that the system position operator is

s^=n=1Mσn|σnσn|.
(2.1)

A grid representation of the system coordinate27 is essential for circumventing the “sign problem” that plagues Monte Carlo methods in real time.43 The use of DVR states stems29 from the need for a compact, minimal-sized basis of position-like states, which are necessary for evaluating the system-bath potential coupling in the factored time evolution operator. Further, truncation of the system’s Hilbert space eliminates the rapid oscillations of the real-time propagator,28,76 leading to well-behaved integrands. In the chosen basis, the system Hamiltonian has the generic form

H^0=n,mMhnm|σnσm|.
(2.2)

The system is linearly coupled to a bath of harmonic oscillators,

H^sb=jpj22mj+12mjωj2(xjcjs^mjωj2)2,
(2.3)

and the total Hamiltonian is

H^=H^0+H^sb.
(2.4)

The characteristics of the bath pertaining to the dynamics of the system can be specified collectively via the spectral density function3 

J(ω)π2jcj2mjωjδ(ωωj).
(2.5)

Conversely, the spectral density function can be used to obtain discrete bath parameters, which are useful for treating the bath via classical trajectories. Recent work77 has shown that it is possible to map a polyatomic environment on a discrete harmonic bath directly through a time correlation function computed through a molecular dynamics (MD) simulation. System observables are obtained from the reduced density matrix

ρ(t)=Trb(eiH^t/ρ^(0)eiH^t/),
(2.6)

where the trace is with respect to the bath degrees of freedom. It is frequently assumed4 that the initial density operator factorizes and that the isolated bath is initially in equilibrium at a temperature 1/kBβ, where kB is the Boltzmann constant, i.e.,

ρ^(0)=ρ^s(0)Zb1eβH^b,
(2.7)

where Hb is the Hamiltonian for the uncoupled bath (obtained from Eq. (2.3) by setting cj=0) and Zb is the canonical partition function of the bath. Expressing each of the forward and backward time evolution operators in the discretized path integral form78 with a time step Δt=t/N and integrating out the harmonic bath degrees of freedom leads to the following form for the reduced density matrix,

sN+|ρ(NΔt)|sN=s0+=σ1σMs1+=σ1σMsN1+=σ1σMs0=σ1σMs1=σ1σMsN1=σ1σMsN+|eiH^0Δt/|sN1+s1+|eiH^0Δt/|s0+s0+|ρ(0)|s0×s0|eiH^0Δt/|s1sN1|eiH^0Δt/|sNF(s0+,s1+,,sN+,s0,s1,,sN;Δt).
(2.8)

Here F is the DVR-discretized29 Feynman-Vernon influence functional,1 

F=exp(1k=0Nk=0k(sk+sk)(ηkksk+ηkk*sk)).
(2.9)

The short time propagators in Eq. (2.8) are obtained using the quasi-adiabatic splitting,27 which offers the advantage of an increased time step compared to the Trotter79 factorization. The coefficients ηkk have been given in previous publications32,80 in terms of integrals of the spectral density function, and recent work77 has shown that they can also be obtained directly from MD data.

Equation (2.9) contains nonlocal couplings between non-adjacent time points, which prevent the stepwise evaluation of the path integral by means of simple matrix-vector multiplication,81 a procedure routinely applied to the propagation of low-dimensional systems in the absence of an influence functional. Fortunately, the magnitude of these couplings decays with time separation (as long as the bath is characterized by a continuous spectral density).30 When the time interval (kk)Δt separating the path integral variables sk± and sk± exceeds the time over which the bath correlation function is nonzero, these variables become decoupled and need not be summed simultaneously. Inclusion of the time points that span the bath correlation (or “memory”) time leads to multi-time propagators,30–32 which can be thought of as higher rank tensors31 (with respect to system coordinates) or ordinary matrices33 (with respect to discrete path segments).

Thus, the iterative quasi-adiabatic propagator path integral (i-QuAPI) methodology offers a simple and efficient way of propagating the reduced density matrix in system-bath Hamiltonians characterized by any type of spectral density, provided the bath-induced memory is not very long (i.e., Δkmax 12). This is often the case when the bath consists of a continuum of modes, some of which have frequencies which are high compared to the frequency components of the system. The i-QuAPI methodology efficiently captures the coherent-incoherent transition in the tunneling dynamics of dissipative TLSs, as well as subtle phenomena arising from entanglement or time-dependent fields,82–87 and has found numerous applications in chemistry, biology, or condensed matter physics. The most challenging regime is that of a low-frequency bath strongly coupled to the system, as many time steps must be included in that case to saturate the time nonlocality. Filtering procedures33,34,39,40 discard the vast majority of path segments, which enter with exponentially small weights, retaining only those that are statistically significant. Such filtering techniques extend significantly the applicability of the i-QuAPI methodology to multi-level systems coupled to relatively slow solvents. The i-QuAPI methodology has been generalized to a bath in equilibrium with the initially populated (“donor”) state of the discrete system88 and to equilibrium (non-product) initial conditions37,38 and thus can be used to calculate linear or nonlinear time correlation functions.89 The methodology has also been extended to fermionic baths.90,91 Last, it has been shown92 that iterative decompositions of the real-time path integral are not restricted to harmonic baths but can be implemented in connection with any condensed phase environment as long as the influence functional of the latter can be computed (either exactly or approximately). Most recently, these ideas have found application within the quantum-classical path integral (QCPI) methodology,93–97 which offers a rigorous treatment of the interaction between a quantum system and a complex polyatomic environment whose dynamics is captured via classical trajectories.

The role of blips becomes clear by expressing the Feynman-Vernon influence functional1 in the form

F=exp(1k=0Nk=0kΔsk(ReηkkΔsk+2iImηkks¯k)),
(2.10)

where

s¯=12(s++s),Δs=s+s
(2.11)

are the sum and difference coordinates of each time point. It is clear that the two-time pair kk contributes to the influence functional only if at least the later of the two time points is a blip, i.e., sk+sk. Through the real part of the exponent of Eq. (2.10), blips give rise to damping, quenching the coherent nature of the dynamics described by the bare system propagators. This type of “classical” decoherence, which is dominant at high temperature, is associated with stimulated phonon absorption and emission.10 Interestingly, the memory associated with this classical decoherence is removable through the introduction of auxiliary variables.98 (This classical memory removal is exploited in the QCPI formulation,93 where the bath is described in terms of trajectories sampled from a phase space distribution. However, within the Feynman-Vernon framework, which completely eliminates the bath variables, all memory interactions have to be included explicitly.) When the system-bath coupling is weak, forward-backward path pairs with several blips play the most important role in changing the dynamics from a fully coherent to an underdamped oscillatory behavior. However, if the dissipative effects of the bath are strong, the contribution of multi-blip paths is exponentially small. Thus, in strongly dissipative systems, the most important contribution to the path sum comes from path pairs with a relatively (in comparison to the total propagation length) small number of blips.

Rewriting the forward-backward path sum in terms of sum and difference coordinates, Eq. (2.8) becomes

sN+|ρ(NΔt)|sN=Δs0Δs1ΔsN1[s¯0s¯1s¯N1sN+|eiH^0Δt/|sN1+s1+|eiH^0Δt/|s0+s0+|ρ(0)|s0×s0|eiH^0Δt/|s1sN1|eiH^0Δt/|sNexp(1k=0Nk=0kΔsk(ReηkkΔsk+2iImηkks¯k))],
(2.12)

where sk+,sk are obtained from Eq. (2.11). Here time points with Δsk0 are the blips, and those with Δsk=0 are the “sojourns,” time points where the forward and backward paths coincide. (Note that the inner summation index s¯k at each time point in this expression depends on the outer summation index Δsk. For example, in the case of a TLS with coordinate values σ1=1,σ2=1, the sum/difference coordinate pair takes on the values Δs=±2,s¯=0 and Δs=0,s¯=±1.) Equation (2.12) provides a convenient starting point for a dramatic acceleration of the path sum in two ways:

  • By restricting the outer sum to those path pairs that do not exceed a particular number bmax of blips. As discussed above, in strongly dissipative environments convergence is achieved with relatively small values of bmaxN.

  • Through the replacement of the inner sum by a series of iterative matrix multiplications. This is possible because all couplings of time points between blips are of nearest neighbor type (i.e., there are no sojourn-sojourn couplings in the influence functional). Even if all possible paths (i.e., bmax=N+1) are included, this replacement amounts53 to an exponential reduction of effort compared to Eq. (2.8).

In favorable regimes of incoherent dynamics, the blip decomposition enables the evaluation of the path integral to fairly long times.53 For propagation to N time steps, the number of blip arrangements for a given value of bmax is given by

b=0bmax(N+1)!b!(N+1b)!.
(2.13)

In addition, for an M-state system there are M2M possible pairs of forward and backward coordinates at each blip time point k=0,,N. Thus the total number of forward-backward blip configurations is

b=0bmax(N+1)!b!(N+1b)!Mb(M1)b.
(2.14)

This number grows rapidly with the number N of path integral time steps. In addition, the number of blips required for convergence generally increases with N. To enable propagation to long times, the blip representation of the path integral needs to be re-cast in an iterative form.

To this end, the influence functional couplings are truncated to the memory length of L time steps. The propagation involves an array of forward-backward path segments over the time points k+1,,k+L, which are connected to path segments spanning the time points k,,k+L1 through couplings arising from the system propagator and the influence functional. The present algorithm differs from the i-QuAPI methodology in two important aspects as follows:

  • The maximum number of blips is restricted to the chosen value of bmax, and

  • Only the coordinates of blip points (plus one additional time point) are stored.

To begin, one generates all possible placements of 1,2,,bmax blips over L time points. From each of these blip arrangements, one generates g blip configurations r1,,rg by assigning all possible values of the M system states as the forward and backward coordinates of each blip time point (ensuring the system coordinates of the forward and backward paths are not identical). For example, in the case of a TLS, there are two possible configurations of each blip: the one with forward and backward path coordinates +1 and 1 and the one with forward and backward path coordinates 1 and +1, respectively. The number of blip configurations is given by Eq. (2.14) with N=L1, i.e.,

g(L,bmax)=b=0bmaxL!b!(Lb)!Mb(M1)b.
(2.15)

These blip configurations are stored and indexed by the blip locations and their forward-backward coordinate values, as well as the blip configurations to which they connect (as explained later). If all possible blips are included, i.e., if bmax=L, the blip configurations correspond to the set of all possible forward-backward path segments that span the memory interval, and g(L,L)=(M2M+1)L. (Note that this number is smaller than the total number M2L of forward-backward paths because sojourn segments are not enumerated.)

As seen from Eq. (2.10), all influence functional interactions connect a blip to an earlier blip or a sojourn. To avoid unnecessary increase of storage, the iterative propagation begins from the last time point N and proceeds toward t=0. The propagation involves iteration of an array Rk(sk±,rj) that holds the stored blip configurations rj,j=1,,g over a memory interval corresponding to the time points k,,k+L1, as well as the coordinate values sk+=σ1,,σM, sk=σ1,,σM of the first time point of this interval (regardless of whether this point is a blip or a sojourn).

The initialization step generates the array 𝐑NL. Next, each blip configuration over the time segment NL,,N1 is augmented by the addition of the forward-backward path coordinates at the time point N (see Figure 1). The value of the array 𝐑NL is obtained by including all the system propagator, blip-blip, and blip-sojourn interactions that connect these L+1 time points and summing over all sojourn points (except for point sNL±) and over the coordinates of point N. The sum with respect to sojourn points is performed from the latest toward the earliest time point via a series of M×M matrix-vector multiplications as described in Ref. 53. This procedure avoids explicit enumeration of sojourn segments, which amounts to dramatic savings. Since the number of sojourns is smaller than L, this task scales sub-linearly with the memory length, allowing propagation even when the memory time is very long.

FIG. 1.

Schematic illustration of the initialization step for a TLS with L=8. The diagram shows (inside the large rectangle) one of the stored blip configurations spanning the time points N−8, ⋯, N−1, augmented with the coordinates of time point N (chosen as a sojourn, to yield a diagonal element of the reduced density matrix). The chosen configuration has two blips, located at the points N−6 and N−2. The horizontal red and blue lines indicate the coordinate values of the forward and backward paths, respectively. The hollow squares indicate sojourn points, whose coordinates are not specified. The gray shaded square indicates that the coordinates of this time point, which are not specified in the chosen blip configuration because this point is a sojourn, are specified in the array R. The initialization step sums over the coordinates of time point N and those of all sojourn points, including the blip-blip (curved solid black line) and blip-sojourn (curved dashed black lines) couplings as well as nearest neighbor system propagator elements (green curved lines).

FIG. 1.

Schematic illustration of the initialization step for a TLS with L=8. The diagram shows (inside the large rectangle) one of the stored blip configurations spanning the time points N−8, ⋯, N−1, augmented with the coordinates of time point N (chosen as a sojourn, to yield a diagonal element of the reduced density matrix). The chosen configuration has two blips, located at the points N−6 and N−2. The horizontal red and blue lines indicate the coordinate values of the forward and backward paths, respectively. The hollow squares indicate sojourn points, whose coordinates are not specified. The gray shaded square indicates that the coordinates of this time point, which are not specified in the chosen blip configuration because this point is a sojourn, are specified in the array R. The initialization step sums over the coordinates of time point N and those of all sojourn points, including the blip-blip (curved solid black line) and blip-sojourn (curved dashed black lines) couplings as well as nearest neighbor system propagator elements (green curved lines).

Close modal

Iteration involves propagating 𝐑k+1 backwards in time to 𝐑k,k=NL1,,0. To achieve this, each blip configuration over the time segment k,,k+L1 must be matched with a blip configuration spanning the time interval k+1,,k+L. This is achieved very efficiently by creating at the beginning of the calculation and storing lists of blip configurations to which each blip configuration “connects.” Such matching configurations are illustrated in Figure 2. The propagation proceeds by including the influence functional interactions from the blips of the segment k+1,,k+L to the blip or sojourn of point k and the propagator between points k and k+1 and summing with respect to all blip configurations in the array 𝐑k+1 and the coordinates of time point k+1, if this is a sojourn.

FIG. 2.

(a) A blip configuration with two blips spanning the time points k + 1, , k + L, along with a matching configuration with three blips spanning the time points k, , k + L−1. Note that the blip configuration within the segments k + 1, , k + L−1 is identical. (b) Propagation of Rk+1 to Rk involves the influence functional couplings between blips of the Rk+1 configuration and the time point k, the self-interaction of point k if this happens to be a blip, and the propagator between points k and k + 1. The meaning of the various shapes and colors is the same as in Fig. 1 

FIG. 2.

(a) A blip configuration with two blips spanning the time points k + 1, , k + L, along with a matching configuration with three blips spanning the time points k, , k + L−1. Note that the blip configuration within the segments k + 1, , k + L−1 is identical. (b) Propagation of Rk+1 to Rk involves the influence functional couplings between blips of the Rk+1 configuration and the time point k, the self-interaction of point k if this happens to be a blip, and the propagator between points k and k + 1. The meaning of the various shapes and colors is the same as in Fig. 1 

Close modal

Finally, once the initial time (k=0) is reached, the desired elements of the reduced density matrix ρ(NΔt) are obtained by summing 𝐑0 with respect to the coordinates of all blip configurations located at k=1,,L1 and the coordinates s0±.

The i-BSPI methodology is illustrated on an asymmetric TLS coupled to a dissipative bath. The TLS Hamiltonian is given by

H^0=Ω(|11|+|11|)+ε(|11||11|),
(3.1)

where Ω=1, ε=5, and |1,|1 are localized states with coordinates σ1=1,σ2=1, while the spectral density has the common Ohmic form,

J(ω)π2ξωeω/ωc
(3.2)

with ξ=4 and ωc=2Ω. The bath is initially in equilibrium with the “donor” state 1 at a temperature ωcβ=0.2. The chosen model has been shown97 to exhibit very long memory. In particular, QCPI calculations with free- or donor-state bath reference95 and memory truncation, which automatically account for all classical memory, failed to converge with realistic values of the memory length, indicating that the quantum memory is very long, and convergence was possible only with a dynamically consistent state hopping (DCSH) QCPI scheme97 which captures some of the “quantum memory” effects10 through properly adapted system propagators.

The results of i-BSPI calculations are presented in Figure 3. Because of the strong system-bath coupling, the factorization of the propagator required a small time step ΩΔt=0.075. The reduced density matrix was propagated to its equilibrium value, which required N=600 time steps. It is seen that the long-time plateau value of the donor population depends sensitively on the memory length included. Convergence to better than 0.01 required a memory length of 7.5Ω1, i.e., the inclusion of influence functional couplings spanning L=100 path integral time steps. The long-time value of the converged donor state population is in excellent agreement with the thermodynamic value 0.27, which was obtained from independent calculations using the standard path integral Monte Carlo (PIMC) method. The converged L=100 i-BSPI results match the DCSH-QCPI results within the Monte Carlo statistical error of the latter.

FIG. 3.

Time evolution of the initially populated right-localized state in the asymmetric TLS described in Section III using the i-BSPI methodology with a time step Δt=0.075Ω1 and bmax=3Hollow magenta squares, blue triangles, green circles, and solid red squares show the results of i-BSPI calculations with L = 10, 20, 30, and 50. The solid black line shows the converged i-BSPI results with L = 100. Representative i-BSPI calculations performed with bmax=4 or 5 led to corrections considerably smaller than the size of the markers. The magenta crosses correspond to full i-QuAPI results with L = 10. The black arrow on the right shows the equilibrium value of the population, obtained through a PIMC calculation with a statistical error of 0.005.

FIG. 3.

Time evolution of the initially populated right-localized state in the asymmetric TLS described in Section III using the i-BSPI methodology with a time step Δt=0.075Ω1 and bmax=3Hollow magenta squares, blue triangles, green circles, and solid red squares show the results of i-BSPI calculations with L = 10, 20, 30, and 50. The solid black line shows the converged i-BSPI results with L = 100. Representative i-BSPI calculations performed with bmax=4 or 5 led to corrections considerably smaller than the size of the markers. The magenta crosses correspond to full i-QuAPI results with L = 10. The black arrow on the right shows the equilibrium value of the population, obtained through a PIMC calculation with a statistical error of 0.005.

Close modal

The i-BSPI calculations converged with just bmax=3 blips. For L=10, the bmax=3 i-BSPI results are identical (to three or more significant figures) to the values obtained with full i-QuAPI calculations with the same memory length. However, the i-BSPI methodology can easily handle much longer memory. With L=100, the full i-QuAPI evaluation of the path integral would involve an array of 2200 elements. While path filtering33,34,39,40 would reduce this storage substantially, filtered iterative path integral calculations would still need to store path segments of length L=100. The explicit enumeration of sojourn coordinates for the filter-retained paths would lead to an array of much larger (and likely unmanageable) size. By contrast, the propagated array in the i-BSPI calculation with L=100 stored only about 1.3 × 106 elements.

The i-BSPI methodology presented in this paper offers an extremely efficient way of evaluating the real-time path integral for a discrete system strongly coupled to a harmonic bath that may include fast as well as very slow degrees of freedom. Such regimes are challenging to earlier path integral methods, where the starting point is the bare quantum system, which exhibits coherent behavior. By contrast, the crudest limit of the blip decomposition, the zero-blip term, describes completely incoherent dynamics, which is qualitatively similar to the true behavior of the system in this regime, thus providing a much better starting point. The inclusion of blips gradually adds quantum coherence, until convergence is reached. Because of the strong damping effect of blip-blip interactions, the blip series converges rapidly in strongly dissipative regimes. Just as importantly, the blip decomposition obviates the need for an explicit enumeration of between-blip sojourn path segments, thus eliminating the vast majority of paths, which would necessitate astronomical amounts of storage. For this reason, the BSPI methodology always (even in coherent regimes, where a large number of blips may be required for convergence) leads to exponential acceleration compared to the full evaluation of the discretized path integral with the same time step.

While evaluation of the full blip sum is often possible for fairly long times, the number of blips required for convergence tends to grow with propagation time, eventually becoming prohibitive. The i-BSPI methodology described in this paper enables propagation to very long times by reducing the required number of blips to those required only within the memory interval. Representative calculations presented in Section III show that convergence is reached rapidly, even in regimes of very long memory. It is thus expected that the i-BSPI methodology will offer an efficient and convenient approach for simulating quantum mechanical processes in sluggish, strongly dissipative environments, which tend to be rather challenging.

While implementation of the blip decomposition always reduces the number of operations, the older i-QuAPI algorithm still offers a better choice in weakly dissipative regimes. This is so for several reasons: First, the number of blips required for convergence tends to be large in such parameter regimes, implying less dramatic gains. Second, the i-QuAPI methodology easily yields results at each time step, while intermediate results cannot be extracted easily in the present version of the i-BSPI algorithm. Last, the i-BSPI code is more complex than i-QuAPI.

The development during the last decade or so of alternative approaches to i-QuAPI has allowed accurate simulations of system-bath dynamics in regimes previously inaccessible. As noted earlier, the QCPI methodology93–97 (which is designed for treating complex, anharmonic condensed-phase environments) can also be used to treat harmonic bath dynamics by discretizing the spectral density99 to produce explicit harmonic oscillators, whose initial conditions are sampled by Monte Carlo. In particular, the cumulative quantum memory form100 of QCPI provides an alternative and powerful approach that is well suited to strongly dissipative dynamics. Since the influence functional-based i-BSPI avoids the bath discretization and the use of Monte Carlo sampling, it offers higher efficiency. Further, a methodology based on truncated hierarchical equations of motion46,47 for auxiliary density matrices has emerged as an alternative to path integral/influence functional-based schemes. Unlike the latter, the convergence of the HEOM approach depends critically on the number of exponential terms required to fit the time correlation function of the bath. Thus, while HEOM calculations for the Debye spectral density converge easily, in particular at high temperatures, other spectral density functions can be quite challenging to that method. A stochastic method that is similar in spirit to generalized Langevin dynamics offers yet another alternative for simulating spin-boson dynamics.101 Last, a recently proposed Monte Carlo based “inchworm” method102,103 appears promising.

Besides its use for simulating dissipative dynamics in harmonic environments, the i-BSPI methodology holds promise for accelerating the convergence of path integral calculations in anharmonic media. Such calculations have recently become possible with the development of the QCPI methodology.93–97 QCPI offers a rigorous way of describing the interaction of a quantum system with a complex polyatomic environment, which is described through classical trajectories in full atomistic detail. In particular, the local nature of the quantum paths leads to forces on the classical trajectories that are unambiguously determined, obviating the need for Ehrenfest-like averaging over delocalized wavefunctions. The recent simulation16 of an electron transfer reaction in solution, where 1320 atoms interacting with CHARMM force fields were treated explicitly, showed that such calculations are feasible without any assumptions or uncontrolled approximations. The major cost of QCPI calculations stems from the computation of classical trajectories, whose number exceeds considerably that required in a typical MD simulation. This number can be reduced dramatically by implementing the blip decomposition, as multi-blip path pairs, along with the trajectories they would generate, do not need to be included. (Note that the role of blips in the QCPI formulation is rather subtle, as the solvent effects enter through a pure phase; however, the phases arising from multi-blip configurations will lead to exponentially small contributions upon averaging with respect to trajectory initial conditions.10) In addition, it is possible to eliminate the path-specific trajectories by treating the quantum decoherence phase within a harmonic approximation.100 Preliminary work indicates that such an approximation yields excellent results, while allowing QCPI propagation with a single trajectory per initial condition. The i-BSPI decomposition should also be fully applicable, reducing the cost of iterative QCPI calculations to the combined cost of a MD simulation and an i-BSPI propagation. This work is in progress.

This material is based upon work supported by the National Science Foundation under Award No. CHE 13-62826.

1.
R. P.
Feynman
and
J. F. L.
Vernon
,
Ann. Phys.
24
,
118
173
(
1963
).
2.
R.
Zwanzig
,
J. Stat. Phys.
9
,
215
220
(
1973
).
3.
A. O.
Caldeira
and
A. J.
Leggett
,
Physica A
121
,
587
616
(
1983
).
4.
A. J.
Leggett
,
S.
Chakravarty
,
A. T.
Dorsey
,
M. P. A.
Fisher
,
A.
Garg
, and
M.
Zwerger
,
Rev. Mod. Phys.
59
,
1
85
(
1987
).
5.
P.
Hänggi
,
E.
Pollak
, and
H.
Grabert
, Report No. 215,
1989
.
6.
P. G.
Wolynes
,
J. Chem. Phys.
86
,
1957
1966
(
1987
).
7.
J. N.
Onuchic
and
P. G.
Wolynes
,
J. Phys. Chem.
92
,
6495
6503
(
1988
).
8.
G. C.
Schatz
and
M. A.
Ratner
,
Quantum Mechanics in Chemistry
(
Prentice Hall
,
Englewood Cliffs, New Jersey
,
1993
).
9.
U.
Weiss
,
Quantum Dissipative Systems
(
World Scientific
,
Singapore
,
1993
).
10.
N.
Makri
,
Chem. Phys. Lett.
593
,
93
103
(
2014
).
11.
W. H.
Miller
,
N. C.
Handy
, and
J. E.
Adams
,
J. Chem. Phys.
72
,
99
112
(
1980
).
12.
B. A.
Ruf
and
W. H.
Miller
,
J. Chem. Soc., Faraday Trans. 2
84
,
1523
1534
(
1988
).
13.
A.
Warshel
and
W. W.
Parson
,
Annu. Rev. Phys. Chem.
42
,
279
(
1991
).
14.
N.
Makri
,
J. Phys. Chem. B
103
,
2823
2829
(
1999
).
15.
M. R.
Hermes
,
M.
Keceli
, and
S.
Hirata
,
J. Chem. Phys.
136
,
234109
(
2012
).
16.
P. L.
Walters
and
N.
Makri
,
J. Phys. Chem. Lett.
6
,
4959
4965
(
2015
).
17.
H. A.
Kramers
,
Physica
7
,
284
304
(
1940
).
18.
R. F.
Grote
and
J. T.
Hynes
,
J. Chem. Phys.
73
,
2715
(
1980
).
19.
A. G.
Redfield
,
IBM J. Res. Dev.
1
,
19
31
(
1957
).
20.
N.
Metropolis
,
A. W.
Rosenbluth
,
M. N.
Rosenbluth
,
H.
Teller
, and
E.
Teller
,
J. Chem. Phys.
21
,
1087
1092
(
1953
).
21.
K.
Binder
and
D. W.
Heermann
,
Monte Carlo Simulation in Statistical Physics
(
Springer-Verlag
,
1988
).
22.
C.
Mak
and
D.
Chandler
,
Phys. Rev. A
41
,
5709
5712
(
1990
).
23.
C. H.
Mak
and
D.
Chandler
,
Phys. Rev. A
44
,
2352
2369
(
1991
).
24.
C. H.
Mak
,
Phys. Rev. Lett.
68
,
899
902
(
1992
).
25.
R.
Egger
and
C. H.
Mak
,
J. Chem. Phys.
99
,
2541
(
1993
).
26.
R.
Egger
,
C. H.
Mak
, and
U.
Weiss
,
J. Chem. Phys.
100
,
2651
2660
(
1994
).
27.
N.
Makri
,
Chem. Phys. Lett.
193
,
435
444
(
1992
).
28.
N.
Makri
,
J. Phys. Chem.
97
,
2417
2424
(
1993
).
29.
M.
Topaler
and
N.
Makri
,
Chem. Phys. Lett.
210
,
448
(
1993
).
30.
D. E.
Makarov
and
N.
Makri
,
Chem. Phys. Lett.
221
,
482
491
(
1994
).
31.
N.
Makri
and
D. E.
Makarov
,
J. Chem. Phys.
102
,
4600
4610
(
1995
).
32.
N.
Makri
and
D. E.
Makarov
,
J. Chem. Phys.
102
,
4611
4618
(
1995
).
33.
E.
Sim
and
N.
Makri
,
Chem. Phys. Lett.
249
,
224
230
(
1996
).
34.
E.
Sim
and
N.
Makri
,
Comput. Phys. Commun.
99
,
335
354
(
1997
).
35.
A. A.
Golosov
,
R. A.
Friesner
, and
P.
Pechukas
,
J. Chem. Phys.
110
,
138
146
(
1999
).
36.
A. A.
Golosov
,
R. A.
Friesner
, and
P.
Pechukas
,
J. Chem. Phys.
112
,
2095
2105
(
2000
).
37.
J.
Shao
and
N.
Makri
,
Chem. Phys.
268
,
1
10
(
2001
).
38.
J.
Shao
and
N.
Makri
,
J. Chem. Phys.
116
,
507
514
(
2002
).
39.
E.
Sim
,
J. Chem. Phys.
115
,
4450
4456
(
2001
).
40.
R.
Lambert
and
N.
Makri
,
Mol. Phys.
110
,
1967
1975
(
2012
).
41.
N. S.
Dattani
,
Comput. Phys. Commun.
184
,
2828
2833
(
2013
).
42.
J. D.
Doll
,
D. L.
Freeman
, and
T. L.
Beck
, “
Equilibrium and dynamical Fourier path integral methods
,”
Adv. Chem. Phys.
78
,
61
127
(
1990
).
43.
N.
Makri
,
Comput. Phys. Commun.
63
,
389
414
(
1991
).
44.
J.
Cao
,
L. W.
Ungar
, and
G. A.
Voth
,
J. Chem. Phys.
104
,
4189
4197
(
1996
).
45.
S.
Weiss
,
J.
Eckel
,
M.
Thorwart
, and
R.
Egger
,
Phys. Rev. B
77
,
195316
(
2008
).
46.
A.
Ishizaki
and
Y.
Tanimura
,
J. Phys. Soc. Jpn.
74
(
12
),
3131
3134
(
2005
).
47.
Y.
Tanimura
,
J. Phys. Soc. Jpn.
75
,
082001
(
2006
).
48.
Y.
Zhou
and
J.
Shao
,
J. Chem. Phys.
128
,
034106
(
2008
).
49.
T. C.
Berkelbach
,
D. R.
Reichman
, and
T. E.
Markland
,
J. Chem. Phys.
136
,
034113
(
2012
).
50.
G.
Cohen
and
E.
Rabani
,
Phys. Rev. B
84
,
075150
(
2011
).
51.
H.-D.
Meyer
,
U.
Manthe
, and
L. S.
Cederbaum
,
Chem. Phys. Lett.
165
,
73
78
(
1990
).
52.
H.
Wang
,
J. Chem. Phys.
113
,
9948
9956
(
2000
).
53.
N.
Makri
,
J. Chem. Phys.
141
,
134117
(
2014
).
54.
N.
Makri
and
K.
Thompson
,
Chem. Phys. Lett.
291
,
101
109
(
1998
).
55.
K.
Thompson
and
N.
Makri
,
J. Chem. Phys.
110
,
1343
1353
(
1999
).
56.
J.
Shao
and
N.
Makri
,
J. Phys. Chem. A
103
,
7753
7756
(
1999
).
57.
J.
Shao
and
N.
Makri
,
J. Chem. Phys.
113
,
3681
3685
(
2000
).
58.
N.
Makri
,
A.
Nakayama
, and
N.
Wright
,
J. Theor. Comput. Chem.
3
,
391
417
(
2004
).
59.
N.
Makri
,
Phys. Chem. Chem. Phys.
13
(
32
),
14442
14452
(
2011
).
60.
H.
Wang
,
X.
Sun
, and
W. H.
Miller
,
J. Chem. Phys.
108
,
9726
9736
(
1998
).
61.
X.
Sun
,
H.
Wang
, and
W. H.
Miller
,
J. Chem. Phys.
109
,
7064
7074
(
1998
).
62.
X.
Sun
and
W. H.
Miller
,
J. Chem. Phys.
110
,
6635
6644
(
1999
).
63.
H.
Wang
,
M.
Thoss
, and
W. H.
Miller
,
J. Chem. Phys.
112
,
47
55
(
2000
).
64.
M.
Thoss
,
H.
Wang
, and
W. H.
Miller
,
J. Chem. Phys.
114
,
9220
9235
(
2001
).
65.
J. A.
Poulsen
,
G.
Nyman
, and
P. J.
Rossky
,
J. Chem. Phys.
119
(
23
),
12179
12193
(
2003
).
66.
A.
Nakayama
and
N.
Makri
,
J. Chem. Phys.
119
,
8592
8605
(
2003
).
67.
C. P.
Lawrence
,
A.
Nakayama
,
N.
Makri
, and
J. L.
Skinner
,
J. Chem. Phys.
120
,
6621
6624
(
2004
).
68.
A.
Nakayama
and
N.
Makri
,
Proc. Natl. Acad. Sci. U. S. A.
102
,
4230
4234
(
2005
).
69.
J. A.
Poulsen
,
G.
Nyman
, and
P. J.
Rossky
,
J. Phys. Chem. B
108
(
51
),
19799
19808
(
2004
).
70.
J. A.
Poulsen
,
J.
Scheers
,
G.
Nyman
, and
P. J.
Rossky
,
Phys. Rev. B: Condens. Matter Mater. Phys.
75
(
22
),
224505
(
2007
).
71.
J.
Liu
and
W. H.
Miller
,
J. Chem. Phys.
128
(
14
),
144511
(
2008
).
72.
J. V.
Lill
,
G. A.
Parker
, and
J. C.
Light
,
Chem. Phys. Lett.
89
,
483
489
(
1982
).
73.
J. C.
Light
,
I. P.
Hamilton
, and
J. V.
Lill
,
J. Chem. Phys.
82
,
1400
1409
(
1985
).
74.
J.
Echave
and
D. C.
Clary
,
J. Chem. Phys.
190
,
225
230
(
1992
).
75.
D. T.
Colbert
and
W. H.
Miller
,
J. Chem. Phys.
96
,
1982
1991
(
1992
).
76.
N.
Makri
,
Chem. Phys. Lett.
159
,
489
498
(
1989
).
77.
T. C.
Allen
,
P. L.
Walters
, and
N.
Makri
,
J. Chem. Theory Comput.
12
,
4169
4177
(
2016
).
78.
R. P.
Feynman
and
A. R.
Hibbs
,
Quantum Mechanics and Path Integrals
(
McGraw-Hill
,
New York
,
1965
).
79.
M. F.
Trotter
,
Proc. Am. Math. Soc.
10
,
545
551
(
1959
).
80.
N.
Makri
,
J. Math. Phys.
36
,
2430
2456
(
1995
).
81.
D.
Thirumalai
,
E. J.
Bruskin
, and
B. J.
Berne
,
J. Chem. Phys.
79
,
5063
5069
(
1983
).
82.
D. E.
Makarov
and
N.
Makri
,
Phys. Rev. E
52
,
5863
5872
(
1995
).
83.
N.
Makri
,
J. Chem. Phys.
106
,
2286
2297
(
1997
).
84.
G.
Taft
and
N.
Makri
,
J. Phys. B: At., Mol. Opt. Phys.
31
,
209
226
(
1998
).
85.
K.
Dong
and
N.
Makri
,
Phys. Rev. A
70
,
042101
(
2004
).
86.
X.-T.
Liang
,
Chem. Phys.
352
,
106
110
(
2008
).
87.
M.
Sahrapour
and
N.
Makri
,
J. Chem. Phys.
138
,
114109
(
2013
).
88.
P. L.
Walters
,
T.
Banerjee
, and
N.
Makri
,
J. Chem. Phys.
143
,
074112
(
2015
).
89.
M.
Sahrapour
and
N.
Makri
,
J. Chem. Phys.
132
,
134506
(
2010
).
90.
D.
Segal
,
A. J.
Millis
, and
D. R.
Reichman
,
Phys. Rev. B
82
,
205323
(
2010
).
91.
L.
Simine
and
D.
Segal
,
J. Chem. Phys.
138
,
214111
(
2013
).
92.
N.
Makri
,
J. Chem. Phys.
111
,
6164
6167
(
1999
).
93.
R.
Lambert
and
N.
Makri
,
J. Chem. Phys.
137
,
22A552
(
2012
).
94.
R.
Lambert
and
N.
Makri
,
J. Chem. Phys.
137
,
22A553
(
2012
).
95.
T.
Banerjee
and
N.
Makri
,
J. Phys. Chem. B
117
,
13357
13366
(
2013
).
96.
N.
Makri
,
Int. J. Quantum Chem.
115
,
1209
1214
(
2015
).
97.
P. L.
Walters
and
N.
Makri
,
J. Chem. Phys.
144
,
044108
(
2016
).
98.
N.
Makri
,
J. Chem. Phys.
109
,
2994
2998
(
1998
).
99.
P. L.
Walters
,
J. Comput. Chem.
38
,
110
115
(
2017
).
100.
N.
Makri
,
Faraday Discuss.
195
,
81
92
(
2016
).
101.
J. T.
Stockburger
and
H.
Grabert
,
Phys. Rev. Lett.
88
,
170407
(
2002
).
102.
H. T.
Chen
,
G.
Cohen
, and
D. R.
Reichman
,
J. Chem. Phys.
146
,
054105
(
2017
).
103.
H. T.
Chen
,
G.
Cohen
, and
D. R.
Reichman
,
J. Chem. Phys.
146
,
054106
(
2017
).