Do you want to publish a course? Click here

GFCCLib: Scalable and Efficient Coupled-Cluster Greens Function Library for Accurately Tackling Many Body Electronic Structure Problems

80   0   0.0 ( 0 )
 Added by Bo Peng
 Publication date 2020
  fields Physics
and research's language is English




Ask ChatGPT about the research

Coupled cluster Greens function (GFCC) calculation has drawn much attention in the recent years for targeting the molecular and material electronic structure problems from a many body perspective in a systematically improvable way. However, GFCC calculations on scientific computing clusters usually suffer from expensive higher dimensional tensor contractions in the complex space, expensive interprocess communication, and severe load imbalance, which limits its routine use for tackling electronic structure problems. Here we present a numerical library prototype that is specifically designed for large scale GFCC calculations. The design of the library is focused on a systematically optimal computing strategy to improve its scalability and efficiency. The performance of the library is demonstrated by the relevant profiling analysis of running GFCC calculations on remote giant computing clusters. The capability of the library is highlighted by computing a wide near valence band of a fullerene C60 molecule for the first time at the GFCCSD level that shows excellent agreement with the experimental spectrum.

rate research

Read More

Coupled cluster Greens function (CCGF) approach has drawn much attention in recent years for targeting the molecular and material electronic structure problems from a many-body perspective in a systematically improvable way. Here, we will present a brief review of the history of how the Greens function method evolved with the wavefunction, early and recent development of CCGF theory, and more recently scalable CCGF software development. We will highlight some of the recent applications of CCGF approach and propose some potential applications that would emerge in the near future.
Greens function methods within many-body perturbation theory provide a general framework for treating electronic correlations in excited states. Here we investigate the cumulant form of the one-electron Greens function based on the coupled-cluster equation of motion approach in an extension of our previous study. The approach yields a non-perturbative expression for the cumulant in terms of the solution to a set of coupled first order, non-linear differential equations. The method thereby adds non-linear corrections to traditional cumulant methods linear in the self energy. The approach is applied to the core-hole Greens function and illustrated for a number of small molecular systems. For these systems we find that the non-linear contributions lead to significant improvements both for quasiparticle properties such as core-level binding energies, as well as the satellites corresponding to inelastic losses observed in photoemission spectra.
Within the self-energy embedding theory (SEET) framework, we study coupled cluster Greens function (GFCC) method in two different contexts: as a method to treat either the system or environment present in the embedding construction. Our study reveals that when GFCC is used to treat the environment we do not see improvement in total energies in comparison to the coupled cluster method itself. To rationalize this puzzling result, we analyze the performance of GFCC as an impurity solver with a series of transition metal oxides. These studies shed light on strength and weaknesses of such a solver and demonstrate that such a solver gives very accurate results when the size of the impurity is small. We investigate if it is possible to achieve a systematic accuracy of the embedding solution when we increase the size of the impurity problem. We found that in such a case, the performance of the solver worsens, both in terms of finding the ground state solution of the impurity problem as well as the self-energies produced. We concluded that increasing the rank of GFCC solver is necessary to be able to enlarge impurity problems and achieve a reliable accuracy. We also have shown that natural orbitals from weakly correlated perturbative methods are better suited than symmetrized atomic orbitals (SAO) when the total energy of the system is the target quantity.
We present CheSS, the Chebyshev Sparse Solvers library, which has been designed to solve typical problems arising in large-scale electronic structure calculations using localized basis sets. The library is based on a flexible and efficient expansion in terms of Chebyshev polynomials and presently features the calculation of the density matrix, the calculation of matrix powers for arbitrary powers, and the extraction of eigenvalues in a selected interval. CheSS is able to exploit the sparsity of the matrices and scales linearly with respect to the number of nonzero entries, making it well-suited for large-scale calculations. The approach is particularly adapted for setups leading to small spectral widths of the involved matrices and outperforms alternative methods in this regime. By coupling CheSS to the DFT code BigDFT, we show that such a favorable setup is indeed possible in practice. In addition, the approach based on Chebyshev polynomials can be massively parallelized, and CheSS exhibits excellent scaling up to thousands of cores even for relatively small matrix sizes.
Classical machine learning (ML) provides a potentially powerful approach to solving challenging quantum many-body problems in physics and chemistry. However, the advantages of ML over more traditional methods have not been firmly established. In this work, we prove that classical ML algorithms can efficiently predict ground state properties of gapped Hamiltonians in finite spatial dimensions, after learning from data obtained by measuring other Hamiltonians in the same quantum phase of matter. In contrast, under widely accepted complexity theory assumptions, classical algorithms that do not learn from data cannot achieve the same guarantee. We also prove that classical ML algorithms can efficiently classify a wide range of quantum phases of matter. Our arguments are based on the concept of a classical shadow, a succinct classical description of a many-body quantum state that can be constructed in feasible quantum experiments and be used to predict many properties of the state. Extensive numerical experiments corroborate our theoretical results in a variety of scenarios, including Rydberg atom systems, 2D random Heisenberg models, symmetry-protected topological phases, and topologically ordered phases.
comments
Fetching comments Fetching comments
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا