Related papers: An LLT-type algorithm for computing higher-level c…
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 classify the quasi-finite irreducible highest weight modules over the infinite rank Lie superalgebras $\hgltwo$, $\hC$ and $\hD$, and determine the necessary and sufficient conditions for quasi-finite irreducible highest weight modules…
We construct level-0 modules of the quantum affine algebra $\Uq$, as the $q$-deformed version of the Lie algebra loop module construction. We give necessary and sufficient conditions for the modules to be irreducible. We construct the…
We classify irreducible finite-dimensional modules of a collection of real Lie superalgebras that includes the simple ones, their classical variants, complex Lie superalgebras after restriction of scalars, and all real Lie algebras. Our…
This article gives conjecturally correct algorithms to construct canonical bases of the irreducible polynomial representations and the matrix coordinate rings of the nonstandard quantum groups in GCT4 and GCT7, and canonical bases of the…
The linear canonical transform (LCT) has attained respectable status within a short span and is being broadly employed across several disciplines of science and engineering including signal processing, optical and radar systems, electrical…
The quantum group SL_q(2,R) at roots of unity is introduced by means of duality pairings with the quantum algebra U_q(sl(2,R)). Its irreducible representations are constructed through the universal T-matrix. An invariant integral on this…
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 prove that an irreducible quasifinite module over the central extension of the Lie algebra of $N\times N$-matrix differential operators on the circle is either a highest or lowest weight module or else a module of the intermediate…
This work introduces a canonical structure for a broad class of unconstrained first-order algorithms that admit a Lur'e representation, including systems with relative degree greater than one, e.g., systems with delayed gradient feedback.…
We classify the simple infinite dimensional integrable modules with finite dimensional weight spaces over the quantized enveloping algebra of an untwisted affine algebra. We prove that these are either highest (lowest) weight integrable…
We introduce the Lattice Deduction Transformer (LDT), a recurrent transformer that approximates logically sound deduction by projecting its latent state through a lattice between forward passes. We train on-policy in a process that mirrors…
This paper explores the irreducible uniformly bounded weight modules of map extended Special Lie algebras and map extended Hamiltonian Lie algebras under some condition on the action of the Laurent polynomial ring A_{N}.
We present SGDPLL(T), an algorithm that solves (among many other problems) probabilistic inference modulo theories, that is, inference problems over probabilistic models defined via a logic theory provided as a parameter (currently,…
Lattice reduction is a NP-hard problem well known in computer science and cryptography. The Lenstra-Lenstra-Lovasz (LLL) algorithm based on the calculation of orthogonal Gram-Schmidt (GS) bases is efficient and gives a good solution in…
Given an arbitrary single-qubit operation, an important task is to efficiently decompose this operation into an (exact or approximate) sequence of fault-tolerant quantum operations. We derive a depth-optimal canonical form for single-qubit…
For each $n\geqslant3$, we construct an uncountable family of models of the crystal of the basic $U_q(\hat{\mathfrak{sl}}_n)$-module. These models are all based on partitions, and include the usual $n$-regular and $n$-restricted models, as…
Quantum computing enables the efficient resolution of complex problems, often outperforming classical methods across various applications. In 2009, Harrow, Hassidim and Lloyd proposed an algorithm for solving linear systems of equations,…
A canonical basis in the sense of Lusztig is a basis of a free module over a ring of Laurent polynomials that is invariant under a certain semilinear involution and is obtained from a fixed "standard basis" through a triangular base change…
The goal of this work is to provide an elementary construction of the canonical basis $\mathbf B(w)$ in each quantum Schubert cell~$U_q(w)$ and to establish its invariance under modified Lusztig's symmetries. To that effect, we obtain a…