Paper detail

Optimizing linked cluster expansions by white graphs

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.

preprint2015arXivOpen access

Signal facts

What is known right now

Open access2 authors1 topic

Next steps

Decide what to do with this paper

Use like or dislike for the fast social read. The more specific scholarly feedback stays available below when needed.

Log in to curate

Reading frame

Keep the important context close to the paper

Keep the important signals around this paper in one place: votes, save state, collection context, reviews and the metadata you need before deciding what to do next.

Institutions

Add specific reaction

Move through the context

Research map

Open full explorer

Move through nearby people, institutions, topics and adjacent work without leaving the paper page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Structured reviews

0 review(s)

ContributeLeave structured feedbackUse the review template when you have a concrete strength, concern or method question.Open review form

No structured reviews yet. High-signal critique starts here.

Work discussion

0 comment(s)

DiscussAdd a high-signal commentKeep quick notes, caveats and replication pointers separate from formal reviews.Open comment form

No discussion yet. The first strong comment sets the tone.