相关论文: An algorithm for computing the global basis of an …
A polynomial-time algorithm for computing the permanent in any field of characteristic 3 is presented in this article. The principal objects utilized for that purpose are the Cauchy and Vandermonde matrices, the discriminant function and…
In this paper we investigate the linear and nonlinear models of optical quantum computation and discuss their scalability and efficiency. We show how there are significantly different scaling properties in single photon computation when…
We describe properties of the nonstandard q-deformation U'_q(so_n) of the universal enveloping algebra U(so_n) of the Lie algebra so_n which does not coincide with the Drinfeld--Jimbo quantum algebra U_q(so_n). In particular, it is shown…
The existing doubling algorithms have been proven efficient for several important nonlinear matrix equations arising from real-world engineering applications. In a nutshell, the algorithms iteratively compute a basis matrix, in one of the…
We show that the full matrix algebra Mat_p(C) is a U-module algebra for U = U_q sl(2), a 2p^3-dimensional quantum sl(2) group at the 2p-th root of unity. Mat_p(C) decomposes into a direct sum of projective U-modules P^+_n with all odd n,…
We explicitly provide minimal Gr\"obner bases for simple, finite-dimensional modules of complex Lie algebras of types A and C, using a homogeneous ordering that is compatible with the PBW filtration on the universal enveloping algebras.
We present a quantum algorithm for the calculation of scattering amplitudes of massive charged scalar particles in scalar quantum electrodynamics. Our algorithm is based on continuous-variable quantum computing architecture resulting in…
We construct a crystal basis for the negative half of the quantum group U associated to the standard super Cartan datum of gl(m|1), which is compatible with known crystals on Kac modules and simple modules. We show that these crystals admit…
We propose quantum algorithms, purely quantum in nature, for calculating the determinant and inverse of an $(N-1)\times (N-1)$ matrix (depth is $O(N^2\log N)$) which is a simple modification of the algorithm for calculating the determinant…
We give a criterion for a collection of polynomials to be a universal Gr\"{o}bner basis for an ideal in terms of the multidegree of the closure of the corresponding affine variety in $(\mathbb{P}^1)^N$. This criterion can be used to give…
Generalized Heisenberg algebras $\H(f)$ for any polynomial $f(h)\in\C[h]$ have been used to explain various physical systems and many physical phenomena for the last 20 years. In this paper, we first obtain the center of $\H(f)$, and the…
We describe an algorithm for using a quantum computer to calculate mean values of observables and the partition function of a quantum system. Our algorithm includes two sub-algorithms. The first sub-algorithm is for calculating, with…
Simplicity of universal minimal quantum affine W-algebras is studied. As an application, we find the values of the center, for which the vacuum module over a superconformal algebra is irreducible.
We describe algorithms for computing geometric invariants for Hilbert modular surfaces, and we report on their implementation.
In this paper, we construct a new class of modules over the Block algebra $\BB(q)$, where $q$ is a nonzero complex number. We determined the irreducibilities of these modules and the isomorphisms among them.
We use the theory of $\textbf{U}_q$-tilting modules to construct cellular bases for centralizer algebras. Our methods are quite general and work for any quantum group $\textbf{U}_q$ attached to a Cartan matrix and include the non-semisimple…
This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann…
In this article we study the deformation of finite maps and show how to use this deformation theory to construct varieties with given invariants in a projective space. Among other things, we prove a criterion that determines when a finite…
In this paper, we give a new realization of crystal bases for irreducible highest weight modules over $U_q(G_2)$ in terms of monomials. We also discuss the natural connection between the monomial realization and tableau realization.
We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…