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:1809.08180 · Annals of Physics

A programming guide for tensor networks with global SU(2) symmetry

Philipp Schmoll, Sukhbinder Singh, Matteo Rizzi, Román Orús

Published Jun 24, 2020• 36 citations
arXivHTMLPDF
DOI
10.1016/j.aop.2020.168232

Related papers

General framework for non-abelian symmetries in tensor networks

Andreas Weichselbaum

•Feb 25, 2012•0 citations

Tensor network states and algorithms in the presence of a global SU(2) symmetry

Sukhwinder Singh, Guifré Vidal

The benefits of exploiting the presence of symmetries in tensor network algorithms have been extensively demonstrated in the context of matrix product states (MPSs). These include the ability to select a specific symmetry sector (e.g., with a given particle number or spin), to ensure the exact preservation of total charge, and to significantly reduce computational costs. Compared to the case of a generic tensor network, the practical implementation of symmetries in the MPS is simplified by the fact that tensors only have three indices (they are trivalent, just as the Clebsch-Gordan coefficients of the symmetry group) and are organized as a one-dimensional array of tensors, without closed loops. Instead, a more complex tensor network, one where tensors have a larger number of indices and/or a more elaborate network structure, requires a more general treatment. In two recent papers, namely, (i) [Singh, Pfeifer, and Vidal, Phys. Rev. A 82, 050301 (2010)] and (ii) [Singh, Pfeifer, and Vidal, Phys. Rev. B 83, 115125 (2011)], we described how to incorporate a global internal symmetry into a generic tensor network algorithm based on decomposing and manipulating tensors that are invariant under the symmetry. In (i) we considered a generic symmetry group $\mathcal{G}$ that is compact, completely reducible, and multiplicity free, acting as a global internal symmetry. Then, in (ii) we described the implementation of Abelian group symmetries in much more detail, considering a U(1) symmetry (e.g., conservation of global particle number) as a concrete example. In this paper, we describe the implementation of non-Abelian group symmetries in great detail. For concreteness, we consider an SU(2) symmetry (e.g., conservation of global quantum spin). Our formalism can be readily extended to more exotic symmetries associated with conservation of total fermionic or anyonic charge. As a practical demonstration, we describe the SU(2)-invariant version of the multiscale entanglement renormalization ansatz and apply it to study the low-energy spectrum of a quantum spin chain with a global SU(2) symmetry.

arXiv:1208.3919•Physical Review B•Nov 9, 2012•114 citations

Benchmarking global SU(2) symmetry in two-dimensional tensor network algorithms

Philipp Schmoll, Román Orús

We implement and benchmark tensor network algorithms with $SU(2)$ symmetry for systems in two spatial dimensions and in the thermodynamic limit. Specifically, we implement $SU(2)$-invariant versions of the infinite projected entangled pair states and infinite projected entangled simplex states methods. Our implementation of $SU(2)$ symmetry follows the formalism based on fusion trees from Schmoll et al. [Ann. Phys. 419, 168232 (2020)]. In order to assess the utility of implementing $SU(2)$ symmetry, the algorithms are benchmarked for three models with different local spin: the spin-1 bilinear-biquadratic model on the square lattice, and the kagome Heisenberg antiferromagnets (KHAFs) for spin-$1/2$ and spin-2. We observe that the implementation of $SU(2)$ symmetry provides better energies in general than nonsymmetric simulations, with smooth scalings with respect to the number of parameters in the ansatz, and with the actual improvement depending on the specifics of the model. In particular, for the spin-2 KHAF model, our $SU(2)$ simulations are compatible with a quantum spin-liquid ground state.

arXiv:2005.02748•Physical review. B./Physical review. B•Dec 1, 2020•11 citations

Tensor Network Theory - Part 1: Overview of core library and tensor operations

Sarah Al-Assam, Stephen R. L. Clark, Dieter Jaksch

•Oct 7, 2016•3 citations

Computations in quantum tensor networks

Thomas Huckle, Konrad Waldherr, Thomas Schulte‐Herbrüggen

arXiv:1212.5005•Linear Algebra and its Applications•Jan 27, 2012•57 citations

Lattice and PT symmetries in tensor-network renormalization group: Case study of a hard-square lattice gas model

Xinliang Lyu

