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

arXiv:1412.5829 · International Journal of Quantum Chemistry

Tensor product methods and entanglement optimization forab initioquantum chemistry

Szilárd Szalay, Max J. Pfeffer, V. Murg, Gergely Barcza, Frank Verstraete, Reinhold Schneider, Örs Legeza

Published May 25, 2015• 333 citations
arXivHTMLPDF

Abstract

The treatment of high‐dimensional problems such as the Schrödinger equation can be approached by concepts of tensor product approximation. We present general techniques that can be used for the treatment of high‐dimensional optimization tasks and time‐dependent equations, and connect them to concepts already used in many‐body quantum physics. Based on achievements from the past decade, entanglement‐based methods—developed from different perspectives for different purposes in distinct communities already matured to provide a variety of tools—can be combined to attack highly challenging problems in quantum chemistry. The aim of the present paper is to give a pedagogical introduction to the theoretical background of this novel field and demonstrate the underlying benefits through numerical applications on a text book example. Among the various optimization tasks, we will discuss only those which are connected to a controlled manipulation of the entanglement which is in fact the key ingredient of the methods considered in the paper. The selected topics will be covered according to a series of lectures given on the topic “New wavefunction methods and entanglement optimizations in quantum chemistry” at the Workshop on Theoretical Chemistry, February 18–21, 2014, Mariapfarr, Austria. © 2015 Wiley Periodicals, Inc.

DOI
10.1002/qua.24898

Related papers

Low entanglement wavefunctions

Garnet Kin‐Lic Chan

Abstract We review a class of efficient wavefunction approximations that are based around the limit of low entanglement. These wavefunctions, which go by such names as matrix product states and tensor network states, occupy a different region of Hilbert space from wavefunctions built around the Hartree–Fock limit. The best known class of low entanglement wavefunctions, the matrix product states, forms the variational space of the density matrix renormalization group algorithm. Because of their different structure to many other quantum chemistry wavefunctions, low entanglement approximations hold promise for problems conventionally considered hard in quantum chemistry, and in particular problems which have a multireference or strong correlation nature. In this review, we describe low entanglement wavefunctions at an introductory level, focusing on the main theoretical ideas. Topics covered include the theory of efficient wavefunction approximations, entanglement, matrix product states, and tensor network states including the tree tensor network, projected entangled pair states, and the multiscale entanglement renormalization ansatz. © 2012 John Wiley & Sons, Ltd. This article is categorized under: Electronic Structure Theory > Ab Initio Electronic Structure Methods

Wiley Interdisciplinary Reviews Computational Molecular Science•May 25, 2012•45 citations

Mathematical Methods in Quantum Chemistry

Eric Cancès B, Gero Friesecke, Trygve Ulf Helgaker +1 more

The field of quantum chemistry is concerned with the modelling and simulation of the behaviour of molecular systems on the basis of the fundamental equations of quantum mechanics. Since these equations exhibit an extreme case of the curse of dimensionality (the Schrödinger equation for N electrons being a partial differential equation on \mathbb R^{3N} ), the quantum-chemical simulation of even moderate-size molecules already requires highly sophisticated model-reduction, approximation, and simulation techniques. The workshop brought together selected quantum chemists and physicists, and the growing community of mathematicians working in the area, to report and discuss recent advances on topics such as coupled-cluster theory, direct approximation schemes in full configuration-interaction (FCI) theory, interacting Green’s functions, foundations and computational aspects of density-functional theory (DFT), low-rank tensor methods, quantum chemistry in the presence of a strong magnetic field, and multiscale coupling of quantum simulations.

Oberwolfach Reports•Jan 4, 2019•0 citations

Mathematical Methods in Quantum Chemistry

Geneviève Dusson, Michael F. Herbst, Benjamin Stamm

Quantum chemistry focuses on modelling and simulating the behaviour of molecular systems using the fundamental principles of quantum mechanics. However, the underlying equations, such as the Schrödinger equation for computing the ground state of N electrons, which is a partial differential equation defined on \mathbb{R}^{3N} , suffer from the curse of dimensionality. As a result, simulating even moderately sized molecules demands advanced techniques in analysis, approximation and reduced-order modelling for overcoming the naive computational complexity. In this workshop, the rapidly growing mathematical community working in the field together with several quantum chemists and physicists were gathered to discuss recent advances in areas such as (1) the mathematical and numerical analysis of standard models used in the field, including Density Functional Theory, Coupled Cluster, and the Density Matrix Renormalization Group (2) the development of efficient numerical methods, relying e.g. on the development of error bounds and (3) the opportunities of recent data-driven methods towards the approximation of wavefunctions or density matrices.

