Results 31 to 40 of about 735,278 (318)
Contractions: Nijenhuis and Saletan tensors for general algebraic structures [PDF]
Generalizations in many directions of the contraction procedure for Lie algebras introduced by E.J.Saletan are proposed. Products of arbitrary nature, not necessarily Lie brackets, are considered on sections of finite-dimensional vector bundles.
José F. Cariñena+2 more
openalex +5 more sources
Efficient Parallel Sparse Tensor Contraction
We investigate the performance of algorithms for sparse tensor-sparse tensor multiplication (SpGETT). This operation, also called sparse tensor contraction, is a higher order analogue of the sparse matrix-sparse matrix multiplication (SpGEMM) operation.
Somesh Singh, Bora Uçar
openalex +4 more sources
Polyhedral Specification and Code Generation of Sparse Tensor Contraction with Co-iteration [PDF]
This article presents a code generator for sparse tensor contraction computations. It leverages a mathematical representation of loop nest computations in the sparse polyhedral framework (SPF), which extends the polyhedral model to support non-affine ...
Tuowen Zhao+4 more
semanticscholar +1 more source
Open Quantum System Dynamics from Infinite Tensor Network Contraction. [PDF]
Approaching the long-time dynamics of non-Markovian open quantum systems presents a challenging task if the bath is strongly coupled. Recent proposals address this problem through a representation of the so-called process tensor in terms of a tensor ...
Valentin Link, Hong-Hao Tu, W. Strunz
semanticscholar +1 more source
Stack Operation of Tensor Networks
The tensor network, as a factorization of tensors, aims at performing the operations that are common for normal tensors, such as addition, contraction, and stacking.
Tianning Zhang+4 more
doaj +1 more source
We present an overview of the key ideas and skills necessary to begin implementing tensor network methods numerically, which is intended to facilitate the practical application of tensor network methods for researchers that are already versed with their ...
Glen Evenbly
doaj +1 more source
Athena: high-performance sparse tensor contraction sequence on heterogeneous memory
Sparse tensor contraction sequence has been widely employed in many fields, such as chemistry and physics. However, how to efficiently implement the sequence faces multiple challenges, such as redundant computations and memory operations, massive memory ...
Jiawen Liu+3 more
semanticscholar +1 more source
Constructing Optimal Contraction Trees for Tensor Network Quantum Circuit Simulation [PDF]
One of the key problems in tensor network based quantum circuit simulation is the construction of a contraction tree which minimizes the cost of the simulation, where the cost can be expressed in the number of operations as a proxy for the simulation ...
Cameron Ibrahim+4 more
semanticscholar +1 more source
Tensor Network Contractions for #SAT [PDF]
The computational cost of counting the number of solutions satisfying a Boolean formula, which is a problem instance of #SAT, has proven subtle to quantify. Even when finding individual satisfying solutions is computationally easy (e.g. 2-SAT, which is in P), determining the number of solutions is #P-hard.
Jacob Turner+3 more
openaire +4 more sources