Related papers: Compression of the electron repulsion integral ten…
Three dimensional convolutional neural networks (3DCNNs) have been applied in many tasks, e.g., video and 3D point cloud recognition. However, due to the higher dimension of convolutional kernels, the space complexity of 3DCNNs is generally…
The particle-particle random phase approximation (pp-RPA) has been shown to be capable of describing double, Rydberg, and charge transfer excitations, for which the conventional time-dependent density functional theory (TDDFT) might not be…
The most challenging scenario for Kohn-Sham density functional theory, that is when the electrons move relatively slowly trying to avoid each other as much as possible because of their repulsion (strong-interaction limit), is reformulated…
We investigate a novel approach to approximate tensor-network contraction via the exact, matrix-free decomposition of full tensor-networks. We study this method as a means to eliminate the propagation of error in the approximation of…
Numerical computations and methods have become increasingly crucial in the study of spin foam models across various regimes. This paper adds to this field by introducing new algorithms based on tensor network methods for computing…
We introduce \texttt{TEOBResumSP}: an efficient, accurate hybrid scheme for generating gravitational waveforms from spin-precessing compact binaries. The precessing waveforms are generated via the established technique of Euler rotating the…
A novel reduced-scaling, general-order coupled-cluster approach is formulated by exploiting hierarchical representations of many-body tensors, combined with the recently suggested formalism of scale-adaptive tensor algebra. Inspired by the…
Channel pruning and tensor decomposition have received extensive attention in convolutional neural network compression. However, these two techniques are traditionally deployed in an isolated manner, leading to significant accuracy drop…
The recent advances in deep neural networks (DNNs) make them attractive for embedded systems. However, it can take a long time for DNNs to make an inference on resource-constrained computing devices. Model compression techniques can address…
High-energy, large-scale particle colliders in nuclear and high-energy physics generate data at extraordinary rates, reaching up to $1$ terabyte and several petabytes per second, respectively. The development of real-time, high-throughput…
The goal of model compression is to reduce the size of a large neural network while retaining a comparable performance. As a result, computation and memory costs in resource-limited applications may be significantly reduced by dropping…
We present a spatially efficient decomposition of matrices and arbitrary-order tensors as linear combinations of tensor products of $\{-1, 1\}$-valued vectors. For any matrix $A \in \mathbb{R}^{m \times n}$, $$A - R_w = S_w C_w T_w^\top =…
We present an efficient algorithm for one- and two-component relativistic exact-decoupling calculations. Spin-orbit coupling is thus taken into account for the evaluation of relativistically transformed (one-electron) Hamiltonian. As the…
In this paper, we investigate tensor based nonintrusive reduced-order models (ROMs) for parametric cross-diffusion equations. The full-order model (FOM) consists of ordinary differential equations (ODEs) in matrix or tensor form resulting…
We present a computationally efficient relativistic formulation of the equation-of-motion coupled-cluster method for the double electron attachment problem. In this work, the exact two-component Hamiltonian within the atomic mean-field…
The statistical problem of estimating the effective dimension-reduction (EDR) subspace in the multi-index regression model with deterministic design and additive noise is considered. A new procedure for recovering the directions of the EDR…
Model order reduction seeks to approximate large-scale dynamical systems by lower-dimensional reduced models. For linear systems, a small reduced dimension directly translates into low computational cost, ensuring online efficiency. This…
Configuration-space matrix elements of N-body potentials arise naturally and ubiquitously in the Ritz-Galerkin solution of many-body quantum problems. For the common specialization of local, finite-range potentials, we develop the eXact…
The superpositional wave function oscillations for finite-time implementation of quantum algorithms modifies the desired interference required for quantum computing. We propose a scheme with trapped ultracold ion-pairs being qubits to…
The bottleneck part of anisotropic tensor renormalization group (ATRG) is a swapping bonds part which consists of a contraction of two tensors and a partial singular value decomposition of a matrix, and their computational costs are…