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

Lecture notes in physics

Summary

Shi-Ju Ran, Emanuele Tirrito, Cheng Peng, Xi Chen, Luca Tagliacozzo, Gang Su, Maciej Lewenstein

Published Jan 1, 2020• 0 citations
Publisher

Abstract

The explosive progresses of TN Tensor network (TN) that have been made in the recent years opened an interdisciplinary diagram for studying varieties of subjects. What is more, the theories and techniques in the TN algorithms are now evolving into a new numerical field, forming a systematic framework for numerical simulations. Our lecture notes are aimed at presenting this framework from the perspective of the TN contraction algorithms for quantum many-body physics.

DOI
10.1007/978-3-030-34489-4_7

Related papers

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•17 citations

Tensor Network Algorithms: A Route Map

Mari Carmen Bañuls

Tensor networks provide extremely powerful tools for the study of complex classical and quantum many-body problems. Over the past two decades, the increment in the number of techniques and applications has been relentless, and especially the last ten years have seen an explosion of new ideas and results that may be overwhelming for the newcomer. This short review introduces the basic ideas, the best established methods, and some of the most significant algorithmic developments that are expanding the boundaries of the tensor network potential. The goal of this review is to help the reader not only appreciate the many possibilities offered by tensor networks but also find their way through state-of-the-art codes, their applicability, and some avenues of ongoing progress.

arXiv:2205.10345•Annual Review of Condensed Matter Physics•Nov 9, 2022•125 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•7 citations

Introduction

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

One characteristic that defines us, human beings, is the curiosity of the unknown. Since our birth, we have been trying to use any methods that human brains can comprehend to explore the nature: to mimic, to understand, and to utilize in a controlled and repeatable way. One of the most ancient means lies in the nature herself, experiments, leading to tremendous achievements from the creation of fire to the scissors of genes. Then comes mathematics, a new world we made by numbers and symbols, where the nature is reproduced by laws and theorems in an extremely simple, beautiful, and unprecedentedly accurate manner. With the explosive development of digital sciences, computer was created. It provided us the third way to investigate the nature, a digital world whose laws can be ruled by ourselves with codes and algorithms to numerically mimic the real universe. In this chapter, we briefly review the history of tensor network algorithms and the related progresses made recently. The organization of our lecture notes is also presented.

Lecture notes in physics•Jan 1, 2020•1 citation

Inverted CERN School of Computing 2019

Patrick Emonts

<!--HTML-->In recent years, tensor networks have become a viable alternative to Monte Carlo calculations and exact diagonalization for the simulation of many-body systems. As they represent a formulation of quantum mechanical wavefunctions with polynomially many parameters, they make calculations of large systems feasible. They have already found wide application in condensed matter physics and start to be an interesting tool for high energy physics as well. In this lecture series, I will introduce the basic concepts of tensor networks. We will start with an introduction of the necessary basics of quantum mechanics and linear algebra and focus on the algorithmic side of tensor networks in the second lecture.

•Jan 1, 2019•0 citations

Les Houches Lecture Notes on Tensor Networks

Bram Vancraeynest-De Cuiper, Weronika Wiesiolek, Frank Verstraete

Tensor networks provide a powerful new framework for classifying and simulating correlated and topological phases of quantum matter. Their central premise is that strongly correlated matter can only be understood by studying the underlying entanglement structure and its associated (generalised) symmetries. In essence, tensor networks provide a compressed, holographic description of the complicated vacuum fluctuations in strongly correlated systems, and as such they break down the infamous many-body exponential wall. These lecture notes provide a concise overview of the most important conceptual, computational and mathematical aspects of this theory.

cond-mat.str-elCross-listedarXiv:2512.24390•SciPost Physics Lecture Notes•Dec 31, 2025•2 citations
The explosive progresses of TN Tensor network (TN) that have been made in the recent years opened an interdisciplinary diagram for studying varieties of subjects. What is more, the theories and techniques in the TN algorithms are now evolving into a new numerical field, forming a systematic framework for numerical simulations. Our lecture notes are aimed at presenting this framework from the perspective of the TN contraction algorithms for quantum many-body physics.
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.
Tensor networks provide extremely powerful tools for the study of complex classical and quantum many-body problems. Over the past two decades, the increment in the number of techniques and applications has been relentless, and especially the last ten years have seen an explosion of new ideas and results that may be overwhelming for the newcomer. This short review introduces the basic ideas, the best established methods, and some of the most significant algorithmic developments that are expanding the boundaries of the tensor network potential. The goal of this review is to help the reader not only appreciate the many possibilities offered by tensor networks but also find their way through state-of-the-art codes, their applicability, and some avenues of ongoing progress.
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.
One characteristic that defines us, human beings, is the curiosity of the unknown. Since our birth, we have been trying to use any methods that human brains can comprehend to explore the nature: to mimic, to understand, and to utilize in a controlled and repeatable way. One of the most ancient means lies in the nature herself, experiments, leading to tremendous achievements from the creation of fire to the scissors of genes. Then comes mathematics, a new world we made by numbers and symbols, where the nature is reproduced by laws and theorems in an extremely simple, beautiful, and unprecedentedly accurate manner. With the explosive development of digital sciences, computer was created. It provided us the third way to investigate the nature, a digital world whose laws can be ruled by ourselves with codes and algorithms to numerically mimic the real universe. In this chapter, we briefly review the history of tensor network algorithms and the related progresses made recently. The organization of our lecture notes is also presented.
<!--HTML-->In recent years, tensor networks have become a viable alternative to Monte Carlo calculations and exact diagonalization for the simulation of many-body systems. As they represent a formulation of quantum mechanical wavefunctions with polynomially many parameters, they make calculations of large systems feasible. They have already found wide application in condensed matter physics and start to be an interesting tool for high energy physics as well. In this lecture series, I will introduce the basic concepts of tensor networks. We will start with an introduction of the necessary basics of quantum mechanics and linear algebra and focus on the algorithmic side of tensor networks in the second lecture.
Tensor networks provide a powerful new framework for classifying and simulating correlated and topological phases of quantum matter. Their central premise is that strongly correlated matter can only be understood by studying the underlying entanglement structure and its associated (generalised) symmetries. In essence, tensor networks provide a compressed, holographic description of the complicated vacuum fluctuations in strongly correlated systems, and as such they break down the infamous many-body exponential wall. These lecture notes provide a concise overview of the most important conceptual, computational and mathematical aspects of this theory.