Related papers: The Qth-power algorithm in characteristic 0

This paper investigates the power of polynomial-time quantum computation in which only a very limited number of qubits are initially clean in the |0> state, and all the remaining qubits are initially in the totally mixed state. No…

We develop a theory of $p$-adic continued fractions for a quaternion algebra $B$ over $\mathbb Q$ ramified at a rational prime $p$. Many properties holding in the commutative case can be proven also in this setting. In particular, we focus…

By using methods of umbral nature, we discuss new rules concerning the operator ordering. We apply the technique of formal power series to take advantage from the wealth of properties of the exponential operators. The usefulness of the…

Working over the prime field F_p, the structure of the indecomposables Q^* for the action of the algebra of Steenrod reduced powers A(p) on the symmetric power functors S^* is studied by exploiting the theory of strict polynomial functors.…

A new class of regular quaternionic functions, defined by power series in a natural fashion, has been introduced in recent years. Several results of the theory recall the classical complex analysis, whereas other results reflect the…

We describe a straightforward method to generate a random prime q such that the multiplicative group GF(q)* also has a random large prime-order subgroup. The described algorithm also yields this order p as well as a p'th primitive root of…

We develop the basic properties of an essentially new closure operation on submodules, the \emph{liftable integral closure} of a submodule, including its relationships with the two prevailing notions of integral closure of submodules. We…

We consider autonomous conservative dynamical systems which are constrained with the condition that the total energy of the system has a specified value. We prove a theorem which provides the quadratic first integrals (QFIs), time-dependent…

In this paper, we make use of the classification results of low-degree permutation rational functions together with their geometric properties to investigate rational functions that induce permutations on the multiplicative subgroup mu_q+1,…

We consider a version of the nearest-codeword problem on finite fields $\mathbb{F}_q$ using the Manhattan distance, an analog of the Hamming metric for non-binary alphabets. Similarly to other lattice related problems, this problem is…

Let $q$ be a positive integer. In our recent paper, we proved that the cardinality of the complement of an integral arrangement, after the modulo $q$ reduction, is a quasi-polynomial of $q$, which we call the characteristic…

We give an efficient algorithm for Lang's Theorem in split connected reductive groups defined over finite fields of characteristic greater than 3. This algorithm can be used to construct many important structures in finite groups of Lie…

In [2], I constructed the p-adic q-integral on Zp. In this paper, we consider the properties of the p-adic invariant p-adic q-integral in the ring of p-adic integers at q=-1. Finally we give the some applications of p-adic q-integration at…

This paper proposes a novel matrix rank-one decomposition for quaternion Hermitian matrices, which admits a stronger property than the previous results in (sturm2003cones,huang2007complex,ai2011new). The enhanced property can be used to…

Let $\mu_{q+1}$ denote the set of $(q+1)$-th roots of unity in $\mathbb{F}_{q^2 }$. We construct permutation polynomials over $\mathbb{F}_{q^2}$ by using rational functions of any degree that induce bijections either on $\mu_{q+1}$ or…

We find a new approach to computing the remainder of a polynomial modulo $x^n-1$; such a computation is called modular enumeration. Given a polynomial with coefficients from a commutative $\mathbb{Q}$-algebra, our first main result…

We employ quantum circuit learning to simulate quantum field theories (QFTs). Typically, when simulating QFTs with quantum computers, we encounter significant challenges due to the technical limitations of quantum devices when implementing…

The inverse of an $\infty \times \infty$ symmetric band matrix can be constructed in terms of a matrix continued fraction. For Hamiltonians with Coulomb plus polynomial potentials, this results in an exact and analytic Green's operator…

We consider the problem of determining the closure of a quadratic module M in a commutative R-algebra with respect to the finest locally convex topology. This is of interest in deciding when the moment problem is solvable and in analyzing…

In this paper, we implement a quantum algorithm -on IBM quantum devices, IBM QASM simulator and PPRC computer cluster -to find the energy values of the ground state and the first excited state of a particle in a finite square-well…