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

WORLD SCIENTIFIC eBooks

NOVEL TENSOR NETWORK RENORMALIZATION GROUP APPROACHES FOR QUANTUM LATTICE MODELS

Gang Su

Published Aug 14, 2013• 0 citations
Publisher

Abstract

Two novel tensor network-based algorithms, say, the linearized tensor renormalization group and the optimized decimation of tensor network with superorthogonalization methods, as well as their applications to quantum spin lattice models, are discussed. Both methods can be applied to explore not only the thermodynamic but also the ground state properties of low-dimensional quantum lattice systems.

DOI
10.1142/9789814518550_0023

Related papers

Linearized Tensor Renormalization Group Algorithm for the Calculation of Thermodynamic Properties of Quantum Lattice Models

Wei Li, Shi-Ju Ran, Shou-Shu Gong +4 more

A linearized tensor renormalization group algorithm is developed to calculate the thermodynamic properties of low-dimensional quantum lattice models. This new approach employs the infinite time-evolving block decimation technique, and allows for treating directly the transfer-matrix tensor network that makes it more scalable. To illustrate the performance, the thermodynamic quantities of the quantum XY spin chain as well as the Heisenberg antiferromagnet on a honeycomb lattice are calculated by the linearized tensor renormalization group method, showing the pronounced precision and high efficiency.

arXiv:1011.0155•Physical Review Letters•Mar 22, 2011•100 citations

Linearized tensor renormalization group approach for quantum many-body lattice systems

Gang Su

We review the development of numerical renormalization group methods,including Wilson's numerical renormalization group,White's density matrix renormalization group,and several recent rapidly developing tensor network state-based algorithms.Among these,particular emphasis is laid on the linearized tensor renormalization group method,which was recently proposed to accurately calculate the thermodynamic properties of quantum many-body lattice systems,and which may have broad applications in both one-and two-dimensional quantum systems.

•Jan 1, 2012•0 citations

Tensor Networks and the Renormalization Group

Markus Hauru

Tensor networks are a class of methods for studying many-body systems. They give a geometrical description of the internal structure of many-body states, operators, and partition functions, that can be used to implement efficient algorithms to simulate them numerically. In this thesis, after providing a very brief overview of the field, we present new tensor network methods for three different use cases. \n \nFirst, we present a new real-space renormalization group algorithm for tensor networks. Compared to existing methods, its advantages are its low computational cost, simplicity of implementation, and applicability to any network. We benchmark it on the 2D classical Ising model and find accuracy comparable with the best existing tensor network methods. Due to its simplicity and generalizability, we consider our algorithm to be an excellent candidate for implementation of real-space renormalization in higher dimensions, and discuss some of the details and the remaining challenges in 3D. \n \nSecond, we show how certain topological conformal defects of critical lattice theories can be represented as tensor networks, using the 2D classical Ising model as an example. Furthermore, we show how such tensor network descriptions, combined with a renormalization group algorithm, can be used to obtain accurate estimates of the universal properties of these defects. We also show how coarse-graining of defects can be applied to any conformal defect (i.e. not just topological ones), and yields a set of associated scaling dimensions. \n \nFinally, we leave behind the focus on renormalization group methods, and present a method for spatially resolving the overlap between two tensor network states, to obtain localized information about the similarities and differences between them. For a given region, the similarity of two states in this region can be quantified by the Uhlmann fidelity of their reduced density matrices, and we show how such fidelities can be efficiently computed in many cases when the two states are represented as tensor networks. We demonstrate the usefulness of evaluating such subsystem fidelities with three example applications: studying local quenches, comparing critical and non-critical states, and quantifying convergence in tensor network simulations.

•Aug 24, 2018•0 citations

Optimized decimation of tensor networks with super-orthogonalization for two-dimensional quantum lattice models

Shi-Ju Ran, Wei Li, Bin Xi +2 more

