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:1112.4101 · Physical Review B

Exploring corner transfer matrices and corner tensors for the classical simulation of quantum lattice systems

Román Orús

Published May 10, 2012• 118 citations
arXivHTMLPDF

Abstract

In this paper we explore the practical use of the corner transfer matrix and its higher-dimensional generalization, the corner tensor, to develop tensor network algorithms for the classical simulation of quantum lattice systems of infinite size. This exploration is done mainly in one and two spatial dimensions (1D and 2D). We describe a number of numerical algorithms based on corner matrices and tensors to approximate different ground-state properties of these systems. The proposed methods also make use of matrix product operators and projected entangled pair operators and naturally preserve spatial symmetries of the system such as translation invariance. In order to assess the validity of our algorithms, we provide preliminary benchmarking calculations for the spin-1/2 quantum Ising model in a transverse field in both 1D and 2D. Our methods are a plausible alternative to other well-established tensor network approaches such as iDMRG and iTEBD in 1D, and iPEPS and TERG in 2D. The computational complexity of the proposed algorithms is also considered and, in 2D, important differences are found depending on the chosen simulation scheme. We also discuss further possibilities, such as 3D quantum lattice systems, periodic boundary conditions, and real-time evolution. This discussion leads us to reinterpret the standard iTEBD and iPEPS algorithms in terms of corner transfer matrices and corner tensors. Our paper also offers a perspective on many properties of the corner transfer matrix and its higher-dimensional generalizations in the light of novel tensor network methods.

DOI
10.1103/physrevb.85.205117

Related papers

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

Simulation of three-dimensional quantum systems with projected entangled-pair states

Patrick C. G. Vlaar, Philippe Corboz

Tensor network algorithms have proven to be very powerful tools for studying one- and two-dimensional quantum many-body systems. However, their application to three-dimensional (3D) quantum systems has so far been limited, mostly because the efficient contraction of a 3D tensor network is very challenging. In this paper, we develop and benchmark two contraction approaches for infinite projected entangled-pair states (iPEPS) in 3D. The first approach is based on a contraction of a finite cluster of tensors including an effective environment to approximate the full 3D network. The second approach performs a full contraction of the network by first iteratively contracting layers of the network with a boundary iPEPS, followed by a contraction of the resulting quasi-2D network using the corner transfer matrix renormalization group. Benchmark data for the Heisenberg and Bose-Hubbard models on the cubic lattice show that the algorithms provide competitive results compared to other approaches, making iPEPS a promising tool to study challenging open problems in 3D.

arXiv:2102.06715•Physical review. B./Physical review. B•May 19, 2021•42 citations

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

Holographic encoding of universality in corner spectra

Ching-Yu Huang, Tzu-Chieh Wei, Román Orús

In numerical simulations of classical and quantum lattice systems, 2D corner transfer matrices (CTMs) and 3D corner tensors (CTs) are a useful tool to compute approximate contractions of infinite-size tensor networks. In this paper we show how the numerical CTMs and CTs can be used, additionally, to extract universal information from their spectra. We provide examples of this for classical and quantum systems, in 1D, 2D, and 3D. Our results provide, in particular, practical evidence for a wide variety of models of the correspondence between $d$-dimensional quantum and $(d+1)$-dimensional classical spin systems. We show also how corner properties can be used to pinpoint quantum phase transitions, topological or not, without the need for observables. Moreover, for a chiral topological PEPS we show by examples that corner tensors can be used to extract the entanglement spectrum of half a system, with the expected symmetries of the $SU{(2)}_{k}$ Wess-Zumino-Witten model describing its gapless edge for $k=1,2$. We also review the theory behind the quantum-classical correspondence for spin systems and provide a numerical scheme for quantum state renormalization in 2D using CTs. Our results show that bulk information of a lattice system is encoded holographically in efficiently-computable properties of its corners.

arXiv:1702.01598•Physical review. B./Physical review. B•May 31, 2017•6 citations

Fine Grained Tensor Network Methods

Philipp Schmoll, Saeed S. Jahromi, Max Hörmann +3 more

We develop a strategy for tensor network algorithms that allows to deal very efficiently with lattices of high connectivity. The basic idea is to fine grain the physical degrees of freedom, i.e., decompose them into more fundamental units which, after a suitable coarse graining, provide the original ones. Thanks to this procedure, the original lattice with high connectivity is transformed by an isometry into a simpler structure, which is easier to simulate via usual tensor network methods. In particular this enables the use of standard schemes to contract infinite 2D tensor networks-such as corner transfer matrix renormalization schemes-which are more involved on complex lattice structures. We prove the validity of our approach by numerically computing the ground-state properties of the ferromagnetic spin-1 transverse-field Ising model on the 2D triangular and 3D stacked triangular lattice, as well as of the hardcore and softcore Bose-Hubbard models on the triangular lattice. Our results are benchmarked against those obtained with other techniques, such as perturbative continuous unitary transformations and graph projected entangled pair states, showing excellent agreement and also improved performance in several regimes.

