We define a class of tensor network states for spin systems where the individual tensors are functionals of fields. The construction is based on the path integral representation of correlators of operators in quantum field theory. These tensor network states are infinite dimensional versions of matrix product states and projected entangled pair states. We find the field-tensor that generates the Haldane-Shastry wave function and extend it to two dimensions. We give evidence that the latter underlies the topological chiral state described by the Kalmeyer-Laughlin wave function.
In the tensor-network framework, the expectation values of two-dimensional quantum states are evaluated by contracting a double-layer tensor network constructed from initial and final tensor-network states. The computational cost of carrying out this contraction is generally very high, which limits the largest bond dimension of tensor-network states that can be accurately studied to a relatively small value. We propose an optimized contraction scheme to solve this problem by mapping the double-layer tensor network onto an intersected single-layer tensor network. This reduces greatly the bond d…
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 mo…
We discuss the variational optimization of a unitary tensor-network circuit with different network structures. The ansatz is performed based on a generalization of well-developed multi-scale entanglement renormalization algorithm and also the conjugate-gradient method with an effective line search. We present the benchmarking calculations for different network structures by studying the Heisenberg model in a strongly disordered magnetic field and a tensor-network $QR$-decomposition.
Techniques for approximately contracting tensor networks are limited in how efficiently they can make use of parallel computing resources. In this work we demonstrate and characterize a Monte Carlo approach to the tensor network renormalization group method which can be used straightforwardly on modern computing architectures. We demonstrate the efficiency of the technique and show that Monte Carlo tensor network renormalization provides an attractive path to improving the accuracy of a wide class of challenging computations while also providing useful estimates of uncertainty and a statistica…
We introduce a tensor renormalization group scheme for coarse-graining a two-dimensional tensor network that can be successfully applied to both classical and quantum systems on and off criticality. The key innovation in our scheme is to deform a 2D tensor network into small loops and then optimize the tensors on each loop. In this way, we remove short-range entanglement at each iteration step and significantly improve the accuracy and stability of the renormalization flow. We demonstrate our algorithm in the classical Ising model and a frustrated 2D quantum model.
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…
We have discussed the tensor-network representation of classical statistical or interacting quantum lattice models, and given a comprehensive introduction to the numerical methods we recently proposed for studying the tensor-network states/models in two dimensions. A second renormalization scheme is introduced to take into account the environment contribution in the calculation of the partition function of classical tensor network models or the expectation values of quantum tensor network states. It improves significantly the accuracy of the coarse grained tensor renormalization group method. …
We introduce a scheme to perform Monte Carlo Renormalization Group with the coupling constants of the system Hamiltonian encoded in a tensor network. With this scheme we compute the tangent space to the manifold of the critical Hamiltonians representable by a tensor network at the nearest-neighbor critical coupling for three models: the two and three dimensional Ising models and the two dimensional three-state Potts model.
We discuss a renormalization procedure for random tensor networks, and show that the corresponding renormalization-group flow is given by the Hamiltonian vector flow of the canonical tensor model, which is a discretized model of quantum gravity. The result is the generalization of the previous one concerning the relation between the Ising model on random networks and the canonical tensor model with N=2. We also prove a general theorem which relates discontinuity of the renormalization-group flow and the phase transitions of random tensor networks.
A tensor network formalism of thermofield dynamics is introduced. The formalism relates the original Hilbert space with its tilde space by a product of two copies of a tensor network. Then, their interface becomes an event horizon, and the logarithm of the tensor rank corresponds to the black hole entropy. Eventually, multiscale entanglement renormalization anzats (MERA) reproduces an AdS black hole at finite temperature. Our finding shows rich functionalities of MERA as efficient graphical representation of AdS/CFT correspondence.
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.
A new unbiased Monte Carlo technique called Tensor Network Monte Carlo (TNMC) is introduced based on sampling all possible renormalizations (or course-grainings) of tensor networks, in this case matrix-product states. Tensor networks are a natural language for expressing a wide range of discrete physical and statistical problems, such as classical and quantum systems on a lattice at thermal equilibrium. By simultaneously sampling multiple degrees of freedom associated with each bond of the tensor network (and its renormalized form), we can achieve unprecedented low levels of statistical fluctu…
We introduce tensor network contraction algorithms for the evaluation of the Jones polynomial of arbitrary knots. The value of the Jones polynomial of a knot maps to the partition function of a $q$-state Potts model defined as a planar graph with weighted edges that corresponds to the knot. For any integer $q$, we cast this partition function into tensor network form and employ fast tensor network contraction protocols to obtain the exact tensor trace, and thus the value of the Jones polynomial. By sampling random knots via a grid-walk procedure and computing the full tensor trace, we demonstr…
In many cases, Neural networks can be mapped into tensor networks with an exponentially large bond dimension. Here, we compare different sub-classes of neural network states, with their mapped tensor network counterpart for studying the ground state of short-range Hamiltonians. We show that when mapping a neural network, the resulting tensor network is highly constrained and thus the neural network states do in general not deliver the naive expected drastic improvement against the state-of-the-art tensor network methods. We explicitly show this result in two paradigmatic examples, the 1D ferro…
A renormalization group flow of Hamiltonians for two-dimensional classical partition functions is constructed using tensor networks. Similar to tensor network renormalization ([G. Evenbly and G. Vidal, Phys. Rev. Lett. 115, 180405 (2015)], [S. Yang, Z.-C. Gu, and X.-G Wen, Phys. Rev. Lett. 118, 110504 (2017)]) we obtain approximate fixed point tensor networks at criticality. Our formalism however preserves positivity of the tensors at every step and hence yields an interpretation in terms of Hamiltonian flows. We emphasize that the key difference between tensor network approaches and Kadanoff'…
We construct a tensor network that delivers an unnormalized quantum state whose coefficients are the solutions to a given instance of 3SAT, an NP-complete problem. The tensor network contraction that corresponds to the norm of the state counts the number of solutions to the instance. It follows that exact contractions of this tensor network are in the #P-complete computational complexity class, thus believed to be a hard task. Furthermore, we show that for a 3SAT instance with n bits, it is enough to perform a polynomial number of contractions of the tensor network structure associated to the …
Subsystems of strongly disordered, interacting quantum systems can fail to thermalize because of the phenomenon of many-body localization (MBL). In this article, we explore a tensor network description of the eigenspectra of such systems. Specifically, we will argue that the presence of a complete set of local integrals of motion in MBL implies an efficient representation of the entire spectrum of energy eigenstates with a single tensor network, a \emph{spectral} tensor network. Our results are rigorous for a class of idealized systems related to MBL with integrals of motion of finite support.…
