Related papers: The Qudit ZH Calculus for Arbitrary Finite Fields:…

We introduce the universal unitarily graded A-algebra for a commutative ring A and an arbitrary abelian extension U of the group of units of A, and use this concept to give simplified proofs of the main theorems of co-Galois theory in the…

Within the general context of the architecture in quantum computer design, this paper aims is to provide a general strategy to obtain a block-matrix representation of quantum gates applied to qubits placed in arbitrary positions over an…

By introducing a generalized notion of multiple zeta values associated with an arbitrary finite subset $S\subset \mathbb{P}^1(\mathbb{C})$ and studying their transformation properties under rational functions, we show that multiple…

It is known that a computationally universal gate set $\{H,CCZ\}$ can be transformed to a strictly universal one $\{H, \Lambda(S)\}$ using one maximally imaginary state $|+i \rangle$ and non-imaginary ancillary qubits. We succeed this…

We propose and study a generalized continued fraction algorithm that can be executed in an arbitrary imaginary quadratic field, the novelty being a non-restriction to the five Euclidean cases. Many hallmark properties of classical continued…

In this paper, we prove the existence of a first-order definition of the polynomial ring over a nonprincipal ultraproduct of finite fields of unbounded cardinalities in its fraction field by a universal-existential formula in the language…

Let $\ell$ be an odd prime, $q$ an odd prime power such that $q \not\equiv 0 \pmod \ell$, and $m$ the order of $q$ in $\F_\ell^\times$. We propose an explicit $L$-polynomial of hyperelliptic function field $K:=\F_q(T,…

We generalize the explicit quadratic Chabauty techniques for integral points on odd degree hyperelliptic curves and for rational points on genus 2 bielliptic curves to arbitrary number fields using restriction of scalars. This is achieved…

We present a randomized quantum algorithm for polynomial factorization over finite fields. For polynomials of degree $n$ over a finite field $\F_q$, the average-case complexity of our algorithm is an expected $O(n^{1 + o(1)} \log^{2 +…

For smooth finite fields $F_q$ (i.e., when $q-1$ factors into small primes) the Fast Fourier Transform (FFT) leads to the fastest known algebraic algorithms for many basic polynomial operations, such as multiplication, division,…

We show that the counts of low degree irreducible factors of a random polynomial $f$ over $\mathbb{F}_q$ with independent but non-uniform coefficients behave like that of a uniform random polynomial, exhibiting a form of universality for…

Let $\mathfrak{p}$ be a monic irreducible polynomial in $A:=\mathbb{F}_q[\theta]$, the ring of polynomials in the indeterminate $\theta$ over the finite field $\mathbb{F}_q$, and let $\zeta$ be a root of $\mathfrak{p}$ in an algebraic…

We study the complexity of multiplication of two elements in a finite field extension given by their coordinates in a normal basis. We show how to control this complexity using the arithmetic and geometry of algebraic curves.

Abhyankar proved that every field of finite transcendence degree over $\mathbb{Q}$ or over a finite field is a homomorphic image of a subring of the ring of polynomials $\mathbb{Z}[T_1, \dots, T_n]$ (for some $n$ depending on the field). We…

The ZW-calculus is a graphical language capable of representing 2-dimensional quantum systems (qubit) through its diagrams, and manipulating them through its equational theory. We extend the formalism to accommodate finite dimensional…

Let Z{t} be the ring of arithmetic power series that converge on the complex open unit disc. A classical result of Harbater asserts that every finite group occurs as a Galois group over the quotient field of Z{t}. We strengthen this by…

It is shown that, under some mild technical conditions, representations of prime numbers by binary quadratic forms can be computed in polynomial complexity by exploiting Schoof's algorithm, which counts the number of $\mathbb F_q$-points of…

In this paper, we present a review of three widely-used practical square root algorithms. We then describe a unifying framework where each of these well-known algorithms can be seen as a special case of it. The framework with singular…

Let $\mathbb{F}_q$ denote the finite field of characteristic $p$ and order $q$. Let $\mathbb{Z}_q$ denote the unramified extension of the $p$-adic rational integers $\mathbb{Z}_p$ with residue field $\mathbb{F}_q$. Given two positive…

One of spectacular results in mathematical physics is the expression of Racah matrices for symmetric representations of the quantum group $SU_q(2)$ through the Askey-Wilson polynomials, associated with the $q$-hypergeometric functions…