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:2001.00123

Accuracy and Efficiency of Simplified Tensor Network Codes

David O. Yevick, Jesse Thompson

Published Jan 1, 2020• 3 citations
arXivHTMLPDF

Abstract

We examine in detail the accuracy, efficiency and implementation issues that arise when a simplified code structure is employed to evaluate the partition function of the two-dimensional square Ising model on periodic lattices though repeated tensor contractions.
DOI
10.48550/arxiv.2001.00123

Related papers

Automatic contraction of unstructured tensor networks

Adam Jermyn

The evaluation of partition functions is a central problem in statistical physics. For lattice systems and other discrete models the partition function may be expressed as the contraction of a tensor network. Unfortunately computing such contractions is difficult, and many methods to make this tractable require periodic or otherwise structured networks. Here I present a new algorithm for contracting unstructured tensor networks. This method makes no assumptions about the structure of the network and performs well in both structured and unstructured cases so long as the correlation structure is local.

arXiv:1709.03080•SciPost Physics•Jan 15, 2020•11 citations

Tensor Network Monte Carlo for Quantum Lattice Models

William J. Huggins, Edwin Miles Stoudenmire, Norm M. Tubman +2 more

Bulletin of the American Physical Society•Mar 14, 2017•0 citations

Matrix product state fixed points of non-Hermitian transfer matrices

Wei Tang, Frank Verstraete, Jutho Haegeman

The contraction of tensor networks is a central task in the application of tensor network methods to the study of quantum and classical many-body systems. In this paper, we investigate the impact of gauge degrees of freedom in the virtual indices of the tensor network on the contraction process, specifically focusing on boundary matrix product state methods for contracting two-dimensional tensor networks. We show that the gauge transformation can affect the entanglement structures of the eigenstates of the transfer matrix and change how the physical information is encoded in the eigenstates, which can influence the accuracy of the numerical simulation. We demonstrate this effect by looking at two different examples. First, we focus on the local gauge transformation, and analyze its effect by viewing it as an imaginary-time evolution governed by a diagonal Hamiltonian. As a specific example, we perform a numerical analysis in the classical Ising model on the square lattice. Second, we go beyond the scope of local gauge transformations and study the antiferromagnetic Ising model on the triangular lattice. The partition function of this model has two tensor network representations connected by a nonlocal gauge transformation, resulting in distinct numerical performances in the boundary matrix product state calculation.

arXiv:2311.18733•Physical review. B./Physical review. B•Jan 3, 2025•11 citations

Contracting Tensor Networks with Generalized Belief Propagation

Joseph Tindall, Grace M. Sommers, Hilbert Kappen

Recent years have seen a growing interest in the use of belief propagation - an algorithm originally introduced for performing statistical inference on graphical models - for approximate, but highly efficient, tensor network contraction. Here, we detail how to apply generalized belief propagation (GBP) - where messages are passed within a hierarchy of overlapping regions of the tensor network - to approximately contract tensor networks and obtain accurate results. The original belief propagation algorithm is a corner case of this approach, corresponding to a particularly simple choice of regions of the tensor network. We implement the GBP algorithm for a number of different region choices on a range of two- and three-dimensional, infinite and finite tensor networks, solving the corresponding fixed point equations both numerically and, in certain tractable cases, analytically. Our examples include calculating the partition function of the fully frustrated Ising model, computing the ground state degeneracy of three-dimensional ice models, measuring observables on the deformed AKLT quantum state and evaluating the norm of randomly generated tensor network states.

quant-pharXiv:2604.24760•Apr 28, 2026•0 citations

Simulation of fermionic and frustrated lattice models in two dimensions with tensor network algorithms

Philippe Corboz, Glen Evenbly, Jacob Jordan +6 more

Bulletin of the American Physical Society•Mar 23, 2011•0 citations

Numerical Study of Spin-1/2 XXZ Model on Square Lattice from Tensor Product States(New Development of Numerical Simulations in Low-Dimensional Quantum Systems: From Density Matrix Renormalization Group to Tensor Network Formulations)

Pochung Chen, Chen-Yen Lai, Min-Fong Yang

物性研究•Mar 5, 2011•0 citations
The evaluation of partition functions is a central problem in statistical physics. For lattice systems and other discrete models the partition function may be expressed as the contraction of a tensor network. Unfortunately computing such contractions is difficult, and many methods to make this tractable require periodic or otherwise structured networks. Here I present a new algorithm for contracting unstructured tensor networks. This method makes no assumptions about the structure of the network and performs well in both structured and unstructured cases so long as the correlation structure is local.
The contraction of tensor networks is a central task in the application of tensor network methods to the study of quantum and classical many-body systems. In this paper, we investigate the impact of gauge degrees of freedom in the virtual indices of the tensor network on the contraction process, specifically focusing on boundary matrix product state methods for contracting two-dimensional tensor networks. We show that the gauge transformation can affect the entanglement structures of the eigenstates of the transfer matrix and change how the physical information is encoded in the eigenstates, which can influence the accuracy of the numerical simulation. We demonstrate this effect by looking at two different examples. First, we focus on the local gauge transformation, and analyze its effect by viewing it as an imaginary-time evolution governed by a diagonal Hamiltonian. As a specific example, we perform a numerical analysis in the classical Ising model on the square lattice. Second, we go beyond the scope of local gauge transformations and study the antiferromagnetic Ising model on the triangular lattice. The partition function of this model has two tensor network representations connected by a nonlocal gauge transformation, resulting in distinct numerical performances in the boundary matrix product state calculation.
Recent years have seen a growing interest in the use of belief propagation - an algorithm originally introduced for performing statistical inference on graphical models - for approximate, but highly efficient, tensor network contraction. Here, we detail how to apply generalized belief propagation (GBP) - where messages are passed within a hierarchy of overlapping regions of the tensor network - to approximately contract tensor networks and obtain accurate results. The original belief propagation algorithm is a corner case of this approach, corresponding to a particularly simple choice of regions of the tensor network. We implement the GBP algorithm for a number of different region choices on a range of two- and three-dimensional, infinite and finite tensor networks, solving the corresponding fixed point equations both numerically and, in certain tractable cases, analytically. Our examples include calculating the partition function of the fully frustrated Ising model, computing the ground state degeneracy of three-dimensional ice models, measuring observables on the deformed AKLT quantum state and evaluating the norm of randomly generated tensor network states.