Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 171

The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.

Strictly single-site DMRG algorithm with subspace expansion

Open access
Hubig, C., McCulloch, I. P., Schollwöck, U., Wolf, F. A.·2015·Physical Review B

Abstract

We introduce a strictly single-site DMRG algorithm based on the subspace expansion of the alternating minimal energy (AMEn) method. The proposed new MPS basis enrichment method is sufficient to avoid local minima during the optimization, similar to the density matrix perturbation method, but computationally cheaper. Each application of $\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{H}$ to $|\ensuremath{\Psi}\ensuremath{\rangle}$ in the central eigensolver is reduced in cost for a speed-up of $\ensuremath{\approx}(d+1)/2$, with $d$ the physical site dimension. Further speed-ups result from cheaper auxiliary calculations and an often greatly improved convergence behavior. Runtime to convergence improves by up to a factor of 2.5 on the Fermi-Hubbard model compared to the previous single-site method and by up to a factor of 3.9 compared to two-site DMRG. The method is compatible with real-space parallelization and non-Abelian symmetries.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physrevb.91.155115

Cites

5 of 5 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 5 references

Cited by

See all 171

Metadata

Authors
Hubig, C., McCulloch, I. P., Schollwöck, U., & Wolf, F. A.
Venue
Physical Review B
Published
2015-04-10
Volume
91
Issue
15
ISSN
  • 1098-0121 (ISSN-L)
  • 1550-235X
OpenAlex
W2084546468
Cited by
171
References
5
FWCI
6.11
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Strictly single-site DMRG algorithm with subspace expansion. https://app.cochat.ai/papers/10.1103/physrevb.91.155115
The paper
Hubig, C., McCulloch, I. P., Schollwöck, U., & Wolf, F. A. (2015). Strictly single-site DMRG algorithm with subspace expansion. Physical Review B. https://doi.org/10.1103/physrevb.91.155115

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.