An algorithm based on the optimized decimation of tensor networks with super-orthogonalization (ODTNS) that can be applied to simulate efficiently and accurately not only the ground state but also the thermodynamic properties of two-dimensional (2D) quantum lattice models is proposed. By transforming the 2D quantum model into a three-dimensional (3D) closed tensor network (TN) comprised of the tensor product density operator and a 3D brick-wall TN, the free energy of the system can be calculated with the imaginary time evolution, in which the network Tucker decomposition is suggested for the first time to obtain the optimal lower-dimensional approximation on the bond space by transforming the TN into a super-orthogonal form. The efficiency and accuracy of this algorithm are testified, which are fairly comparable with the quantum Monte Carlo calculations. Besides, the present ODTNS scheme can also be applicable to the 2D frustrated quantum spin models with nice efficiency.

arXiv:1205.5636•Physical Review B•Oct 26, 2012•70 citations

Bilayer linearized tensor renormalization group approach for thermal tensor networks

Yongliang Dong, Lei Chen, Yun-Jing Liu +1 more

Thermal tensor networks constitute an efficient and versatile representation for quantum lattice models at finite temperatures. By Trotter-Suzuki decomposition, one obtains a $D$+1 dimensional TTN for the $D$-dimensional quantum system and then employs efficient renormalizaton group (RG) contractions to obtain the thermodynamic properties with high precision. The linearized tensor renormalization group (LTRG) method, which can be used to contract TTN efficiently and calculate the thermodynamics, is briefly reviewed and then generalized to a bilayer form. We dub this bilayer algorithm as LTRG++ and explore its performance in both finite- and infinite-size systems, finding the numerical accuracy significantly improved compared to single-layer algorithm. Moreover, we show that the LTRG++ algorithm in an infinite-size system is in essence equivalent to transfer-matrix renormalization group method, while reformulated in a tensor network language. As an application of LTRG++, we simulate an extended fermionic Hubbard model numerically, where the phase separation phenomenon, ground-state phase diagram, as well as quantum criticality-enhanced magnetocaloric effects, are investigated.

arXiv:1612.01896•Physical review. B./Physical review. B•Apr 24, 2017•25 citations

Tensor network algorithm by coarse-graining tensor renormalization on finite periodic lattices

Hui‐Hai Zhao, Z. Y. Xie, Tao Xiang +1 more

We develop coarse-graining tensor renormalization group algorithms to compute physical properties of two-dimensional lattice models on finite periodic lattices. Two different coarse-graining strategies, one based on the tensor renormalization group and the other based on the higher-order tensor renormalization group, are introduced. In order to optimize the tensor network model globally, a sweeping scheme is proposed to account for the renormalization effect from the environment tensors under the framework of second renormalization group. We demonstrate the algorithms by the classical Ising model on the square lattice and the Kitaev model on the honeycomb lattice, and show that the finite-size algorithms achieve substantially more accurate results than the corresponding infinite-size ones.

