2014
DOI: 10.1080/08927022.2014.923573
|View full text |Cite
|
Sign up to set email alerts
|

Assessment of approximate solutions of the quantum–classical Liouville equation for dynamics simulations of quantum subsystems embedded in classical environments

Abstract: The quantum-classical Liouville equation (QCLE) provides a rigorous approach for modelling the dynamics of systems that can be effectively partitioned into a quantum subsystem and a classical environment. Several surface-hopping algorithms have been developed for solving the QCLE and successfully applied to simple model systems, but simulating the long-time dynamics of complex, realistic systems using these schemes has proven to be computationally demanding. Motivated by the need for computationally efficient … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
10
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
7

Relationship

3
4

Authors

Journals

citations
Cited by 8 publications
(10 citation statements)
references
References 80 publications
0
10
0
Order By: Relevance
“…On the other hand, the Poisson Bracket Mapping Equation (PBME) and the Forward–Backward Trajectory Solution (FBTS) algorithms involve generating an ensemble of trajectories in which both the quantum and classical DOF conveniently evolve according to classical-like equations of motion. Despite their simplicity and efficiency, these methods solve the QCLE more approximately and can yield inaccurate results in situations where a mean-field picture of the dynamics is not valid. Thus, efforts toward making the SSTP and TBQC algorithms more efficient are worthwhile.…”
Section: Introductionmentioning
confidence: 99%
“…On the other hand, the Poisson Bracket Mapping Equation (PBME) and the Forward–Backward Trajectory Solution (FBTS) algorithms involve generating an ensemble of trajectories in which both the quantum and classical DOF conveniently evolve according to classical-like equations of motion. Despite their simplicity and efficiency, these methods solve the QCLE more approximately and can yield inaccurate results in situations where a mean-field picture of the dynamics is not valid. Thus, efforts toward making the SSTP and TBQC algorithms more efficient are worthwhile.…”
Section: Introductionmentioning
confidence: 99%
“…However, these trajectories are different from Ehrenfest trajectories, but their dynamics is based on an approximation to the formal solution to the quantum classical Liouville equation. Theoretical and numerical details of the FBTS method are described elsewhere [23,24,47]. In both the MTEF and the FBTS methods, the ensemble average of trajectories can be performed by Monte Carlo sampling for the initial condition of each trajectory.…”
Section: Resultsmentioning
confidence: 99%
“…The quantum-classical equations of motion herein discussed can be implemented in silico using a variety of simulation algorithms [79,[114][115][116][117][118][119][120][121][122][123][124]. We will sketch out one such integration algorithm, which unfolds the quantum-classical dynamics of the operator-valued quasi-probability function in terms of piecewise-deterministic trajectories evolving on the adiabatic energy surfaces of the system under study [79,114].…”
Section: Introductionmentioning
confidence: 99%