CoChat

Exploiting translational invariance in matrix product state simulations of spin chains with periodic boundary conditions

Open access
Pirvu, B., Verstraete, F., Vidal, G. · 2011 · Physical Review B
Cited by 52

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

Abstract

We present a matrix product state (MPS) algorithm to approximate ground states of translationally invariant systems with periodic boundary conditions. For a fixed value of the bond dimension $D$ of the MPS, we discuss how to minimize the computational cost to obtain a seemingly optimal MPS approximation to the ground state. In a chain with $N$ sites and correlation length $\ensuremath{\xi}$, the computational cost formally scales as $g(D,\ensuremath{\xi}/N){D}^{3}$, where $g(D,\ensuremath{\xi}/N)$ is a nontrivial function. For $\ensuremath{\xi}\ensuremath{\ll}N$, this scaling reduces to ${D}^{3}$, independent of the system size $N$, making our method $N$ times faster than previous proposals. We apply the algorithm to obtain MPS approximations for the ground states of the critical quantum Ising and Heisenberg spin-$1/2$ models as well as for the noncritical Heisenberg spin-$1$ model. In the critical case, for any chain length $N$, we find a model-dependent bond dimension $D(N)$ above which the polynomial decay of correlations is faithfully reproduced throughout the entire system.

Overview

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

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Integrity signals

Registry

Crossref · 10.1103/physrevb.83.125104

Cites

2 of 2 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.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Cited by

See all 52

Metadata

Authors
Pirvu, B., Verstraete, F., & Vidal, G.
Venue
Physical Review B
Published
2011-03-17
Volume
83
Issue
12
ISSN
  • 1098-0121 (ISSN-L)
  • 1550-235X
OpenAlex
W2149075194
Cited by
52
References
2
FWCI
3.82
Type
journal article
Language
en
Open access
bronze

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

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.