# Optimizing linked cluster expansions by white graphs

Source: [Optimizing linked cluster expansions by white graphs](<https://www.sota2.com/research/paper/68fa32311e209131ce885f9b>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-24T19:21:45.032Z

Authors: K. Coester, K.P. Schmidt

Published: 2015-05-12T12:07:38.000Z

## Abstract

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. This appoach is shown to be especially well suited for microscopic models with many coupling constants, since the total number of relevant graphs is drastically reduced. The white graph expansion is exemplified for a two-dimensional quantum spin model of coupled two-leg XXZ ladders.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1505.02975>)

[PDF](<https://arxiv.org/pdf/1505.02975.pdf>)