The coupled cluster method is considered a gold standard in quantum chemistry, reliably giving energies that are exact within chemical accuracy (1.6 mhartree). However, even in the coupled cluster single-double (CCSD) approximation, where the cluster operator is truncated to include only single and double excitations, the method scales as O(N6) in the number of electrons, and the cluster operator needs to be solved for iteratively, increasing the computation time. Inspired by eigenvector continuation, we present here an algorithm making use of the Gaussian processes that provides an improved initial guess for the coupled cluster amplitudes. The cluster operator is written as a linear combination of sample cluster operators that are obtained at particular sample geometries. By reusing the cluster operators from previous calculations in that way, it is possible to obtain a start guess for the amplitudes that surpasses both MP2 guesses and “previous geometry”-guesses in terms of the number of necessary iterations. As this improved guess is very close to the exact cluster operator, it can be used directly to calculate the CCSD energy to chemical accuracy, giving approximate CCSD energies scaling as O(N5).
The Coupled-Cluster (CC) method is one of the most popular and efficient correlation methods in quantum chemistry. \nEspecially the CCSD(T) approximation, which includes single and double excitations by means of the application of the cluster operator \nto a reference determinant and triple excitations via a perturbative treatment, has become a standard tool \nin quantum chemical applications. However, the method is restricted to relatively small system sizes due to its unfavourable scaling (N^7, where N is the number of basis functions applied). \nFor the full treatment of triple excitations the scaling advances to N^8 and every further excitation level increases the exponent by two. \n \nThe goal of this work is to reduce the calculation time for closed shell systems at least by a factor growing with the excitation level for arbitrary truncation levels. \nThis is done by restricting the spatial parts of the spin orbitals and thus treat pairs of spin orbitals on the same footing. The restrictions can be easily constructed \nfor the CCSD model by spin integration. \nThe derivation of the restrictions arising in higher excited case will be done employing \nthe spatial orbital excitation operators E. \n \nIn the first part of this work an algorithm is derived that is capable of the derivation of the energy and amplitude equations for arbitrary excitation levels. In the second part \nan implementation of this algorithm is presented.
Solving the coupled-cluster (CC) equations is a cost-prohibitive process that exhibits poor scaling with system size. These equations are solved by determining the set of amplitudes ( t ) that minimize the system energy with respect to the coupled-cluster equations at the selected level of truncation. Here, a novel approach to predict the converged coupled-cluster singles and doubles (CCSD) amplitudes, thus the coupled-cluster wave function, is explored by using machine learning and electronic structure properties inherent to the MP2 level. Features are collected from quantum chemical data, such as orbital energies, one-electron Hamiltonian, Coulomb, and exchange terms. The data-driven CCSD (DDCCSD) is not an alchemical method because the actual iterative coupled-cluster equations are solved. However, accurate energetics can also be obtained by bypassing solving the CC equations entirely. Our preliminary data show that it is possible to achieve remarkable speedups in solving the CCSD equations, especially when the correct physics are encoded and used for training of machine learning models.
We consider the rank-reduced coupled-cluster theory with single and double (RR-CCSD) excitations introduced recently [Parrish et al., J. Chem. Phys. 150, 164118 (2019)]. The main feature of this method is the decomposed form of doubly excited amplitudes, which are expanded in the basis of largest magnitude eigenvectors of MP2 or MP3 amplitudes. This approach enables a substantial compression of amplitudes with only minor loss of accuracy. However, the formal scaling of the computational costs with the system size (N) is unaffected in comparison with the conventional CCSD theory (∝N6) due to the presence of some terms quadratic in amplitudes, which do not naturally factorize to a simpler form even within the rank-reduced framework. We show how to solve this problem, exploiting the fact that their effective rank increases only linearly with the system size. We provide a systematic way to approximate the problematic terms using the singular value decomposition and reduce the scaling of the RR-CCSD iterations down to the level of N5. This is combined with an iterative method of finding dominant eigenpairs of MP2 or MP3 amplitudes, which eliminates the necessity to perform the complete diagonalization, making the cost of this step proportional to the fifth power of the system size, as well. Next, we consider the evaluation of perturbative corrections to CCSD energies resulting from triply excited configurations. The triply excited amplitudes present in the CCSD(T) method are decomposed to the Tucker-3 format using the higher-order orthogonal iteration procedure. This enables us to compute the energy correction due to triple excitations non-iteratively with N6 cost. The accuracy of the resulting rank-reduced CCSD(T) method is studied for both total and relative correlation energies of a diverse set of molecules. Accuracy levels better than 99.9% can be achieved with a substantial reduction of the computational costs. Concerning the computational timings, the break-even point between the rank-reduced and conventional CCSD implementations occurs for systems with about 30–40 active electrons.
We have developed a graphical processing unit (GPU) accelerated implementation of our recently introduced rank-reduced coupled-cluster singles and doubles (RR-CCSD) method. RR-CCSD introduces a low-rank approximation of the doubles amplitudes. This is combined with a low-rank approximation of the electron repulsion integrals via Cholesky decomposition. The result of these two low-rank approximations is the replacement of the usual fourth-order CCSD tensors with products of second- and third-order tensors. In our implementation, only a single fourth-order tensor must be constructed as an intermediate during the solution of the amplitude equations. Owing in large part to the compression of the doubles amplitudes, the GPU-accelerated implementation shows excellent parallel efficiency (95% on eight GPUs). Our implementation can solve the RR-CCSD equations for up to 400 electrons and 1550 basis functions—roughly 50% larger than the largest canonical CCSD computations that have been performed on any hardware. In addition to increased scalability, the RR-CCSD computations are faster than the corresponding CCSD computations for all but the smallest molecules. We test the accuracy of RR-CCSD for a variety of chemical systems including up to 1000 basis functions and determine that accuracy to better than 0.1% error in the correlation energy can be achieved with roughly 95% compression of the ov space for the largest systems considered. We also demonstrate that conformational energies can be predicted to be within 0.1 kcal mol−1 with efficient compression applied to the wavefunction. Finally, we find that low-rank approximations of the CCSD doubles amplitudes used in the similarity transformation of the Hamiltonian prior to a conventional equation-of-motion CCSD computation will not introduce significant errors (on the order of a few hundredths of an electronvolt) into the resulting excitation energies.
Accurate correlated electronic structure methods involve a significant amount of computations and can be only employed to small molecular systems. For example, the coupled-cluster singles, doubles, and perturbative triples model (CCSD(T)), which is known as the ``gold standard" of quantum chemistry for its accuracy, usually can treat molecules with 20-30 atoms. To extend the reach of accurate correlated electronic structure methods to larger molecular systems, we work towards two directions: parallel computing and reduced-cost/scaling approaches. Parallel computing can utilize more computational resources to handle systems that demand more substantial computational efforts. Reduced-cost/scaling approaches, which introduce approximations to the existing electronic structure methods, can significantly reduce the amount of computation and storage requirements. In this work, we introduce a new distributed-memory massively parallel implementation of standard and explicitly correlated (F12) coupled-cluster singles and doubles (CCSD) with canonical bigO{N^6} computational complexity ( C. Peng, J. A. Calvin, F. Pavov{s}evi'c, J. Zhang, and E. F. Valeev, textit{J. Phys. Chem. A} 2016, textbf{120}, 10231.), based on the TiledArray tensor framework. Excellent strong scaling is demonstrated on a multi-core shared-memory computer, a commodity distributed-memory computer, and a national-scale supercomputer. We also present a distributed-memory implementation of the density-fitting (DF) based CCSD(T) method. (C. Peng, J. A. Calvin, and E. F. Valeev, textit{in preparation for submission}) An improved parallel DF-CCSD is presented utilizing lazy evaluation for tensors with more than two unoccupied indices, which makes the DF-CCSD storage requirements always smaller than those of the non-iterative triples correction (T). Excellent strong scaling is observed on both shared-memory and distributed-memory computers equipped with conventional Intel Xeon processors and the Intel Xeon Phi (Knights Landing) processors. With the new implementation, the CCSD(T) energies can be evaluated for systems containing 200 electrons and 1000 basis functions in a few days using a small size commodity cluster, with even more massive computations possible on leadership-class computing resources. The inclusion of F12 correction to the CCSD(T) method makes it converge to basis set limit much more rapidly. The large-scale parallel explicitly correlated coupled-cluster program makes the accurate estimation of the coupled-cluster basis set limit for molecules with 20 or more atoms a routine. Thus, it can be used rigorously to test the emerging reduced-scaling coupled-cluster approaches. Moreover, we extend the pair natural orbital (PNO) approach to excited states through the equation-of-motion coupled cluster singles and doubles (EOM-CCSD) method. (C. Peng, M. C. Clement, and E. F. Valeev, textit{submitted}) We simulate the PNO-EOM-CCSD method using an existing massively parallel canonical EOM-CCSD program. We propose the use of state-averaged PNOs, which are generated from the average of the pair density of excited states, to span the PNO space of all the excited states. The doubles amplitudes in the CIS(D) method are used to compute the state-averaged pair density of excited states. The issue of incorrect states in the state-averaged pair density, caused by an energy reordering of excited states between the CIS(D) and EOM-CCSD, is resolved by simply computing more states than desired. We find that with a truncation threshold of
10−7, the truncation error for the excitation energy is already below 0.02 eV for the systems tested, while the average number of PNOs is reduced to 50-70 per pair. The accuracy of the PNO-EOM-CCSD method on local, Rydberg and charge transfer states is also investigated.
In this work, we present an amplitude extrapolation ansatz for geometry optimization that uses calculations from previous steps to construct an initial guess for the quasi-Newton solver at each new geometry, significantly accelerating convergence of the coupled-cluster and Lambda solver alike. The ansatz incorporates a necessary amplitude transformation to mitigate discontinuities associated with orbital energy crossings at the Hartree-Fock level of theory, while remaining computational and memory efficient. The method is tested for a diverse set of medium-sized molecules to demonstrate a systematic and significant reduction in the number of coupled-cluster iterations compared to the conventional method.