Fourier analysis on the discrete hypercubes $\{-1,1\}^n$ has found numerous applications in learning theory. A recent breakthrough involves the use of a classical result from Fourier analysis, the Bohnenblust--Hille inequality, in the context of learning low-degree Boolean functions. In these lecture notes, we explore this line of research and discuss recent progress in discrete quantum systems and classical Fourier analysis.Fourier analysis on the discrete hypercubes $\{-1,1\}^n$ has found numerous applications in learning theory. A recent breakthrough involves the use of a classical result from Fourier analysis, the Bohnenblust--Hille inequality, in the context of learning low-degree Boolean functions. In these lecture notes, we explore this line of research and discuss recent progress in discrete quantum systems and classical Fourier analysis.

arXiv:2409.10886Sep 17, 20240 citations

Fourier analysis on the discrete hypercubes

\{-1,1\}^n

has found numerous applications in learning theory. A recent breakthrough involves the use of a classical result from Fourier analysis, the Bohnenblust--Hille inequality, in the context of learning low-degree Boolean functions. In these lecture notes, we explore this line of research and discuss recent progress in discrete quantum systems and classical Fourier analysis.