Papers
Topics
Authors
Recent
Search
2000 character limit reached

Coupled Cluster as an impurity solver for Green's function embedding methods

Published 10 Jun 2019 in cond-mat.str-el, physics.chem-ph, and physics.comp-ph | (1906.04079v1)

Abstract: We investigate the performance of Green's function coupled cluster singles and doubles (CCSD) method as a solver for Green's function embedding methods. To develop an efficient CC solver, we construct the one-particle Green's function from the coupled cluster (CC) wave function based on a non-hermitian Lanczos algorithm. The major advantage of this method is that its scaling does not depend on the number of frequency points. We have tested the applicability of the CC Green's function solver in the weakly to strongly correlated regimes by employing it for a half-filled 1D Hubbard model projected onto a single site impurity problem and a half-filled 2D Hubbard model projected onto a 4-site impurity problem. For the 1D Hubbard model, for all interaction strengths, we observe an excellent agreement with the full configuration interaction (FCI) technique, both for the self-energy and spectral function. For the 2D Hubbard, we have employed an open-shell version of the current implementation and observed some discrepancies from FCI in the strongly correlated regime. Finally, on an example of a small ammonia cluster, we analyze the performance of the Green's function CCSD solver within the self-energy embedding theory (SEET) with Hartee-Fock (HF) and Green's function second order (GF2) for the treatment of the environment.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.