相关论文: Fast and accurate evaluation of Wigner 3j, 6j, and…

In calculating integral or discrete transforms, use has been made of fast algorithms for multiplying vectors by matrices whose elements are specified as values of special (Chebyshev, Legendre, Laguerre, etc.) functions. The currently…

In this paper we employ a novel technique combining the Euler Maclaurin formula with the saddle point approximation method to obtain the asymptotic behavior (in the limit of large representation index $J$) of generic Wigner matrix elements…

We consider the quantum complexity of estimating matrix elements of unitary irreducible representations of groups. For several finite groups including the symmetric group, quantum Fourier transforms yield efficient solutions to this…

The cyclic quantum dilogarithm is interpreted as a cyclic 6j-symbol of the Weyl algebra, considered as a Borel subalgebra $BU_q(sl(2))$. Using modified 6j-symbols, an invariant of triangulated links in triangulated 3-manifolds is…

We propose an algebraic expression for $U_q(\mathfrak{sl}_3)$ quantum $3j$ symbols (quantum Clebsch-Gordan coefficients) appearing in the decomposition of tensor product of symmetric representations. Our compact form will be useful to write…

This paper shows that it is possible to improve the computational cost, the memory requirements and the accuracy of Quick Fourier Transform (QFT) algorithm for power-of-two FFT (Fast Fourier Transform) just introducing a slight modification…

A quantum processor (QuP) can be used to exploit quantum mechanics to find the prime factors of composite numbers[1]. Compiled versions of Shor's algorithm have been demonstrated on ensemble quantum systems[2] and photonic systems[3-5],…

The Wigner d function, which is the essential part of an irreducible representation of SU(2) and SO(3) parameterized with Euler angles, has been know to suffer from a serious numerical errors at high spins, if it is calculated by means of…

Fast algorithms for integer and polynomial multiplication play an important role in scientific computing as well as in other disciplines. In 1971, Sch{\"o}nhage and Strassen designed an algorithm that improved the multiplication time for…

Factoring integers is considered as a computationally-hard problem for classical methods, whereas there exists polynomial-time Shor's quantum algorithm for solving this task. However, requirements for running the Shor's algorithm for…

We compute the three-loop non-singlet corrections to the photon-quark form factors taking into account the full dependence on the virtuality of the photon and the quark mass. We combine the method of differential equations in an effective…

This work belongs to a series of articles which have been dedicated to the combination of signed particles and neural networks to speed up the time-dependent simulation of quantum systems. More specifically, the suggested networks are…

In this work we study the encoding of smooth, differentiable multivariate functions in quantum registers, using quantum computers or tensor-network representations. We show that a large family of distributions can be encoded as…

The coupling coefficients (3j-symbols) for the symmetric (most degenerate) irreducible representations of the orthogonal groups SO(n) in a canonical basis and different semicanonical (tree) bases [with SO(n) restricted to SO(n')\times…

We devise an efficient algorithm for the symbolic calculation of irreducible angular momentum and spin (LS) eigenspaces within the $n$-fold antisymmetrized tensor product $\wedge^n V_u$, where $n$ is the number of electrons and $u =…

We expand a set of notions recently introduced providing the general setting for a universal representation of the quantum structure on which quantum information stands. The dynamical evolution process associated with generic quantum…

As the most central and computationally intensive component of deep neural networks, the execution efficiency of matrix multiplication directly determines the training and inference performance of models. Harnessing the parallel processing…

The purpose of this paper is to provide definitions for, and proofs of, the asymptotic formulae given by Edmonds, which relate the 3j and 6j symbols to rotation matrices.

We show that $n$-bit integers can be factorized by independently running a quantum circuit with $\tilde{O}(n^{3/2})$ gates for $\sqrt{n}+4$ times, and then using polynomial-time classical post-processing. The correctness of the algorithm…

Quantum processors are potentially superior to their classical counterparts for many computational tasks including factorization. Circuit methods as well as adiabatic methods have already been proposed and implemented for finding the…