We investigate the efficient combination of the canonical polyadic decomposition (CPD) and tensor hyper-contraction (THC) approaches. We first present a novel low-cost CPD solver which leverages a precomputed THC factorization of an order-$4$ tensor to efficiently optimize the order-$4$ CPD with $\mathcal{O}(NR^2)$ scaling. With the matrix-free THC-based optimization strategy in hand we can: efficiently generate CPD factorizations of the order-4 two-electron integral tensors; and develop novel electronic structure methods which take advantage of both the THC and CPD approximations. Next, we investigate the application of a combined CPD and THC approximation of the Laplace transform (LT) second-order Møller-Plesset (MP2) method. We exploit the ability to switch efficiently between the THC and CPD factorizations of the two electron integrals to reduce the computational complexity of the LT MP2 method while preserving the accuracy of the approach. Furthermore we take advantage of the robust fitting approximation to eliminate leading order error in the CPD approximated tensor networks. Finally, we show that modest values of THC and CPD rank preserve the accuracy of the LT MP2 method and that this CPD+THC LT MP2 strategy realizes a performance advantage over canonical LT MP2 in both computational wall-times and memory resource requirements.
We investigate the efficient combination of the canonical polyadic decomposition (CPD) and tensor hyper-contraction (THC) approaches. We first present a novel low-cost CPD solver which leverages a precomputed THC factorization of an order-4 tensor to efficiently optimize the order-4 CPD with O(NR2) scaling. With the matrix-free THC-based optimization strategy in hand we can: efficiently generate CPD factorizations of the order-4 two-electron integral tensors; and develop novel electronic structure methods which take advantage of both the THC and CPD approximations. Next, we investigate the application of a combined CPD and THC approximation of the Laplace transform (LT) second-order Møller-Plesset (MP2) method. We exploit the ability to switch efficiently between the THC and CPD factorizations of the two electron integrals to reduce the computational complexity of the LT MP2 method while preserving the accuracy of the approach. Furthermore we take advantage of the robust fitting approximation to eliminate leading order error in the CPD approximated tensor networks. Finally, we show that modest values of THC and CPD rank preserve the accuracy of the LT MP2 method and that this CPD+THC LT MP2 strategy realizes a performance advantage over canonical LT MP2 in both computational wall-times and memory resource requirements.
We investigate the efficient combination of the canonical polyadic decomposition (CPD) and tensor hyper-contraction (THC) approaches. We first present a novel low-cost CPD solver that leverages a precomputed THC factorization of an order-4 tensor to efficiently optimize the order-4 CPD with O ( N R 2 ) scaling. With the matrix-free THC-based optimization strategy in hand, we can efficiently generate CPD factorizations of the order-4 two-electron integral tensors and develop novel electronic structure methods that take advantage of both the THC and CPD approximations. Next, we investigate the application of a combined CPD and THC approximation of the Laplace transform (LT) second-order Mo̷ller-Plesset (MP2) method. We exploit the ability to switch efficiently between the THC and CPD factorizations of the two-electron integrals to reduce the computational complexity of the LT MP2 method while preserving the accuracy of the approach. Furthermore, we take advantage of the robust fitting approximation to eliminate the leading-order error in the CPD approximated tensor networks. Finally, we show that modest values of THC and CPD rank preserve the accuracy of the LT MP2 method and that this CPD + THC LT MP2 strategy realizes a performance advantage over canonical LT MP2 in both computational wall-times and memory resource requirements.
We investigate a novel approach to approximate tensor-network contraction via the exact, matrix-free decomposition of full tensor-networks. We study this method as a means to eliminate the propagation of error in the approximation of tensor-networks. Importantly, this decomposition-based approach is generic, i.e. it does not depend on a specific tensor-network, the tensor index (physical) ordering, or the choice of tensor decomposition. Careful consideration should be made to determine the best decomposition strategy. Furthermore, this method does not rely on robust cancellation of errors (i.e. the Taylor expansion). As a means to study the effectiveness of the approach, we replace the exact contraction of the particle particle ladder (PPL) tensor diagram in the popular coupled-cluster with single and double excitation (CCSD) method with a low-rank tensor decomposition, namely the canonical polyadic decomposition (CPD). With this approach, we replace an O(N6) tensor contractions with a potentially reduced-scaling O(N4R) optimization problem, where R is the CP rank, and we reduce the computational storage of the PPL tensor from O(N4) to O(NR), although we do not take advantage of this compression in this study. To minimize the cost of the CPD optimization, we utilize the iterative structure of CCSD to efficiently initialize the CPD optimization. We show that accurate chemically-relevant energy values can be computed with an error of less than 1 kcal/mol using a relatively low CP rank.
We investigate a novel approach to approximate tensor-network contraction via the exact, matrix-free decomposition of full tensor-networks. We study this method as a means to eliminate the propagation of error in the approximation of tensor-networks. Importantly, this decomposition-based approach is generic, i.e., it does not depend on a specific tensor-network, the tensor index (physical) ordering, or the choice of tensor decomposition. Careful consideration should be made to determine the best decomposition strategy. Furthermore, this method does not rely on robust cancellation of errors (i.e., the Taylor expansion). As a means to study the effectiveness of the approach, we replace the exact contraction of the particle–particle ladder (PPL) tensor diagram in the popular coupled-cluster with single and double excitation (CCSD) method with a low-rank tensor decomposition, namely the canonical polyadic decomposition (CPD). With this approach, we replace an O ( N 6 ) tensor contractions with a potentially reduced-scaling O ( N 4 R ) optimization problem, where R is the CP rank, and we reduce the computational storage of the PPL tensor from O ( N 4 ) to O ( N R ), although we do not take advantage of this compression in this study. To minimize the cost of the CPD optimization, we utilize the iterative structure of CCSD to efficiently initialize the CPD optimization. We show that accurate chemically relevant energy values can be computed with an error of less than 1 kcal/mol using a relatively low CP rank.
We incorporate a canonical polyadic decomposition (CPD)-based low-level solver as a means to accelerate the environment-level solver for the recently developed Møller-Plesset Coupled-Cluster (MPCC) embedding framework. Using CPD, we both factorize the three dominant order-three density-fitting two-electron integral (DF TEI) tensors and develop a novel formulation that reduces the storage complexity of the low-level solver from O(N3) to O(NR), where R is the CPD rank, and the computational scaling of the most time-consuming contractions from O(N4) to O(NR2). We provide benchmarks on representative chemical environments, namely water clusters (H2O)n with n = 1 to 6 and linear alkane chains CnH2n+2 with n = 1 to 6. For both test sets, using the CPD-compressed DF TEI tensors reproduces the DF reference convergence behavior of the low-level solver, the subsequent high-level step, and the fully self-consistent MPCC iterations, while introducing only small, rank-controlled shifts in absolute energies. At a fixed tolerance in the absolute MPCC energy, the CP ranks required for these tensor approximations increase linearly with system size. Chemically relevant energy differences are likewise preserved, as demonstrated for water-cluster dissociation energies and in a proof-of-concept embedding calculation of methane in a four-water cluster.
The extension of least-squares tensor hypercontracted second- and third-order Møller–Plesset perturbation theory (LS-THC-MP2 and LS-THC-MP3) to open-shell systems is an important development due to the scaling reduction afforded by THC and the ubiquity of molecular ions, radicals, and other open-shell reactive species. The complexity of wavefunction-based quantum-chemical methods such as Møller–Plesset and coupled cluster theory is reflected in the steep scaling of the computational costs with the molecular size. The least-squares tensor hypercontraction (LS-THC) method is an efficient, single-step factorization for the two-electron integral tensor but can also be used to factorize the double excitation amplitudes, leading to significant scaling reduction. Here we extend this promising method to open-shell variants of LS-THC-MP2 and -MP3 by using diagrammatic techniques and explicit spin summation. The accuracy of the resulting methods for open-shell species is benchmarked on standard test systems such as regular alkanes as well as realistic systems involving bond breaking, radical stabilization, and other effects. We find that open-shell LS-THC-MP n methods exhibit errors highly comparable to those produced by closed-shell LS-THC-MP n and are highly insensitive to particular chemical interactions, geometries, or even moderate spin contamination.
In a previous publication, we have discussed the usage of tensor decomposition in the canonical polyadic (CP) tensor format for electronic structure methods. There, we focused on two-electron integrals and second order Møller-Plesset perturbation theory (MP2). In this work, we discuss the CP format for Coupled Cluster (CC) theory and present a pilot implementation for the Coupled Cluster Doubles method. We discuss the iterative solution of the CC amplitude equations using tensors in CP representation and present a tensor contraction scheme that minimizes the effort necessary for the rank reductions during the iterations. Furthermore, several details concerning the reduction of complexity of the algorithm, convergence of the CC iterations, truncation errors, and the choice of threshold for chemical accuracy are discussed.