Related papers: Complexity of Modular Circuits
Multi-homogeneous polynomial systems arise in many applications. We provide bit complexity estimates for solving them which, up to a few extra other factors, are quadratic in the number of solutions and linear in the height of the input…
In this paper, we investigate generalizations of the Mahler-Popkens complexity of integers. Specifically, we generalize to $k$-th roots of unity, polynomials over the naturals, and the integers mod $m$. In cyclotomic rings, we establish…
Motivated by recent studies of circuit complexity in weakly interacting scalar field theory, we explore the computation of circuit complexity in $\mathcal{Z}_2$ Even Effective Field Theories ($\mathcal{Z}_2$ EEFTs). We consider a massive…
We give a new complexity bound for calculating the complex dimension of an algebraic set. Our algorithm is completely deterministic and approaches the best recent randomized complexity bounds. We also present some new, significantly sharper…
This was submitted as a final project for CS254B, taught by Li Yang Tan and Tom Knowles. The field of Circuit Complexity utilises careful analysis of Boolean Circuit Functions in order to extract meaningful information about a range of…
In the present note we show that for any positive integer k an arbitrary Boolean circulant matrix can be implemented via modulo 2 rectifier circuit of depth 2k-1 and complexity O(n^{1+1/k}), and also via circuit of depth 2k and complexity…
Quantum Parametric Circuits are constructed as an alternative to reduce the size of quantum circuits, meaning to decrease the number of quantum gates and, consequently, the depth of these circuits. However, determining the optimal circuit…
We study the real components of modular curves. Our main result is an abstract group-theoretic description of the real components of a modular curve defined by a congruence subgroup of level N in terms of the corresponding subgroup of…
We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph $H$ to $n$-vertex graphs. These polynomials have received a lot of attention recently for their crucial role in several new…
Elliptic curves with a known number of points over a given prime field with n elements are often needed for use in cryptography. In the context of primality proving, Atkin and Morain suggested the use of the theory of complex multiplication…
Within recent years, considerable progress has been made regarding high-performance solvers for Partial Differential Equations (PDEs), yielding potential gains in efficiency compared to industry standard tools. However, the latter largely…
The vast majority of quantum states and unitaries have circuit complexity exponential in the number of qubits. In a similar vein, most of them also have exponential minimum description length, which makes it difficult to pinpoint examples…
We study primary submodules and primary decompositions from a differential and computational point of view. Our main theoretical contribution is a general structure theory and a representation theorem for primary submodules of an arbitrary…
We present a novel automated technique for parallelizing quantum circuits via forward and backward translation to measurement-based quantum computing patterns and analyze the trade off in terms of depth and space complexity. As a result we…
We calculate the higher topological complexity TC$_s$ for the complements of reflection arrangements, in other words for the pure Artin type groups of all finite complex reflection groups. In order to do that we introduce a simple…
We study the computational complexity of two Boolean nonlinearity measures: the nonlinearity and the multiplicative complexity. We show that if one-way functions exist, no algorithm can compute the multiplicative complexity in time…
Maximally embedding dimension (MED) numerical semigroups are a wide and interesting family, with some remarkable algebraic and combinatorial properties. Associated to any numerical semigroup one can construct a MED closure, as it is well…
We systematically investigate the complexity of counting subgraph patterns modulo fixed integers. For example, it is known that the parity of the number of $k$-matchings can be determined in polynomial time by a simple reduction to the…
Warped conformal field theories in two dimensions are exotic nonlocal, Lorentz violating field theories characterized by Virasoro-Kac-Moody symmetries and have attracted a lot of attention as candidate boundary duals to warped AdS$_3$…
We first study birational mappings generated by the composition of the matrix inversion and of a permutation of the entries of $ 3 \times 3 $ matrices. We introduce a semi-numerical analysis which enables to compute the Arnold complexities…