Characterizing the free energy landscape of water ionization has been a great challenge due to the limitations from expensive ab initio calculations and strong rare-event features. Lacking equilibrium sampling of the ionization pathway will cause ambiguities in the mechanistic study. Here, we obtain convergent free energy surfaces through nanosecond timescale metadynamics simulations with classical nuclei enhanced by atomic neural network potentials, which yields good reproduction of the equilibrium constant () and ionization rate constant (). The character of transition state unveils the triple-proton transfer occurs through a concerted but asynchronous mechanism. Conditional ensemble average analyses establish the dual-presolvation mechanism, where a pair of hypercoordinated and undercoordinated waters bridged by one cooperatively constitutes the initiation environment for autoionization, and contributes extremely to the local electric field fluctuation to promote water dissociation.
In this article, several optimization methods of two-electron repulsion integral calculations on a graphic processing unit (GPU) are presented. These methods are based on the investigations of the method presented by McMurchie and Davidson (MD). A new Boys function evaluation method for the GPU calculation is introduced. The series summation, the error function, and the finite sum formula method are combined; thus, good performance on the GPU can be achieved. By taking some theoretical study of the McMurchie–Davidson recurrence relations, three major optimization approaches are derived from the deduction of the general term formula for the Hermite expansion coefficient. The three approaches contain a new form of the Hermite expansion coefficients with corresponding recurrence relations, which is more efficient for one-electron integrals and [ss|∗∗] or [∗∗|ss] type two-electron integrals. In addition, a simple yet efficient new recurrence formula for the coefficient evaluation is derived, which is more efficient both in float operations and memory operations than its original one. In average, the new recurrence relation can save 26% float operations and 37% memory operations. Finally, a common sub-expression elimination (CSE) method is implemented. This CSE method is directly generated from some equalities we discovered from the general term formula other than by computer algebra system software. This optimized method achieved up to 3.09 speedups compared to the original MD method on the GPU and up to 92.75 speedups compared to the GAMESS calculation on the central processing unit.
2 November 2022 in Journal of Chemical Theory and Computation
In the last decades, many algorithms have been developed to use high-performance computing (HPC) techniques to accelerate the density matrix renormalization group (DMRG) method, an effective method for solving large active space strong correlation problems. In this article, the previous DMRG parallelization algorithms at different levels of the parallelism are introduced. The heterogeneous computing acceleration methods and the mixed-precision implementation are also presented and discussed. This mini-review concludes with some summary and prospects for future works.
Neural network methods have shown promise for solving complex quantum many-body systems. In this study, we develop a novel approach through incorporating the density-matrix renormalization group (DMRG) method with the neural network quantum state method. The results demonstrate that, when tensor-network pre-training is introduced into the neural network, a high efficiency can be achieved for quantum many-body systems with strong correlations.