Search

Fanpy is a free and open‐source Python library for developing and testing multideterminant wavefunctions and related ab initio methods in electronic structure theory. The main use of Fanpy is to quickly prototype new methods by making it easier to convert the mathematical formulation of a new wavefunction ansätze to a working implementation. Fanpy is designed based on our recently introduced Flexible Ansatz for N‐electron Configuration Interaction (FANCI) framework, where multideterminant wavefunctions are represented by their overlaps with Slater determinants of orthonormal spin‐orbitals. In the simplest case, a new wavefunction ansatz can be implemented by simply writing a function for evaluating its overlap with an arbitrary Slater determinant. Fanpy is modular in both implementation and theory: the wavefunction model, the system's Hamiltonian, and the choice of objective function are all independent modules. This modular structure makes it easy for users to mix and match different methods and for developers to quickly explore new ideas. Fanpy is written purely in Python with standard dependencies, making it accessible for various operating systems. In addition, it adheres to principles of modern software development, including comprehensive documentation, extensive testing, quality assurance, and continuous integration and delivery protocols. This article is considered to be the official release notes for the Fanpy library. [ABSTRACT FROM AUTHOR]

We present a new method for computing the most probable tunneling paths based on the minimum imaginary action principle. Unlike many conventional methods, the paths are calculated without resorting to an optimization (minimization) scheme. Instead, a fast marching method coupled with a back-propagation scheme is used to efficiently compute the tunneling paths. The fast marching method solves a Hamilton–Jacobi equation for the imaginary action on a discrete grid where the action value at an initial point (usually the reactant state configuration) is known in the beginning. Subsequently, a back-propagation scheme uses a steepest descent method on the imaginary action surface to compute a path connecting an arbitrary point on the potential energy surface (usually a state in the product valley) to the initial state. The proposed method is demonstrated for the tunneling paths of two different systems: a model 2D potential surface and the collinear  [image omitted] reaction. Unlike existing methods, where the tunneling path is based on a presumed reaction coordinate and a correction is made with respect to the reaction coordinate within an ‘adiabatic’ approximation, the proposed method is very general and makes no assumptions about the relationship between the reaction coordinate and tunneling path. [ABSTRACT FROM AUTHOR]