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:1409.2407 · New Journal of Physics

Decorated tensor network renormalization for lattice gauge theories and spin foam models

Bianca Dittrich, Sebastian Mizera, Sebastian Steinhaus

Published May 6, 2016• 101 citations
arXivHTMLPDF

Abstract

Tensor network techniques have proved to be powerful tools that can be employed to explore the large scale dynamics of lattice systems. Nonetheless, the redundancy of degrees of freedom in lattice gauge theories (and related models) poses a challenge for standard tensor network algorithms. We accommodate for such systems by introducing an additional structure decorating the tensor network. This allows to explicitly preserve the gauge symmetry of the system under coarse graining and straightforwardly interpret the fixed point tensors. We propose and test (for models with finite Abelian groups) a coarse graining algorithm for lattice gauge theories based on decorated tensor networks. We also point out that decorated tensor networks are applicable to other models as well, where they provide the advantage to give immediate access to certain expectation values and correlation functions.

DOI
10.1088/1367-2630/18/5/053009

Related papers

Tensor Network Renormalization with Fusion Charges—Applications to 3D Lattice Gauge Theory

William J. Cunningham, Bianca Dittrich, Sebastian Steinhaus

Tensor network methods are powerful and efficient tools for studying the properties and dynamics of statistical and quantum systems, in particular in one and two dimensions. In recent years, these methods have been applied to lattice gauge theories, yet these theories remain a challenge in ( 2 + 1 ) dimensions. In this article, we present a new (decorated) tensor network algorithm, in which the tensors encode the lattice gauge amplitude expressed in the fusion basis. This has several advantages—firstly, the fusion basis does diagonalize operators measuring the magnetic fluxes and electric charges associated to a hierarchical set of regions. The algorithm allows therefore a direct access to these observables. Secondly the fusion basis is, as opposed to the previously employed spin network basis, stable under coarse-graining. Thirdly, due to the hierarchical structure of the fusion basis, the algorithm does implement predefined disentanglers. We apply this new algorithm to lattice gauge theories defined for the quantum group SU ( 2 ) k and identify a weak and a strong coupling phase for various levels k . As we increase the level k , the critical coupling g c decreases linearly, suggesting the absence of a deconfining phase for the continuous group SU ( 2 ) . Moreover, we illustrate the scaling behaviour of the Wilson loops in the two phases.

arXiv:2002.10472•Universe•Jul 12, 2020•18 citations

Towards a phase diagram for spin foams

Clement Delcamp, Bianca Dittrich

Abstract One of the most pressing issues for loop quantum gravity and spin foams is the construction of the continuum limit. In this paper, we propose a systematic coarse-graining scheme for three-dimensional lattice gauge models including spin foams. This scheme is based on the concept of decorated tensor networks, which have been introduced recently. Here we develop an algorithm applicable to gauge theories with non-Abelian groups, which for the first time allows for the application of tensor network coarse-graining techniques to proper spin foams. The procedure deals efficiently with the large redundancy of degrees of freedom resulting from gauge invariance. The algorithm is applied to 3D spin foams defined on a cubical lattice which, in contrast to a proper triangulation, allows for non-trivial simplicity constraints. This mimics the construction of spin foams for 4D gravity. For lattice gauge models based on a finite group we use the algorithm to obtain phase diagrams, encoding the continuum limit of a wide range of these models. We find phase transitions for various families of models carrying non-trivial simplicity constraints.

arXiv:1612.04506•Classical and Quantum Gravity•Sep 26, 2017•68 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•40 citations

Tensor networks for lattice gauge theories beyond one dimension

Giuseppe Magnifico, Giovanni Cataldi, Marco Rigobello +4 more

Tensor network methods are numerical tools and algorithms to study many-body quantum systems in and out of equilibrium, based on tailored variational wave functions. They have found significant applications in simulating lattice gauge theories that approach relevant problems in high-energy physics. Compared to Monte Carlo methods, they do not suffer from the sign problem, allowing them to explore challenging regimes such as finite chemical potentials and real-time dynamics. Further development is required to tackle fundamental challenges, such as accessing continuum limits or computations of large-scale quantum chromodynamics. This work reviews the state-of-the-art tensor network methods and discusses a possible roadmap for algorithmic development and strategies to enhance their capabilities and extend their applicability to open high-energy problems. We provide tailored estimates of the theoretical and computational resource scaling for attacking large-scale lattice gauge theories. Tensor networks are a powerful complementary approach to Monte Carlo methods for simulating lattice gauge theories, enabling access to challenging regimes such as real-time dynamics and finite-density systems. This work reviews the state of the art, outlines a roadmap for algorithmic developments, and provides resource estimates to guide large-scale applications in high-energy physics.

arXiv:2407.03058•Communications Physics•Aug 9, 2025•22 citations

Coarse graining methods for spin net and spin foam models

Bianca Dittrich, Frank C Eckert, Mercedes Martín-Benito

We undertake first steps in making a class of discrete models of quantum gravity, spin foams, accessible to a large-scale analysis by numerical and computational methods. In particular, we apply the Migdal–Kadanoff and tensor network renormalization (TNR) schemes to spin net and spin foam models based on finite Abelian groups and introduce 'cutoff models' to probe the fate of gauge symmetries under various such approximated renormalization group flows. For the TNR analysis, a new Gauß constraint preserving algorithm is introduced to improve numerical stability and aid physical interpretation. We also describe the fixed point structure and establish the equivalence of certain models.

arXiv:1109.4927•New Journal of Physics•Mar 16, 2012•103 citations

Tensor Network Renormalization

Glen Evenbly, Guifré Vidal