The tensor-network renormalization group (TNRG) is an accurate numerical real-space renormalization group method for studying phase transitions in both quantum and classical systems. Continuous phase transitions, as an important class of phase transitions, are usually accompanied by spontaneous breaking of various symmetries. However, the understanding of symmetries in the TNRG is well-established mainly for global on-site symmetries like U(1) and SU(2). In this paper, we demonstrate how to incorporate lattice symmetries (including reflection and rotation) and the PT symmetry in the TNRG in two dimensions (2D) through a case study of the hard-square lattice gas with nearest-neighbor exclusion. This model is chosen because it is well-understood and has two continuous phase transitions whose spontaneously-broken symmetries are lattice and PT symmetries. Specifically, we write down proper definitions of these symmetries in a coarse-grained tensor network and propose a TNRG scheme that incorporates these symmetries. We demonstrate the validity of the proposed method by estimating the critical parameters and the scaling dimensions of the two phase transitions of the model. The technical development in this paper has made the 2D TNRG a more well-rounded numerical method.

cond-mat.stat-mechCross-listedarXiv:2603.25492•Physical review. B./Physical review. B•Mar 27, 2026•0 citations
The benefits of exploiting the presence of symmetries in tensor network algorithms have been extensively demonstrated in the context of matrix product states (MPSs). These include the ability to select a specific symmetry sector (e.g., with a given particle number or spin), to ensure the exact preservation of total charge, and to significantly reduce computational costs. Compared to the case of a generic tensor network, the practical implementation of symmetries in the MPS is simplified by the fact that tensors only have three indices (they are trivalent, just as the Clebsch-Gordan coefficients of the symmetry group) and are organized as a one-dimensional array of tensors, without closed loops. Instead, a more complex tensor network, one where tensors have a larger number of indices and/or a more elaborate network structure, requires a more general treatment. In two recent papers, namely, (i) [Singh, Pfeifer, and Vidal, Phys. Rev. A 82, 050301 (2010)] and (ii) [Singh, Pfeifer, and Vidal, Phys. Rev. B 83, 115125 (2011)], we described how to incorporate a global internal symmetry into a generic tensor network algorithm based on decomposing and manipulating tensors that are invariant under the symmetry. In (i) we considered a generic symmetry group G\mathcal{G}G that is compact, completely reducible, and multiplicity free, acting as a global internal symmetry. Then, in (ii) we described the implementation of Abelian group symmetries in much more detail, considering a U(1) symmetry (e.g., conservation of global particle number) as a concrete example. In this paper, we describe the implementation of non-Abelian group symmetries in great detail. For concreteness, we consider an SU(2) symmetry (e.g., conservation of global quantum spin). Our formalism can be readily extended to more exotic symmetries associated with conservation of total fermionic or anyonic charge. As a practical demonstration, we describe the SU(2)-invariant version of the multiscale entanglement renormalization ansatz and apply it to study the low-energy spectrum of a quantum spin chain with a global SU(2) symmetry.
We implement and benchmark tensor network algorithms with SU(2)SU(2)SU(2) symmetry for systems in two spatial dimensions and in the thermodynamic limit. Specifically, we implement SU(2)SU(2)SU(2)-invariant versions of the infinite projected entangled pair states and infinite projected entangled simplex states methods. Our implementation of SU(2)SU(2)SU(2) symmetry follows the formalism based on fusion trees from Schmoll et al. [Ann. Phys. 419, 168232 (2020)]. In order to assess the utility of implementing SU(2)SU(2)SU(2) symmetry, the algorithms are benchmarked for three models with different local spin: the spin-1 bilinear-biquadratic model on the square lattice, and the kagome Heisenberg antiferromagnets (KHAFs) for spin-1/21/21/2 and spin-2. We observe that the implementation of SU(2)SU(2)SU(2) symmetry provides better energies in general than nonsymmetric simulations, with smooth scalings with respect to the number of parameters in the ansatz, and with the actual improvement depending on the specifics of the model. In particular, for the spin-2 KHAF model, our SU(2)SU(2)SU(2) simulations are compatible with a quantum spin-liquid ground state.
The tensor-network renormalization group (TNRG) is an accurate numerical real-space renormalization group method for studying phase transitions in both quantum and classical systems. Continuous phase transitions, as an important class of phase transitions, are usually accompanied by spontaneous breaking of various symmetries. However, the understanding of symmetries in the TNRG is well-established mainly for global on-site symmetries like U(1) and SU(2). In this paper, we demonstrate how to incorporate lattice symmetries (including reflection and rotation) and the PT symmetry in the TNRG in two dimensions (2D) through a case study of the hard-square lattice gas with nearest-neighbor exclusion. This model is chosen because it is well-understood and has two continuous phase transitions whose spontaneously-broken symmetries are lattice and PT symmetries. Specifically, we write down proper definitions of these symmetries in a coarse-grained tensor network and propose a TNRG scheme that incorporates these symmetries. We demonstrate the validity of the proposed method by estimating the critical parameters and the scaling dimensions of the two phase transitions of the model. The technical development in this paper has made the 2D TNRG a more well-rounded numerical method.