scholarly journals Automatic contraction of unstructured tensor networks

2020 ◽  
Vol 8 (1) ◽  
Author(s):  
Adam Jermyn
Keyword(s):  
Partition Function ◽  
Statistical Physics ◽  
Discrete Models ◽  
Correlation Structure ◽  
Central Problem ◽  
Partition Functions ◽  
Lattice Systems ◽  
Tensor Networks ◽  
Tensor Network

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.

scholarly journals The Tensor Networks Anthology: Simulation techniques for many-body quantum lattice systems

2019 ◽  
Author(s):  
Pietro Silvi ◽  
Ferdinand Tschirsich ◽  
Matthias Gerster ◽  
Johannes Jünemann ◽  
Daniel Jaschke ◽  
...  
Keyword(s):  
Data Structures ◽  
Finite Size ◽  
Many Body ◽  
Lattice Systems ◽  
Arbitrary Boundary ◽  
The Core ◽  
Simulation Techniques ◽  
Tensor Networks ◽  
Tensor Network ◽  
Network Methods

We present a compendium of numerical simulation techniques, based on tensor network methods, aiming to address problems of many-body quantum mechanics on a classical computer. The core setting of this anthology are lattice problems in low spatial dimension at finite size, a physical scenario where tensor network methods, both Density Matrix Renormalization Group and beyond, have long proven to be winning strategies. Here we explore in detail the numerical frameworks and methods employed to deal with low-dimensional physical setups, from a computational physics perspective. We focus on symmetries and closed-system simulations in arbitrary boundary conditions, while discussing the numerical data structures and linear algebra manipulation routines involved, which form the core libraries of any tensor network code. At a higher level, we put the spotlight on loop-free network geometries, discussing their advantages, and presenting in detail algorithms to simulate low-energy equilibrium states. Accompanied by discussions of data structures, numerical techniques and performance, this anthology serves as a programmer’s companion, as well as a self-contained introduction and review of the basic and selected advanced concepts in tensor networks, including examples of their applications.

scholarly journals Free partition functions and an averaged holographic duality

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Nima Afkhami-Jeddi ◽  
Henry Cohn ◽  
Thomas Hartman ◽  
Amirhossein Tajdini
Keyword(s):  
Partition Function ◽  
Spectral Gap ◽  
Central Charge ◽  
Three Dimensional ◽  
Two Dimensions ◽  
Three Dimensions ◽  
Partition Functions ◽  
General Constraints ◽  
Dimensional Gravity ◽  
Holographic Duality

Abstract We study the torus partition functions of free bosonic CFTs in two dimensions. Integrating over Narain moduli defines an ensemble-averaged free CFT. We calculate the averaged partition function and show that it can be reinterpreted as a sum over topologies in three dimensions. This result leads us to conjecture that an averaged free CFT in two dimensions is holographically dual to an exotic theory of three-dimensional gravity with U(1)c×U(1)c symmetry and a composite boundary graviton. Additionally, for small central charge c, we obtain general constraints on the spectral gap of free CFTs using the spinning modular bootstrap, construct examples of Narain compactifications with a large gap, and find an analytic bootstrap functional corresponding to a single self-dual boson.

scholarly journals Gauge theories on compact toric manifolds

2021 ◽  
Vol 111 (3) ◽  
Author(s):  
Giulio Bonelli ◽  
Francesco Fucito ◽  
Jose Francisco Morales ◽  
Massimiliano Ronzani ◽  
Ekaterina Sysoeva ◽  
...  
Keyword(s):  
Partition Function ◽  
Gauge Theories ◽  
Blow Up ◽  
Gauge Coupling ◽  
Piecewise Constant Function ◽  
Partition Functions ◽  
Piecewise Constant ◽  
Toric Manifolds ◽  
Holomorphic Anomaly ◽  
The One

AbstractWe compute the $$\mathcal{N}=2$$ N = 2 supersymmetric partition function of a gauge theory on a four-dimensional compact toric manifold via equivariant localization. The result is given by a piecewise constant function of the Kähler form with jumps along the walls where the gauge symmetry gets enhanced. The partition function on such manifolds is written as a sum over the residues of a product of partition functions on $$\mathbb {C}^2$$ C 2 . The evaluation of these residues is greatly simplified by using an “abstruse duality” that relates the residues at the poles of the one-loop and instanton parts of the $$\mathbb {C}^2$$ C 2 partition function. As particular cases, our formulae compute the SU(2) and SU(3) equivariant Donaldson invariants of $$\mathbb {P}^2$$ P 2 and $$\mathbb {F}_n$$ F n and in the non-equivariant limit reproduce the results obtained via wall-crossing and blow up methods in the SU(2) case. Finally, we show that the U(1) self-dual connections induce an anomalous dependence on the gauge coupling, which turns out to satisfy a $$\mathcal {N}=2$$ N = 2 analog of the $$\mathcal {N}=4$$ N = 4 holomorphic anomaly equations.

scholarly journals Modular invariance in finite temperature Casimir effect

2020 ◽  
Vol 2020 (10) ◽  
Author(s):  
Francesco Alessio ◽  
Glenn Barnich
Keyword(s):  
Partition Function ◽  
Chemical Potential ◽  
Casimir Effect ◽  
Temperature Inversion ◽  
Massless Scalar ◽  
Partition Functions ◽  
Parallel Plates ◽  
Modular Transformations ◽  
Real Analytic ◽  
Set Up

