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

Advances in chemical physics

Tensor Networks for Entanglement Evolution

Sebastian Meznaric, Jacob Biamonte

Published Feb 14, 2014• 2 citations
Publisher

Abstract

The introduction of a tensor network theory of entanglement evolution opens the door to apply numerical methods from the rapidly evolving area known as tensor network states. This chapter begins by reviewing tensor network components and paves the way for a review of the so-called snake equation. This equation is then used to prove a graphical version of map-state duality. These building blocks and associated tools from tensor network states can be applied to the theory of entanglement evolution. The methods are used to pinpoint a wide class of measures that all share the same network topology in the tensor network language. The chapter shows how entanglement evolution can be understood and even unified in terms of a tailored variant of the Penrose graphical calculus. The conclusion presents an overview of potential future directions by listing some open problems and new directions.

DOI
10.1002/9781118742631.ch17

Related papers

Tensor Networks for Entanglement Evolution

Sebastian Meznaric, Jacob Biamonte

The intuitiveness of the tensor network graphical language is becoming well known through its use in numerical simulations using methods from tensor network algorithms. Recent times have also seen rapid progress in developing equations of motion to predict the time evolution of quantum entanglement [Nature Physics, 4(\textbf{4}):99, 2008]. Here we cast these recent results into a tensor network framework and in doing so, construct a theory which exposes the topological equivalence of the evolution of a family of entanglement monotones in arbitrary dimensions. This unification was accomplished by tailoring a form of channel state duality through the interpretation of graphical tensor network rewrite rules. The introduction of tensor network methods to the theory of entanglement evolution opens the door to apply methods from the rapidly evolving area known as tensor network states.

arXiv:1204.3599•Apr 16, 2012•3 citations

Tensor Networks in a Nutshell

Jacob Biamonte, Ville Bergholm

Tensor network methods are taking a central role in modern quantum physics and beyond. They can provide an efficient approximation to certain classes of quantum states, and the associated graphical language makes it easy to describe and pictorially reason about quantum circuits, channels, protocols, open systems and more. Our goal is to explain tensor networks and some associated methods as quickly and as painlessly as possible. Beginning with the key definitions, the graphical tensor network language is presented through examples. We then provide an introduction to matrix product states. We conclude the tutorial with tensor contractions evaluating combinatorial counting problems. The first one counts the number of solutions for Boolean formulae, whereas the second is Penrose's tensor contraction algorithm, returning the number of $3$-edge-colorings of $3$-regular planar graphs.

arXiv:1708.00006•Jul 31, 2017•299 citations

Density Matrix and Tensor Network Renormalization

Tao Xiang

Renormalization group theory of tensor network states provides a powerful tool for studying quantum many-body problems and a new paradigm for understanding entangled structures of complex systems. In recent decades the theory has rapidly evolved into a universal framework and language employed by researchers in fields ranging from condensed matter theory to machine learning. This book presents a pedagogical and comprehensive introduction to this field for the first time. After an introductory survey on the major advances in tensor network algorithms and their applications, it introduces step-by-step the tensor network representations of quantum states and the tensor-network renormalization group methods developed over the past three decades. Basic statistical and condensed matter physics models are used to demonstrate how the tensor network renormalization works. An accessible primer for scientists and engineers, this book would also be ideal as a reference text for a graduate course in this area.

Cambridge University Press eBooks•Aug 31, 2023•55 citations

Tensor networks and graphical calculus for open quantum systems

Christopher J. Wood, Jacob Biamonte, David G. Cory

We describe a graphical calculus for completely positive maps and in doing so review the theory of open quantum systems and other fundamental primitives of quantum information theory using the language of tensor networks. In particular we demonstrate the construction of tensor networks to pictographically represent the Liouville-superoperator, Choi-matrix, process-matrix, Kraus, and system-environment representations for the evolution of quantum states, review how these representations interrelate, and illustrate how graphical manipulations of the tensor networks may be used to concisely transform between them. To further demonstrate the utility of the presented graphical calculus we include several examples where we provide arguably simpler graphical proofs of several useful quantities in quantum information theory including the composition and contraction of multipartite channels, a condition for whether an arbitrary bipartite state may be used for ancilla assisted process tomography, and the derivation of expressions for the average gate fidelity and entanglement fidelity of a channel in terms of each of the different representations of the channel.

