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

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

Chunhoa Chhenh

Published Jan 1, 2011• 0 citations
Publisher

Abstract

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.

DOI
10.25911/5d611f3b11174

Related papers

Simulation of two dimensional quantum systems on an infinite lattice: corner transfer matrix methods revisited

Román Orús, Guifré Vidal

An extension of the projected entangled-pair states (PEPS) algorithm to infinite systems, known as the iPEPS algorithm, was recently proposed to compute the ground state of quantum systems on an infinite two-dimensional lattice. Here we investigate a modification of the iPEPS algorithm, where the environment is computed using the corner transfer matrix renormalization group (CTMRG) method, instead of using one-dimensional transfer matrix methods as in the original proposal. We describe a variant of the CTMRG that addresses different directions of the lattice independently, and use it combined with imaginary time evolution to compute the ground state of the two-dimensional quantum Ising model. Near criticality, the modified iPEPS algorithm is seen to provide a better estimation of the order parameter and correlators.

•May 20, 2009•1 citation

Simulation of two-dimensional quantum systems on an infinite lattice revisited: Corner transfer matrix for tensor contraction

Román Orús, Guifré Vidal

An extension of the projected entangled-pair states (PEPS) algorithm to infinite systems, known as the iPEPS algorithm, was recently proposed to compute the ground state of quantum systems on an infinite two dimensional lattice. Here we investigate a modification of the iPEPS algorithm, where the environment is computed using the corner transfer matrix renormalization group (CTMRG) method, instead of using one-dimensional transfer matrix methods as in the original proposal. We describe a variant of the CTMRG that addresses different directions of the lattice independently, and use it combined with imaginary time evolution to compute the ground state of the two dimensional quantum Ising model. Near criticality, the modified iPEPS algorithm is seen to provide a better estimation of the order parameter and correlators.

arXiv:0905.3225•Physical Review B•Sep 8, 2009•413 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

Series expansions from the corner transfer matrix renormalization group method: the hard-squares model

Yao-ban Chan

The corner transfer matrix renormalization group method is an efficient method for evaluating physical quantities in statistical mechanical models. It originates from Baxter’s corner transfer matrix equations and method, and was developed by Nishino and Okunishi in 1996. In this paper, we review and adapt this method, previously used for numerical calculations, to derive series expansions. We use this to calculate 92 terms of the partition function of the hard-squares model. We use the resulting series to provide evidence supporting the claim that the method is subexponential in the number of generated terms, and briefly analyse the singularities of the function.

arXiv:1107.1677•Journal of Physics A Mathematical and Theoretical•Feb 9, 2012•21 citations

Corner Transfer Matrix Algorithm for Classical Renormalization Group

Tomotoshi Nishino, Kouichi Okunishi

We report a real-space renormalization group (RSRG) algorithm, which is formulated through Baxter's corner transfer matrix (CTM), for two-dimensional (d = 2) classical lattice models. The new method performs the renormalization group transformation according to White's density matrix algorithm, so that variational free energies are minimized within a restricted degree of freedom m. As a consequence of the renormalization, spin variables on each corner of CTM are replaced by a m-state block spin variable. It is shown that the thermodynamic functions and critical exponents of the q = 2, 3 Potts models can be precisely evaluated by use of the renormalization group method.

arXiv:cond-mat/9705072•Journal of the Physical Society of Japan•Oct 15, 1997•206 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•142 citations
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.
An extension of the projected entangled-pair states (PEPS) algorithm to infinite systems, known as the iPEPS algorithm, was recently proposed to compute the ground state of quantum systems on an infinite two-dimensional lattice. Here we investigate a modification of the iPEPS algorithm, where the environment is computed using the corner transfer matrix renormalization group (CTMRG) method, instead of using one-dimensional transfer matrix methods as in the original proposal. We describe a variant of the CTMRG that addresses different directions of the lattice independently, and use it combined with imaginary time evolution to compute the ground state of the two-dimensional quantum Ising model. Near criticality, the modified iPEPS algorithm is seen to provide a better estimation of the order parameter and correlators.
An extension of the projected entangled-pair states (PEPS) algorithm to infinite systems, known as the iPEPS algorithm, was recently proposed to compute the ground state of quantum systems on an infinite two dimensional lattice. Here we investigate a modification of the iPEPS algorithm, where the environment is computed using the corner transfer matrix renormalization group (CTMRG) method, instead of using one-dimensional transfer matrix methods as in the original proposal. We describe a variant of the CTMRG that addresses different directions of the lattice independently, and use it combined with imaginary time evolution to compute the ground state of the two dimensional quantum Ising model. Near criticality, the modified iPEPS algorithm is seen to provide a better estimation of the order parameter and correlators.
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.
The corner transfer matrix renormalization group method is an efficient method for evaluating physical quantities in statistical mechanical models. It originates from Baxter’s corner transfer matrix equations and method, and was developed by Nishino and Okunishi in 1996. In this paper, we review and adapt this method, previously used for numerical calculations, to derive series expansions. We use this to calculate 92 terms of the partition function of the hard-squares model. We use the resulting series to provide evidence supporting the claim that the method is subexponential in the number of generated terms, and briefly analyse the singularities of the function.
We report a real-space renormalization group (RSRG) algorithm, which is formulated through Baxter's corner transfer matrix (CTM), for two-dimensional (d = 2) classical lattice models. The new method performs the renormalization group transformation according to White's density matrix algorithm, so that variational free energies are minimized within a restricted degree of freedom m. As a consequence of the renormalization, spin variables on each corner of CTM are replaced by a m-state block spin variable. It is shown that the thermodynamic functions and critical exponents of the q = 2, 3 Potts models can be precisely evaluated by use of the renormalization group method.
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.