Tensor Renormalization Group with Randomized Singular Value Decomposition

Abstract

An algorithm of the tensor renormalization group is proposed based on a randomized algorithm for singular value decomposition. Our algorithm is applicable to a broad range of two-dimensional classical models. In the case of a square lattice, its computational complexity and memory usage are proportional to the fifth and the third power of the bond dimension, respectively, whereas those of the conventional implementation are of the sixth and the fourth power. The oversampling parameter larger than the bond dimension is sufficient to reproduce the same result as full singular value decomposition even at the critical point of the two-dimensional Ising model.

arXiv comment7 pages, 6 figures. Published version

References in corpus (18)

• The NumPy array: a structure for efficient numerical computation
• Efficient classical simulation of slightly entangled quantum computations
• A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
• Efficient simulation of one-dimensional quantum many-body systems
• Thermodynamic limit of the density matrix renormalization for the spin-1 Heisenberg chain
• Tensor renormalization group approach to 2D classical lattice models
• Coarse-graining renormalization by higher-order singular value decomposition
• Renormalization and tensor product states in spin chains and lattices
• Tensor Network Renormalization
• Second Renormalization of Tensor-Network States
• Renormalization of tensor-network states
• Loop optimization for tensor network renormalization
• Tensor renormalization of quantum many-body systems using projected entangled simplex states
• Tensor renormalization group study of classical XY model on the square lattice
• Faster identification of optimal contraction sequences for tensor networks
• Tensor network algorithm by coarse-graining tensor renormalization on finite periodic lattices
• Improved scaling of Time-Evolving Block-Decimation algorithm through Reduced-Rank Randomized Singular Value Decomposition
• Probabilistic low-rank factorization accelerates tensor network simulations of critical quantum many-body ground states

Cited by in corpus (22)

• Anisotropic Tensor Renormalization Group
• Boundary Tensor Renormalization Group
• Tensor Renormalization Group Algorithms with a Projective Truncation Method
• Phase structure of the CP(1) model in the presence of a topological $\theta$-term
• Boundary conformal spectrum and surface critical behaviors of the classical spin systems: a tensor network renormalization study
• Global optimization of tensor renormalization group using the corner transfer matrix
• Triad second renormalization group
• Multi-impurity method for the bond-weighted tensor renormalization group
• Algorithms for Tensor Network Contraction Ordering
• Improved coarse-graining methods on two dimensional tensor networks including fermions
• Phase boundary location with information-theoretic entropy in tensor renormalization group flows
• Grassmann tensor renormalization group approach to $(1+1)$-dimensional two-color lattice QCD at finite density
• All-mode Renormalization for Tensor Network with Stochastic Noise
• Initial tensor construction and dependence of the tensor renormalization group on initial tensors
• Spectroscopy with the tensor renormalization group method
• Triad representation for the anisotropic tensor renormalization group in four dimensions
• Efficient 2D Tensor Network Simulation of Quantum Systems
• Variational boundary based tensor network renormalization group
• Single-layer framework of variational tensor network states
• Forward-mode automatic differentiation for the tensor renormalization group and its relation to the impurity method
• Grassmann tensor renormalization group for the massive Schwinger model with a $\theta$ term using staggered fermions
• Emergence of Hermitian topology from non-Hermitian knots