Efficient simulation of infinite tree tensor network states on the Bethe lattice
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
We show that the simple update approach proposed by Jiang et al. [H. C. Jiang, Z. Y. Weng, and T. Xiang, Phys. Rev. Lett. 101, 090603 (2008)] is an efficient and accurate method for determining the infinite tree tensor network states on the Bethe lattice. Ground-state properties of the quantum transverse Ising model and the Heisenberg XXZ model on the Bethe lattice are studied. The transverse Ising model is found to undergo a second-order quantum phase transition with a diverging magnetic susceptibility but a finite correlation length which is upper bounded by $1/\mathrm{ln}(q\ensuremath{-}1)$ even at the transition point ($q$ is the coordinate number of the Bethe lattice). An intuitive explanation on this peculiar ``critical'' phenomenon is given. The XXZ model on the Bethe lattice undergoes a first-order quantum phase transition at the isotropic point. Furthermore, the simple update scheme is found to be related with the Bethe approximation. Finally, by applying the simple update to various tree tensor clusters, we can obtain rather nice and scalable approximations for two-dimensional lattices.
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.
Integrity signals
Registry
Cites
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.
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
Density matrix formulation for quantum renormalization groups
White, S. R. (1992) · Physical Review Letters · doi:10.1103/physrevlett.69.2863 · Cited by 7,702
Density-matrix algorithms for quantum renormalization groups
White, S. R. (1993) · Physical Review B · doi:10.1103/physrevb.48.10345 · Cited by 3,244
Classical simulation of quantum many-body systems with a tree tensor network
Shi, Y.-Y., Duan, L.-M., & Vidal, G. (2006) · Physical Review A · doi:10.1103/physreva.74.022320 · Cited by 577
Tagliacozzo, L., Evenbly, G., & Vidal, G. (2009) · Physical Review B · doi:10.1103/physrevb.80.235127 · Cited by 261
Simulating strongly correlated quantum systems with tree tensor networks
Murg, V., Verstraete, F., Legeza, Ö., & Noack, R. M. (2010) · Physical Review B · doi:10.1103/physrevb.82.205105 · Cited by 245
Cited by
Orús, R. (2014) · Annals of Physics · doi:10.1016/j.aop.2014.06.013 · Cited by 2,255
Gapless Spin-Liquid Ground State in theS=1/2Kagome Antiferromagnet
Liao, H. J., Xie, Z. Y., Chen, J., Liu, Z. Y., Xie, H. D., Huang, R. Z., Normand, B., & Xiang, T. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.137202 · Cited by 385
Self-citationDifferentiable Programming Tensor Networks
Liao, H.-J., Liu, J.-G., Wang, L., & Xiang, T. (2019) · Physical Review X · doi:10.1103/physrevx.9.031041 · Cited by 251
Self-citationInfinite projected entangled pair states algorithm improved: Fast full update and gauge fixing
Phien, H. N., Bengua, J. A., Tuan, H. D., Corboz, P., & Orús, R. (2015) · Physical Review B · doi:10.1103/physrevb.92.035142 · Cited by 227
Nakatani, N., & Chan, G. K.-L. (2013) · The Journal of Chemical Physics · doi:10.1063/1.4798639 · Cited by 184
Metadata
- Authors
- Li, W., von Delft, J., & Xiang, T.
- Venue
- Physical Review B
- Publisher
- American Physical Society (APS)
- Published
- 2012-11-26
- Volume
- 86
- Issue
- 19
- ISSN
- 1098-0121 (ISSN-L)
- 1550-235X
- OpenAlex
- W1976983183
- Cited by
- 84
- References
- 5
- FWCI
- 2.66
- 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: Efficient simulation of infinite tree tensor network states on the Bethe lattice. https://app.cochat.ai/papers/10.1103/physrevb.86.195137
- The paper
- Li, W., von Delft, J., & Xiang, T. (2012). Efficient simulation of infinite tree tensor network states on the Bethe lattice. Physical Review B. https://doi.org/10.1103/physrevb.86.195137
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.