Convergence behavior of the density-matrix renormalization group algorithm for optimized orbital orderings
The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
The density-matrix renormalization group algorithm has emerged as a promising new method in ab initio quantum chemistry. However, many problems still need to be solved before this method can be applied routinely. At the start of such a calculation, the orbitals originating from a preceding quantum chemical calculation must be placed in a specific order on a one-dimensional lattice. This ordering affects the convergence of the density-matrix renormalization group iterations significantly. In this paper, we present two approaches to obtain optimized orderings of the orbitals. First, we use a genetic algorithm to optimize the ordering with respect to a low total electronic energy obtained at a predefined stage of the density-matrix renormalization group algorithm with a given number of total states kept. In addition to that, we derive orderings from the one- and two-electron integrals of our test system. This test molecule is the chromium dimer, which is known to possess a complicated electronic structure. For this molecule, we have carried out calculations for the various orbital orderings obtained. The convergence behavior of the density-matrix renormalization group iterations is discussed in detail.
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
Density-matrix algorithms for quantum renormalization groups
White, S. R. (1993) · Physical Review B · doi:10.1103/physrevb.48.10345 · Cited by 3,244
Ab initio quantum chemistry using the density matrix renormalization group
White, S. R., & Martin, R. L. (1999) · The Journal of Chemical Physics · doi:10.1063/1.478295 · Cited by 558
Chan, G. K.-L., & Head-Gordon, M. (2002) · The Journal of Chemical Physics · doi:10.1063/1.1449459 · Cited by 554
Legeza, Ö., Röder, J., & Hess, B. A. (2003) · Physical Review B · doi:10.1103/physrevb.67.125114 · Cited by 263
Cited by
Quantum Chemistry in the Age of Quantum Computing
Cao, Y., Romero, J., Olson, J. P., Degroote, M., Johnson, P. D., Kieferová, M., Kivlichan, I. D., Menke, T., Peropadre, B., Sawaya, N. P. D., et al. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.8b00803 · Cited by 1,560
The Density Matrix Renormalization Group in Quantum Chemistry
Chan, G. K.-L., & Sharma, S. (2011) · Annual Review of Physical Chemistry · doi:10.1146/annurev-physchem-032210-103338 · Cited by 822
“Determining the optimal ordering is an NP (nonpolynomial)-hard problem, and the heuristic construction of good orderings has been studied in a number of works (8, 18, 19).”
BackgroundSzalay, P. G., Müller, T., Gidofalvi, G., Lischka, H., & Shepard, R. (2012) · Chemical Reviews · doi:10.1021/cr200137a · Cited by 725
The ab-initio density matrix renormalization group in practice
Olivares-Amaya, R., Hu, W., Nakatani, N., Sharma, S., Yang, J., & Chan, G. K.-L. (2015) · The Journal of Chemical Physics · doi:10.1063/1.4905329 · Cited by 363
Ghosh, D., Hachmann, J., Yanai, T., & Chan, G. K.-L. (2008) · The Journal of Chemical Physics · doi:10.1063/1.2883976 · Cited by 341
Low-energy spectrum of iron–sulfur clusters directly from many-particle quantum mechanics
Sharma, S., Sivalingam, K., Neese, F., & Chan, G. K.-L. (2014) · Nature Chemistry · doi:10.1038/nchem.2041 · Cited by 315
Tensor product methods and entanglement optimization for ab initio quantum chemistry
Szalay, S., Pfeffer, M., Murg, V., Barcza, G., Verstraete, F., Schneider, R., & Legeza, Ö. (2015) · International Journal of Quantum Chemistry · doi:10.1002/qua.24898 · Cited by 314
Baiardi, A., & Reiher, M. (2020) · The Journal of Chemical Physics · doi:10.1063/1.5129672 · Cited by 306
Self-citationThe density matrix renormalization group for ab initio quantum chemistry
Wouters, S., & Van Neck, D. (2014) · The European Physical Journal D · doi:10.1140/epjd/e2014-50500-1 · Cited by 285
Spin-adapted density matrix renormalization group algorithms for quantum chemistry
Sharma, S., & Chan, G. K.-L. (2012) · The Journal of Chemical Physics · doi:10.1063/1.3695642 · Cited by 279
Measuring orbital interaction using quantum information theory
Rissler, J., Noack, R. M., & White, S. R. (2006) · Chemical Physics · doi:10.1016/j.chemphys.2005.10.018 · Cited by 265
Schriber, J. B., & Evangelista, F. A. (2016) · The Journal of Chemical Physics · doi:10.1063/1.4948308 · Cited by 257
Simulating strongly correlated quantum systems with tree tensor networks
Murg, V., Verstraete, F., Legeza, Ö., & Noack, R. M. (2010) · Physical Review B · doi:10.1103/physrevb.82.205105 · Cited by 245
Veis, L., Antalík, A., Brabec, J., Neese, F., Legeza, Ö., & Pittner, J. (2016) · The Journal of Physical Chemistry Letters · doi:10.1021/acs.jpclett.6b01908 · Cited by 102
Murg, V., Verstraete, F., Schneider, R., Nagy, P. R., & Legeza, O. (2015) · Journal of Chemical Theory and Computation · doi:10.1021/ct501187j · Cited by 97
Complete-graph tensor network states: a new fermionic wave function ansatz for molecules
Marti, K. H., Bauer, B., Reiher, M., Troyer, M., & Verstraete, F. (2010) · New Journal of Physics · doi:10.1088/1367-2630/12/10/103008 · Cited by 87
“Note that an artificial one-dimensional ordering of the molecular orbitals for the construction of the total basis states, which can create convergence problems to local energy minima as in the quantum chemical DMRG algorithm [13,14], is explicitly circumvented.”
BackgroundSelf-citationThe Shape of Full Configuration Interaction to Come
Eriksen, J. J. (2021) · The Journal of Physical Chemistry Letters · doi:10.1021/acs.jpclett.0c03225 · Cited by 66
Density Matrix Renormalization Group with Tensor Processing Units
Ganahl, M., Beall, J., Hauru, M., Lewis, A. G. M., Wojno, T., Yoo, J. H., Zou, Y., & Vidal, G. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.010317 · Cited by 37
Self-adaptive tensor network states with multi-site correlators
Kovyrshin, A., & Reiher, M. (2017) · The Journal of Chemical Physics · doi:10.1063/1.5004693 · Cited by 14
“which yields Nvar = [ 2 ( M + 1 2 ) −M ] 8 (22) 3-site variational parameters.”
Self-citation
Metadata
- Authors
- Moritz, G., Hess, B. A., & Reiher, M.
- Venue
- The Journal of Chemical Physics
- Publisher
- AIP Publishing
- Published
- 2004-12-20
- Volume
- 122
- Issue
- 2
- Pages
- 024107-024107
- ISSN
- 0021-9606 (ISSN-L)
- 1089-7690
- OpenAlex
- W2025734445
- Cited by
- 145
- References
- 5
- FWCI
- 1.43
- Type
- journal article
- Language
- en
- Open access
- closed
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.