Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Bulletin of the American Physical Society

Recent progress in ab initio density matrix renormalization group methodology

Johannes Hachmann, Jonathan J. Dorando, Garnet Kin‐Lic Chan

Published Mar 13, 2008• 0 citations
OpenAlex

Related papers

The density matrix renormalization group for ab initio quantum chemistry

Sebastian Wouters, Dimitri Van Neck

arXiv:1407.2040•The European Physical Journal D•Sep 1, 2014•296 citations

Density matrix renormalization group for ab initio quantum chemistry Hamiltonian

Haibo Ma, Ulrich Schollwöck, Zhigang Shuai

Elsevier eBooks•Jan 1, 2022•2 citations

Ab Initio Density Matrix Renormalization Group Methodology And Computational Transition Metal Chemistry

Johannes Hachmann

This thesis is concerned with two topics from the field of computational electronic structure theory. In the first part we will describe our contributions to the ab initio density matrix renormalization group (DMRG) methodology in quantum chemistry, in particular our quadratically scaling local algorithm. We will present applications aimed towards new insights into the physics of conjugated π-electron systems as found, e.g., in organic electronic materials. The second part of this thesis covers our computational study of 3d-M(smif)2 complexes synthesized and characterized in the Wolczanski Group. These compounds exhibit unusual electronic structure phenomena which we address from a theoretical perspective.

•Apr 9, 2010•0 citations

Probing the Structure of Density Functional Theory with Density Matrix Renormalization Group

Thomas E. Baker, Li Li, Kieron Burke +1 more

Bulletin of the American Physical Society•Oct 30, 2015•0 citations

Matrix product operators, matrix product states, and ab initio density matrix renormalization group algorithms

Garnet Kin‐Lic Chan, Anna Keselman, Naoki Nakatani +2 more

Current descriptions of the ab initio density matrix renormalization group (DMRG) algorithm use two superficially different languages: an older language of the renormalization group and renormalized operators, and a more recent language of matrix product states and matrix product operators. The same algorithm can appear dramatically different when written in the two different vocabularies. In this work, we carefully describe the translation between the two languages in several contexts. First, we describe how to efficiently implement the ab initio DMRG sweep using a matrix product operator based code, and the equivalence to the original renormalized operator implementation. Next we describe how to implement the general matrix product operator/matrix product state algebra within a pure renormalized operator-based DMRG code. Finally, we discuss two improvements of the ab initio DMRG sweep algorithm motivated by matrix product operator language: Hamiltonian compression, and a sum over operators representation that allows for perfect computational parallelism. The connections and correspondences described here serve to link the future developments with the past and are important in the efficient implementation of continuing advances in ab initio DMRG and related algorithms.

arXiv:1605.02611•The Journal of Chemical Physics•Jul 5, 2016•244 citations

Density matrix renormalization group for ab initio Calculations and associated dynamic correlation methods: A review of theory and applications

Takeshi Yanai, Yuki Kurashige, Wataru Mizukami +3 more

The recent advent of the density matrix renormalization group (DMRG) theory has delivered a new capability to compute multireference (MR) wave function with large configuration space, which far exceeds the limitation of conventional approaches. Here, we provide an overview of our recent work on the developments of ab initio DMRG methods in the context of the active space approaches and their applications to MR chemical systems. © 2014 Wiley Periodicals, Inc.

International Journal of Quantum Chemistry•Oct 23, 2014•173 citations
This thesis is concerned with two topics from the field of computational electronic structure theory. In the first part we will describe our contributions to the ab initio density matrix renormalization group (DMRG) methodology in quantum chemistry, in particular our quadratically scaling local algorithm. We will present applications aimed towards new insights into the physics of conjugated π-electron systems as found, e.g., in organic electronic materials. The second part of this thesis covers our computational study of 3d-M(smif)2 complexes synthesized and characterized in the Wolczanski Group. These compounds exhibit unusual electronic structure phenomena which we address from a theoretical perspective.
Current descriptions of the ab initio density matrix renormalization group (DMRG) algorithm use two superficially different languages: an older language of the renormalization group and renormalized operators, and a more recent language of matrix product states and matrix product operators. The same algorithm can appear dramatically different when written in the two different vocabularies. In this work, we carefully describe the translation between the two languages in several contexts. First, we describe how to efficiently implement the ab initio DMRG sweep using a matrix product operator based code, and the equivalence to the original renormalized operator implementation. Next we describe how to implement the general matrix product operator/matrix product state algebra within a pure renormalized operator-based DMRG code. Finally, we discuss two improvements of the ab initio DMRG sweep algorithm motivated by matrix product operator language: Hamiltonian compression, and a sum over operators representation that allows for perfect computational parallelism. The connections and correspondences described here serve to link the future developments with the past and are important in the efficient implementation of continuing advances in ab initio DMRG and related algorithms.