相关论文: An Algorithm for Calculating the Spin Tune in Circ…

We propose an approach to compute one-loop corrections to the four-point amplitude in the higher spin gravities that are holographically dual to free $O(N)$, $U(N)$ and $USp(N)$ vector models. We compute the double-particle cut of one-loop…

We present an efficient graphical approach to construct projectors for the tensor reduction of multi-loop Feynman integrals with both Lorentz and spinor indices in $D$ dimensions. An ansatz for the projectors is constructed making use of…

In this paper, we compose a computational algorithm for the determinant and the inverse of the n x n cyclic nonadiagonal matrix. The algorithm is suited for implementation using computer algebra systems (CAS) such as Mathematica and Maple.

In this paper we consider parallelization for applications whose objective can be expressed as maximizing a non-monotone submodular function under a cardinality constraint. Our main result is an algorithm whose approximation is arbitrarily…

We develop a systematic approach to deriving addition theorems for, and some other bilocal sums of, spin spherical harmonics. In this first part we establish some necessary technical results. We discuss the factorization of orbital and spin…

This paper describes the design and simulation of an 8-bit dedicated processor for calculating the Sine and Cosine of an Angle using CORDIC Algorithm (COordinate Rotation DIgital Computer), a simple and efficient algorithm to calculate…

We propose a new method to calculate Faraday rotation measure maps from multi-frequency polarisation angle data. In order to solve the so called n-pi ambiguity problem which arises from the observationally ambiguity of the polarisation…

A new method to compute the incoherent scattering function of harmonic lattices is introduced. It is based in a saddle point approximation for each term of the phonon expansion, and is simple enough to be used in practice. The method gives…

In atomistic spin dynamics simulations, the time cost of constructing the space- and time-displaced pair correlation function in real space increases quadratically as the number of spins $N$, leading to significant computational effort. The…

Single spin measurement represents a major challenge for spin-based quantum computation. In this article we propose a new method for measuring the spin of a single electron confined in a quantum dot (QD). Our strategy is based on entangling…

We introduce a new technique to generate scattering amplitudes at one loop. Traditional tree algorithms, which handle diagrams with fixed momenta, are promoted to generators of loop-momentum polynomials that we call open loops. Combining…

We study polygonal analogues of several moving boundary problems and their time discretization which preserves the constant area speed property. We establish various polygonal analogues of geometric formulas for moving boundaries and make…

In this paper we discuss the potential of emerging spintorque devices for computing applications. Recent proposals for spinbased computing schemes may be differentiated as all-spin vs. hybrid, programmable vs. fixed, and, Boolean vs.…

This paper presents convergence acceleration, a method for computing efficiently the limit of numerical sequences as a typical application of streams and higher-order functions.

The inelastic scanning tunneling microscopy (STM) has been shown recently (Loth et al. Science 329, 1628 (2010)) to be extendable as to access the nanosecond, spin-resolved dynamics of magnetic adatoms and molecules. Here we analyze…

The FIND algorithm is a fast algorithm designed to calculate certain entries of the inverse of a sparse matrix. Such calculation is critical in many applications, e.g., quantum transport in nano-devices. We extended the algorithm to other…

We present a simple, accurate method for computing singular or nearly singular integrals on a smooth, closed surface, such as layer potentials for harmonic functions evaluated at points on or near the surface. The integral is computed with…

A REDUCE code for the Newman-Janis algorithm is described. This algorithm is intended to include rotation into nonrotating solutions of the Einstein field equations with spherically symmetry or perturbed spherically symmetry and has been…

A new algorithm for numerical integration of the rigid-body equations of motion is proposed. The algorithm uses the leapfrog scheme and the quantities involved are angular velocities and orientational variables which can be expressed in…

As quantum computers scale toward millions of physical qubits, it becomes essential to robustly encode individual logical qubits to ensure fault tolerance under realistic noise. A high-quality foundational encoding allows future compilation…