Related papers: Formal Analysis of Galois Field Arithmetics - Para…

A modified Green operator is proposed as an improvement of Fourier-based numerical schemes commonly used for computing the electrical or thermal response of heterogeneous media. Contrary to other methods, the number of iterations necessary…

Masking is a widely-used effective countermeasure against power side-channel attacks for implementing cryptographic algorithms. Surprisingly, few formal verification techniques have addressed a fundamental question, i.e., whether the masked…

Many promising quantum algorithms in economics, medical science, and material science rely on circuits that are parameterized by a large number of angles. To ensure that these algorithms are efficient, these parameterized circuits must be…

We present an algorithm for the integrand-level reduction of multi-loop amplitudes of renormalizable field theories, based on computational algebraic geometry. This algorithm uses (1) the Gr\"obner basis method to determine the basis for…

This paper proposes a highly efficient global coded-multiplexing scheme, conceptualized as Orthogonal Frequency Division Multiplexing over a finite field (FF-OFDM), for reliable multiuser communications. By utilizing a prime length cyclic…

We consider the task of recovering two real or complex $m$-vectors from phaseless Fourier measurements of their circular convolution. Our method is a novel convex relaxation that is based on a lifted matrix recovery formulation that allows…

Geometric programming (GP) provides a power tool for solving a variety of optimization problems. In the real world, many applications of geometric programming (GP) are engineering design problems in which some of the problem parameters are…

With the race to build large-scale quantum computers and efforts to exploit quantum algorithms for efficient problem solving in science and engineering disciplines, the requirement to have efficient and scalable verification methods are of…

Let $p$ be a prime and $s,m,n$ be positive integers. This paper studies quasi-recursive MDS matrices over Galois rings $GR(p^{s}, p^{sm})$ and proposes various direct construction methods for such matrices. The construction is based on skew…

For finite Galois extension fields defined by odd degree irreducible polynomials over algebraic integer ring, we observe "Reciprocity Law" through Jacobian Variety by embedding all roots of the polynomials into 2-torsion points of Jacobian…

And-Inverter Graphs (AIGs) are a popular way to represent Boolean functions (like circuits). AIG simplification algorithms can dramatically reduce an AIG, and play an important role in modern hardware verification tools like equivalence…

The Galois/monodromy group of a family of geometric problems or equations is a subtle invariant that encodes the structure of the solutions. Computing monodromy permutations using numerical algebraic geometry gives information about the…

Reversible computing basically means computation with less or not at all electrical power. Since the standard binary gates are not usually reversible we use the Fredkin gate in order to achieve reversibility. An algorithm for designing…

This paper analyzes theorems about algebraic field extensions using the techniques of reverse mathematics. In section 2, we show that $\mathsf{WKL}_0$ is equivalent to the ability to extend $F$-automorphisms of field extensions to…

Multiplication is an essential step in a lot of calculations. In this paper we look at multiplication of 2 binary polynomials of degree at most $n-1$, modulo an irreducible polynomial of degree $n$ with $2n$ input and $n$ output qubits,…

In this paper, an optimized efficient VLSI architecture of a pipeline Fast Fourier transform (FFT) processor capable of producing the reverse output order sequence is presented. Paper presents Radix-2 multipath delay architecture for FFT…

This work provides a proof of concept for the computation of pure gluonic amplitudes in quantum chromodynamics (QCD) on graphics processing units (GPUs). The implementation relies on the Berends-Giele recursion algorithm and, for the first…

Triple-GEM detectors are a well known technology in high energy physics. In order to have a complete understanding of their behavior, in parallel with on beam testing, a Monte Carlo code has to be developed to simulate their response to the…

Complex functions $\chi (m)$ where $m$ belongs to a Galois field $GF(p^ \ell)$, are considered. Fourier transforms, displacements in the $GF(p^ \ell) \times GF(p^ \ell)$ phase space and symplectic $Sp(2,GF(p^ \ell))$ transforms of these…

We present some basic integer arithmetic quantum circuits, such as adders and multipliers-accumulators of various forms, as well as diagonal operators, which operate on multilevel qudits. The integers to be processed are represented in an…