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:2005.02748 · Physical review. B./Physical review. B

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

Philipp Schmoll, Román Orús

Published Dec 1, 2020• 11 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physrevb.102.241101

Related papers

Universal tensor-network algorithm for any infinite lattice

Saeed S. Jahromi, Román Orús

We present a general graph-based projected entangled-pair state (gPEPS) algorithm to approximate ground states of nearest-neighbor local Hamiltonians on any lattice or graph of infinite size. By introducing the structural matrix, which codifies the details of tensor networks on any graphs in any dimension $d$, we are able to produce a code that can be essentially launched to simulate any lattice. We further introduce an optimized algorithm to compute simple tensor updates as well as expectation values and correlators with a mean-field-like effective environments. Though not being variational, this strategy allows to cope with PEPS of very large bond dimension (e.g., $D=100$) and produces remarkably accurate results in the thermodynamic limit in many situations, and specially when the correlation length is small and the connectivity of the lattice is large. We prove the validity of our approach by benchmarking the algorithm against known results for several models, i.e., the antiferromagnetic Heisenberg model on a chain, star and cubic lattices, the hardcore Bose-Hubbard model on square lattice, the ferromagnetic Heisenberg model in a field on the pyrochlore lattice, as well as the three-state quantum Potts model in field on the kagome lattice and the spin-1 bilinear-biquadratic Heisenberg model on the triangular lattice. We further demonstrate the performance of gPEPS by studying the quantum phase transition of the $2d$ quantum Ising model in transverse magnetic field on the square lattice, and the phase diagram of the Kitaev-Heisenberg model on the hyperhoneycomb lattice. Our results are in excellent agreement with previous studies.

arXiv:1808.00680•Physical review. B./Physical review. B•May 3, 2019•38 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

Tensor Network Annealing Algorithm for Two-Dimensional Thermal States

Augustine Kshetrimayum, Matteo Rizzi, Jens Eisert +1 more

Tensor network methods have become a powerful class of tools to capture strongly correlated matter, but methods to capture the experimentally ubiquitous family of models at finite temperature beyond one spatial dimension are largely lacking. We introduce a tensor network algorithm able to simulate thermal states of two-dimensional quantum lattice systems in the thermodynamic limit. The method develops instances of projected entangled pair states and projected entangled pair operators for this purpose. It is the key feature of this algorithm to resemble the cooling down of the system from an infinite temperature state until it reaches the desired finite-temperature regime. As a benchmark, we study the finite-temperature phase transition of the Ising model on an infinite square lattice, for which we obtain remarkable agreement with the exact solution. We then turn to study the finite-temperature Bose-Hubbard model in the limits of two (hard-core) and three bosonic modes per site. Our technique can be used to support the experimental study of actual effectively two-dimensional materials in the laboratory, as well as to benchmark optical lattice quantum simulators with ultracold atoms.

arXiv:1809.08258•Physical Review Letters•Feb 22, 2019•84 citations

Tensor-Network Simulation of Quantum Spin Systems with Bond-Dependent Interactions

Richards, Addison

The efficient simulation of a quantum many-body system is often incredibly difficult due to the exponential scaling of the Hilbert space with increasing number of interacting particles. In practice, it is only possible to exactly simulate small clusters. In many cases, tensor-network-based methods are capable of overcoming this challenge, providing reliable simulations of much larger or even infinite-sized systems through a low-rank factorization of the state coefficients. Tensor operations are typically highly parallelizable, and therefore capable of utilizing the high performance of modern general-purpose graphics processing units (GPU). A particular tensor-network ansatz called infinite projected-entangled pair states (iPEPS) may be used to simulate infinite two-dimensional lattice systems, and are the primary subject of this thesis. As part of this work, a GPU-based open-source software library called Ace-TN was developed to accelerate iPEPS calculations. Benchmarks are presented showing efficient single- and muli-gpu execution of the core iPEPS simulation techniques. iPEPS simulations are performed for quantum spin systems with bond directional interactions, referred to as quantum compass models (QCM) or Kitaev models depending on pre-established naming conventions. The QCM defined on square and kagome lattices are considered with the addition of an external magnetic field. Each system possesses one-dimensional gauge-like symmetries in zero field, relating subextensively-many ground states that are capable of being represented by iPEPS. These states are shown to be metastable in non-zero field through adiabatic evolution from the zero-field ground state, each separated by a small energy gap. Several field-dependent phases and phase transitions are found in each system. Prominent nematic phases are found in both the square- and kagome-lattice systems. The square-lattice system contains a field value that admits an exact solution of the ground state which is characteristic of the surrounding phase. The inclusion of isotropic Heisenberg coupling to the kagome-lattice system is also explored, which produces a frustrated parameter regime between two dual quantum spin-liquid phases.

