Accuracy and Efficiency of Simplified Tensor Network Codes
arXiv:2001.00123
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.
References in corpus (21)
- An efficient, multiple range random walk algorithm to calculate the density of states
- Multicanonical Ensemble: A New Approach to Simulate First-order Phase Transitions
- Determining the density of states for classical statistical models: A random walk algorithm to produce a flat histogram
- Tensor renormalization group approach to 2D classical lattice models
- Tensor Network Renormalization
- Tensor network states and algorithms in the presence of a global U(1) symmetry
- Transition Matrix Monte Carlo Reweighting and Dynamics
- Tensor network renormalization yields the multi-scale entanglement renormalization ansatz
- Renormalization of tensor networks using graph independent local truncations
- Algorithms for tensor network renormalization
- TensorNetwork: A Library for Physics and Machine Learning
- Fast convergence of imaginary time evolution tensor network algorithms by recycling the environment
- TensorNetwork for Machine Learning
- Optimal Modification Factor and Convergence of the Wang-Landau Algorithm
- Multigrid Algorithms for Tensor Network States
- Tensor network algorithm by coarse-graining tensor renormalization on finite periodic lattices
- Boundary Tensor Renormalization Group
- Generalization of the tensor renormalization group approach to 3-D or higher dimensions
- Dynamic Canonical and Microcanonical Transition Matrix Analyses of Critical Behavior
- A Projected Entropy Controller for Transition Matrix Calculations
- A Cluster Controller for Transition Matrix Calculations