Related papers: Cubic Goldreich-Levin
In this paper, we analyze the iteration-complexity of Generalized Forward--Backward (GFB) splitting algorithm, as proposed in \cite{gfb2011}, for minimizing a large class of composite objectives $f + \sum_{i=1}^n h_i$ on a Hilbert space,…
The inverse Langevin function is a fundamental part of the statistical chain models used to describe the behavior of polymeric-like materials, appearing also in other fields such as magnetism, molecular dynamics and even biomechanics. In…
We study geodesically convex (g-convex) problems that can be written as a difference of Euclidean convex functions. This structure arises in several optimization problems in statistics and machine learning, e.g., for matrix scaling,…
We study the problems of testing isomorphism of polynomials, algebras, and multilinear forms. Our first main results are average-case algorithms for these problems. For example, we develop an algorithm that takes two cubic forms $f, g\in…
Our approach to higher order Fourier analysis is to study the ultra product of finite (or compact) Abelian groups on which a new algebraic theory appears. This theory has consequences on finite (or compact) groups usually in the form of…
This paper introduces a new class of algorithms for solving large-scale linear inverse problems based on new flexible and inexact Golub-Kahan factorizations. The proposed methods iteratively compute regularized solutions by approximating a…
The Gowers U^3 norm is one of a sequence of norms used in the study of arithmetic progressions. If G is an abelian group and A is a subset of G then the U^3(G) of the characteristic function 1_A is useful in the study of progressions of…
We prove a power saving upper bound for the sum of Fourier coefficients $\rho_f(\cdot)$ of a fixed cubic metaplectic cusp form $f$ over primes. Our result is the cubic analogue of a celebrated 1990 Theorem of Duke and Iwaniec, and the…
This paper gives the first quantitative bounds for the inverse theorem for the Gowers $U^4$-norm over $\mathbb{F}_p^n$ when $p=2,3$. We build upon earlier work of Gowers and Mili\'cevi\'c who solved the corresponding problem for $p\geq 5$.…
We evaluate the accuracy of the quantum inverse (Q-Inv) algorithm in which the multiplication of $\hat{H}^{-k}$ to the reference wavefunction is replaced by the Fourier Transformed multiplication of $e^{-i\lambda \hat{H}}$, as a function of…
This paper introduces the generalized forward-backward splitting algorithm for minimizing convex functions of the form $F + \sum_{i=1}^n G_i$, where $F$ has a Lipschitz-continuous gradient and the $G_i$'s are simple in the sense that their…
Linear reversible circuits represent a subclass of reversible circuits with many applications in quantum computing. These circuits can be efficiently simulated by classical computers and their size is polynomially bounded by the number of…
The Bogolyubov-Ruzsa lemma, in particular the quantitative bounds obtained by Sanders, plays a central role in obtaining effective bounds for the inverse $U^3$ theorem for the Gowers norms. Recently, Gowers and Mili\'cevi\'c applied a…
Let $G$ be a finite-dimensional vector space over a prime field $\mathbb{F}_p$ with some subspaces $H_1, \dots, H_k$. Let $f \colon G \to \mathbb{C}$ be a function. Generalizing the notion of Gowers uniformity norms, Austin introduced…
Chevyrev and Galbraith recently devised an algorithm which inputs a maximal order of the quaternion algebra ramified at one prime and infinity and constructs a supersingular elliptic curve whose endomorphism ring is precisely this maximal…
Quantum algorithms offer an exponential advantage with respect to the number of dependent variables for solving certain nonlinear ordinary differential equations (ODEs). These algorithms typically begin by transforming the original…
A fast algorithm (linear in the degrees of freedom) for the solution of linear variable-coefficient rational-order fractional integral and differential equations is described. The approach is related to the ultraspherical method for…
Modular composition is the problem of computing the coefficient vector of the polynomial $f(g(x)) \bmod h(x)$, given as input the coefficient vectors of univariate polynomials $f$, $g$, and $h$ over an underlying field $\mathbb{F}$. While…
Grover's search algorithm is one of the first quantum algorithms to exhibit a provable quantum advantage. It forms the backbone of numerous quantum applications and is widely used in benchmarking efforts. Here, we report…
We develop a generalized hybrid iterative approach for computing solutions to large-scale Bayesian inverse problems. We consider a hybrid algorithm based on the generalized Golub-Kahan bidiagonalization for computing Tikhonov regularized…