•Jan 1, 2025•0 citations

Implementing global Abelian symmetries in projected entangled-pair state algorithms

Bela Bauer, Philippe Corboz, Román Orús +1 more

Due to the unfavorable scaling of tensor-network methods with the refinement parameter $M$, new approaches are necessary to improve the efficiency of numerical simulations based on such states, in particular for gapless, strongly entangled systems. In one-dimensional density matrix renormalization group methods, the use of Abelian symmetries has led to large computational gain. In higher-dimensional tensor networks, this is associated with significant technical efforts and additional approximations. We explain a formalism to implement such symmetries in two-dimensional tensor-network states and present benchmark results that confirm the validity of these approximations in the context of projected entangled-pair state algorithms.

arXiv:1010.3595•Physical Review B•Mar 18, 2011•126 citations

Finite temperature tensor network algorithm for frustrated two-dimensional quantum materials

Philipp Schmoll, Christian Balz, B. Lake +2 more

Aimed at a more realistic classical description of natural quantum systems, we present a two-dimensional tensor network algorithm to study finite temperature properties of frustrated model quantum systems and real quantum materials. For this purpose, we introduce the infinite projected entangled simplex operator ansatz to study thermodynamic properties. To obtain state-of-the-art benchmarking results, we explore the highly challenging spin-1/2 Heisenberg antiferromagnet on the Kagome lattice, a system for which we investigate the melting of the magnetization plateaus at finite magnetic field and temperature. Making a close connection to actual experimental data of real quantum materials, we go on to studying the finite temperature properties of ${\mathrm{Ca}}_{10}{\mathrm{Cr}}_{7}{\mathrm{O}}_{28}$. We compare the magnetization curve of this material in the presence of an external magnetic field at finite temperature with classically simulated data. As the first theoretical tool that incorporates both thermal fluctuations as well as quantum correlations in the study of this material, our work contributes to settling the existing controversy between the experimental data and previous theoretical works on the magnetization process.

