Related papers: Quadratic Probabilistic Algorithms for Normal Base…

Mutually unbiased bases are an important tool in many applications of quantum information theory. We present a new algorithm for finding the mutually unbiased bases for two-qubit systems. We derive a system of four equations in the Galois…

A graph $\Gamma$ is said to be a semi-Cayley graph over a group $G$ if it admits $G$ as a semiregular automorphism group with two orbits of equal size. We say that $\Gamma$ is normal if $G$ is a normal subgroup of ${\rm Aut}(\Gamma)$. We…

In analogy with the free factors of a free group we define special factors of Generalized Baumslag-Solitar (GBS) groups as non-cyclic subgroups which appear in splittings over infinite cyclic groups. We give an algorithm which, given a GBS…

The notion of normal elements for finite fields extension has been generalized as k-normal elements by Huczynska et al. [3]. The number of k-normal elements for a fixed finite field extension has been calculated and estimated [3], and…

A quantum computer encodes information in quantum states and runs quantum algorithms to surpass the classical counterparts by exploiting quantum superposition and quantum correlation. Grover's quantum search algorithm is a typical quantum…

We compute the fundamental group of the Galois cover of a surface of degree~$8$, with singularities of degree $4$, whose degeneration envelope is isomorphic to an octahedron. The group is shown to be a metabelian group of order $2^{23}$.…

Given an abelian algebraic group $A$ over a global field $F$, $\alpha \in A(F)$, and a prime $\ell$, the set of all preimages of $\alpha$ under some iterate of $[\ell]$ generates an extension of $F$ that contains all $\ell$-power torsion…

The isomorphism type of the Galois group G of finite 3-class field towers of quadratic number fields with 3-class group of type (9,9) is determined by means of Artin patterns which contain information on the transfer of 3-classes to…

Spherical Gauss-Laguerre (SGL) basis functions, i.e., normalized functions of the type $L_{n-l-1}^{(l + 1/2)} (r^2) r^{l} Y_{lm}(\vartheta,\varphi)$, $|m| \leq l < n \in \mathbb{N}$, $L_{n-l-1}^{(l + 1/2)}$ being a generalized Laguerre…

Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseudorandom with respect to linear phases. The Goldreich-Levin…

We propose a new class of quantum computing algorithms which generalize many standard ones. The goal of our algorithms is to estimate probability distributions. Such estimates are useful in, for example, applications of Decision Theory and…

Let $G, G_1,\dots,G_N$ be independent copies of a standard gaussian random vector in $\mathbb{R}^d$ and denote by $\Gamma = \sum_{i=1}^N \langle G_i,\cdot\rangle e_i$ the standard gaussian ensemble. We show that, for any set $A\subset…

A new approach to the classical limit of Grover's algorithm is discussed by assuming a very rapid dephasing of a system between consecutive Grover's unitary operations, which drives pure quantum states to decohered mixed states. One can…

Let $KG$ be the group ring of a group $G$ over a commutative ring $K$ with unity. The rings $KG$ are described for which $xx^\sigma=x^\sigma x$ for all $x=\sum_{g\in G}\alpha_gg\in KG$, where \quad $x\mapsto x^\sigma=~\sum_{g\in…

We consider the Rosenfeld-Groebner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of ordinary differential polynomials in n indeterminates. For a set of ordinary differential polynomials…

Let $\mathbf{F}$ be a real extension of $\mathbb{Q}$, $G$ a finite group and $\mathbf{F}G$ its group algebra. Given both a group homomorphism $\sigma:G\rightarrow \{\pm1\}$ (called an orientation) and a group involution $^\ast:G \rightarrow…

Let $\varphi\colon\Gamma\to G$ be a homomorphism of groups. In this paper we introduce the notion of a subnormal map (the inclusion of a subnormal subgroup into a group being a basic prototype). We then consider factorizations…

The Gaussian Elimination with Partial Pivoting (GEPP) is a classical algorithm for solving systems of linear equations. Although in specific cases the loss of precision in GEPP due to roundoff errors can be very significant, empirical…

A Hopf Galois structure on a finite field extension L/K is given by a finite cocommutative K-Hopf algebra and a Hopf action. In this paper we present an algorithm written in the computational algebra system Magma which gives all Hopf Galois…

A relevant signal in the quantum domain may manifest as a displacement or a squeezing operator in the bosonic phase space. For a real parameter $\beta$ embedded in such a Gaussian operator, the task of determining if $\beta \in…