This work shows how to achieve vectorization for the practically relevant case of abelian symmetric tensor networks (which includes fermionic tensor networks) by developing a ``flat''tensor network formalism for block-sparse tensor representation and contraction.
Abstract
Variational Monte Carlo (VMC) calculations based on tensor networks (TN) have recently achieved competitive accuracy in ground-state calculations of strongly correlated spin and fermionic systems. However, existing tensor network VMC (TN-VMC) algorithms have not been formulated in a manner that can fully utilize GPU acceleration. We tackle the key missing ingredient, namely, the vectorized evaluation of tensor network amplitudes and tensor network operations. This ensures high GPU utilization by batching over computations with identical structure. In particular, we show how to achieve vectorization for the practically relevant case of abelian symmetric tensor networks (which includes fermionic tensor networks) by developing a ``flat''tensor network formalism for block-sparse tensor representation and contraction. Using this, we construct a GPU-adapted symmetric TN-VMC workflow with batched tensor network computation. In the two-dimensional Fermi--Hubbard model, we demonstrate a GPU speedup of up to $300 \times$ over single core CPU implementations, for fermionic TN variational wavefunctions.
A novel Jacobi-type tensor algorithm for tensor decomposition is investigated and a CUDA-based algorithm that supports tensors of arbitrary order on a single GPU is developed that outperforms the original MATLAB reference.
Markus Hellgren, Erna Begović Kovač, H. O. Karlsson et al.· 0 citations
Tensor networks are powerful formats for compressing large-scale data. However, their application to general data processing has been limited by the difficulty of performing nonlinear operations. Here, we introduce iterative tensor network transformations (ITNTs), a general algorithmic framework for the element-wise ev...
Xiao Wang, Tomohiro Hashizume, Pia Siegl et al.· 2 citations
As quantum computing matures, it is critical to benchmark its real-world problem solving performance against competitive classical methods, such as tensor networks. In this work, we leverage the Density Matrix Renormalization Group (DMRG) algorithm to compute ground state energies of the Lipkin Meshkov Glick (LMG) mode...
Maggie Bao, Rushil Dandamudi, Jerimiah Wright et al.· 0 citations
A new SVD-based tensor decomposition method for tensor networks with arbitrary graph topologies is introduced, and it is found that the graph-format representation attains comparable or better accuracy than the classical tensor train and hierarchical Tucker tensor formats, while using substantially fewer degrees of fre...
Tensor networks (TNs), originally developed for simulating many-body quantum systems, provide a systematic framework for approximating high-dimensional fields. This is achieved by factorizing the field into interconnected tensors with small bond dimensions, thereby restricting the correlations captured across field bip...
M. Esmaeili, Hirad Alipanah, Robert Pinkston et al.· 1 citation
A learning-to-rank framework for selecting efficient contraction plans before executing them and supporting Learning to Rank as a practical way to reduce contraction-plan search, while showing that performance remains partly backend dependent.
Alfred M. Pastor, Maribel Castillo, José M. Badía· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.