Related papers: Simon's Algorithm, Clebsch-Gordan Sieves, and Hidd…
The curvelet transform is a directional wavelet transform over R^n, which is used to analyze functions that have singularities along smooth surfaces (Candes and Donoho, 2002). I demonstrate how this can lead to new quantum algorithms. I…
We re-express the quantum Calogero-Sutherland model for the Lie algebra E7 and the particular value of the coupling constant K=1 by using the fundamental irreducible characters of the algebra as dynamical variables. For that, we need to…
Group equivariant convolutional networks (GCNNs) endow classical convolutional networks with additional symmetry priors, which can lead to a considerably improved performance. Recent advances in the theoretical description of GCNNs revealed…
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…
We discuss three applications of efficient quantum algorithms to determining properties of permutations and group automorphisms. The first uses the Bernstein-Vazirani algorithm to determine an unknown homomorphism from $Z_{p-1}^{m}$ to…
Clustering may be the most fundamental problem in unsupervised learning which is still active in machine learning research because its importance in many applications. Popular methods like K-means, may suffer from instability as they are…
We present a quantum algorithm for solving the hidden subgroup problem in the general linear group over a finite field where the hidden subgroup is promised to be a conjugate of the group of the invertible lower triangular matrices. The…
This paper studies hidden convexity properties associated with constrained optimization problems over the set of rotation matrices $\text{SO}(n)$. Such problems are nonconvex due to the constraint $X \in \text{SO}(n)$. Nonetheless, we show…
Many computational problems are unchanged under some symmetry operation. In classical machine learning, this can be reflected with the layer structure of the neural network. In quantum machine learning, the ansatz can be tuned to correspond…
Simon's problem is one of the most important problems demonstrating the power of quantum computers, which achieves a large separation between quantum and classical query complexities. However, Simon's discussion on his problem was limited…
Quantum algorithms for topological data analysis provide significant advantage over the best classical algorithm. Different from the previous simplical complex on points cloud, the GLMY homology introduced by Alexander Grigor'yan, Yong Lin,…
While recent work suggests that quantum computers can speed up the solution of semidefinite programs, little is known about the quantum complexity of more general convex optimization. We present a quantum algorithm that can optimize a…
We give efficient quantum algorithms for the problems of Hidden Translation and Hidden Subgroup in a large class of non-abelian solvable groups including solvable groups of constant exponent and of constant length derived series. Our…
The Askey-Wilson algebra $AW(3)$ with three generators is shown to serve as a hidden symmetry algebra underlying the Racah and (new) generalized Clebsch-Gordan problems for the quantum algebra $sl_q(2)$. On the base of this hidden symmetry…
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…
With rapid advancements in machine learning, first-order algorithms have emerged as the backbone of modern optimization techniques, owing to their computational efficiency and low memory requirements. Recently, the connection between…
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…
Many quantum algorithms, including Shor's celebrated factoring and discrete log algorithms, proceed by reduction to a Hidden Subgroup problem, in which an unknown subgroup H of a group G must be determined from a uniform superposition on a…
We use the theory of the quantum group $U_q(gl(2,\RR))$ in order to develop a quantum theory of invariants and show a decomposition of invariants into a Gordan-Capelli series. Higher binary forms are introduced on the basis of braided…
We introduce a generalization of the Euclidean algorithm for rings equipped with an involution, and completely enumerate all isomorphism classes of orders over definite, rational quaternion algebras equipped with an orthogonal involution…