Related papers: A Deleting Derivations Algorithm for Quantum Nilpo…
Quantum machines are among the most promising technologies expected to provide significant improvements in the following years. However, bridging the gap between real-world applications and their implementation on quantum hardware is still…
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…
Let $K$ be a number field. We show that, up to allowing a finite set of denominators in the partial quotients, it is possible to define algorithms for $\mathfrak P$-adic continued fractions satisfying the finiteness property on $K$ for…
This paper presents a quantum algorithm for the solution of prototypical second-order linear elliptic partial differential equations discretized by $d$-linear finite elements on Cartesian grids of a bounded $d$-dimensional domain. An…
A family of maximally superintegrable systems containing the Coulomb atom as a special case is constructed in N-dimensional Euclidean space. Two different sets of N commuting second order operators are found, overlapping in the Hamiltonian…
In this article, the two-parameter quantum Heisenberg enveloping algebra, which serves as a model for certain quantum generalized Heisenberg algebras, have been studied at roots of unity. In this context, the quantum Heisenberg enveloping…
We propose a sheaf-theoretic approach to the theory of differential calculi on quantum principal bundles over non-affine bases. After recalling the affine case we define differential calculi on sheaves of comodule algebras as sheaves of…
Topological quantum computers promise a fault tolerant means to perform quantum computation. Topological quantum computers use particles with exotic exchange statistics called non-Abelian anyons, and the simplest anyon model which allows…
Let $K$ be a field and $P=K[x_1,\dots,x_n]$. The technique of elimination by substitution is based on discovering a coherently $Z=(z_1,\dots,z_s)$-separating tuple of polynomials $(f_1,\dots,f_s)$ in an ideal $I$, i.e., on finding…
We present new techniques for removing arrows of bound quiver algebras, reducing thus the Finitistic Dimension Conjecture $\mathsf{(FDC)}$ for a given algebra to a smaller one. Unlike the classic arrow removal operation of…
In this survey, we review some of the recent connections between the representation theory of (untwisted) quantum affine algebras and the representation theory of current algebras. We mainly focus on the finite-dimensional representations…
Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…
We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…
A classification of finite dimensional irreducible representations of the nonstandard $q$-deformation $U'_q(so_n)$ of the universal enveloping algebra $U(so(n, C))$ of the Lie algebra $so(n, C)$ (which does not coincides with the…
We propose models of quantum neural networks through Clifford algebras, which are capable of capturing geometric features of systems and to produce entanglement. Due to their representations in terms of Pauli matrices, the Clifford algebras…
Quantum computers can efficiently solve problems which are widely believed to lie beyond the reach of classical computers. In the near-term, hybrid quantum-classical algorithms, which efficiently embed quantum hardware in classical…
Equational reasoning about circuits is central in quantum software for validation, optimisation, and verification. For qubits, the CNOT-dihedral fragment supports efficient rewriting via phase polynomials and layered normal forms, yielding…
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 give a general construction for finite dimensional representations of $U_q(\hat{\G})$ where $\hat{\G}$ is a non-twisted affine Kac-Moody algebra with no derivation and zero central charge. At $q=1$ this is trivial because…
In this work, we present a quantum neighborhood preserving embedding and a quantum local discriminant embedding for dimensionality reduction and classification. We demonstrate that these two algorithms have an exponential speedup over their…