Quantum Wavepacket Dynamics with Trajectories

Róbert E. Wyatt

Amartya Bose

Simulation and analysis of multidimensional dynamics of a quantum non-Hmeritian system is a challenging problem. Gaussian wavepacket dynamics has proven to be an intuitive semiclassical approach to approximately solving the dynamics of quantum systems. A Gaussian wavepacket approach is proposed for a continuous space extension to the Hatano-Nelson model that enables transparent analysis of the dynamics in terms of complex classical trajectories. We demonstrate certain cases where the configuration space trajectory can be made fully real by transforming the initial conditions to account for the non-Hermiticity appropriately through the momentum coordinates. However, in general the complex phase space is unavoidable. For the cases where the trajectory is real, the effective force can be decomposed into that due to the potential energy surface and that due to the imaginary vector potential. The impact of the vector potential on the trajectory of the wavepacket is directly proportional to both the strength of the vector potential and the width of the wavepacket.

Fausto Martelli

R.L. Carino, Ioana Banicescu, R. K. Vadapalli +2 more

Time-dependent wavepackets are widely used to model various phenomena in physics. One approach in simulating the wavepacket dynamics is the quantum trajectory method (QTM). Based on the hydrodynamic formulation of quantum mechanics, the QTM represents the wavepacket by an unstructured set of pseudoparticles whose trajectories are coupled by the quantum potential. The governing equations for the pseudoparticle trajectories are solved using a computationally intensive moving weighted least squares (MWLS) algorithm, and the trajectories can be computed in parallel. This paper contributes a strategy for improving the performance of wavepacket simulations using the QTM. Specifically, adaptivity is incorporated into the MWLS algorithm, and loop scheduling techniques are employed to dynamically load balance the parallel computation of the trajectories. The adaptive MWLS algorithm reduces the amount of computations without sacrificing accuracy, while adaptive loop scheduling addresses the load imbalance introduced by the algorithm and the runtime system. Results of experiments on a Linux cluster are presented to confirm that the adaptive MWLS reduces the trajectory computation time by up to 24%, and adaptive loop scheduling achieves parallel efficiencies of up to 85% when simulating a free particle.

Ricolindo L. Cariño, Ioana Banicescu, R. K. Vadapalli +2 more

Time-dependent wavepackets are widely used to model various phenomena in physics. One approach in simulating the wavepacket dynamics is the quantum trajectory method (QTM). Based on the hydrodynamic formulation of quantum mechanics, the QTM represents the wavepacket by an unstructured set of pseudoparticles whose trajectories are coupled by the quantum potential. The governing equations for the pseudoparticle trajectories are solved using a computationally-intensive moving weighted least squares (MWLS) algorithm, and the trajectories can be computed in parallel. This paper contributes a strategy for improving the performance of wavepacket simulations using the QTM. Specifically, adaptivity is incorporated into the MWLS algorithm, and loop scheduling techniques are employed to dynamically load balance the parallel computation of the trajectories. The adaptive MWLS algorithm reduces the amount of computations without sacrificing accuracy, while adaptive loop scheduling addresses the load imbalance introduced by the algorithm and the runtime system. Results of experiments on a Linux cluster are presented to confirm that the adaptive MWLS reduces the trajectory computation time by up to 24%, and adaptive loop scheduling achieves parallel efficiencies of up to 85% when simulating a free particle.

John R. Merrill