Related papers: Fast and Exact Spin-s Spherical Harmonic Transform…
Spin-based computing is emerging as a powerful approach for energy-efficient and high-performance solutions to future data processing hardware. Spintronic devices function by electrically manipulating the collective dynamics of the electron…
Szapudi et al (2001) introduced the method of estimating angular power spectrum of the CMB sky via heuristically weighted correlation functions. Part of the new technique is that all (co)variances are evaluated by massive Monte Carlo…
Spin wave computing device where an algorithm can be encoded by recording a corresponding magnetization pattern onto a hard magnetic material was previously proposed1 and a particular implementation of a vector-matrix algorithm was…
We construct spherical harmonics for fuzzy spheres of even and odd dimensions, generalizing the correspondence between finite matrix algebras and fuzzy two-spheres. The finite matrix algebras associated with the various fuzzy spheres have a…
We introduce a highly-parallelizable architecture for estimating parameters of compact binary coalescence using gravitational-wave data and waveform models. Using a spherical harmonic mode decomposition, the waveform is expressed as a sum…
Inverse scattering involving microwave and ultrasound waves require numerical solution of nonlinear optimization problem. To alleviate the computational burden of a full three-dimensional (3-D) inverse problem, it is a common practice to…
Spin models are widely studied in the natural sciences, from investigating magnetic materials in condensed matter physics to studying neural networks. Previous work has demonstrated that there exist simple classical spin models that are…
We design spin filters for particles with potentially arbitrary spin S (= 1/2, 1, 3/2,....) using a one-dimensional periodic chain of magnetic atoms as a quantum device. Describing the system within a tight-binding formalism we present an…
We present a very simple expression and a Fortran code for the fast and precise calculation of three-dimensional harmonic-oscillator transformation brackets. The complete system of symmetries for the brackets along with analytical…
We present a simple algorithm that perfectly samples configurations from the unique Gibbs measure of a spin system on a potentially infinite graph $G$. The sampling algorithm assumes strong spatial mixing together with subexponential growth…
We study the computational complexity of approximately computing the partition function of a spin system. Techniques based on standard counting-to-sampling reductions yield $\tilde{O}(n^2)$-time algorithms, where $n$ is the size of the…
Fast Fourier transform algorithms are an arsenal of effective tools for solving various problems of analysis and high-speed processing of signals of various natures. Almost all of these algorithms are designed to process sequences of…
A complete discrete set of spherical single-particle wave functions for studies of weakly-bound many-body systems is proposed. The new basis is obtained by means of a local-scale point transformation of the spherical harmonic oscillator…
Time reversal and spin flip are discrete symmetry operations of substantial import to quantum information and quantum computation. Spin flip arises in the context of separability, quantification of entanglement and the construction of…
In a previous paper it was shown that a machine learning regression problem can be solved within the framework of random function theory, with the optimal kernel analytically derived from symmetry and indifference principles and coinciding…
In this paper we propose and realize (the code is publicly available at https://github.com/Thrawn1985/2D-Partition-Function) an algorithm for exact calculation of partition function for planar graph models with binary spins. The complexity…
Based on the Beylkin-Cramer summation rule, we introduce a new fast algorithm that enable us to explore the high order statistics efficiently in large data sets. Central to this technique is to make decomposition both of fields and…
Multipolar expansions are a foundational tool for describing basis functions in quantum mechanics, many-body polarization, and other distributions on the unit sphere. Progress on these topics is often held back by complicated and competing…
We introduce Spiral, a third-order integration algorithm for the rotational motion of extended bodies. It requires only one force calculation per time step, does not require quaternion normalization at each time step, and can be formulated…
Accurately estimating the point spread function (PSF) of an optical system requires solving free-space wave propagation, which entails evaluating a diffraction integral. This integral is traditionally computed numerically using Fast Fourier…