Related papers: Formal Analysis of Galois Field Arithmetics - Para…
Normal basis is used in many applications because of the efficiency of the implementation. However, most space complexity reduction techniques for binary field multiplier are applicable for only optimal normal basis or Gaussian normal basis…
Motivated by practical applications in the design of optimization compilers for neural networks, we initiated the study of identity testing problems for arithmetic circuits augmented with \emph{exponentiation gates} that compute the real…
In this study, we consider the Euclidean and Galois hulls of multi-twisted (MT) codes over a finite field $\mathbb{F}_{p^e}$ of characteristic $p$. Let $\mathbf{G}$ be a generator polynomial matrix (GPM) of a MT code $\mathcal{C}$. For any…
We present an algorithm for computing circuit polynomials in the algebraic rigidity matroid $\mathcal{A}(\text{CM}_n)$ associated to the Cayley-Menger ideal CM$_n$ for $n$ points in 2D. It relies on combinatorial resultants, a new operation…
This paper introduces several techniques that improve the scalability of the deductive verification of data-level programs working on arrays and matrices. First of all, we introduce a technique to rewrite expressions with (nested)…
Estimating the trace of the inverse of a large matrix is an important problem in lattice quantum chromodynamics. A multilevel Monte Carlo method is proposed for this problem that uses different degree polynomials for the levels. The…
This paper introduces a systematic approach towards the inverse problem for arboreal Galois representations of finite index attached to quadratic polynomials. Let $F$ be a field of characteristic $\neq 2$, $f\in F[x]$ be monic and quadratic…
We demonstrate a programmable quantum Hall circuit that implements a novel iterative voltage bisection scheme and allows obtaining any binary fraction $(k/2^n)$ of the fundamental resistance quantum $R_K/2=h/2e^2$. The circuit requires a…
In this paper, we consider the problem of phase retrieval, which consists of recovering an $n$-dimensional real vector from the magnitude of its $m$ linear measurements. We propose a mirror descent (or Bregman gradient descent) algorithm…
We discuss the formulation of the prototype gauge field theory, QED, in the context of two-particle-irreducible (2PI) functional techniques with particular emphasis on the issues of renormalization and gauge symmetry. We show how to…
We consider a multi-block separable convex optimization problem with the linear constraints, where the objective function is the sum of m individual convex functions without overlapping variables. The linearized version of the generalized…
In the recent years, reversible logic has emerged as a promising technology having its applications in low power CMOS, quantum computing, nanotechnology, and optical computing. The classical set of gates such as AND, OR, and EXOR are not…
We present short elementary proofs of the well-known Ruffini-Abel-Galois theorems on insolvability of algebraic equations in radicals. These proofs are obtained from existing expositions by stripping away material not required for the…
The ability to perform gates in multiqubit systems that are robust to noise is of crucial importance for the advancement of quantum information technologies. However, finding control pulses that cancel noise while performing a gate is made…
For the simulation of rectilinearly moving conductors across a magnetic field, the Galer-kin finite element method (GFEM) is generally employed. The inherent instability of GFEM is very often addressed by employing Streamline…
Shor's quantum algorithm for discrete logarithms applied to elliptic curve groups forms the basis of a "quantum attack" of elliptic curve cryptosystems. To implement this algorithm on a quantum computer requires the efficient implementation…
Robust quantum computation with d-level quantum systems (qudits) poses two requirements: fast, parallel quantum gates and high fidelity two-qudit gates. We first describe how to implement parallel single qudit operations. It is by now well…
A novel parallel technique for Fourier-Galerkin pseudo-spectral methods with applications to two-dimensional Navier-Stokes equations and inviscid Boussinesq approximation equations is presented. It takes the advantage of the programming…
We discuss recent progress in multi-loop integrand reduction methods. Motivated by the possibility of an automated construction of multi-loop amplitudes via generalized unitarity cuts we describe a procedure to obtain a general…
For a differential field $F$ having an algebraically closed field of constants, we analyze the structure of Picard-Vessiot extensions of $F$ whose differential Galois groups are unipotent algebraic groups and apply these results to study…