Efficient Implementation of Gaussian Process Regression Accelerated Saddle Point Searches with Application to Molecular Reactions

• URL: http://arxiv.org/abs/2505.12519v2
• Date: Tue, 08 Jul 2025 17:27:55 GMT
• Title: Efficient Implementation of Gaussian Process Regression Accelerated Saddle Point Searches with Application to Molecular Reactions
• Authors: Rohit Goswami, Maxim Masterov, Satish Kamath, Alejandro Peña-Torres, Hannes Jónsson,
• Abstract summary: We describe an efficient implementation of Gaussian process regression acceleration of the minimum mode following method.<n>An order of magnitude reduction in the number of electronic structure calculations needed to reach the saddle point configurations is obtained.<n>The present implementation of the GPR surrogate model in C++ is efficient enough for the wall time of the saddle point searches to be reduced in 3 out of 4 cases.
• Score: 39.58317527488534
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The task of locating first order saddle points on high-dimensional surfaces describing the variation of energy as a function of atomic coordinates is an essential step for identifying the mechanism and estimating the rate of thermally activated events within the harmonic approximation of transition state theory. When combined directly with electronic structure calculations, the number of energy and atomic force evaluations needed for convergence is a primary issue. Here, we describe an efficient implementation of Gaussian process regression (GPR) acceleration of the minimum mode following method where a dimer is used to estimate the lowest eigenmode of the Hessian. A surrogate energy surface is constructed and updated after each electronic structure calculation. The method is applied to a test set of 500 molecular reactions previously generated by Hermez and coworkers [J. Chem. Theory Comput. 18, 6974 (2022)]. An order of magnitude reduction in the number of electronic structure calculations needed to reach the saddle point configurations is obtained by using the GPR compared to the dimer method. Despite the wide range in stiffness of the molecular degrees of freedom, the calculations are carried out using Cartesian coordinates and are found to require similar number of electronic structure calculations as an elaborate internal coordinate method implemented in the Sella software package. The present implementation of the GPR surrogate model in C++ is efficient enough for the wall time of the saddle point searches to be reduced in 3 out of 4 cases even though the calculations are carried out at a low Hartree-Fock level.

Related papers

• Enhancing Accuracy of Quantum-Selected Configuration Interaction Calculations using Multireference Perturbation Theory: Application to Aromatic Molecules [0.0]
  Quantum-selected configuration interaction (QSCI) is a novel quantum-classical hybrid algorithm for quantum chemistry calculations.<n>The incorporation of the perturbation treatment was found to provide improved accuracy.
  arXiv  Detail & Related papers  (2025-03-28T08:12:39Z)
• Learning Equivariant Non-Local Electron Density Functionals [51.721844709174206]
  We introduce Equivariant Graph Exchange Correlation (EG-XC), a novel non-local XC functional based on equivariant graph neural networks (GNNs)<n>By applying an equivariant GNN on this point cloud, we capture molecular-range interactions in a scalable and accurate manner.<n> EG-XC excels in data efficiency and molecular size extrapolation on QM9, matching force fields trained on 5 times more and larger molecules.
  arXiv  Detail & Related papers  (2024-10-10T14:31:45Z)
• Tensor-based quantum phase difference estimation for large-scale demonstration [3.492424366069693]
  We develop an energy calculation algorithm leveraging quantum phase difference estimation (QPDE) scheme. Alongside its efficient implementation, this algorithm reduces depolarization noise affections exponentially. We demonstrate energy gap calculations for one-dimensional Hubbard models on IBM superconducting devices.
  arXiv  Detail & Related papers  (2024-08-09T09:01:37Z)
• Force-free identification of minimum-energy pathways and transition states for stochastic electronic structure theories [0.18641315013048293]
  We present strategies that utilize the surrogate Hessian line-search method to efficiently identify MEP and TS structures. We show that it is possible to identify MEPs and TSs using a force-free Quantum Monte Carlo approach.
  arXiv  Detail & Related papers  (2024-02-20T17:58:43Z)
• Gaussian process regression and conditional Karhunen-Lo\'{e}ve models for data assimilation in inverse problems [68.8204255655161]
  We present a model inversion algorithm, CKLEMAP, for data assimilation and parameter estimation in partial differential equation models. The CKLEMAP method provides better scalability compared to the standard MAP method.
  arXiv  Detail & Related papers  (2023-01-26T18:14:12Z)
• Iterative Qubit Coupled Cluster using only Clifford circuits [36.136619420474766]
  An ideal state preparation protocol can be characterized by being easily generated classically. We propose a method that meets these requirements by introducing a variant of the iterative qubit coupled cluster (iQCC) We demonstrate the algorithm's correctness in ground-state simulations and extend our study to complex systems like the titanium-based compound Ti(C5H5)(CH3)3 with a (20, 20) active space.
  arXiv  Detail & Related papers  (2022-11-18T20:31:10Z)
• Exploring the role of parameters in variational quantum algorithms [59.20947681019466]
  We introduce a quantum-control-inspired method for the characterization of variational quantum circuits using the rank of the dynamical Lie algebra. A promising connection is found between the Lie rank, the accuracy of calculated energies, and the requisite depth to attain target states via a given circuit architecture.
  arXiv  Detail & Related papers  (2022-09-28T20:24:53Z)
• Benchmarking adaptive variational quantum eigensolvers [63.277656713454284]
  We benchmark the accuracy of VQE and ADAPT-VQE to calculate the electronic ground states and potential energy curves. We find both methods provide good estimates of the energy and ground state. gradient-based optimization is more economical and delivers superior performance than analogous simulations carried out with gradient-frees.
  arXiv  Detail & Related papers  (2020-11-02T19:52:04Z)
• Local optimization on pure Gaussian state manifolds [63.76263875368856]
  We exploit insights into the geometry of bosonic and fermionic Gaussian states to develop an efficient local optimization algorithm. The method is based on notions of descent gradient attuned to the local geometry. We use the presented methods to collect numerical and analytical evidence for the conjecture that Gaussian purifications are sufficient to compute the entanglement of purification of arbitrary mixed Gaussian states.
  arXiv  Detail & Related papers  (2020-09-24T18:00:36Z)
• Tailoring Term Truncations for Electronic Structure Calculations Using a Linear Combination of Unitaries [3.222802562733787]
  We present an adaptation of that method, optimized for Hamiltonians with terms of widely varying magnitude. We find that our adaptive method can typically improve the simulation accuracy by an order of magnitude, for a given circuit depth.
  arXiv  Detail & Related papers  (2020-07-22T18:50:58Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.