SeQuant Framework for Symbolic and Numerical Tensor Algebra. I. Core Capabilities

Abstract

SeQuant is an open-source library for symbolic algebra of tensors over commutative (scalar) and non-commutative (operator) rings. The key innovation supporting most of its functionality is a graph-theoretic tensor network (TN) canonicalizer that can handle tensor networks with symmetries faster than their standard group-theoretic counterparts. The TN canonicalizer is used for routine simplification of conventional tensor expressions, for optimizing application of Wick's theorem (used to canonicalize products of tensors over operator fields), and for manipulation of the intermediate representation leading to the numerical evaluation. Notable features of SeQuant include support for noncovariant tensor networks (which often arise from tensor decompositions) and for tensors with modes that depend parametrically on indices of other tensor modes (such dependencies between degrees of freedom are naturally viewed as nesting of tensors, "tensors of tensors" arising in block-wise data compressions in data science and modern quantum simulation). SeQuant blurs the line between pure symbolic manipulation/code generation and numerical evaluation by including compiler-like components to optimize and directly interpret tensor expressions using external numerical tensor algebra frameworks. The SeQuant source code is available at https://github.com/ValeevGroup/SeQuant.

References in corpus (27)

• The ITensor Software Library for Tensor Network Calculations
• xPerm: fast index canonicalization for tensor computer algebra
• A field-theory motivated approach to symbolic computer algebra
• Tensor factorizations of local second-order Møller Plesset theory
• Automatic code generation enables nuclear gradient computations for fully internally contracted multireference theory
• Faster identification of optimal contraction sequences for tensor networks
• SNEG - Mathematica package for symbolic calculations with second-quantization-operator expressions
• ADG: Automated generation and evaluation of many-body diagrams I. Bogoliubov many-body perturbation theory
• Implementation of the full CCSDT electronic structure model with tensor decompositions
• A call to arms: making the case for more reusable libraries
• An Algorithm to Simplify Tensor Expressions
• Group-theoretic Approach for Symbolic Tensor Manipulation: II. Dummy Indices
• p${}^{†}$q: A tool for prototyping many-body methods for quantum chemistry
• Automatic derivation of fermionic many-body theories based on general Fermi vacua
• ATENSOR - REDUCE program for tensor simplification
• Tensor computations in computer algebra systems
• Efficient construction of canonical polyadic approximations of tensor networks
• Variations of the Hartree-Fock fractional-spin error for one electron
• Equation Generator for Equation-of-Motion Coupled Cluster Assisted by Computer Algebra System
• "Best" iterative coupled-cluster triples model: More evidence for 3CC
• A correctly scaling rigorously spin-adapted and spin-complete open-shell CCSD implementation for arbitrary high-spin states
• Comment on "Canonical transcorrelated theory with projected Slater-type geminals" [J. Chem. Phys. 136, 084107 (2012)]
• Faster Tensor Canonicalization
• Generating coupled cluster code for modern distributed memory tensor software
• A simple algorithm for automatic Feynman diagram generation
• Towards Balanced Description of Ground and Excited States with Transcorrelated F12 Methods
• Simplification of tensor expressions in computer algebra