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:2203.17098 · Chinese Physics Letters

Variational Corner Transfer Matrix Renormalization Group Method for Classical Statistical Models

X. F. Liu, Yu Fu, Weiqiang Yu, Ji-Feng Yu, Z. Y. Xie

Published Jun 1, 2022• 13 citations
arXivHTMLPDF

Abstract

In the context of tensor network states, we for the first time reformulate the corner transfer matrix renormalization group (CTMRG) method into a variational bilevel optimization algorithm. The solution of the optimization problem corresponds to the fixed-point environment pursued in the conventional CTMRG method, from which the partition function of a classical statistical model, represented by an infinite tensor network, can be efficiently evaluated. The validity of this variational idea is demonstrated by the high-precision calculation of the residual entropy of the dimer model, and is further verified by investigating several typical phase transitions in classical spin models, where the obtained critical points and critical exponents all agree with the best known results in literature. Its extension to three-dimensional tensor networks or quantum lattice models is straightforward, as also discussed briefly.

DOI
10.1088/0256-307x/39/6/067502

Related papers

Corner transfer matrix derived variational methods in lattice statistical mechanics and quantum many-body systems

Chunhoa Chhenh

The concept of the corner transfer matrix (CTM) was first discovered by Baxter in 1968, when he derived a set of variational matrix equations, which for finite matrix sizes, could be numerically solved to obtain a sequence of approximations for the statistical mechanical properties of a system of monomers and dimers on a rectangular lattice [1]. It was not until 1978, however, in a seminal paper entitled "Variational Approximations for Square Lattice Models in Statistical Mechanics" [4], that Baxter outlined his CTM variational method, which brought to light the potential power of the former objects to obtain numerics and series expansions for unsolved models and to calculate the order parameter of solved ones. Subsequent numerical work led to the realisation that the method, though general, was not very efficient; and increasing efficiency required making model specific modifications, which restricted the transferability of the resulting algorithm to other models. The CTM variational method was thus not widely adopted, despite holding much promise. More recently, however, Nishino and Okunishi discovered that White's density matrix renormalisation group (DMRG) algorithm [55, 56] could be efficiently extended to study two-dimensional classical lattice models, if the density matrix was approximated by Baxters CTMs. Numerical tests of their algorithm, the corner transfer matrix renormalisation group (CTMRG) method, were met with much success. Notable among these is its implementation within the infinite projected entangled-pair states (iPEPS) algorithm of Orus and Vidal to simulate the ground state of infinite two-dimensional quantum systems. In this thesis we review CTM derived variational methods: Baxter's original CTM iterative method, and developments of the CTM concept within the DMRG algorithm by Nishino and Okunishi, which led to the CTMRG method to calculate critical phenomena of classical and quantum systems. This will begin with elucidating the theoretical formalisms of both methods in two dimensions and their generalisations to three dimensions; followed by review of important application, namely, within the iPEPS algorithm of Orus and Vidal to numerically study infinite planar quantum systems.

•Jan 1, 2011•0 citations

Development of Tensor Network Algorithms for Studying Classical and Quantum Many-Body Systems

Matthew Fishman

The field of tensor networks, kicked off in 1992 by Steve White's invention of the spectacularly successful density matrix renormalization group (DMRG) algorithm, has exploded in popularity in recent years. Tensor networks are poised to play a role in helping us solve some of the greatest open physics problems of our time, such as understanding the nature of high-temperature superconductivity and illuminating a theory of quantum gravity. DMRG and extensions based on a class of variational states known as tensor network states have been indispensable tools in helping us understand both numerically and theoretically the properties of complicated classical and quantum many-body systems. However, practical challenges to these techniques still remain, and algorithmic developments are needed before tensor network algorithms can be applied to more physics problems. In this thesis we present a variety of recent advancements to tensor network algorithms. First we describe a DMRG-like algorithm for noninteracting fermions. Noninteracting fermions, naturally being gapless and therefore having high levels of entanglement, are actually a challenging setting for standard DMRG algorithms, and we believe this new algorithm can help with tensor network calculations in that setting. Next we explain a new algorithm called the variational uniform matrix product state (VUMPS) algorithm that is a DMRG-like algorithm that works directly in the thermodynamic limit, improving upon currently available MPS-based methods for studying infinite 1D and quasi-1D quantum many-body systems. Finally, we describe a variety of improvements to algorithms for contracting 2D tensor networks, a common problem in tensor network algorithms, for example for studying 2D classical statistical mechanics problems and 2D quantum many-body problems with projected entangled pair states (PEPS). One is a new variant of the corner transfer matrix renormalization group (CTMRG) algorithm of Nishino and Okunishi that improves the numerical stability for contracting asymmetric two-dimensional tensor networks compared to the most commonly used method. Another is the application of the VUMPS algorithm to contracting 2D tensor networks. The last is a new alternative to CTMRG, where the tensors are solved for with eigenvalue equations instead of a power method, which we call the fixed point corner method (FPCM). We present results showing the transfer matrix VUMPS algorithm and FPCM significantly improve upon the convergence time of CTMRG. We expect these algorithms will play an important role in expanding the set of 2D classical and 2D quantum many-body problems that can be addressed with tensor networks.

