Optimized decimation of tensor networks with super-orthogonalization for two-dimensional quantum lattice models
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
An algorithm based on the optimized decimation of tensor networks with super-orthogonalization (ODTNS) that can be applied to simulate efficiently and accurately not only the ground state but also the thermodynamic properties of two-dimensional (2D) quantum lattice models is proposed. By transforming the 2D quantum model into a three-dimensional (3D) closed tensor network (TN) comprised of the tensor product density operator and a 3D brick-wall TN, the free energy of the system can be calculated with the imaginary time evolution, in which the network Tucker decomposition is suggested for the first time to obtain the optimal lower-dimensional approximation on the bond space by transforming the TN into a super-orthogonal form. The efficiency and accuracy of this algorithm are testified, which are fairly comparable with the quantum Monte Carlo calculations. Besides, the present ODTNS scheme can also be applicable to the 2D frustrated quantum spin models with nice efficiency.
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 algorithms for quantum renormalization groups
White, S. R. (1993) · Physical Review B · doi:10.1103/physrevb.48.10345 · Cited by 3,244
Matrix Product Density Operators: Simulation of Finite-Temperature and Dissipative Systems
Verstraete, F., García-Ripoll, J. J., & Cirac, J. I. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.207204 · Cited by 1,098
Classical Simulation of Infinite-Size Quantum Lattice Systems in Two Spatial Dimensions
Jordan, J., Orús, R., Vidal, G., Verstraete, F., & Cirac, J. I. (2008) · Physical Review Letters · doi:10.1103/physrevlett.101.250602 · Cited by 710
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
Cited by
Tensor Network Contractions: Methods and Applications to Quantum Many-Body Systems
Ran, S.-J., Tirrito, E., Peng, C., Chen, X., Tagliacozzo, L., Su, G., & Lewenstein, M. (2020) · Lecture Notes in Physics · doi:10.1007/978-3-030-34489-4 · Cited by 176
Self-citationEfficient Tensor Network Simulation of IBM’s Eagle Kicked Ising Experiment
Tindall, J., Fishman, M., Stoudenmire, E. M., & Sels, D. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.010308 · Cited by 152
Begušić, T., Gray, J., & Chan, G. K.-L. (2024) · Science Advances · doi:10.1126/sciadv.adk4321 · Cited by 89
Time evolution of an infinite projected entangled pair state: Neighborhood tensor update
Dziarmaga, J. (2021) · Physical Review B · doi:10.1103/physrevb.104.094411 · Cited by 38
Simulation of three-dimensional quantum systems with projected entangled-pair states
Vlaar, P. C. G., & Corboz, P. (2021) · Physical Review B · doi:10.1103/physrevb.103.205137 · Cited by 38
Metadata
- Authors
- Ran, S.-J., Li, W., Xi, B., Zhang, Z., & Su, G.
- Venue
- Physical Review B
- Publisher
- American Physical Society (APS)
- Published
- 2012-10-26
- Volume
- 86
- Issue
- 13
- ISSN
- 1098-0121 (ISSN-L)
- 1550-235X
- OpenAlex
- W2084823734
- Cited by
- 67
- References
- 5
- FWCI
- 1.16
- 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: Optimized decimation of tensor networks with super-orthogonalization for two-dimensional quantum lattice models. https://app.cochat.ai/papers/10.1103/physrevb.86.134429
- The paper
- Ran, S.-J., Li, W., Xi, B., Zhang, Z., & Su, G. (2012). Optimized decimation of tensor networks with super-orthogonalization for two-dimensional quantum lattice models. Physical Review B. https://doi.org/10.1103/physrevb.86.134429
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.