arXiv:1111.6950•Quantum Information and Computation•Jul 1, 2015•186 citations

Developments in the Tensor Network — from Statistical Mechanics to Quantum Entanglement

Kouichi Okunishi, Tomotoshi Nishino, Hiroshi Ueda

Tensor networks (TNs) have become one of the most essential building blocks for various fields of theoretical physics such as condensed matter theory, statistical mechanics, quantum information, and quantum gravity. This review provides a unified description of a series of developments in the TN from the statistical mechanics side. In particular, we begin with the variational principle for the transfer matrix of the 2D Ising model, which naturally leads us to the matrix product state (MPS) and the corner transfer matrix (CTM). We then explain how the CTM can be evolved to such MPS-based approaches as density matrix renormalization group (DMRG) and infinite time-evolved block decimation. We also elucidate that the finite-size DMRG played an intrinsic role for incorporating various quantum information concepts in subsequent developments in the TN. After surveying higher-dimensional generalizations like tensor product states or projected entangled pair states, we describe tensor renormalization groups (TRGs), which are a fusion of TNs and Kadanoff-Wilson type real-space renormalization groups, focusing on their fixed point structures. We then discuss how the difficulty in TRGs for critical systems can be overcome in the tensor network renormalization and the multi-scale entanglement renormalization ansatz.

arXiv:2111.12223•Journal of the Physical Society of Japan•May 1, 2022•96 citations

Tensor Networks and their use for Lattice Gauge Theories

Mari Carmen Bañuls, Krzysztof Cichy, J. I. Cirac +2 more

Tensor Network States are ansaetze for the efficient description of quantum many-body systems. Their success for one dimensional problems, together with the fact that they do not suffer from the sign problem and can address the simulation of real time evolution, have turned them into one of the most promising techniques to study strongly correlated systems. In the realm of Lattice Gauge Theories they can offer an alternative to standard lattice Monte Carlo calculations, which are suited for static properties and regimes where no sign problem appears. The application of Tensor Networks to this kind of problems is a young but rapidly evolving research field. This paper reviews some of the recent progress in this area, and how, using one dimensional models as testbench, some fundamental milestones have been reached that may pave the way to more ambitious goals.

