Related papers: Compression of the electron repulsion integral ten…
The deployment and training of neural networks on edge computing devices pose many challenges. The low memory nature of edge devices is often one of the biggest limiting factors encountered in the deployment of large neural network models.…
Tensor-based discrete density estimation requires flexible modeling and proper divergence criteria to enable effective learning; however, traditional approaches using $\alpha$-divergence face analytical challenges due to the $\alpha$-power…
Entropy and free-energy estimation are key in thermodynamic characterization of simulated systems ranging from spin models through polymers, colloids, protein structure, and drug-design. Current techniques suffer from being model specific,…
Neural network (NN) compression via techniques such as pruning, quantization requires setting compression hyperparameters (e.g., number of channels to be pruned, bitwidths for quantization) for each layer either manually or via neural…
Unlike 2D raster images, there is no single dominant representation for 3D visual data processing. Different formats like point clouds, meshes, or implicit functions each have their strengths and weaknesses. Still, grid representations such…
This study proposes a novel spatial discretization procedure for the compressible Euler equations which guarantees entropy conservation at a discrete level when an arbitrary equation of state is assumed. The proposed method, based on a…
The rotation of multi-dimensional arrays, or tensors, is a fundamental operation in computer science with applications ranging from data processing to scientific computing. While various methods exist, achieving this rotation in-place…
We develop a computationally and numerically efficient method to calculate binding energies and corresponding wave functions of quantum mechanical three-body problems in low dimensions. Our approach exploits the tensor structure of the…
We propose an efficient quantum state tomography method inspired by compressed sensing and threshold quantum state tomography that can drastically reduce the number of measurement settings to reconstruct the density matrix of an $N$-qudit…
A new approach for the reduction of tensor integrals is described. The standard decomposition \`{a} la Davydychev is applied. Integrals with higher indices are then expressed in terms of scalar higher-dimensional integrals with generic…
We consider one-loop scalar and tensor integrals with an arbitrary number of external legs relevant for multi-parton processes in massless theories. We present a procedure to reduce N-point scalar functions with generic 4-dimensional…
Two-body reduced density matrices (2RDMs) encode the essential two-electron physics of electronic states, but their quartic storage cost poses a major limitation in practical workflows. We investigate a simple protocol to compress both…
This paper describes a trapezoidal quadrature method for the discretization of weakly singular, singular and hypersingular boundary integral operators with complex symmetric quadratic forms. Such integral operators naturally arise when…
For a general third-order tensor $\mathcal{A}\in\mathbb{R}^{n\times n\times n}$ the paper studies two closely related problems, an SVD-like tensor decomposition and an (approximate) tensor diagonalization. We develop a Jacobi-type algorithm…
We investigate pairing symmetry and a transition temperature in a quasi-one-dimensional repulsive Hubbard model. We solve the Eliashberg equation using the third-order perturbation expansion with respect to the on-site repulsion $U$. We…
Tensor decomposition is a mathematically supported technique for data compression. It consists of applying some kind of a Low Rank Decomposition technique on the tensors or matrices in order to reduce the redundancy of the data. However, it…
With the increasing demand for storing images, traditional image compression methods face challenges in balancing the compressed size and image quality. However, the hybrid quantum-classical model can recover this weakness by using the…
The variational quantum eigensolver (VQE) has emerged as one of the leading quantum algorithms for solving electronic structure problems on near-term noisy intermediate-scale quantum devices. However, its practical application to quantum…
Variational Quantum algorithms, especially Quantum Approximate Optimization and Variational Quantum Eigensolver (VQE) have established their potential to provide computational advantage in the realm of combinatorial optimization. However,…
We discuss the reformulation of the O(2) model with a chemical potential and the Abelian Higgs model on a 1+1 dimensional space-time lattice using the Tensor Renormalization Group (TRG) method. The TRG allows exact blocking and connects…