Related papers: The Calculation of Clebsh-Gordan Coefficients for …
This article presents the derivation of a comprehensive formula for the Clebsch-Gordan coefficients in a quantum system. The formula is derived by employing the iterative application of angular momentum ladder operators on each defined…
A particular case of degenerate Clebsch-Gordan coefficient can be expressed with three binomial coefficients. Such a formula, which may be obtained using the standard ladder operator procedure, can also be derived from the Racah-Shimpuku…
A covariant - tensor method for $SU(2)_{q}$ is described. This tensor method is used to calculate q - deformed Clebsch - Gordan coefficients. The connection with covariant oscillators and irreducible tensor operators is established. This…
We express each Clebsch-Gordan (CG) coefficient of a discrete group as a product of a CG coefficient of its subgroup and a factor, which we call an embedding factor. With an appropriate definition, such factors are fixed up to phase…
We calculate (q-deformed) Clebsch-Gordan and 6j-coefficients for rank two quantum groups. We explain in detail how such calculations are done, which should allow the reader to perform similar calculations in other cases. Moreover, we…
The Clebsh-Gordan coefficients for the Lie algebra $\mathfrak{gl}_3$ in the Gelfand-Tsetlin base are calculated. In contrast to previous papers the result is given as an explicit formula. To obtain the result a realization of a…
We provide an algorithm of computing Clebsch-Gordan coefficients for irreducible representations, with integer weights, of the rotation group SO(3) and demonstrate the convenience of this algorithm for constructing new (to our knowledge)…
The Clebsch--Gordan coefficients of the Kronecker products of the irreducible representations of the Quaternion Group Q8, of the Generalized Quaternion Groups Q16 and Q32, and of the factor group (Q32 X Q32)/{(1,1),(-1,-1)} are computed as…
It has recently been shown that quantum computers can efficiently solve the Heisenberg hidden subgroup problem, a problem whose classical query complexity is exponential. This quantum algorithm was discovered within the framework of using…
A numerical algorithm that computes the decomposition of any finite-dimen\-sio\-nal unitary reducible representation of a compact Lie group is presented. The algorithm, which does not rely on an algebraic insight on the group structure, is…
Asymptotic expressions for Clebsch-Gordan coefficients are derived from an exact integral representation. Both the classically allowed and forbidden regions are analyzed. Higher-order approximations are calculated. These give, for example,…
The coefficients of fractional parentage (CFP) or Clebcsh-Gordan coefficients of the outer product of representations of the symmetric group $S_n$ are evaluated using an build up algorithm defined in terms of the chain involving the chain…
Representation theory for the Jordanian quantum algebra U=U_h(sl(2)) is developed using a nonlinear relation between its generators and those of sl(2). Closed form expressions are given for the action of the generators of U on the basis…
We present a new sum rule for Clebsch-Gordan coefficients using generalized characters of irreducible representations of the rotation group. The identity is obtained from an integral involving Gegenbauer ultraspherical polynomials. A…
A class of Clebsch-Gordan coefficients are derived from the properties of conditional probability using the binomial distribution. In particular, in the case of $l=l_1+l_2$ it is shown that $$[<l_1/2-k_1, l_2/2-k_2|l/2, k=k_1+k_2]>^2…
The first quantum algorithm to offer an exponential speedup (in the query complexity setting) over classical algorithms was Simon's algorithm for identifying a hidden exclusive-or mask. Here we observe how part of Simon's algorithm can be…
Fast, accurate, and stable computation of the Clebsch-Gordan (C-G) coefficients is always desirable, for example, in light scattering simulations, the translation of the multipole fields, quantum physics and chemistry. Current recursive…
In this paper, we study the tensor product of two unitary irreducible representations, as well as the tensor product of a unitary irreducible representation with a finite-dimensional one, and determine the corresponding Clebsch-Gordan…
We present an algorithm for the explicit numerical calculation of SU(N) and SL(N,C) Clebsch-Gordan coefficients, based on the Gelfand-Tsetlin pattern calculus. Our algorithm is well-suited for numerical implementation; we include a computer…
In an effort to develop tools for grand unified model building for the Lie group $E_6$, in this paper we present the computation of the Clebsch-Gordan coefficients for the product (100000) $\otimes$ (000010), where (100000) is the…