Related papers: An $O(N^3)$ algorithm for the calculation of far f…
A new formulation of four dimensional quantum field theories, such as scalar field theory, is proposed as a large N limit of a special NxN matrix model. Our reduction scheme works beyond planar approximation and applies for QFT with finite…
Nonnegative Matrix Factorization (NMF) is a widely used technique for data representation. Inspired by the expressive power of deep learning, several NMF variants equipped with deep architectures have been proposed. However, these methods…
Neural Fields (NFs) have gained momentum as a tool for compressing various data modalities - e.g. images and videos. This work leverages previous advances and proposes a novel NF-based compression algorithm for 3D data. We derive two…
Multi-level non-local thermodynamic equilibrium (NLTE) radiation transfer calculations have become standard throughout the stellar atmospheres community and are applied to all types of stars as well as dynamical systems such as novae and…
We propose a method for calculating the nucleon form factors (FFs) of $G$-parity-even operators by combining Chiral Effective Field Theory ($\chi$EFT) and dispersion analysis. The FFs are expressed as dispersive integrals over the two-pion…
The low lying spectrum of the O(n) effective field theory is calculated in the delta-regime in 3 and 4 space-time dimensions using lattice regularization to NNL order. It allows, in particular, to determine, using numerical simulations in…
Recently, Gaussian splatting has emerged as a strong alternative to NeRF, demonstrating impressive 3D modeling capabilities while requiring only a fraction of the training and rendering time. In this paper, we show how the standard Gaussian…
A simple algorithm and a computational program to numerically compute the electric field gradient and the concomitant quadrupolar nuclear splitting is developed for an arbitrary ionic crystal. The calculations are performed using a point…
The Fast Fourier Transform (FFT) is a numerical operation that transforms a function into a form comprised of its constituent frequencies and is an integral part of scientific computation and data analysis. The objective of our work is to…
We provide practical simulation methods for scalar field theories on a quantum computer that yield improved asymptotics as well as concrete gate estimates for the simulation and physical qubit estimates using the surface code. We achieve…
It is well known that, using fast algorithms for polynomial multiplication and division, evaluation of a polynomial $F \in \mathbb{C}[x]$ of degree $n$ at $n$ complex-valued points can be done with $\tilde{O}(n)$ exact field operations in…
The singular values of convolutional mappings encode interesting spectral properties, which can be used, e.g., to improve generalization and robustness of convolutional neural networks as well as to facilitate model compression. However,…
Given a graph $G=(V,E)$ and two vertices $s,t\in V$, the $f$-fault replacement path ($f$FRP) problem computes for every set of edges $F$ where $|F|\leq f$, the distance from $s$ to $t$ when edges in $F$ fail. A recent result shows that 2FRP…
Neural Radiance Fields (NeRF) offer the potential to benefit 3D reconstruction tasks, including aerial photogrammetry. However, the scalability and accuracy of the inferred geometry are not well-documented for large-scale aerial…
A general and fast method is conceived for computing the cyclic convolution of n points, where n is a prime number. This method fully exploits the internal structure of the cyclic matrix, and hence leads to significant reduction of the…
The real-space density-functional perturbation theory (DFPT) for the computations of the response properties with respect to the atomic displacement and homogeneous electric field perturbation has been recently developed and implemented…
A new algorithm is proposed to describe the propagation of fronts advected in the normal direction with prescribed speed function F. The assumptions on F are that it does not depend on the front itself, but can depend on space and time.…
The division of the near-field and far-field zones for electromagnetic waves is important for simplifying theoretical calculations and applying far-field results. In this paper, we have studied the far-field asymptotic behaviors of dipole…
This paper considers the non-Hermitian Zakharov-Shabat (ZS) scattering problem which forms the basis for defining the SU$(2)$-nonlinear Fourier transformation (NFT). The theoretical underpinnings of this generalization of the conventional…
Discrete Fourier transform (DFT) is the base of modern signal or information processing. 1-Dimensional fast Fourier transform (1D FFT) and 2D FFT have time complexity O(NlogN) and O(N^2logN) respectively. Quantum 1D and 2D DFT algorithms…