Abstract The temperature inversion symmetry of the partition function of the electromagnetic field in the set-up of the Casimir effect is extended to full modular transformations by turning on a purely imaginary chemical potential for adapted spin angular momentum. The extended partition function is expressed in terms of a real analytic Eisenstein series. These results become transparent after explicitly showing equivalence of the partition functions for Maxwell’s theory between perfectly conducting parallel plates and for a massless scalar with periodic boundary conditions.

A COMPACT BOSON COUPLED TO TWO-DIMENSIONAL GRAVITY

1991 ◽  
Vol 06 (15) ◽  
pp. 2743-2754 ◽  
Author(s):  
NORISUKE SAKAI ◽  
YOSHIAKI TANII
Keyword(s):  
Field Theory ◽  
Partition Function ◽  
Quantum Gravity ◽  
Matrix Models ◽  
Riemann Surfaces ◽  
Partition Functions ◽  
Two Dimensional ◽  
Dimensional Gravity ◽  
The Continuum ◽  
Continuum Field

The radius dependence of partition functions is explicitly evaluated in the continuum field theory of a compactified boson, interacting with two-dimensional quantum gravity (noncritical string) on Riemann surfaces for the first few genera. The partition function for the torus is found to be a sum of terms proportional to R and 1/R. This is in agreement with the result of a discretized version (matrix models), but is quite different from the critical string. The supersymmetric case is also explicitly evaluated.

Asymptotic expansion of the logarithm of the partition function in spin lattice systems that possess a vacuum

1989 ◽  
Vol 81 (2) ◽  
pp. 1134-1141 ◽  
Author(s):  
V. A. Arzumanyan ◽  
B. S. Nakhapetyan ◽  
S. K. Pogosyan
Keyword(s):  
Asymptotic Expansion ◽  
Partition Function ◽  
Lattice Systems ◽  
Spin Lattice

scholarly journals Hyper-optimized tensor network contraction

Quantum ◽  
2021 ◽  
Vol 5 ◽  
pp. 410
Author(s):  
Johnnie Gray ◽  
Stefanos Kourtis
Keyword(s):  
Computation Time ◽  
Quantum Circuit ◽  
Optimization Approach ◽  
Many Body ◽  
Tensor Networks ◽  
Randomized Protocols ◽  
Classical Simulation ◽  
Tensor Network ◽  
Speed Up ◽  
Many Body Systems

Tensor networks represent the state-of-the-art in computational methods across many disciplines, including the classical simulation of quantum many-body systems and quantum circuits. Several applications of current interest give rise to tensor networks with irregular geometries. Finding the best possible contraction path for such networks is a central problem, with an exponential effect on computation time and memory footprint. In this work, we implement new randomized protocols that find very high quality contraction paths for arbitrary and large tensor networks. We test our methods on a variety of benchmarks, including the random quantum circuit instances recently implemented on Google quantum chips. We find that the paths obtained can be very close to optimal, and often many orders or magnitude better than the most established approaches. As different underlying geometries suit different methods, we also introduce a hyper-optimization approach, where both the method applied and its algorithmic parameters are tuned during the path finding. The increase in quality of contraction schemes found has significant practical implications for the simulation of quantum many-body systems and particularly for the benchmarking of new quantum chips. Concretely, we estimate a speed-up of over 10,000× compared to the original expectation for the classical simulation of the Sycamore `supremacy' circuits.

scholarly journals Algorithms for Estimating the Partition Function of Restricted Boltzmann Machines (Extended Abstract)

2020 ◽  
Author(s):  
Oswin Krause ◽  
Asja Fischer ◽  
Christian Igel
Keyword(s):  
Partition Function ◽  
Markov Random Fields ◽  
Probabilistic Models ◽  
Ratio Method ◽  
Parallel Tempering ◽  
Partition Functions ◽  
Path Sampling ◽  
Reference Distribution ◽  
Restricted Boltzmann Machines ◽  
Boltzmann Machines

Estimating the normalization constants (partition functions) of energy-based probabilistic models (Markov random fields) with a high accuracy is required for measuring performance, monitoring the training progress of adaptive models, and conducting likelihood ratio tests. We devised a unifying theoretical framework for algorithms for estimating the partition function, including Annealed Importance Sampling (AIS) and Bennett's Acceptance Ratio method (BAR). The unification reveals conceptual similarities of and differences between different approaches and suggests new algorithms. The framework is based on a generalized form of Crooks' equality, which links the expectation over a distribution of samples generated by a transition operator to the expectation over the distribution induced by the reversed operator. Different ways of sampling, such as parallel tempering and path sampling, are covered by the framework. We performed experiments in which we estimated the partition function of restricted Boltzmann machines (RBMs) and Ising models. We found that BAR using parallel tempering worked well with a small number of bridging distributions, while path sampling based AIS performed best with many bridging distributions. The normalization constant is measured w.r.t.~a reference distribution, and the choice of this distribution turned out to be very important in our experiments. Overall, BAR gave the best empirical results, outperforming AIS.

scholarly journals MODIFIED PARTITION FUNCTIONS, CONSISTENT ANOMALIES AND CONSISTENT SCHWINGER TERMS

2011 ◽  
Vol 08 (08) ◽  
pp. 1747-1762 ◽  
Author(s):  
AMIR ABBASS VARSHOVI
Keyword(s):  
Partition Function ◽  
Gauge Theories ◽  
Partition Functions ◽  
Gauge Invariant

A gauge invariant partition function is defined for gauge theories which leads to the standard quantization. It is shown that the descent equations and consequently the consistent anomalies and Schwinger terms can be extracted from this modified partition function naturally.

Sign in / Sign up

Export Citation Format

Share Document