CoChat

Efficient tree tensor network states (TTNS) for quantum chemistry: Generalizations of the density matrix renormalization group algorithm

Open access
Nakatani, Naoki, Chan, Garnet Kin-Lic · 2013 · The Journal of Chemical Physics

The DOI matches its Crossref record; 42 of the 43 references it cites were found in a registry or an index, and 1 are not checked yet.

Abstract

We investigate tree tensor network states for quantum chemistry. Tree tensor network states represent one of the simplest generalizations of matrix product states and the density matrix renormalization group. While matrix product states encode a one-dimensional entanglement structure, tree tensor network states encode a tree entanglement structure, allowing for a more flexible description of general molecules. We describe an optimal tree tensor network state algorithm for quantum chemistry. We introduce the concept of half-renormalization which greatly improves the efficiency of the calculations. Using our efficient formulation we demonstrate the strengths and weaknesses of tree tensor network states versus matrix product states. We carry out benchmark calculations both on tree systems (hydrogen trees and π-conjugated dendrimers) as well as non-tree molecules (hydrogen chains, nitrogen dimer, and chromium dimer). In general, tree tensor network states require much fewer renormalized states to achieve the same accuracy as matrix product states. In non-tree molecules, whether this translates into a computational savings is system dependent, due to the higher prefactor and computational scaling associated with tree algorithms. In tree like molecules, tree network states are easily superior to matrix product states. As an illustration, our largest dendrimer calculation with tree tensor network states correlates 110 electrons in 110 active orbitals.

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.1063/1.4798639

Cites

42 of 43 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

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

Show all 43 references

Research works printed but not linked: 2

  1. S. N. Sivanandam and S. N. Deepa, Introduction to Genetic Algorithm (Springer-Verlag, Berlin/Heidelberg, 2010).
  2. H. Meier and M. Lehmann, Angew. Chem., Int. Ed. 37, 643 (1998). · doi:10.1002/(sici)1521-3773(19980316)37:5<643::aid-anie643>3.0.co;2-4

Cited by

Items 101–200 of 238

Metadata

Authors
Nakatani, N., & Chan, G. K.-L.
Affiliations
Princeton University (US)
Venue
The Journal of Chemical Physics
Published
2013-04-04
Volume
138
Issue
13
Pages
134113-134113
ISSN
  • 0021-9606 (ISSN-L)
  • 1089-7690
OpenAlex
W2048364886
Cited by
184
References
43
Citations by year
2026: 12 · 2025: 17 · 2024: 21 · 2023: 11 · 2022: 10 · 2021: 10 · 2020: 29 · 2019: 19 · 2018: 13 · 2017: 9 · 2016: 9 · 2015: 9 · 2014: 11 · 2013: 4
FWCI
5.66
Type
journal article
Language
en
Open access
Locations
  • The Journal of Chemical Physics (publishedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • CaltechAUTHORS (California Institute of Technology) (submittedVersion)
  • arXiv (Cornell University)
Funders
National Science Foundation (NSF-CHE-1213933, NSF-OCI-1148287)
Topics
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Advanced Chemical Physics Studies
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
Keywords
density matrix renormalization group, matrix product states, quantum chemistry, dendrimers, conjugated molecules, computational scaling, electron correlation, nitrogen dimer, chromium dimer

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.