•Jun 8, 2018•2 citations

Variationally optimizing infinite projected entangled-pair states at large bond dimensions: A split corner transfer matrix renormalization group approach

Jan Naumann, Erik Lennart Weerda, Jens Eisert +2 more

Projected entangled-pair states (PEPS) have become a powerful tool for studying quantum many-body systems in the condensed matter and quantum materials context, particularly with advances in variational energy optimization methods. A key challenge within this framework is the computational cost associated with the contraction of the two-dimensional lattice, crucial for calculating state vector norms and expectation values. The conventional approach, using the corner transfer matrix renormalization group (CTMRG), involves combining two tensor network layers, resulting in significant time and memory demands. In this work, we introduce an alternative split-CTMRG algorithm, which maintains separate PEPS layers and leverages modified environment tensors, reducing computational complexity while preserving accuracy. Benchmarks on quantum lattice models demonstrate substantial speedups for variational energy optimization, rendering this method valuable for large-scale PEPS simulations.

arXiv:2502.10298•Physical review. B./Physical review. B•Jun 6, 2025•7 citations

Tensor network calculation of boundary and corner magnetization

Krcmar, Roman, Genzor, Jozef, Gendiar, Andrej +1 more

The Corner Transfer Matrix Renormalization Group (CTMRG) algorithm is modified to measure the magnetization at the boundary of the system, including the corners of the square-shaped lattice. Using automatic differentiation, we calculate the magnetization's first derivative, allowing us to determine the boundary critical exponent $β$ accurately.

arXiv:2506.17194•Jun 20, 2025•0 citations

Faster methods for contracting infinite two-dimensional tensor networks

Matthew Fishman, Laurens Vanderstraeten, Valentin Zauner-Stauber +2 more

We revisit the corner transfer matrix renormalization group (CTMRG) method of Nishino and Okunishi for contracting two-dimensional (2D) tensor networks and demonstrate that its performance can be substantially improved by determining the tensors using an eigenvalue solver as opposed to the power method used in CTMRG. We also generalize the variational uniform matrix product state (VUMPS) ansatz for diagonalizing 1D quantum Hamiltonians to the case of 2D transfer matrices and discuss similarities with the corner methods. These two new algorithms will be crucial to improving the performance of variational infinite projected entangled pair state (PEPS) methods.

arXiv:1711.05881•Physical review. B./Physical review. B•Dec 26, 2018•127 citations

Development of Two-Dimensional Tensor Network Methods for the Variational Simulation of Quantum Many-Body States

Jan Naumann