arXiv:1510.03333•Physical review. B./Physical review. B•Mar 9, 2016•43 citations
Two novel tensor network-based algorithms, say, the linearized tensor renormalization group and the optimized decimation of tensor network with superorthogonalization methods, as well as their applications to quantum spin lattice models, are discussed. Both methods can be applied to explore not only the thermodynamic but also the ground state properties of low-dimensional quantum lattice systems.
A linearized tensor renormalization group algorithm is developed to calculate the thermodynamic properties of low-dimensional quantum lattice models. This new approach employs the infinite time-evolving block decimation technique, and allows for treating directly the transfer-matrix tensor network that makes it more scalable. To illustrate the performance, the thermodynamic quantities of the quantum XY spin chain as well as the Heisenberg antiferromagnet on a honeycomb lattice are calculated by the linearized tensor renormalization group method, showing the pronounced precision and high efficiency.
We review the development of numerical renormalization group methods,including Wilson's numerical renormalization group,White's density matrix renormalization group,and several recent rapidly developing tensor network state-based algorithms.Among these,particular emphasis is laid on the linearized tensor renormalization group method,which was recently proposed to accurately calculate the thermodynamic properties of quantum many-body lattice systems,and which may have broad applications in both one-and two-dimensional quantum systems.
Tensor networks are a class of methods for studying many-body systems. They give a geometrical description of the internal structure of many-body states, operators, and partition functions, that can be used to implement efficient algorithms to simulate them numerically. In this thesis, after providing a very brief overview of the field, we present new tensor network methods for three different use cases. \n \nFirst, we present a new real-space renormalization group algorithm for tensor networks. Compared to existing methods, its advantages are its low computational cost, simplicity of implementation, and applicability to any network. We benchmark it on the 2D classical Ising model and find accuracy comparable with the best existing tensor network methods. Due to its simplicity and generalizability, we consider our algorithm to be an excellent candidate for implementation of real-space renormalization in higher dimensions, and discuss some of the details and the remaining challenges in 3D. \n \nSecond, we show how certain topological conformal defects of critical lattice theories can be represented as tensor networks, using the 2D classical Ising model as an example. Furthermore, we show how such tensor network descriptions, combined with a renormalization group algorithm, can be used to obtain accurate estimates of the universal properties of these defects. We also show how coarse-graining of defects can be applied to any conformal defect (i.e. not just topological ones), and yields a set of associated scaling dimensions. \n \nFinally, we leave behind the focus on renormalization group methods, and present a method for spatially resolving the overlap between two tensor network states, to obtain localized information about the similarities and differences between them. For a given region, the similarity of two states in this region can be quantified by the Uhlmann fidelity of their reduced density matrices, and we show how such fidelities can be efficiently computed in many cases when the two states are represented as tensor networks. We demonstrate the usefulness of evaluating such subsystem fidelities with three example applications: studying local quenches, comparing critical and non-critical states, and quantifying convergence in tensor network simulations.
An algorithm based on the optimized decimation of tensor networks with super-orthogonalization (ODTNS) that can be applied to simulate efficiently and accurately not only the ground state but also the thermodynamic properties of two-dimensional (2D) quantum lattice models is proposed. By transforming the 2D quantum model into a three-dimensional (3D) closed tensor network (TN) comprised of the tensor product density operator and a 3D brick-wall TN, the free energy of the system can be calculated with the imaginary time evolution, in which the network Tucker decomposition is suggested for the first time to obtain the optimal lower-dimensional approximation on the bond space by transforming the TN into a super-orthogonal form. The efficiency and accuracy of this algorithm are testified, which are fairly comparable with the quantum Monte Carlo calculations. Besides, the present ODTNS scheme can also be applicable to the 2D frustrated quantum spin models with nice efficiency.
Thermal tensor networks constitute an efficient and versatile representation for quantum lattice models at finite temperatures. By Trotter-Suzuki decomposition, one obtains a DDD+1 dimensional TTN for the DDD-dimensional quantum system and then employs efficient renormalizaton group (RG) contractions to obtain the thermodynamic properties with high precision. The linearized tensor renormalization group (LTRG) method, which can be used to contract TTN efficiently and calculate the thermodynamics, is briefly reviewed and then generalized to a bilayer form. We dub this bilayer algorithm as LTRG++ and explore its performance in both finite- and infinite-size systems, finding the numerical accuracy significantly improved compared to single-layer algorithm. Moreover, we show that the LTRG++ algorithm in an infinite-size system is in essence equivalent to transfer-matrix renormalization group method, while reformulated in a tensor network language. As an application of LTRG++, we simulate an extended fermionic Hubbard model numerically, where the phase separation phenomenon, ground-state phase diagram, as well as quantum criticality-enhanced magnetocaloric effects, are investigated.
We develop coarse-graining tensor renormalization group algorithms to compute physical properties of two-dimensional lattice models on finite periodic lattices. Two different coarse-graining strategies, one based on the tensor renormalization group and the other based on the higher-order tensor renormalization group, are introduced. In order to optimize the tensor network model globally, a sweeping scheme is proposed to account for the renormalization effect from the environment tensors under the framework of second renormalization group. We demonstrate the algorithms by the classical Ising model on the square lattice and the Kitaev model on the honeycomb lattice, and show that the finite-size algorithms achieve substantially more accurate results than the corresponding infinite-size ones.