Oberwolfach Reports•Aug 29, 2025•0 citations

Tensor Network Techniques for Quantum Computation

Mario Collura, Guglielmo Lami, Nishan Ranabhat +1 more

This book serves as an introductory yet thorough guide to tensor networks and their applications in quantum computation and quantum information, designed for advanced undergraduate and graduate-level readers. In Part I, foundational topics are covered, including tensor structures and network representations like Matrix Product States (MPS) and Tree Tensor Networks (TTN). These preliminaries provide readers with the core mathematical tools and concepts necessary for quantum physics and quantum computing applications, bridging the gap between multi-linear algebra and complex quantum systems. Part II explores practical applications of tensor networks in simulating quantum dynamics, with a particular focus on the efficiency they offer for systems of high computational complexity. Key topics include Hamiltonian dynamics, quantum annealing, open system dynamics, and optimization strategies using TN frameworks. A final chapter addresses the emerging role of “quantum magic” in tensor networks. It delves into non-stabilizer states and their contribution to quantum computational power beyond classical simulability, featuring methods such as stabilizer-enhanced MPS and the Clifford-dressed TDVP. In presenting tensor networks as tools for understanding quantum complexity, this book aims to foster a deeper collaboration between the many-body physics and quantum computing communities, inviting a broader audience to engage with these recent developments.

arXiv:2503.04423•Dec 1, 2024•12 citations

Review of Tensor Network Contraction Approaches

Shi-Ju Ran, Emanuele Tirrito, Cheng Peng +3 more

Tensor network (TN), a young mathematical tool of high vitality and great potential, has been undergoing extremely rapid developments in the last two decades, gaining tremendous success in condensed matter physics, atomic physics, quantum information science, statistical physics, and so on. In this lecture notes, we focus on the contraction algorithms of TN as well as some of the applications to the simulations of quantum many-body systems. Starting from basic concepts and definitions, we first explain the relations between TN and physical problems, including the TN representations of classical partition functions, quantum many-body states (by matrix product state, tree TN, and projected entangled pair state), time evolution simulations, etc. These problems, which are challenging to solve, can be transformed to TN contraction problems. We present then several paradigm algorithms based on the ideas of the numerical renormalization group and/or boundary states, including density matrix renormalization group, time-evolving block decimation, coarse-graining/corner tensor renormalization group, and several distinguished variational algorithms. Finally, we revisit the TN approaches from the perspective of multi-linear algebra (also known as tensor algebra or tensor decompositions) and quantum simulation. Despite the apparent differences in the ideas and strategies of different TN algorithms, we aim at revealing the underlying relations and resemblances in order to present a systematic picture to understand the TN contraction approaches.

•Aug 30, 2017•22 citations

Tensor network approaches: Ground states and dynamics in quantum many-body systems

Ho N. Phien

The study of interacting quantum many-body systems is one of the central challenges in modern physics. Interestingly, by understanding the physical properties of such systems from a microscopic description, one can explain many complex quantum phenomena such as the high-temperature superconductivity, fractional quantum Hall effect, etc. However, due to high complexity of these systems, theoretical investigations such as analytical and perturbation theories are limited to studying only a small subset of problems. In the past few decades, numerical simulation has emerged as an indispensable method for studying many phenomena, and has led to immense success and progress in recent years. The main obstacle in addressing quantum many-body systems is that the number of parameters required to represent a state of the system scales exponentially with the system size. However, one hardly needs the full Hilbert space but only a small subspace to describe physical properties of the system. From the point of view in quantum information theory, quantum entanglement is one of the main factors that is responsible for the complexity of studying quantum many-body systems. In particular, the amount of quantum entanglement in such system quantifies the correlation between constituents and therefore it determines how big the subspace is required to represent the system. In this thesis, we are interested in using tensor network states, a new emerging numerical technique to study dynamical and ground state properties of the system. The key ingredient is that a tensor network state which consists of a fairly small number of parameters can represent very well the complete wave function of a system. In one spatial dimension, Matrix Product State (MPS) has become a standard tool, combined with related algorithms such as Time Evolving Block Decimation algorithm (TEBD) to study dynamical properties of a locally-perturbed quantum lattice system. In this thesis, we introduce a technique called ``infinite boundary conditions'' that allows us to use a finite-size MPS to represent the state of an infinite-size system. As a result, one can simulate dynamics of a system for a longer time with a significant computational cost reduction compared to traditional methods. In two spatial dimensions, the tensor network known as Projected Entangled Pair States (PEPS) is emerging as a useful approach. However algorithms for optimizing the matrix elements of these tensors are complex and not very efficient. In particular, the efficiency of the optimization depends critically on the quality of the so-called ``environment'', which is expensive to compute. We have introduced a new method to accelerate the convergence of calculating the PEPS ground state by recycling the environment tensors for many optimization steps, vastly reducing the number of times that the full environment needs to be calculated.

