Related papers: Three lectures on Fourier analysis and learning th…
Previous noncommutative Bohnenblust--Hille (BH) inequalities addressed operator decompositions in the tensor-product space $M_2(\mathbb{C})^{\otimes n}$; \emph{i.e.,} for systems of qubits \cite{HCP22,VZ23}. Here we prove noncommutative BH…
Attempts to apply Neural Networks (NN) to a wide range of research problems have been ubiquitous and plentiful in recent literature. Particularly, the use of deep NNs for understanding complex physical and chemical phenomena has opened a…
We introduce fusion bialgebras and their duals and systematically study their Fourier analysis. As an application, we discover new efficient analytic obstructions on the unitary categorification of fusion rings. We prove the Hausdorff-Young…
We give a new framework for proving the existence of low-degree, polynomial approximators for Boolean functions with respect to broad classes of non-product distributions. Our proofs use techniques related to the classical moment problem…
Hamiltonian learning is an important procedure in quantum system identification, calibration, and successful operation of quantum computers. Through queries to the quantum system, this procedure seeks to obtain the parameters of a given…
We show here that the refined theorems for both lecture hall partitions and anti-lecture hall compositions can be obtained as straightforward consequences of two q-Chu Vandermonde identities, once an appropriate recurrence is derived. We…
Decoupling is a recent development in Fourier analysis, which has applications in harmonic analysis, PDE, and number theory. We survey some applications of decoupling and some of the ideas in the proof. This survey is aimed at a general…
In this note, we study the arithmetic nature of values of modular functions, meromorphic modular forms and meromorphic quasi-modular forms with respect to arbitrary congruence subgroups, that have algebraic Fourier coefficients. This…
The first part of this thesis proposes a general approach to infinite dimensional non-Gaussian analysis, including the Poissonian case. In particular distribution theory is developed. Using appropriate integral transformations, generalized…
In the present paper, we deal with Fourier-transformation of Frobenius-Euler polynomials. We shall give its applications by using infinite series. Our applications possess interesting properties which we state in this paper.
Linear and nonlinear Hodge-like systems for 1-forms are studied, with an assumption equivalent to complete integrability substituted for the requirement of closure under exterior differentiation. The systems are placed in a variational…
The classical hypercontractive inequality for the noise operator on the discrete cube plays a crucial role in many of the fundamental results in the Analysis of Boolean functions, such as the KKL (Kahn-Kalai-Linial) theorem, Friedgut's…
Computational learning theory states that many classes of boolean formulas are learnable in polynomial time. This paper addresses the understudied subject of how, in practice, such formulas can be learned by deep neural networks.…
We establish an exponential error term for the renewal theorem in the context of products of random matrices, which is surprising compared with classical abelian cases. A key tool is the Fourier decay of the Furstenberg measures on the…
We study the most-informative Boolean function conjecture using a differential equation approach. This leads to a formulation of a functional inequality on finite-dimensional random variables. We also develop a similar inequality in the…
This text is based on a series of three expository lectures on a variety of topics related to "thin orbits," as delivered at Durham University's Easter School on "Dynamics and Analytic Number Theory" in April 2014. The first lecture reviews…
Monotone Boolean functions, and the monotone Boolean circuits that compute them, have been intensively studied in complexity theory. In this paper we study the structure of Boolean functions in terms of the minimum number of negations in…
Here we revisit the quantum algorithms for obtaining Forrelation [Aaronson et al, 2015] values to evaluate some of the well-known cryptographically significant spectra of Boolean functions, namely the Walsh spectrum, the cross-correlation…
Let $\mathscr{F}_{n,d}$ be the class of all functions $f:\{-1,1\}^n\to[-1,1]$ on the $n$-dimensional discrete hypercube of degree at most $d$. In the first part of this paper, we prove that any (deterministic or randomized) algorithm which…
Fourier transforms are ubiquitous mathematical tools in basic and applied sciences. We here report classical and quantum optical realizations of the discrete fractional Fourier transform, a generalization of the Fourier transform. In the…