Fragment-Based Electronic Structure for Potential Energy Surfaces Using a Superposition of Fragmentation Topologies

Resource Optimization for Quantum Dynamics with Tensor Networks: Quantum and Classical Algorithms

The exponential scaling of the quantum degrees of freedom with the size of the system is one of the biggest challenges in computational chemistry and particularly in quantum dynamics. We present a tensor network approach for the time-evolution of the nuclear degrees of freedom of multiconfigurational chemical systems at a reduced storage and computational complexity. We also present quantum algorithms for the resultant dynamics. To preserve the compression advantage achieved via tensor network decompositions, we present an adaptive algorithm for the regularization of nonphysical bond dimensions, preventing the potentially exponential growth of these with time. While applicable to any quantum dynamical problem, our method is particularly valuable for dynamical simulations of nuclear chemical systems. Our algorithm is demonstrated using ab initio potentials obtained for a symmetric hydrogen-bonded system, namely, the protonated 2,2'-bipyridine, and compared to exact diagonalization numerical results.

Reformulation of All ONIOM-Type Molecular Fragmentation Approaches and Many-Body Theories Using Graph-Theory-Based Projection Operators: Applications to Dynamics, Molecular Potential Surfaces, Machine Learning, and Quantum Computing

We present a graph-theory-based reformulation of all ONIOM-based molecular fragmentation methods. We discuss applications to (a) accurate post-Hartree-Fock AIMD that can be conducted at DFT cost for medium-sized systems, (b) hybrid DFT condensed-phase studies at the cost of pure density functionals, (c) reduced cost on-the-fly large basis gas-phase AIMD and condensed-phase studies, (d) post-Hartree-Fock-level potential surfaces at DFT cost to obtain quantum nuclear effects, and (e) novel transfer machine learning protocols derived from these measures. Additionally, in previous work, the unifying strategy discussed here has been used to construct new quantum computing algorithms. Thus, we conclude that this reformulation is robust and accurate.

Capturing Weak Interactions in Surface Adsorbate Systems at Coupled Cluster Accuracy: A Graph-Theoretic Molecular Fragmentation Approach Improved through Machine Learning

The accurate and efficient study of the interactions of organic matter with the surface of water is critical to a wide range of applications. For example, environmental studies have found that acidic polyfluorinated alkyl substances, especially perfluorooctanoic acid (PFOA), have spread throughout the environment and bioaccumulate into human populations residing near contaminated watersheds, leading to many systemic maladies. Thus, the study of the interactions of PFOA with water surfaces became important for the mitigation of their activity as pollutants and threats to public health. However, theoretical study of the interactions of such organic adsorbates on the surface of water, and their bulk concerted properties, often necessitates the use of ab initio methods to properly incorporate the long-range electronic properties that govern these extended systems. Notable theoretical treatments of "on-water" reactions thus far have employed hybrid DFT and semilocal DFT, but the interactions involved are weak interactions that may be best described using post-Hartree-Fock theory. Here, we aim to demonstrate the utility of a graph-theoretic approach to molecular fragmentation that accurately captures the critical "weak" interactions while maintaining an efficient ab initio treatment of the long-range periodic interactions that underpin the physics of extended systems. We apply this graph-theoretical treatment to study PFOA on the surface of water as a model system for the study of weak interactions seen in the wide range of surface interactions and reactions. The approach divides a system into a set of vertices, that are then connected through edges, faces, and higher order graph theoretic objects known as simplexes, to represent a collection of locally interacting subsystems. These subsystems are then used to construct ab initio molecular dynamics simulations and for computing multidimensional potential energy surfaces. To further improve the computational efficiency of our graph theoretic fragmentation method, we use a recently developed transfer learning protocol to construct the full system potential energy from a family of neural networks each designed to accurately model the behavior of individual simplexes. We use a unique multidimensional clustering algorithm, based on the k-means clustering methodology, to define our training space for each separate simplex. These models are used to extrapolate the energies for molecular dynamics trajectories at PFOA water interfaces, at less than one-tenth the cost as compared to a regular molecular fragmentation-based dynamics calculation with excellent agreement with couple cluster level of full system potential energies.

