CoChat

Tree Tensor Network State with Variable Tensor Order: An Efficient Multireference Method for Strongly Correlated Systems

Open access
Murg, V., Verstraete, F., Schneider, R., Nagy, P. R., Legeza, Ö. · 2015 · Journal of Chemical Theory and Computation

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

Abstract

We study the tree-tensor-network-state (TTNS) method with variable tensor orders for quantum chemistry. TTNS is a variational method to efficiently approximate complete active space (CAS) configuration interaction (CI) wave functions in a tensor product form. TTNS can be considered as a higher order generalization of the matrix product state (MPS) method. The MPS wave function is formulated as products of matrices in a multiparticle basis spanning a truncated Hilbert space of the original CAS-CI problem. These matrices belong to active orbitals organized in a one-dimensional array, while tensors in TTNS are defined upon a tree-like arrangement of the same orbitals. The tree-structure is advantageous since the distance between two arbitrary orbitals in the tree scales only logarithmically with the number of orbitals N, whereas the scaling is linear in the MPS array. It is found to be beneficial from the computational costs point of view to keep strongly correlated orbitals in close vicinity in both arrangements; therefore, the TTNS ansatz is better suited for multireference problems with numerous highly correlated orbitals. To exploit the advantages of TTNS a novel algorithm is designed to optimize the tree tensor network topology based on quantum information theory and entanglement. The superior performance of the TTNS method is illustrated on the ionic-neutral avoided crossing of LiF. It is also shown that the avoided crossing of LiF can be localized using only ground state properties, namely one-orbital entanglement.

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.1021/ct501187j

Cites

57 of 59 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 59 references

Research works printed but not linked: 2

  1. Verstraete, 2004, Renormalization algorithms for Quantum-Many Body Systems in two and higher dimensions, arXiv, 0407066
  2. Hackbusch, 2012, Springer series in computational mathematics

Cited by

Items 101–105 of 105

Metadata

Authors
Murg, V., Verstraete, F., Schneider, R., Nagy, P. R., & Legeza, O.
Affiliations
  • University of Vienna (AT)
  • Technische Universität Berlin (DE)
  • Eötvös Loránd University (HU)
  • Strongly correlated systems ”Lendület” research group, Wigner Research Centre for Physics , P.O. Box 49, ,
Venue
Journal of Chemical Theory and Computation
Published
2015-02-03
Volume
11
Issue
3
Pages
1027-1036
ISSN
  • 1549-9618 (ISSN-L)
  • 1549-9626
OpenAlex
W2334770951
Cited by
97
References
57
Citations by year
2026: 3 · 2025: 12 · 2024: 11 · 2023: 7 · 2022: 4 · 2021: 6 · 2020: 15 · 2019: 12 · 2018: 3 · 2017: 6 · 2016: 9 · 2015: 9
FWCI
4.57
Type
journal article
Language
en
Open access
Locations
  • Journal of Chemical Theory and Computation (publishedVersion, cc-by)
  • Europe PMC (PubMed Central) (publishedVersion)
  • PubMed Central (publishedVersion)
  • PubMed (publishedVersion)
  • Repository of the Academy's Library (Library of the Hungarian Academy of Sciences) (acceptedVersion)
  • Ghent University Academic Bibliography (Ghent University) (submittedVersion, other-oa)
Funders
  • DFG SCHN 530/9-1 (10041620)
  • FWF (E1243-N19)
  • OTKA (K100908, NN110360)
  • SFB-ViCoM (NA)
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
multireference methods, strongly correlated electrons, complete active space configuration interaction, matrix product states, entanglement, avoided crossings, LiF

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.