•Jan 1, 2013•0 citations
The treatment of high‐dimensional problems such as the Schrödinger equation can be approached by concepts of tensor product approximation. We present general techniques that can be used for the treatment of high‐dimensional optimization tasks and time‐dependent equations, and connect them to concepts already used in many‐body quantum physics. Based on achievements from the past decade, entanglement‐based methods—developed from different perspectives for different purposes in distinct communities already matured to provide a variety of tools—can be combined to attack highly challenging problems in quantum chemistry. The aim of the present paper is to give a pedagogical introduction to the theoretical background of this novel field and demonstrate the underlying benefits through numerical applications on a text book example. Among the various optimization tasks, we will discuss only those which are connected to a controlled manipulation of the entanglement which is in fact the key ingredient of the methods considered in the paper. The selected topics will be covered according to a series of lectures given on the topic “New wavefunction methods and entanglement optimizations in quantum chemistry” at the Workshop on Theoretical Chemistry, February 18–21, 2014, Mariapfarr, Austria. © 2015 Wiley Periodicals, Inc.
Abstract We review a class of efficient wavefunction approximations that are based around the limit of low entanglement. These wavefunctions, which go by such names as matrix product states and tensor network states, occupy a different region of Hilbert space from wavefunctions built around the Hartree–Fock limit. The best known class of low entanglement wavefunctions, the matrix product states, forms the variational space of the density matrix renormalization group algorithm. Because of their different structure to many other quantum chemistry wavefunctions, low entanglement approximations hold promise for problems conventionally considered hard in quantum chemistry, and in particular problems which have a multireference or strong correlation nature. In this review, we describe low entanglement wavefunctions at an introductory level, focusing on the main theoretical ideas. Topics covered include the theory of efficient wavefunction approximations, entanglement, matrix product states, and tensor network states including the tree tensor network, projected entangled pair states, and the multiscale entanglement renormalization ansatz. © 2012 John Wiley & Sons, Ltd. This article is categorized under: Electronic Structure Theory > Ab Initio Electronic Structure Methods
The field of quantum chemistry is concerned with the modelling and simulation of the behaviour of molecular systems on the basis of the fundamental equations of quantum mechanics. Since these equations exhibit an extreme case of the curse of dimensionality (the Schrödinger equation for N electrons being a partial differential equation on \mathbb R^{3N} ), the quantum-chemical simulation of even moderate-size molecules already requires highly sophisticated model-reduction, approximation, and simulation techniques. The workshop brought together selected quantum chemists and physicists, and the growing community of mathematicians working in the area, to report and discuss recent advances on topics such as coupled-cluster theory, direct approximation schemes in full configuration-interaction (FCI) theory, interacting Green’s functions, foundations and computational aspects of density-functional theory (DFT), low-rank tensor methods, quantum chemistry in the presence of a strong magnetic field, and multiscale coupling of quantum simulations.
Quantum chemistry focuses on modelling and simulating the behaviour of molecular systems using the fundamental principles of quantum mechanics. However, the underlying equations, such as the Schrödinger equation for computing the ground state of N electrons, which is a partial differential equation defined on \mathbb{R}^{3N} , suffer from the curse of dimensionality. As a result, simulating even moderately sized molecules demands advanced techniques in analysis, approximation and reduced-order modelling for overcoming the naive computational complexity. In this workshop, the rapidly growing mathematical community working in the field together with several quantum chemists and physicists were gathered to discuss recent advances in areas such as (1) the mathematical and numerical analysis of standard models used in the field, including Density Functional Theory, Coupled Cluster, and the Density Matrix Renormalization Group (2) the development of efficient numerical methods, relying e.g. on the development of error bounds and (3) the opportunities of recent data-driven methods towards the approximation of wavefunctions or density matrices.
This book serves as an introductory yet thorough guide to tensor networks and their applications in quantum computation and quantum information, designed for advanced undergraduate and graduate-level readers. In Part I, foundational topics are covered, including tensor structures and network representations like Matrix Product States (MPS) and Tree Tensor Networks (TTN). These preliminaries provide readers with the core mathematical tools and concepts necessary for quantum physics and quantum computing applications, bridging the gap between multi-linear algebra and complex quantum systems. Part II explores practical applications of tensor networks in simulating quantum dynamics, with a particular focus on the efficiency they offer for systems of high computational complexity. Key topics include Hamiltonian dynamics, quantum annealing, open system dynamics, and optimization strategies using TN frameworks. A final chapter addresses the emerging role of “quantum magic” in tensor networks. It delves into non-stabilizer states and their contribution to quantum computational power beyond classical simulability, featuring methods such as stabilizer-enhanced MPS and the Clifford-dressed TDVP. In presenting tensor networks as tools for understanding quantum complexity, this book aims to foster a deeper collaboration between the many-body physics and quantum computing communities, inviting a broader audience to engage with these recent developments.
Tensor network (TN), a young mathematical tool of high vitality and great potential, has been undergoing extremely rapid developments in the last two decades, gaining tremendous success in condensed matter physics, atomic physics, quantum information science, statistical physics, and so on. In this lecture notes, we focus on the contraction algorithms of TN as well as some of the applications to the simulations of quantum many-body systems. Starting from basic concepts and definitions, we first explain the relations between TN and physical problems, including the TN representations of classical partition functions, quantum many-body states (by matrix product state, tree TN, and projected entangled pair state), time evolution simulations, etc. These problems, which are challenging to solve, can be transformed to TN contraction problems. We present then several paradigm algorithms based on the ideas of the numerical renormalization group and/or boundary states, including density matrix renormalization group, time-evolving block decimation, coarse-graining/corner tensor renormalization group, and several distinguished variational algorithms. Finally, we revisit the TN approaches from the perspective of multi-linear algebra (also known as tensor algebra or tensor decompositions) and quantum simulation. Despite the apparent differences in the ideas and strategies of different TN algorithms, we aim at revealing the underlying relations and resemblances in order to present a systematic picture to understand the TN contraction approaches.
The study of interacting quantum many-body systems is one of the central challenges in modern physics. Interestingly, by understanding the physical properties of such systems from a microscopic description, one can explain many complex quantum phenomena such as the high-temperature superconductivity, fractional quantum Hall effect, etc. However, due to high complexity of these systems, theoretical investigations such as analytical and perturbation theories are limited to studying only a small subset of problems. In the past few decades, numerical simulation has emerged as an indispensable method for studying many phenomena, and has led to immense success and progress in recent years. The main obstacle in addressing quantum many-body systems is that the number of parameters required to represent a state of the system scales exponentially with the system size. However, one hardly needs the full Hilbert space but only a small subspace to describe physical properties of the system. From the point of view in quantum information theory, quantum entanglement is one of the main factors that is responsible for the complexity of studying quantum many-body systems. In particular, the amount of quantum entanglement in such system quantifies the correlation between constituents and therefore it determines how big the subspace is required to represent the system. In this thesis, we are interested in using tensor network states, a new emerging numerical technique to study dynamical and ground state properties of the system. The key ingredient is that a tensor network state which consists of a fairly small number of parameters can represent very well the complete wave function of a system. In one spatial dimension, Matrix Product State (MPS) has become a standard tool, combined with related algorithms such as Time Evolving Block Decimation algorithm (TEBD) to study dynamical properties of a locally-perturbed quantum lattice system. In this thesis, we introduce a technique called ``infinite boundary conditions'' that allows us to use a finite-size MPS to represent the state of an infinite-size system. As a result, one can simulate dynamics of a system for a longer time with a significant computational cost reduction compared to traditional methods. In two spatial dimensions, the tensor network known as Projected Entangled Pair States (PEPS) is emerging as a useful approach. However algorithms for optimizing the matrix elements of these tensors are complex and not very efficient. In particular, the efficiency of the optimization depends critically on the quality of the so-called ``environment'', which is expensive to compute. We have introduced a new method to accelerate the convergence of calculating the PEPS ground state by recycling the environment tensors for many optimization steps, vastly reducing the number of times that the full environment needs to be calculated.