Optimizing linked cluster expansions by white graphs

12 May 2015 Coester K. Schmidt K. P.

We introduce a white graph expansion for the method of perturbative continuous unitary transformations when implemented as a linked cluster expansion. The essential idea behind an expansion in white graphs is to perform an optimized bookkeeping during the calculation by exploiting the model-independent effective Hamiltonian in second quantization and the associated inherent cluster additivity... (read more)

PDF Abstract
No code implementations yet. Submit your code now