Physical review. B./Physical review. B•Jun 10, 2024•3 citations
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.
We present a general graph-based projected entangled-pair state (gPEPS) algorithm to approximate ground states of nearest-neighbor local Hamiltonians on any lattice or graph of infinite size. By introducing the structural matrix, which codifies the details of tensor networks on any graphs in any dimension ddd, we are able to produce a code that can be essentially launched to simulate any lattice. We further introduce an optimized algorithm to compute simple tensor updates as well as expectation values and correlators with a mean-field-like effective environments. Though not being variational, this strategy allows to cope with PEPS of very large bond dimension (e.g., D=100D=100D=100) and produces remarkably accurate results in the thermodynamic limit in many situations, and specially when the correlation length is small and the connectivity of the lattice is large. We prove the validity of our approach by benchmarking the algorithm against known results for several models, i.e., the antiferromagnetic Heisenberg model on a chain, star and cubic lattices, the hardcore Bose-Hubbard model on square lattice, the ferromagnetic Heisenberg model in a field on the pyrochlore lattice, as well as the three-state quantum Potts model in field on the kagome lattice and the spin-1 bilinear-biquadratic Heisenberg model on the triangular lattice. We further demonstrate the performance of gPEPS by studying the quantum phase transition of the 2d2d2d quantum Ising model in transverse magnetic field on the square lattice, and the phase diagram of the Kitaev-Heisenberg model on the hyperhoneycomb lattice. Our results are in excellent agreement with previous studies.
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.
Tensor network methods have become a powerful class of tools to capture strongly correlated matter, but methods to capture the experimentally ubiquitous family of models at finite temperature beyond one spatial dimension are largely lacking. We introduce a tensor network algorithm able to simulate thermal states of two-dimensional quantum lattice systems in the thermodynamic limit. The method develops instances of projected entangled pair states and projected entangled pair operators for this purpose. It is the key feature of this algorithm to resemble the cooling down of the system from an infinite temperature state until it reaches the desired finite-temperature regime. As a benchmark, we study the finite-temperature phase transition of the Ising model on an infinite square lattice, for which we obtain remarkable agreement with the exact solution. We then turn to study the finite-temperature Bose-Hubbard model in the limits of two (hard-core) and three bosonic modes per site. Our technique can be used to support the experimental study of actual effectively two-dimensional materials in the laboratory, as well as to benchmark optical lattice quantum simulators with ultracold atoms.
The efficient simulation of a quantum many-body system is often incredibly difficult due to the exponential scaling of the Hilbert space with increasing number of interacting particles. In practice, it is only possible to exactly simulate small clusters. In many cases, tensor-network-based methods are capable of overcoming this challenge, providing reliable simulations of much larger or even infinite-sized systems through a low-rank factorization of the state coefficients. Tensor operations are typically highly parallelizable, and therefore capable of utilizing the high performance of modern general-purpose graphics processing units (GPU). A particular tensor-network ansatz called infinite projected-entangled pair states (iPEPS) may be used to simulate infinite two-dimensional lattice systems, and are the primary subject of this thesis. As part of this work, a GPU-based open-source software library called Ace-TN was developed to accelerate iPEPS calculations. Benchmarks are presented showing efficient single- and muli-gpu execution of the core iPEPS simulation techniques. iPEPS simulations are performed for quantum spin systems with bond directional interactions, referred to as quantum compass models (QCM) or Kitaev models depending on pre-established naming conventions. The QCM defined on square and kagome lattices are considered with the addition of an external magnetic field. Each system possesses one-dimensional gauge-like symmetries in zero field, relating subextensively-many ground states that are capable of being represented by iPEPS. These states are shown to be metastable in non-zero field through adiabatic evolution from the zero-field ground state, each separated by a small energy gap. Several field-dependent phases and phase transitions are found in each system. Prominent nematic phases are found in both the square- and kagome-lattice systems. The square-lattice system contains a field value that admits an exact solution of the ground state which is characteristic of the surrounding phase. The inclusion of isotropic Heisenberg coupling to the kagome-lattice system is also explored, which produces a frustrated parameter regime between two dual quantum spin-liquid phases.
Due to the unfavorable scaling of tensor-network methods with the refinement parameter MMM, new approaches are necessary to improve the efficiency of numerical simulations based on such states, in particular for gapless, strongly entangled systems. In one-dimensional density matrix renormalization group methods, the use of Abelian symmetries has led to large computational gain. In higher-dimensional tensor networks, this is associated with significant technical efforts and additional approximations. We explain a formalism to implement such symmetries in two-dimensional tensor-network states and present benchmark results that confirm the validity of these approximations in the context of projected entangled-pair state algorithms.
Aimed at a more realistic classical description of natural quantum systems, we present a two-dimensional tensor network algorithm to study finite temperature properties of frustrated model quantum systems and real quantum materials. For this purpose, we introduce the infinite projected entangled simplex operator ansatz to study thermodynamic properties. To obtain state-of-the-art benchmarking results, we explore the highly challenging spin-1/2 Heisenberg antiferromagnet on the Kagome lattice, a system for which we investigate the melting of the magnetization plateaus at finite magnetic field and temperature. Making a close connection to actual experimental data of real quantum materials, we go on to studying the finite temperature properties of Ca10Cr7O28{\mathrm{Ca}}_{10}{\mathrm{Cr}}_{7}{\mathrm{O}}_{28}Ca10​Cr7​O28​. We compare the magnetization curve of this material in the presence of an external magnetic field at finite temperature with classically simulated data. As the first theoretical tool that incorporates both thermal fluctuations as well as quantum correlations in the study of this material, our work contributes to settling the existing controversy between the experimental data and previous theoretical works on the magnetization process.