The Schur basis on n d-dimensional quantum systems is a generalization of the total angular momentum basis that is useful for exploiting symmetry under permutations or collective unitary rotations. We present efficient (size poly(n,d,log(1/ε)) for accuracy ε) quantum circuits for the Schur transform, which is the change of basis between the computational and the Schur bases. These circuits are based on efficient circuits for the Clebsch-Gordan transformation. We also present an efficient circuit for a limited version of the Schur transform in which one needs only to project onto different Schur subspaces. This second circuit is based on a generalization of phase estimation to any nonabelian finite group for which there exists a fast quantum Fourier transform.
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 interpreted as a Clebsch-Gordan transform. Inspired by this we show how Clebsch-Gordan transforms can be used to efficiently find a hidden involution on the group G^n where G is the dihedral group of order eight (the group of symmetries of a square.) This problem previously admitted an efficient quantum algorithm but a connection to Clebsch-Gordan transforms …
The Clebsch-Gordan coefficients of the group SU(2) are shown to satisfy new inequalities. They are obtained using the properties of Shannon and Tsallis entropies. The inequalities associated with the Wigner 3-j symbols are obtained using the relation of Clebsch-Gordan coefficients with probability distributions interpreted either as distributions for composite systems or distributions for noncomposite systems. The new inequalities were found for Hahn polynomials and hypergeometric functions
The Löwdin-Shapiro projection operator for the Higgs algebra is constructed and utilised to find an analytical expression for the Clebsch-Gordan coefficients for the same.
We discuss the procedure of different partitions in the finite set of $N$ integer numbers and construct generic formulas for a bijective map of real numbers $s_y$, where $y=1,2,\ldots,N$, $N=\prod \limits_{k=1}^{n} X_k$, and $X_k$ are positive integers, onto the set of numbers $s(y(x_1,x_2,\ldots,x_n))$. We give the functions used to present the bijective map, namely, $y(x_1,x_2,...,x_n)$ and $x_k(y)$ in an explicit form and call them the functions detecting the hidden correlations in the system. The idea to introduce and employ the notion of "hidden gates" for a single qudit is proposed. We o…
Quantum Simulation of Random Unitaries from Clebsch-Gordan Transforms
QuSoft, Amsterdam, The Netherlands（QuSoft）；Institute for Logic, Language and Computation, University of Amsterdam, The Netherlands（阿姆斯特丹大学逻辑、语言与计算研究所）；Korteweg-de Vries Institute for Mathematics, University of Amsterdam, The Netherlands（阿姆斯特丹大学科特韦格-德弗里斯数学研究所）；Department of Physics, Graduate School of Science, The University of Tokyo, Japan（东京大学理学研究科物理学系）
本文提出基于克莱布施-戈尔丹变换的精确压缩 oracle 构造方法，用于任意有限维紧群的 Haar 随机群作用，展示了其在量子算法和密码学中的应用。
A symmetrising shift employed by Frenkel and Hartnoll in the approximate computation of the elements of matrix spherical harmonics is further explored and shown to be related to the permutation symmetry of 3-j symbols yielding an extension of the Edmonds classical limit. Some graphs are displayed.
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 pretty-good measurements for obtaining optimal measurements in the hidden subgroup problem. Here we show how to solve the Heisenberg hidden subgroup problem using arguments based instead on the symmetry of certain hidden subgroup states. The symmetry we consider leads naturally to a unitary transform known as the Clebsch-Gordan transform over the Heisenberg g…
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 similar procedure can be applied for other types of integrals of such polynomials, and may therefore lead to the derivation of further new relations.
It is shown that, in the relativistic hydrogenic approximation, expectation values of the type $\langle n\ell j|r^k|n\ell j\rangle$ can be expressed in terms of Clebsch-Gordan coefficients or $3jm$ symbols. This generalizes the results obtained by Varshalovich and Karpova [Opt. Spectrosc. 118, 1-5 (2015); Opt. Spektrosk. 118, 3-7] in the non-relativistic hydrogenic case.
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 =\frac{(\begin{array}{c} l_1 k_1\end{array}) (\begin{array}{c}l_2 k_2\end{array})}{(\begin{array}{c}l k \end{array})}$$
In a recent paper [J.-C. Pain, Opt. Spectrosc. ${\bf 218}$, 1105-1109 (2020)], we discussed the link between expectation values of powers of $r$ and Clebsch-Gordan coefficients. In this short note we provide additional information, reminding that such a connection is a direct consequence of group theory. The hydrogenic radial wavefunctions form bases for infinite dimensional representations of the algebra of the non-compact group $O(2,1)$ and the expectation values $r^p$ and $r^{-p}$ ($p$ being positive) transform as tensors with respect to this algebra. As shown a long time ago by Armstrong […
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 methods for computing the C-G coefficients are often unstable for large quantum numbers due to numerical overflow or underflow. In this paper, we present an improved method, the so-called sign-exponent recurrence, for the recursive computation of C-G coefficients. The result shows that the proposed method can significantly improve the stability of the computati…
We discuss the construction and symmetries of su(3) Clebsch-Gordan coefficients arising from the su(3) basis states constructed as triple tensor products of two-dimensional harmonic oscillator states. Because of the su(2) symmetry of the basis states, matrix elements and recursion relations are easily expressed in terms of su(2) technology. As the Weyl group has a particularly simple action on these states, Weyl symmetries of the su(3) coupling coefficients generalizing the well known m-> -m symmetry of su(2) coupling can be obtained, so that any coefficient can be obtained as a sum of Weyl-re…
We review the properties of the Kronecker (direct, or tensor) product of square matrices $A \otimes B \otimes C \cdots$ in terms of Hubbard operators. In its simplest form, a Hubbard operator $X_n^{i,j}$ can be expressed as the $n$-square matrix which has entry 1 in position $(i,j)$ and zero in all other entries. The algebra and group properties of the observables that define a multipartite quantum system are notably straightforward in such a framework. In particular, we use the Kronecker product in Hubbard notation to get the Clebsch-Gordan decomposition of the product group $SU(2) \times SU(…
The Schur-Weyl states belong to a special class of states with a symmetry described by two Young and Weyl tableaux. Representation of physical systems in Hilbert space spanned on these states enables to extract quantum information hidden in nonlocal degrees of freedom. Such property can be very useful in a broad range of problems in Quantum Computations, especially in quantum algorithms constructions, therefore it is very important to know exact form of these states. Moreover, they allow to reduce significantly the size of eigenproblem, or in general, diminishing the representation matrix of a…
Knot and link invariants naturally arise from any braided Hopf algebra. We consider the computational complexity of the invariants arising from an elementary family of finite-dimensional Hopf algebras: quantum doubles of finite groups (denoted D(G), for a group G). Regarding algorithms for these invariants, we develop quantum circuits for the quantum Fourier transform over D(G); in general, we show that when one can uniformly and efficiently carry out the quantum Fourier transform over the centralizers Z(g) of the elements of G, one can efficiently carry out the quantum Fourier transform over …
