Related papers: Implementation of linear maps with circulant matri…

It is shown by Karp reduction that deciding the singularity of $(2^n - 1) \times (2^n - 1)$ sparse circulant matrices (SC problem) is NP-complete. We can write them only implicitly, by indicating values of the $2 + n(n + 1)/2$ eventually…

An automatic system to calculate two loop weak corrections to muon anomalous magnetic moment is discussed. Diagrams are classified into eight types, according to their topology. Adopting Civitanovi\'c-Kinoshita representation of Feynman…

The resummation of soft gluon exchange for QCD hard scattering requires a matrix of anomalous dimensions. We compute this matrix directly for arbitrary 2 to n massless processes for the first time at two loops. Using color generator…

We describe methods for evaluating one-loop integrals in $4-2\e$ dimensions. We give a recursion relation that expresses the scalar $n$-point integral as a cyclicly symmetric combination of $(n-1)$-point integrals. The computation of such…

In this work, we mainly study the one-loop effective action for real scalar theories in non-homogeneous backgrounds in odd dimensions. It is shown that through the method studied in Ref. [1], it is possible to obtain a unified result for…

Double circulant matrices are introduced and studied. A formula to compute the rank r of a double circulant matrix is exhibited; and it is shown that any consecutive r rows of the double circulant matrix are linearly independent. As a…

In arXiv:1710.08163 a generalization of Boolean circuits to arbitrary finite algebras had been introduced and applied to sketch P versus NP-complete borderline for circuits satisfiability over algebras from congruence modular varieties.…

We establish new separations between the power of monotone and general (non-monotone) Boolean circuits: - For every $k \geq 1$, there is a monotone function in ${\sf AC^0}$ that requires monotone circuits of depth $\Omega(\log^k n)$. This…

Consider a unit-resistive plate in the shape of a regular polygon with 2n sides, in which even-numbered sides are wired to electrodes and odd-numbered sides are insulated. The response matrix, or Dirichlet-to-Neumann map, allows one to…

We examine the fundamental problem of constructing depth-optimum circuits for binary addition. More precisely, as in literature, we consider the following problem: Given auxiliary inputs $t_0, \dotsc, t_{m-1}$, so-called generate and…

We prove that any $n$-qubit unitary can be implemented (i) approximately in time $\tilde O\big(2^{n/2}\big)$ with query access to an appropriate classical oracle, and also (ii) exactly by a circuit of depth $\tilde O\big(2^{n/2}\big)$ with…

We give a complete characterization of degree two rational maps with potential good reduction over local fields. We show this happens exactly when the map corresponds to an integral point in the moduli space. We detail an algorithm by which…

We associate to each Boolean function a polynomial whose evaluations represents the distances from all possible Boolean affine functions. Both determining the coefficients of this polynomial from the truth table of the Boolean function and…

This paper presents a means with time complexity of at worst O(n^3) to compute the discrete logarithm on cyclic finite groups of integers modulo p. The algorithm makes use of reduction of the problem to that of finding the concurrent zeros…

In this work we revisit the problem of solving multi-matrix systems through numerical large $N$ methods. The framework is a collective, loop space representation which provides a constrained optimization problem, addressed through…

The work proposes an extension of the quantum circuit formalism where qubits (wires) are circular instead of linear. The left-to-right interpretation of a quantum circuit is replaced by a circular representation which allows to select the…

We present a new interior-point potential-reduction algorithm for solving monotone linear complementarity problems (LCPs) that have a particular special structure: their matrix $M\in{\mathbb R}^{n\times n}$ can be decomposed as $M=\Phi U +…

Let $ACC \circ THR$ be the class of constant-depth circuits comprised of AND, OR, and MOD$m$ gates (for some constant $m > 1$), with a bottom layer of gates computing arbitrary linear threshold functions. This class of circuits can be seen…

We study polynomial systems whose equations have as common support a set C of n+2 points in Z^n called a circuit. We find a bound on the number of real solutions to such systems which depends on n, the dimension of the affine span of the…

This note shows how to compute, to high relative accuracy under mild assumptions, complex Jacobi rotations for diagonalization of Hermitian matrices of order two, using the correctly rounded functions $\mathtt{cr\_hypot}$ and…