Tensor Network Annealing Algorithm for Two-Dimensional Thermal States
Open accessThe DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Abstract
Tensor network methods have become a powerful class of tools to capture strongly correlated matter, but methods to capture the experimentally ubiquitous family of models at finite temperature beyond one spatial dimension are largely lacking. We introduce a tensor network algorithm able to simulate thermal states of two-dimensional quantum lattice systems in the thermodynamic limit. The method develops instances of projected entangled pair states and projected entangled pair operators for this purpose. It is the key feature of this algorithm to resemble the cooling down of the system from an infinite temperature state until it reaches the desired finite-temperature regime. As a benchmark, we study the finite-temperature phase transition of the Ising model on an infinite square lattice, for which we obtain remarkable agreement with the exact solution. We then turn to study the finite-temperature Bose-Hubbard model in the limits of two (hard-core) and three bosonic modes per site. Our technique can be used to support the experimental study of actual effectively two-dimensional materials in the laboratory, as well as to benchmark optical lattice quantum simulators with ultracold atoms.
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
The density-matrix renormalization group in the age of matrix product states
Schollwöck, U. (2011) · Annals of Physics · doi:10.1016/j.aop.2010.09.012 · Cited by 4,818
Quantum simulations with ultracold quantum gases
Bloch, I., Dalibard, J., & Nascimbène, S. (2012) · Nature Physics · doi:10.1038/nphys2259 · Cited by 2,339
Orús, R. (2014) · Annals of Physics · doi:10.1016/j.aop.2014.06.013 · Cited by 2,255
Self-citationMatrix 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
Thermodynamic limit of density matrix renormalization.
Östlund, S., & Rommer, S. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.3537 · Cited by 1,077
Goals and opportunities in quantum simulation
Cirac, J. I., & Zoller, P. (2012) · Nature Physics · doi:10.1038/nphys2275 · Cited by 891
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
Self-citationOrús, R., & Vidal, G. (2009) · Physical Review B · doi:10.1103/physrevb.80.094403 · Cited by 387
Self-citationComputational complexity of projected entangled pair states
Schuch, N., Wolf, M. M., Verstraete, F., & Cirac, J. I. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.140506 · Cited by 313
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
Contracting projected entangled pair states is average-case hard
Haferkamp, J., Hangleiter, D., Eisert, J., & Gluza, M. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.013010 · Cited by 62
Self-citationTime 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
- Kshetrimayum, A., Rizzi, M., Eisert, J., & Orús, R.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2019-02-22
- Volume
- 122
- Issue
- 7
- Pages
- 070502-070502
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W3021348370
- Cited by
- 85
- References
- 10
- FWCI
- 6.56
- 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
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.