Related papers: Algorithm for computing canonical bases and foldin…
Let ${\mathbf U}_q^-$ be the negative half of a quantum group of finite type. We construct the canonical basis of ${\mathbf U}_q^-$ by applying the folding theory of quantum groups, and piecewise linear parametrization of canonical basis.…
We construct a monomial basis of a quantum affine algebra of simply-laced type, associated to the PBW basis of Beck-Nakajima. We show that there exists a simple algorithm of computing canonical basis in terms of the monomial basis. We…
Let ${\mathbf U}^-_q$ be the negative part of the quantum enveloping algebra associated to a simply laced Kac-Moody Lie algebra ${\mathfrak g}$, and $\underline{\mathbf U}^-_q$ the algebra corresponding to the fixed point subalgebra of…
Quantum computing has been a fascinating research field in quantum physics. Recent progresses motivate us to study in depth the universal quantum computing models (UQCM), which lie at the foundation of quantum computing and have tight…
For any quantum group of finite ADE type, we prove a new formula for the standard bilinear form evaluated at monomials. Combining this with ideas from the Lusztig-Shoji algorithm, we obtain a new algorithm that computes the canonical basis.…
We will introduce an $\mathbb{N}$-filtration on the negative part of a quantum group of type $A_n$, such that the associated graded algebra is a q-commutative polynomial algebra. This filtration is given in terms of the representation…
We initiate the study of several distinguished bases for the positive half of a quantum supergroup $U_q$ associated to a general super Cartan datum $(\mathrm{I}, (\cdot,\cdot))$ of basic type inside a quantum shuffle superalgebra. The…
We develop a general theory of canonical bases for quantum symmetric pairs $(\mathbf{U}, \mathbf{U}^\imath)$ with parameters of arbitrary finite type. We construct new canonical bases for the simple integrable $\mathbf{U}$-modules and their…
We have reviewed some results on quantized shuffling, and in particular, the grading and structure of this algebra. In parallel, we have summarized certain details about classical shuffle algebras, including Lyndon words (primes) and the…
We recognize quantum circuit model of computation as factorisable scattering model and propose that a quantum computer is associated with a quantum many-body system solved by the Bethe ansatz. As an typical example to support our…
The Fast Fourier Transform (FFT) over a finite field $\mathbb{F}_q$ computes evaluations of a given polynomial of degree less than $n$ at a specifically chosen set of $n$ distinct evaluation points in $\mathbb{F}_q$. If $q$ or $q-1$ is a…
We introduce a Sinkhorn-type algorithm for producing quantum permutation matrices encoding symmetries of graphs. Our algorithm generates square matrices whose entries are orthogonal projections onto one-dimensional subspaces satisfying a…
For quantum symmetric pairs $(\mathbf{U}, \textbf{U}^\imath)$ of Kac-Moody type, we construct $\imath$canonical bases for the highest weight integrable $\mathbf{U}$-modules and their tensor products regarded as $\mathbf{U}^\imath$-modules,…
Quantum computers provide a super-exponential speedup for performing a Fourier transform over the symmetric group, an ability for which practical use cases have remained elusive so far. In this work, we leverage this ability to unlock…
We compute icanonical basis of the quasi-split rank one modified iquantum group, by obtaining explicit transition matrices among the icanonical basis, monomial basis, and standardized canonical basis; all these bases can be naturally…
Let $\textbf{U}^+$ be the positive part of the quantum group $\textbf{U}$ associated with a generalized Cartan matrix. In the case of finite type, Lusztig constructed the canonical basis $\textbf{B}$ of $\textbf{U}^+$ via two approaches.…
We study the computation of canonical bases of sets of univariate relations $(p_1,\ldots,p_m) \in \mathbb{K}[x]^{m}$ such that $p_1 f_1 + \cdots + p_m f_m = 0$; here, the input elements $f_1,\ldots,f_m$ are from a quotient…
We present a number of quantum computing patterns that build on top of fundamental algorithms, that can be applied to solving concrete, NP-hard problems. In particular, we introduce the concept of a quantum dictionary as a summation of…
We apply numerical optimization and linear algebra algorithms for classical computers to the problem of automatically synthesizing algorithms for quantum computers. Using our framework, we apply several common techniques from these…
We characterize the algebraic structure of semi-direct product of cyclic groups, $\Z_{N}\rtimes\Z_{p}$, where $p$ is an odd prime number which does not divide $q-1$ for any prime factor $q$ of $N$, and provide a polynomial-time quantum…