264 Quantum Trajectories
[10,11] (a related approach has been reported by Rabitz et al. [12]), has seen a growing
interest in the chemical dynamics community over the past 10 years, and now appears
as a possible alternative to standard wave packet methods [13] for solving the time-
dependent Schrödinger equation (TDSE). QTM is a computational implementation of
the hydrodynamical approach based on the Madelung [8] ansatz, ψ = A exp(iS/),
in which the probability density is partitioned into a finite number of probability fluid
elements. Each of these elements, or particles, evolves along a quantum trajectory
whose momentum is the gradient of the action
→
∇ S. Contrary to classical trajectories,
quantum trajectories are all coupled with one another through the nonlocal quantum
potential, which brings in all quantum effects. In QTM, coupled equations of motion
for the densities and action functions of all Bohmian particles are propagated, and
from these the wave function can be recovered at each instant.
Traditionally, analytic quantum trajectories were extracted from conventional
wave packets to provide physical insight into dynamical processes [14]. Beyond this
intuitive aspect, in QTM synthetic quantum trajectories are propagated from scratch,
to actually solve the TDSE. Since Bohmian quantum trajectories “follow” the flux
of probability density, computer time is spent almost exclusively in regions of high-
dynamics activity. For this reason, QTM is expected to outperform standard wave
packet methods in terms of computing effort, at least in certain situations. In fact,
model systems of up to hundreds of degrees of freedom have been successfully stud-
ied with QTM [10,15, 16].
Unfortunately, a simple implementation of QTM equations of motion generally
leads to numerical difficulties that limit the time during which quantum trajectories
can be propagated. A computational drawback of QTM lies in the difficult evalua-
tion of space derivatives that appear in the expression of the quantum potential (see
Section 17.2.1), since these derivatives must be computed on the unstructured “grid”
formed by Bohmian particles, which is moving and changing shape at each instant.
An even more serious problem occurs in case of interferences—when a wave packet is
reflected on a potential barrier, for example. In this case the quantum potential under-
goes rapid variations (and even becomes singular at probability density nodes), thus
giving rise to very irregular, numerically unstable, trajectories [17]. This is referred
to in the literature as the node problem [10].
Various exact or approximate treatments have been proposed to deal with the
node problem, and more generally with numerical difficulties encountered in the
propagation of quantum trajectories. In the bipolar decomposition theory of Poirier
et al. [18–24]—one of the most promising strategies, in our opinion—the wave func-
tion is expressed as the sum of two counter-propagating waves whose probability
densities are much less oscillatory, and whose associated trajectories are much more
regular, than that of the total wave function. Other approaches include the linearized
quantum force [25], artificial viscosity [26], the covering function method [27], and
the mixed wave function representation [28]. Of particular interest are the adaptive
grid techniques developed by Wyatt et al. [10,29–32], in which each particle, instead
of being driven by the Bohmian flow, is assigned an arbitrary well-defined path con-
trolled by the user. Such an adaptive grid constitutes an arbitrary Lagrangian Eulerian