Related papers: The Qth-power algorithm in characteristic 0
We find certain functional identities for the Gauss q-power function of a sum of q-commuting variables. Then we use these identities to obtain two-parameter twists of the quantum affine algebra U_q (\hat{sl}_2) and of the Yangian Y(sl_2).…
Quantum field theory reconciles quantum mechanics and special relativity, and plays a central role in many areas of physics. We develop a quantum algorithm to compute relativistic scattering probabilities in a massive quantum field theory…
A generalization of the factorization technique is shown to be a powerful algebraic tool to discover further properties of a class of integrable systems in Quantum Mechanics. The method is applied in the study of radial oscillator, Morse…
For an elliptic curve $E$ over a finite field $\F_q$, where $q$ is a prime power, we propose new algorithms for testing the supersingularity of $E$. Our algorithms are based on the Polynomial Identity Testing (PIT) problem for the $p$-th…
We present a quantum-classical hybrid random power method that approximates a ground state of a Hamiltonian. The quantum part of our method computes a fixed number of elements of a Hamiltonian-matrix polynomial via quantum polynomial…
J.~Rosen introduced the ring $\mathcal{P}^0_{\mathcal{A}}$ of so-called finite algebraic numbers, which may be seen as an analogue of certain periods in the ring $\mathcal{A}=\prod_p \mathbb{Z}/p\mathbb{Z} /\bigoplus_p…
The method is introduced for fast data processing by reducing the probability amplitudes of undesirable elements. The algorithm has a mathematical description and circuit implementation on a quantum processor. The idea is to make a quick…
This article deals with the computation of the characteristic polynomial of dense matrices over small finite fields and over the integers. We first present two algorithms for the finite fields: one is based on Krylov iterates and Gaussian…
The quantum Fourier transform (QFT) brings efficiency in many respects, especially usage of resource, for most operations on quantum computers. In this study, the existing QFT-based and non-QFT-based quantum arithmetic operations are…
In this paper, we present a $q$-analogue of the polynomial reduction which was originally developed for hypergeometric terms. Using the $q$-Gosper representation, we describe the structure of rational functions that are summable when…
We define a $q$-deformation of the classical ring of integer-valued polynomials which we call the ring of quantum integer-valued polynomials. We show that this ring has a remarkable combinatorial structure and enjoys many positivity…
The fractional polylogarithms, depending on a complex parameter $\a$, are defined by a series which is analytic inside the unit disk. After an elementary conversion of the series into an integral presentation, we show that the fractional…
The Quantum Fourier Transformation (QFT) is a well-known subroutine for algorithms on qubit-based universal quantum computers. In this work, the known QFT circuit is used to derive an efficient circuit for the multidimensional QFT. The…
Let $\mathbb{F}_q$ denote the finite field of $q$ elements with characteristic $p$. Let $\mathbb{Z}_q$ denote the unramified extension of the $p$-adic integers $\mathbb{Z}_p$ with residue field $\mathbb{F}_q$. In this paper, we investigate…
Quantum algorithms are built enabling to find Poincar\'e recurrence times and periodic orbits of classical dynamical systems. It is shown that exponential gain compared to classical algorithms can be reached for a restricted class of…
Given a non-zero polynomial $f$ in a polynomial ring $R$ with coefficients in a finite field of prime characteristic $p$, we present an algorithm to compute a differential operator $\delta$ which raises $1/f$ to its $p$th power. For some…
Due to the significant progress made in the implementation of quantum hardware, efficient methods and tools to design corresponding algorithms become increasingly important. Many of these tools rely on functional representations of certain…
In an earlier preprint (math.AG/9810142) we gave an explicit description of the algebraic closure of the field of power series over a field of characteristic p, in terms of "generalized power series". In this paper, we give an analogous…
We present new results and an algorithm for standard basis computations of a 0-dimensional ideal I in a power series ring or in the localization of a polynomial ring in finitely many variables over a field K. The algorithm provides a…
We discuss and illustrate the behaviour of the continued fraction expansion of a formal power series under specialisation of parameters or their reduction modulo $p$ and sketch some applications of the reduction theorem here proved.