CoChat
Sign Up
Cited by 261Quantum many-body systemsQuantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

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

Simulation of two-dimensional quantum systems using a tree tensor network that exploits the entropic area law

Open access
Tagliacozzo, L., Evenbly, G., Vidal, G.·2009·Physical Review B
DOI 10.1103/physrevb.80.235127
Open this paper in CoChat — free accountOpen PDF

Abstract

This work explores the use of a tree tensor network ansatz to simulate the ground state of a local Hamiltonian on a two-dimensional lattice. By exploiting the entropic area law, the tree tensor network ansatz seems to produce quasiexact results in systems with sizes well beyond the reach of exact diagonalization techniques. We describe an algorithm to approximate the ground state of a local Hamiltonian on a $L\ifmmode\times\else\texttimes\fi{}L$ lattice with the topology of a torus. Accurate results are obtained for $L={4,6,8}$, whereas approximate results are obtained for larger lattices. As an application of the approach, we analyze the scaling of the ground-state entanglement entropy at the quantum critical point of the model. We confirm the presence of a positive additive constant to the area law for half a torus. We also find a logarithmic additive correction to the entropic area law for a square block. The single copy entanglement for half a torus reveals similar corrections to the area law with a further term proportional to $1/L$.

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.80.235127

Cites

61 of 61 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

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

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

Flagged first, then by citations

Show all 61 references

Research works printed but not linked: 1

  1. J. I. Latorre, 2004, Quantum Inf. Comput., 4, 48

Cited by

Sorted by citations

Related

See all

Metadata

Authors
Tagliacozzo, L., Evenbly, G., & Vidal, G.
Affiliations
The University of Queensland (AU)
ORCID
Venue
Physical Review B
Publisher
American Physical Society (APS)
Published
2009-12-18
Volume
80
Issue
23
ISSN
  • 1098-0121 (ISSN-L)
  • 1550-235X
DOI
10.1103/physrevb.80.235127
OpenAlex
W2118564312
Cited by
261
References
61
Citations by year
2026: 17 · 2025: 20 · 2024: 20 · 2023: 20 · 2022: 10 · 2021: 5 · 2020: 21 · 2019: 22 · 2018: 16 · 2017: 11 · 2016: 8 · 2015: 13 · 2014: 17 · 2013: 16 · 2012: 18
FWCI
8.37
Type
journal article
Language
en
Open access
Licence
link.aps.org/licenses/aps-default-license (vor)
Locations
  • Physical Review B (publishedVersion)
  • arXiv (Cornell University) (publishedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
Keywords
tree tensor networks, ground state simulation, local Hamiltonians, two-dimensional quantum systems, entanglement entropy, quantum critical point, logarithmic corrections

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