arXiv:1911.04882•Physical Review Letters•May 19, 2020•16 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
In this paper we explore the practical use of the corner transfer matrix and its higher-dimensional generalization, the corner tensor, to develop tensor network algorithms for the classical simulation of quantum lattice systems of infinite size. This exploration is done mainly in one and two spatial dimensions (1D and 2D). We describe a number of numerical algorithms based on corner matrices and tensors to approximate different ground-state properties of these systems. The proposed methods also make use of matrix product operators and projected entangled pair operators and naturally preserve spatial symmetries of the system such as translation invariance. In order to assess the validity of our algorithms, we provide preliminary benchmarking calculations for the spin-1/2 quantum Ising model in a transverse field in both 1D and 2D. Our methods are a plausible alternative to other well-established tensor network approaches such as iDMRG and iTEBD in 1D, and iPEPS and TERG in 2D. The computational complexity of the proposed algorithms is also considered and, in 2D, important differences are found depending on the chosen simulation scheme. We also discuss further possibilities, such as 3D quantum lattice systems, periodic boundary conditions, and real-time evolution. This discussion leads us to reinterpret the standard iTEBD and iPEPS algorithms in terms of corner transfer matrices and corner tensors. Our paper also offers a perspective on many properties of the corner transfer matrix and its higher-dimensional generalizations in the light of novel tensor network methods.
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.
Tensor network algorithms have proven to be very powerful tools for studying one- and two-dimensional quantum many-body systems. However, their application to three-dimensional (3D) quantum systems has so far been limited, mostly because the efficient contraction of a 3D tensor network is very challenging. In this paper, we develop and benchmark two contraction approaches for infinite projected entangled-pair states (iPEPS) in 3D. The first approach is based on a contraction of a finite cluster of tensors including an effective environment to approximate the full 3D network. The second approach performs a full contraction of the network by first iteratively contracting layers of the network with a boundary iPEPS, followed by a contraction of the resulting quasi-2D network using the corner transfer matrix renormalization group. Benchmark data for the Heisenberg and Bose-Hubbard models on the cubic lattice show that the algorithms provide competitive results compared to other approaches, making iPEPS a promising tool to study challenging open problems in 3D.
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.
In numerical simulations of classical and quantum lattice systems, 2D corner transfer matrices (CTMs) and 3D corner tensors (CTs) are a useful tool to compute approximate contractions of infinite-size tensor networks. In this paper we show how the numerical CTMs and CTs can be used, additionally, to extract universal information from their spectra. We provide examples of this for classical and quantum systems, in 1D, 2D, and 3D. Our results provide, in particular, practical evidence for a wide variety of models of the correspondence between ddd-dimensional quantum and (d+1)(d+1)(d+1)-dimensional classical spin systems. We show also how corner properties can be used to pinpoint quantum phase transitions, topological or not, without the need for observables. Moreover, for a chiral topological PEPS we show by examples that corner tensors can be used to extract the entanglement spectrum of half a system, with the expected symmetries of the SU(2)kSU{(2)}_{k}SU(2)k​ Wess-Zumino-Witten model describing its gapless edge for k=1,2k=1,2k=1,2. We also review the theory behind the quantum-classical correspondence for spin systems and provide a numerical scheme for quantum state renormalization in 2D using CTs. Our results show that bulk information of a lattice system is encoded holographically in efficiently-computable properties of its corners.
We develop a strategy for tensor network algorithms that allows to deal very efficiently with lattices of high connectivity. The basic idea is to fine grain the physical degrees of freedom, i.e., decompose them into more fundamental units which, after a suitable coarse graining, provide the original ones. Thanks to this procedure, the original lattice with high connectivity is transformed by an isometry into a simpler structure, which is easier to simulate via usual tensor network methods. In particular this enables the use of standard schemes to contract infinite 2D tensor networks-such as corner transfer matrix renormalization schemes-which are more involved on complex lattice structures. We prove the validity of our approach by numerically computing the ground-state properties of the ferromagnetic spin-1 transverse-field Ising model on the 2D triangular and 3D stacked triangular lattice, as well as of the hardcore and softcore Bose-Hubbard models on the triangular lattice. Our results are benchmarked against those obtained with other techniques, such as perturbative continuous unitary transformations and graph projected entangled pair states, showing excellent agreement and also improved performance in several regimes.
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.