arXiv:1810.12838•International Symposium on Lattice Field Theory (LATTICE)•May 29, 2019•84 citations
The introduction of a tensor network theory of entanglement evolution opens the door to apply numerical methods from the rapidly evolving area known as tensor network states. This chapter begins by reviewing tensor network components and paves the way for a review of the so-called snake equation. This equation is then used to prove a graphical version of map-state duality. These building blocks and associated tools from tensor network states can be applied to the theory of entanglement evolution. The methods are used to pinpoint a wide class of measures that all share the same network topology in the tensor network language. The chapter shows how entanglement evolution can be understood and even unified in terms of a tailored variant of the Penrose graphical calculus. The conclusion presents an overview of potential future directions by listing some open problems and new directions.
The intuitiveness of the tensor network graphical language is becoming well known through its use in numerical simulations using methods from tensor network algorithms. Recent times have also seen rapid progress in developing equations of motion to predict the time evolution of quantum entanglement [Nature Physics, 4(\textbf{4}):99, 2008]. Here we cast these recent results into a tensor network framework and in doing so, construct a theory which exposes the topological equivalence of the evolution of a family of entanglement monotones in arbitrary dimensions. This unification was accomplished by tailoring a form of channel state duality through the interpretation of graphical tensor network rewrite rules. The introduction of tensor network methods to the theory of entanglement evolution opens the door to apply methods from the rapidly evolving area known as tensor network states.
Tensor network methods are taking a central role in modern quantum physics and beyond. They can provide an efficient approximation to certain classes of quantum states, and the associated graphical language makes it easy to describe and pictorially reason about quantum circuits, channels, protocols, open systems and more. Our goal is to explain tensor networks and some associated methods as quickly and as painlessly as possible. Beginning with the key definitions, the graphical tensor network language is presented through examples. We then provide an introduction to matrix product states. We conclude the tutorial with tensor contractions evaluating combinatorial counting problems. The first one counts the number of solutions for Boolean formulae, whereas the second is Penrose's tensor contraction algorithm, returning the number of 333-edge-colorings of 333-regular planar graphs.
Renormalization group theory of tensor network states provides a powerful tool for studying quantum many-body problems and a new paradigm for understanding entangled structures of complex systems. In recent decades the theory has rapidly evolved into a universal framework and language employed by researchers in fields ranging from condensed matter theory to machine learning. This book presents a pedagogical and comprehensive introduction to this field for the first time. After an introductory survey on the major advances in tensor network algorithms and their applications, it introduces step-by-step the tensor network representations of quantum states and the tensor-network renormalization group methods developed over the past three decades. Basic statistical and condensed matter physics models are used to demonstrate how the tensor network renormalization works. An accessible primer for scientists and engineers, this book would also be ideal as a reference text for a graduate course in this area.
We describe a graphical calculus for completely positive maps and in doing so review the theory of open quantum systems and other fundamental primitives of quantum information theory using the language of tensor networks. In particular we demonstrate the construction of tensor networks to pictographically represent the Liouville-superoperator, Choi-matrix, process-matrix, Kraus, and system-environment representations for the evolution of quantum states, review how these representations interrelate, and illustrate how graphical manipulations of the tensor networks may be used to concisely transform between them. To further demonstrate the utility of the presented graphical calculus we include several examples where we provide arguably simpler graphical proofs of several useful quantities in quantum information theory including the composition and contraction of multipartite channels, a condition for whether an arbitrary bipartite state may be used for ancilla assisted process tomography, and the derivation of expressions for the average gate fidelity and entanglement fidelity of a channel in terms of each of the different representations of the channel.
Tensor networks (TNs) have become one of the most essential building blocks for various fields of theoretical physics such as condensed matter theory, statistical mechanics, quantum information, and quantum gravity. This review provides a unified description of a series of developments in the TN from the statistical mechanics side. In particular, we begin with the variational principle for the transfer matrix of the 2D Ising model, which naturally leads us to the matrix product state (MPS) and the corner transfer matrix (CTM). We then explain how the CTM can be evolved to such MPS-based approaches as density matrix renormalization group (DMRG) and infinite time-evolved block decimation. We also elucidate that the finite-size DMRG played an intrinsic role for incorporating various quantum information concepts in subsequent developments in the TN. After surveying higher-dimensional generalizations like tensor product states or projected entangled pair states, we describe tensor renormalization groups (TRGs), which are a fusion of TNs and Kadanoff-Wilson type real-space renormalization groups, focusing on their fixed point structures. We then discuss how the difficulty in TRGs for critical systems can be overcome in the tensor network renormalization and the multi-scale entanglement renormalization ansatz.
Tensor Network States are ansaetze for the efficient description of quantum many-body systems. Their success for one dimensional problems, together with the fact that they do not suffer from the sign problem and can address the simulation of real time evolution, have turned them into one of the most promising techniques to study strongly correlated systems. In the realm of Lattice Gauge Theories they can offer an alternative to standard lattice Monte Carlo calculations, which are suited for static properties and regimes where no sign problem appears. The application of Tensor Networks to this kind of problems is a young but rapidly evolving research field. This paper reviews some of the recent progress in this area, and how, using one dimensional models as testbench, some fundamental milestones have been reached that may pave the way to more ambitious goals.