Propagation with distributed Gaussians as a sparse, adaptive basis for higher-dimensional quantum dynamics.

Area of Science:

• Quantum mechanics
• Computational chemistry
• Theoretical physics

Background:

• Quantum wavepacket propagation is crucial for simulating molecular dynamics.
• Traditional methods using direct-product bases face challenges in higher dimensions due to computational scaling.
• Developing efficient algorithms is essential for accurate quantum dynamics simulations.

Purpose of the Study:

• To present a novel quantum wavepacket propagation algorithm.
• To achieve a compact, non-direct product representation for higher-dimensional systems.
• To demonstrate the algorithm's efficiency and applicability to complex quantum phenomena.

Main Methods:

• The algorithm employs an adaptive basis set approach.
• Localized basis functions are dynamically added and removed based on wavepacket position.
• This generates an active basis set localized to regions of significant wavepacket amplitude.

Main Results:

• The algorithm successfully produces compact representations in one-dimensional examples.
• It accurately simulates wavepacket splitting, rejoining, and tunneling through potential barriers.
• The adaptive basis approach shows potential for reduced computational cost in higher dimensions.

Conclusions:

• The proposed algorithm offers an efficient alternative to traditional methods for quantum wavepacket propagation.
• Its adaptive nature allows for significant computational savings in complex, high-dimensional systems.
• This method paves the way for more tractable simulations of quantum dynamics.