Strongly correlated quantum systems are one of the most interesting and challenging phenomena in modern condensed matter physics. Unfortunately, the theoretical access even to their low energy properties is limited by the exponential growth of the Hilbert space in a many-body setting. To mitigate this computational barrier, tensor network methods are one of the most competitive approaches to classically simulate complex quantum systems. In this thesis we will discuss recent developments in the field of tensor networks to efficiently and accurately simulate two-dimensional quantum many-body states in the thermodynamic limit. Hereby, we introduce the variational update globally optimizing the wave-function, encoded as tensor network in the form of an infinite projected entangled pair state (iPEPS), in order to obtain ground states of many-body Hamiltonian models. We focus in the discussion on the well-established method to approximately contract this two-dimensional structure, the corner transfer matrix renormalization group (CTMRG), and discuss its native application on square lattice and triangular lattice based models. Furthermore, we report the development of a refined numerical algorithm, the split-CTMRG, to significantly reduce its computational complexity, pushing the limits of feasible simulations within modern hardware capabilities. Finally, the method advancements are applied to a currently widely studied model of frustrated magnetism, the Heisenberg maple-leaf antiferromagnet. We are able to find a large phase of vanishing magnetization in contradiction to previous works and, to the best of our knowledge, the lowest reported variational ground state energy at the isotropic point of the model. As an outlook, we describe a potential adaption of the previously developed methods to variationally simulate two-dimensional many-body thermal states.