Graph-|Q⟩⟨C|: A Quantum Algorithm with Reduced Quantum Circuit Depth for Electronic Structure

The accurate determination of chemical properties is known to have a critical impact on multiple fundamental chemical problems but is deeply hindered by the steep algebraic scaling of electron correlation calculations and the exponential scaling of quantum nuclear dynamics. With the advent of new quantum computing hardware and associated developments in creating new paradigms for quantum software, this avenue has been recognized as perhaps one way to address exponentially complex challenges in quantum chemistry and molecular dynamics. In this paper, we discuss a new approach to drastically reduce the quantum circuit depth (by several orders of magnitude) and help improve the accuracy in the quantum computation of electron correlation energies for large molecular systems. The method is derived from a graph-theoretic approach to molecular fragmentation and enables us to create a family of projection operators that decompose quantum circuits into separate unitary processes. Some of these processes can be treated on quantum hardware and others on classical hardware in a completely asynchronous and parallel fashion. Numerical benchmarks are provided through the computation of unitary coupled-cluster singles and doubles (UCCSD) energies for medium-sized protonated and neutral water clusters using the new quantum algorithms presented here.

Fragment-based models for dissociation of strong acids in water: Electrostatic embedding minimizes the dependence on the fragmentation schemes

Fragmentation methods such as MIM (Molecules-in-Molecules) provide a route to accurately model large systems and have been successful in predicting their structures, energies, and spectroscopic properties. However, their use is often limited to systems at equilibrium due to the inherent complications in the choice of fragments in systems away from equilibrium. Furthermore, the presence of charges resulting from any heterolytic bond breaking may increase the fragmentation error. We have previously suggested EE-MIM (Electrostatically Embedded Molecules-In-Molecules) as a method to mitigate the errors resulting from the missing long-range interactions in molecular clusters in equilibrium. Here, we show that the same method can be applied to improve the performance of MIM to solve the longstanding problem of dependency of the fragmentation energy error on the choice of the fragmentation scheme. We chose four widely used acid dissociation reactions (HCl, HClO4, HNO3, and H2SO4) as test cases due to their importance in chemical processes and complex reaction potential energy surfaces. Electrostatic embedding improves the performance at both one and two-layer MIM as shown by lower EE-MIM1 and EE-MIM2 errors. The EE-MIM errors are also demonstrated to be less dependent on the choice of the fragmentation scheme by analyzing the variation in fragmentation energy at the points with more than one possible fragmentation scheme (points where the fragmentation scheme changes). EE-MIM2 with M06-2X as the low-level resulted in a variation of less than 1 kcal/mol for all the cases and 1 kJ/mol for all but three cases, rendering our method fragmentation scheme-independent for acid dissociation processes.

Graph-Theoretic Molecular Fragmentation for Potential Surfaces Leads Naturally to a Tensor Network Form and Allows Accurate and Efficient Quantum Nuclear Dynamics

Molecular fragmentation methods have revolutionized quantum chemistry. Here, we use a graph-theoretically generated molecular fragmentation method, to obtain accurate and efficient representations for multidimensional potential energy surfaces and the quantum time-evolution operator, which plays a critical role in quantum chemical dynamics. In doing so, we find that the graph-theoretic fragmentation approach naturally reduces the potential portion of the time-evolution operator into a tensor network that contains a stream of coupled lower-dimensional propagation steps to potentially achieve quantum dynamics with reduced complexity. Furthermore, the fragmentation approach used here has previously been shown to allow accurate and efficient computation of post-Hartree-Fock electronic potential energy surfaces, which in many cases has been shown to be at density functional theory cost. Thus, by combining the advantages of molecular fragmentation with the tensor network formalism, the approach yields an on-the-fly quantum dynamics scheme where both the electronic potential calculation and nuclear propagation portion are enormously simplified through a single stroke. The method is demonstrated by computing approximations to the propagator and to potential surfaces for a set of coupled nuclear dimensions within a protonated water wire problem exhibiting the Grotthuss mechanism of proton transport. In all cases, our approach has been shown to reduce the complexity of representing the quantum propagator, and by extension action of the propagator on an initial wavepacket, by several orders, with minimal loss in accuracy.

