Related papers: The true complexity of a system of linear equation…
Let $K$ be a number field, and let $G$ be a finitely generated subgroup of $K^\times$. Without relying on the Generalized Riemann Hypothesis we prove an asymptotic formula for the number of primes $\mathfrak p$ of $K$ such that the order of…
We prove that any finite abelian group $G$ contains a collection of not too many subsets with a special structure, so that for every subset $A$ of $G$ with a small doubling, there is a member $F$ of the collection that is fully contained in…
We propose a quantum algorithm to solve systems of nonlinear algebraic equations. In the ideal case the complexity of the algorithm is linear in the number of variables $n$, which means our algorithm's complexity is less than $O(n^{3})$ of…
The linear optimization degree gives an algebraic measure of complexity of optimizing a linear objective function over an algebraic model. Geometrically, it can be interpreted as the degree of a projection map on the {affine} conormal…
Grothendieck proved that any finite epimorphism of noetherian schemes factors into a finite sequence of effective epimorphisms. We define the complexity of a flat groupoid $R\rightrightarrows X$ with finite stabilizer to be the length of…
Many quantum algorithms, including Shor's celebrated factoring and discrete log algorithms, proceed by reduction to a Hidden Subgroup problem, in which an unknown subgroup H of a group G must be determined from a uniform superposition on a…
The quantum guesswork quantifies the minimum number of queries needed to guess the state of a quantum ensemble if one is allowed to query only one state at a time. Previous approaches to the computation of the guesswork were based on…
One of the central problems in additive combinatorics is to determine how large a subset of the first $N$ integers can be before it is forced to contain $k$ elements forming an arithmetic progression. Around 25 years ago, Gowers proved the…
In this paper, we study combinatorial properties of stable curves. To the dual graph of any nodal curve, it is naturally associated a group, which is the group of components of the N\'eron model of the generalized Jacobian of the curve. We…
It is well known that a dense subgroup $G$ of the complex unitary group $U(d)$ cannot be amenable as a discrete group when $d>1$. When $d$ is large enough we give quantitative versions of this phenomenon in connection with certain estimates…
We characterize the conditions under which a multi-time quantum process with a finite temporal resolution can be approximately described by an equilibrium one. By providing a generalization of the notion of equilibration on average, where a…
We consider probabilistic theories in which the most elementary system, a two-dimensional system, contains one bit of information. The bit is assumed to be contained in any complete set of mutually complementary measurements. The…
Our contribution is a bounded cubic compilation theorem. For each fixed resource parameter $k$, syntactic proof checking at resource level $k$ is faithfully represented by a finite bounded-domain system of cubic polynomial equations. Every…
Many systems of interest in cryptography consist of equations of the same degree. Under the assumption that the degree of regularity is finite, we prove upper bounds on the degree of regularity of a system of equations of the same degree,…
Simulating a cellular automaton (CA) for t time-steps into the future requires t^2 serial computation steps or t parallel ones. However, certain CAs based on an Abelian group, such as addition mod 2, are termed ``linear'' because they obey…
Classical and recent results on uncertainty principles for functions on finite Abelian groups relate the cardinality of the support of a function to the cardinality of the support of its Fourier transforms. We use these results and their…
The spectral fluctuations of complex quantum systems, in appropriate limit, are known to be consistent with that obtained from random matrices. However, this relation between the spectral fluctuations of physical systems and random matrices…
A linear equation with coefficients in $\mathbb{F}_q$ is common if the number of monochromatic solutions in any two-coloring of $\mathbb{F}_q^n$ is asymptotically (as $n \to \infty$) at least the number expected in a random two-coloring.…
As quantum analogs of the classical Kolmogorov-Sinai entropy, quantum dynamical entropies have emerged as important tools to characterize complex quantum dynamics. In particular, Alicki-Fannes-Lindblad (AFL) entropy, which quantifies the…
Probabilistic machine learning models are distinguished by their ability to integrate prior knowledge of noise statistics, smoothness parameters, and training data uncertainty. A common approach involves modeling data with Gaussian…