•Jan 1, 2026•0 citations
In the context of tensor network states, we for the first time reformulate the corner transfer matrix renormalization group (CTMRG) method into a variational bilevel optimization algorithm. The solution of the optimization problem corresponds to the fixed-point environment pursued in the conventional CTMRG method, from which the partition function of a classical statistical model, represented by an infinite tensor network, can be efficiently evaluated. The validity of this variational idea is demonstrated by the high-precision calculation of the residual entropy of the dimer model, and is further verified by investigating several typical phase transitions in classical spin models, where the obtained critical points and critical exponents all agree with the best known results in literature. Its extension to three-dimensional tensor networks or quantum lattice models is straightforward, as also discussed briefly.
The concept of the corner transfer matrix (CTM) was first discovered by Baxter in 1968, when he derived a set of variational matrix equations, which for finite matrix sizes, could be numerically solved to obtain a sequence of approximations for the statistical mechanical properties of a system of monomers and dimers on a rectangular lattice [1]. It was not until 1978, however, in a seminal paper entitled "Variational Approximations for Square Lattice Models in Statistical Mechanics" [4], that Baxter outlined his CTM variational method, which brought to light the potential power of the former objects to obtain numerics and series expansions for unsolved models and to calculate the order parameter of solved ones. Subsequent numerical work led to the realisation that the method, though general, was not very efficient; and increasing efficiency required making model specific modifications, which restricted the transferability of the resulting algorithm to other models. The CTM variational method was thus not widely adopted, despite holding much promise. More recently, however, Nishino and Okunishi discovered that White's density matrix renormalisation group (DMRG) algorithm [55, 56] could be efficiently extended to study two-dimensional classical lattice models, if the density matrix was approximated by Baxters CTMs. Numerical tests of their algorithm, the corner transfer matrix renormalisation group (CTMRG) method, were met with much success. Notable among these is its implementation within the infinite projected entangled-pair states (iPEPS) algorithm of Orus and Vidal to simulate the ground state of infinite two-dimensional quantum systems. In this thesis we review CTM derived variational methods: Baxter's original CTM iterative method, and developments of the CTM concept within the DMRG algorithm by Nishino and Okunishi, which led to the CTMRG method to calculate critical phenomena of classical and quantum systems. This will begin with elucidating the theoretical formalisms of both methods in two dimensions and their generalisations to three dimensions; followed by review of important application, namely, within the iPEPS algorithm of Orus and Vidal to numerically study infinite planar quantum systems.
The field of tensor networks, kicked off in 1992 by Steve White's invention of the spectacularly successful density matrix renormalization group (DMRG) algorithm, has exploded in popularity in recent years. Tensor networks are poised to play a role in helping us solve some of the greatest open physics problems of our time, such as understanding the nature of high-temperature superconductivity and illuminating a theory of quantum gravity. DMRG and extensions based on a class of variational states known as tensor network states have been indispensable tools in helping us understand both numerically and theoretically the properties of complicated classical and quantum many-body systems. However, practical challenges to these techniques still remain, and algorithmic developments are needed before tensor network algorithms can be applied to more physics problems. In this thesis we present a variety of recent advancements to tensor network algorithms. First we describe a DMRG-like algorithm for noninteracting fermions. Noninteracting fermions, naturally being gapless and therefore having high levels of entanglement, are actually a challenging setting for standard DMRG algorithms, and we believe this new algorithm can help with tensor network calculations in that setting. Next we explain a new algorithm called the variational uniform matrix product state (VUMPS) algorithm that is a DMRG-like algorithm that works directly in the thermodynamic limit, improving upon currently available MPS-based methods for studying infinite 1D and quasi-1D quantum many-body systems. Finally, we describe a variety of improvements to algorithms for contracting 2D tensor networks, a common problem in tensor network algorithms, for example for studying 2D classical statistical mechanics problems and 2D quantum many-body problems with projected entangled pair states (PEPS). One is a new variant of the corner transfer matrix renormalization group (CTMRG) algorithm of Nishino and Okunishi that improves the numerical stability for contracting asymmetric two-dimensional tensor networks compared to the most commonly used method. Another is the application of the VUMPS algorithm to contracting 2D tensor networks. The last is a new alternative to CTMRG, where the tensors are solved for with eigenvalue equations instead of a power method, which we call the fixed point corner method (FPCM). We present results showing the transfer matrix VUMPS algorithm and FPCM significantly improve upon the convergence time of CTMRG. We expect these algorithms will play an important role in expanding the set of 2D classical and 2D quantum many-body problems that can be addressed with tensor networks.
Projected entangled-pair states (PEPS) have become a powerful tool for studying quantum many-body systems in the condensed matter and quantum materials context, particularly with advances in variational energy optimization methods. A key challenge within this framework is the computational cost associated with the contraction of the two-dimensional lattice, crucial for calculating state vector norms and expectation values. The conventional approach, using the corner transfer matrix renormalization group (CTMRG), involves combining two tensor network layers, resulting in significant time and memory demands. In this work, we introduce an alternative split-CTMRG algorithm, which maintains separate PEPS layers and leverages modified environment tensors, reducing computational complexity while preserving accuracy. Benchmarks on quantum lattice models demonstrate substantial speedups for variational energy optimization, rendering this method valuable for large-scale PEPS simulations.
The Corner Transfer Matrix Renormalization Group (CTMRG) algorithm is modified to measure the magnetization at the boundary of the system, including the corners of the square-shaped lattice. Using automatic differentiation, we calculate the magnetization's first derivative, allowing us to determine the boundary critical exponent βββ accurately.
We revisit the corner transfer matrix renormalization group (CTMRG) method of Nishino and Okunishi for contracting two-dimensional (2D) tensor networks and demonstrate that its performance can be substantially improved by determining the tensors using an eigenvalue solver as opposed to the power method used in CTMRG. We also generalize the variational uniform matrix product state (VUMPS) ansatz for diagonalizing 1D quantum Hamiltonians to the case of 2D transfer matrices and discuss similarities with the corner methods. These two new algorithms will be crucial to improving the performance of variational infinite projected entangled pair state (PEPS) methods.
Strongly correlated quantum systems are one of the most interesting and challenging phenomena in modern condensed matter physics. Unfortunately, the theoretical access even to their low energy properties is limited by the exponential growth of the Hilbert space in a many-body setting. To mitigate this computational barrier, tensor network methods are one of the most competitive approaches to classically simulate complex quantum systems. In this thesis we will discuss recent developments in the field of tensor networks to efficiently and accurately simulate two-dimensional quantum many-body states in the thermodynamic limit. Hereby, we introduce the variational update globally optimizing the wave-function, encoded as tensor network in the form of an infinite projected entangled pair state (iPEPS), in order to obtain ground states of many-body Hamiltonian models. We focus in the discussion on the well-established method to approximately contract this two-dimensional structure, the corner transfer matrix renormalization group (CTMRG), and discuss its native application on square lattice and triangular lattice based models. Furthermore, we report the development of a refined numerical algorithm, the split-CTMRG, to significantly reduce its computational complexity, pushing the limits of feasible simulations within modern hardware capabilities. Finally, the method advancements are applied to a currently widely studied model of frustrated magnetism, the Heisenberg maple-leaf antiferromagnet. We are able to find a large phase of vanishing magnetization in contradiction to previous works and, to the best of our knowledge, the lowest reported variational ground state energy at the isotropic point of the model. As an outlook, we describe a potential adaption of the previously developed methods to variationally simulate two-dimensional many-body thermal states.