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 (8)
- Tensor renormalization group approach to 2D classical lattice models
- Tensor network states and algorithms in the presence of a global U(1) symmetry
- 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
- A Cluster Controller for Transition Matrix Calculations