We introduce a coarse-graining transformation for tensor networks that can be applied to study both the partition function of a classical statistical system and the Euclidean path integral of a quantum many-body system. The scheme is based upon the insertion of optimized unitary and isometric tensors (disentanglers and isometries) into the tensor network and has, as its key feature, the ability to remove short-range entanglement or correlations at each coarse-graining step. Removal of short-range entanglement results in scale invariance being explicitly recovered at criticality. In this way we obtain a proper renormalization group flow (in the space of tensors), one that in particular (i) is computationally sustainable, even for critical systems, and (ii) has the correct structure of fixed points, both at criticality and away from it. We demonstrate the proposed approach in the context of the 2D classical Ising model.

arXiv:1412.0732•Physical Review Letters•Oct 29, 2015•362 citations
Tensor network techniques have proved to be powerful tools that can be employed to explore the large scale dynamics of lattice systems. Nonetheless, the redundancy of degrees of freedom in lattice gauge theories (and related models) poses a challenge for standard tensor network algorithms. We accommodate for such systems by introducing an additional structure decorating the tensor network. This allows to explicitly preserve the gauge symmetry of the system under coarse graining and straightforwardly interpret the fixed point tensors. We propose and test (for models with finite Abelian groups) a coarse graining algorithm for lattice gauge theories based on decorated tensor networks. We also point out that decorated tensor networks are applicable to other models as well, where they provide the advantage to give immediate access to certain expectation values and correlation functions.
Tensor network methods are powerful and efficient tools for studying the properties and dynamics of statistical and quantum systems, in particular in one and two dimensions. In recent years, these methods have been applied to lattice gauge theories, yet these theories remain a challenge in ( 2 + 1 ) dimensions. In this article, we present a new (decorated) tensor network algorithm, in which the tensors encode the lattice gauge amplitude expressed in the fusion basis. This has several advantages—firstly, the fusion basis does diagonalize operators measuring the magnetic fluxes and electric charges associated to a hierarchical set of regions. The algorithm allows therefore a direct access to these observables. Secondly the fusion basis is, as opposed to the previously employed spin network basis, stable under coarse-graining. Thirdly, due to the hierarchical structure of the fusion basis, the algorithm does implement predefined disentanglers. We apply this new algorithm to lattice gauge theories defined for the quantum group SU ( 2 ) k and identify a weak and a strong coupling phase for various levels k . As we increase the level k , the critical coupling g c decreases linearly, suggesting the absence of a deconfining phase for the continuous group SU ( 2 ) . Moreover, we illustrate the scaling behaviour of the Wilson loops in the two phases.
Abstract One of the most pressing issues for loop quantum gravity and spin foams is the construction of the continuum limit. In this paper, we propose a systematic coarse-graining scheme for three-dimensional lattice gauge models including spin foams. This scheme is based on the concept of decorated tensor networks, which have been introduced recently. Here we develop an algorithm applicable to gauge theories with non-Abelian groups, which for the first time allows for the application of tensor network coarse-graining techniques to proper spin foams. The procedure deals efficiently with the large redundancy of degrees of freedom resulting from gauge invariance. The algorithm is applied to 3D spin foams defined on a cubical lattice which, in contrast to a proper triangulation, allows for non-trivial simplicity constraints. This mimics the construction of spin foams for 4D gravity. For lattice gauge models based on a finite group we use the algorithm to obtain phase diagrams, encoding the continuum limit of a wide range of these models. We find phase transitions for various families of models carrying non-trivial simplicity constraints.
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.
Tensor network methods are numerical tools and algorithms to study many-body quantum systems in and out of equilibrium, based on tailored variational wave functions. They have found significant applications in simulating lattice gauge theories that approach relevant problems in high-energy physics. Compared to Monte Carlo methods, they do not suffer from the sign problem, allowing them to explore challenging regimes such as finite chemical potentials and real-time dynamics. Further development is required to tackle fundamental challenges, such as accessing continuum limits or computations of large-scale quantum chromodynamics. This work reviews the state-of-the-art tensor network methods and discusses a possible roadmap for algorithmic development and strategies to enhance their capabilities and extend their applicability to open high-energy problems. We provide tailored estimates of the theoretical and computational resource scaling for attacking large-scale lattice gauge theories. Tensor networks are a powerful complementary approach to Monte Carlo methods for simulating lattice gauge theories, enabling access to challenging regimes such as real-time dynamics and finite-density systems. This work reviews the state of the art, outlines a roadmap for algorithmic developments, and provides resource estimates to guide large-scale applications in high-energy physics.
We undertake first steps in making a class of discrete models of quantum gravity, spin foams, accessible to a large-scale analysis by numerical and computational methods. In particular, we apply the Migdal–Kadanoff and tensor network renormalization (TNR) schemes to spin net and spin foam models based on finite Abelian groups and introduce 'cutoff models' to probe the fate of gauge symmetries under various such approximated renormalization group flows. For the TNR analysis, a new Gauß constraint preserving algorithm is introduced to improve numerical stability and aid physical interpretation. We also describe the fixed point structure and establish the equivalence of certain models.
We introduce a coarse-graining transformation for tensor networks that can be applied to study both the partition function of a classical statistical system and the Euclidean path integral of a quantum many-body system. The scheme is based upon the insertion of optimized unitary and isometric tensors (disentanglers and isometries) into the tensor network and has, as its key feature, the ability to remove short-range entanglement or correlations at each coarse-graining step. Removal of short-range entanglement results in scale invariance being explicitly recovered at criticality. In this way we obtain a proper renormalization group flow (in the space of tensors), one that in particular (i) is computationally sustainable, even for critical systems, and (ii) has the correct structure of fixed points, both at criticality and away from it. We demonstrate the proposed approach in the context of the 2D classical Ising model.