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:1903.12137 · Physical review. E

Tangent space to the manifold of critical classical Hamiltonians representable by tensor networks

Yantao Wu

Published Aug 20, 2019• 2 citations
arXivHTMLPDF

Abstract

We introduce a scheme to perform Monte Carlo renormalization group with the coupling constants of the system Hamiltonian encoded in a tensor network. With this scheme we compute the tangent space to the manifold of the critical Hamiltonians representable by a tensor network at the nearest-neighbor critical coupling for three models: the two- and three-dimensional Ising models and the two-dimensional three-state Potts model.

DOI
10.1103/physreve.100.023306

Related papers

Determination of the critical manifold tangent space and curvature with Monte Carlo renormalization group

Yantao Wu, Roberto Car

We show that the critical manifold of a statistical mechanical system in the vicinity of a critical point is locally accessible through correlation functions at that point. A practical numerical method is presented to determine the tangent space and the curvature to the critical manifold with variational Monte Carlo renormalization group. Because of the use of a variational bias potential of the coarse-grained variables, critical slowing down is greatly alleviated in the Monte Carlo simulation. In addition, this method is free of truncation error. We study the isotropic Ising model on square and cubic lattices, the anisotropic Ising model, and the tricritical Ising model on square lattices to illustrate the method.

arXiv:1903.08231•Physical review. E•Aug 26, 2019•7 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

Monte Carlo Renormalization Group for Classical Lattice Models with Quenched Disorder

Yantao Wu, Roberto Car

We extend to quenched-disordered systems the variational scheme for real-space renormalization group calculations that we recently introduced for homogeneous spin Hamiltonians. When disorder is present our approach gives access to the flow of the renormalized Hamiltonian distribution, from which one can compute the critical exponents if the correlations of the renormalized couplings retain finite range. Key to the variational approach is the bias potential found by minimizing a convex functional in statistical mechanics. This potential reduces dramatically the Monte Carlo relaxation time in large disordered systems. We demonstrate the method with applications to the two-dimensional dilute Ising model, the random transverse field quantum Ising chain, and the random field Ising in two- and three-dimensional lattices.

arXiv:1810.09579•Physical Review Letters•Nov 3, 2020•2 citations

Tensor renormalization group study of 3D principal chiral model

Judah Unmuth-Yockey, Shinichiro Akiyama, Raghav G. Jha

We study the three-dimensional $SU(2)$ principal chiral model using different tensor renormalization group methods based on the triad and anisotropic decomposition of the tensor. The tensor network representation is formulated based on the character expansion of the Boltzmann weight. We compare the average action obtained using these two tensor network algorithms and confirm that the resulting critical coupling and exponent are comparable with the recent estimations from the Monte Carlo methods.

International Symposium on Lattice Field Theory (LATTICE)•Dec 27, 2023•1 citation

Variational Approach to Monte Carlo Renormalization Group

Yantao Wu, Roberto Car

We present a Monte Carlo method for computing the renormalized coupling constants and the critical exponents within renormalization theory. The scheme, which derives from a variational principle, overcomes critical slowing down, by means of a bias potential that renders the coarse grained variables uncorrelated. The two-dimensional Ising model is used to illustrate the method.

arXiv:1707.08683•Physical Review Letters•Nov 28, 2017•13 citations

Finite-size and finite bond dimension effects of tensor network renormalization

Atsushi Ueda, Masaki Oshikawa

We propose a general procedure for extracting the running coupling constants of the underlying field theory of a given classical statistical model on a two-dimensional lattice, combining tensor network renormalization (TNR) and the finite-size scaling theory of conformal field theory. By tracking the coupling constants at each scale, we are able to visualize the renormalization group flow and demonstrate it with the classical Ising and three-state Potts models. Furthermore, utilizing this methodology, we reveal the limitations due to finite bond dimension $D$ on TNR applied to critical systems. We find that a finite correlation length is imposed by the finite bond dimension in TNR, and it can be attributed to an emergent relevant perturbation that respects the symmetries of the system. The correlation length shows the same power-law dependence on $D$ as the ``finite entanglement scaling'' of the matrix product states.

arXiv:2302.06632•Physical review. B./Physical review. B•Jul 14, 2023•30 citations
We introduce a scheme to perform Monte Carlo renormalization group with the coupling constants of the system Hamiltonian encoded in a tensor network. With this scheme we compute the tangent space to the manifold of the critical Hamiltonians representable by a tensor network at the nearest-neighbor critical coupling for three models: the two- and three-dimensional Ising models and the two-dimensional three-state Potts model.
We show that the critical manifold of a statistical mechanical system in the vicinity of a critical point is locally accessible through correlation functions at that point. A practical numerical method is presented to determine the tangent space and the curvature to the critical manifold with variational Monte Carlo renormalization group. Because of the use of a variational bias potential of the coarse-grained variables, critical slowing down is greatly alleviated in the Monte Carlo simulation. In addition, this method is free of truncation error. We study the isotropic Ising model on square and cubic lattices, the anisotropic Ising model, and the tricritical Ising model on square lattices to illustrate the method.
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.
We extend to quenched-disordered systems the variational scheme for real-space renormalization group calculations that we recently introduced for homogeneous spin Hamiltonians. When disorder is present our approach gives access to the flow of the renormalized Hamiltonian distribution, from which one can compute the critical exponents if the correlations of the renormalized couplings retain finite range. Key to the variational approach is the bias potential found by minimizing a convex functional in statistical mechanics. This potential reduces dramatically the Monte Carlo relaxation time in large disordered systems. We demonstrate the method with applications to the two-dimensional dilute Ising model, the random transverse field quantum Ising chain, and the random field Ising in two- and three-dimensional lattices.
We study the three-dimensional SU(2)SU(2)SU(2) principal chiral model using different tensor renormalization group methods based on the triad and anisotropic decomposition of the tensor. The tensor network representation is formulated based on the character expansion of the Boltzmann weight. We compare the average action obtained using these two tensor network algorithms and confirm that the resulting critical coupling and exponent are comparable with the recent estimations from the Monte Carlo methods.
We propose a general procedure for extracting the running coupling constants of the underlying field theory of a given classical statistical model on a two-dimensional lattice, combining tensor network renormalization (TNR) and the finite-size scaling theory of conformal field theory. By tracking the coupling constants at each scale, we are able to visualize the renormalization group flow and demonstrate it with the classical Ising and three-state Potts models. Furthermore, utilizing this methodology, we reveal the limitations due to finite bond dimension DDD on TNR applied to critical systems. We find that a finite correlation length is imposed by the finite bond dimension in TNR, and it can be attributed to an emergent relevant perturbation that respects the symmetries of the system. The correlation length shows the same power-law dependence on DDD as the ``finite entanglement scaling'' of the matrix product states.