## Codebase release 1.3 for SymTensor

Yang Gao, Phillip Helms, Garnet Kin-Lic Chan, Edgar Solomonik

SciPost Phys. Codebases 10-r1.3 (2023) · published 24 February 2023

- doi: 10.21468/SciPostPhysCodeb.10-r1.3
**publication repo**- live repo (external)
- Submissions/Reports

### This Publication is part of a bundle

When citing, cite all relevant items (e.g. for a Codebase, cite both the article and the release you used).

DOI | Type | |
---|---|---|

10.21468/SciPostPhysCodeb.10 | Article | |

10.21468/SciPostPhysCodeb.10-r1.3 | Codebase release |

### Abstract

Tensor contractions are ubiquitous in computational chemistry and physics, where tensors generally represent states or operators and contractions express the algebra of these quantities. In this context, the states and operators often preserve physical conservation laws, which are manifested as group symmetries in the tensors. These group symmetries imply that each tensor has block sparsity and can be stored in a reduced form. For nontrivial contractions, the memory footprint and cost are lowered, respectively, by a linear and a quadratic factor in the number of symmetry sectors. State-of-the-art tensor contraction software libraries exploit this opportunity by iterating over blocks or using general block-sparse tensor representations. Both approaches entail overhead in performance and code complexity. With intuition aided by tensor diagrams, we present a technique, irreducible representation alignment, which enables efficient handling of Abelian group symmetries via only dense tensors, by using contraction-specific reduced forms. This technique yields a general algorithm for arbitrary group symmetric contractions, which we implement in Python and apply to a variety of representative contractions from quantum chemistry and tensor network methods. As a consequence of relying on only dense tensor contractions, we can easily make use of efficient batched matrix multiplication via Intel's MKL and distributed tensor contraction via the Cyclops library, achieving good efficiency and parallel scalability on up to 4096 Knights Landing cores of a supercomputer.

### Cited by 1

### Authors / Affiliations: mappings to Contributors and Organizations

See all Organizations.-
^{1}Yang Gao, -
^{1}Phillip Helms, -
^{1}Garnet Kin-Lic Chan, -
^{2}Edgar Solomonik

^{1}California Institute of Technology [CalTech]^{2}University of Illinois at Urbana Champaign [UIUC]