Graph Theoretic Molecular Fragmentation for Multidimensional Potential Energy Surfaces Yield an Adaptive and General Transfer Machine Learning Protocol

Over a series of publications we have introduced a graph-theoretic description for molecular fragmentation. Here, a system is divided into a set of nodes, or vertices, that are then connected through edges, faces, and higher-order simplexes to represent a collection of spatially overlapping and locally interacting subsystems. Each such subsystem is treated at two levels of electronic structure theory, and the result is used to construct many-body expansions that are then embedded within an ONIOM-scheme. These expansions converge rapidly with many-body order (or graphical rank) of subsystems and have been previously used for ab initio molecular dynamics (AIMD) calculations and for computing multidimensional potential energy surfaces. Specifically, in all these cases we have shown that CCSD and MP2 level AIMD trajectories and potential surfaces may be obtained at density functional theory cost. The approach has been demonstrated for gas-phase studies, for condensed phase electronic structure, and also for basis set extrapolation-based AIMD. Recently, this approach has also been used to derive new quantum-computing algorithms that enormously reduce the quantum circuit depth in a circuit-based computation of correlated electronic structure. In this publication, we introduce (a) a family of neural networks that act in parallel to represent, efficiently, the post-Hartree-Fock electronic structure energy contributions for all simplexes (fragments), and (b) a new k-means-based tessellation strategy to glean training data for high-dimensional molecular spaces and minimize the extent of training needed to construct this family of neural networks. The approach is particularly useful when coupled cluster accuracy is desired and when fragment sizes grow in order to capture nonlocal interactions accurately. The unique multidimensional k-means tessellation/clustering algorithm used to determine our training data for all fragments is shown to be extremely efficient and reduces the needed training to only 10% of data for all fragments to obtain accurate neural networks for each fragment. These fully connected dense neural networks are then used to extrapolate the potential energy surface for all molecular fragments, and these are then combined as per our graph-theoretic procedure to transfer the learning process to a full system energy for the entire AIMD trajectory at less than one-tenth the cost as compared to a regular fragmentation-based AIMD calculation.

Graph-|Q⟩⟨C|, a Graph-Based Quantum/Classical Algorithm for Efficient Electronic Structure on Hybrid Quantum/Classical Hardware Systems: Improved Quantum Circuit Depth Performance

We present a procedure to reduce the depth of quantum circuits and improve the accuracy of results in computing post-Hartree-Fock electronic structure energies in large molecular systems. The method is based on molecular fragmentation where a molecular system is divided into overlapping fragments through a graph-theoretic procedure. This allows us to create a set of projection operators that decompose the unitary evolution of the full system into separate sets of processes, some of which can be treated on quantum hardware and others on classical hardware. Thus, we develop a procedure for an electronic structure that can be asynchronously spawned onto a potentially large ensemble of classical and quantum hardware systems. We demonstrate this method by computing Unitary Coupled Cluster Singles and Doubles (UCCSD) energies for a set of [H₂]_n clusters, with n ranging from 4 to 128. We implement our methodology using quantum circuits, and when these quantum circuits are processed on a quantum simulator, we obtain energies in agreement with the UCCSD energies in the milli-hartree energy range. We also show that our circuit decomposition approach yields up to 9 orders of magnitude reduction in the number of CNOT gates and quantum circuit depth for the large-sized clusters when compared to a standard quantum circuit implementation available on IBM's Quantum Information Science kit, known as Qiskit.

Graph-Theory-Based Molecular Fragmentation for Efficient and Accurate Potential Surface Calculations in Multiple Dimensions

We present a multitopology molecular fragmentation approach, based on graph theory, to calculate multidimensional potential energy surfaces in agreement with post-Hartree-Fock levels of theory but at the density functional theory cost. A molecular assembly is coarse-grained into a set of graph-theoretic nodes that are then connected with edges to represent a collection of locally interacting subsystems up to an arbitrary order. Each of the subsystems is treated at two levels of electronic structure theory, the result being used to construct many-body expansions that are embedded within an ONIOM scheme. These expansions converge rapidly with the many-body order (or graphical rank) of subsystems and capture many-body interactions accurately and efficiently. However, multiple graphs, and hence multiple fragmentation topologies, may be defined in molecular configuration space that may arise during conformational sampling or from reactive, bond breaking and bond formation, events. Obtaining the resultant potential surfaces is an exponential scaling proposition, given the number of electronic structure computations needed. We utilize a family of graph-theoretic representations within a variational scheme to obtain multidimensional potential surfaces at a reduced cost. The fast convergence of the graph-theoretic expansion with increasing order of many-body interactions alleviates the exponential scaling cost for computing potential surfaces, with the need to only use molecular fragments that contain a fewer number of quantum nuclear degrees of freedom compared to the full system. This is because the dimensionality of the conformational space sampled by the fragment subsystems is much smaller than the full molecular configurational space. Additionally, we also introduce a multidimensional clustering algorithm, based on physically defined criteria, to reduce the number of energy calculations by orders of magnitude. The molecular systems benchmarked include coupled proton motion in protonated water wires. The potential energy surfaces and multidimensional nuclear eigenstates obtained are shown to be in very good agreement with those from explicit post-Hartree-Fock calculations that become prohibitive as the number of quantum nuclear dimensions grows. The developments here provide a rigorous and efficient alternative to this important chemical physics problem.

iOI: An Iterative Orbital Interaction Approach for Solving the Self-Consistent Field Problem

An iterative orbital interaction (iOI) approach is proposed to solve, in a bottom-up fashion, the self-consistent field problem in quantum chemistry. While it belongs grossly to the family of fragment-based quantum chemical methods, iOI is distinctive in that (1) it divides and conquers not only the energy but also the wave function and that (2) the subsystem sizes are automatically determined by successively merging neighboring small subsystems until they are just enough for converging the wave function to a given accuracy. Orthonormal occupied and virtual localized molecular orbitals are obtained in a natural manner, which can be used for all post-SCF purposes.

Weighted-Graph-Theoretic Methods for Many-Body Corrections within ONIOM: Smooth AIMD and the Role of High-Order Many-Body Terms

We present a weighted-graph-theoretic approach to adaptively compute contributions from many-body approximations for smooth and accurate post-Hartree-Fock (pHF) ab initio molecular dynamics (AIMD) of highly fluxional chemical systems. This approach is ONIOM-like, where the full system is treated at a computationally feasible quality of treatment (density functional theory (DFT) for the size of systems considered in this publication), which is then improved through a perturbative correction that captures local many-body interactions up to a certain order within a higher level of theory (post-Hartree-Fock in this publication) described through graph-theoretic techniques. Due to the fluxional and dynamical nature of the systems studied here, these graphical representations evolve during dynamics. As a result, energetic "hops" appear as the graphical representation deforms with the evolution of the chemical and physical properties of the system. In this paper, we introduce dynamically weighted, linear combinations of graphs, where the transition between graphical representations is smoothly achieved by considering a range of neighboring graphical representations at a given instant during dynamics. We compare these trajectories with those obtained from a set of trajectories where the range of local many-body interactions considered is increased, sometimes to the maximum available limit, which yields conservative trajectories as the order of interactions is increased. The weighted-graph approach presents improved dynamics trajectories while only using lower-order many-body interaction terms. The methods are compared by computing dynamical properties through time-correlation functions and structural distribution functions. In all cases, the weighted-graph approach provides accurate results at a lower cost.