Related papers: A Hypercontractive Inequality for Matrix-Valued Fu…

We show that certain statements related to the Fourier-Walsh expansion of functions with respect to a biased measure on the discrete cube can be deduced from the respective results for the uniform measure by a simple reduction. In…

In this paper we develop the theory of quantum reverse hypercontractivity inequalities and show how they can be derived from log-Sobolev inequalities. Next we prove a generalization of the Stroock-Varopoulos inequality in the…

The goal of the present paper is to introduce and study noncommutative Hardy spaces associated with the regular $\Lambda$-polyball, to develop a functional calculus on noncommutative Hardy spaces for the completely non-coisometric (c.n.c.)…

We present new algorithms to compute fundamental properties of a Boolean function given in truth-table form. Specifically, we give an O(N^2.322 log N) algorithm for block sensitivity, an O(N^1.585 log N) algorithm for `tree decomposition,'…

A function defined on the Boolean hypercube is $k$-Fourier-sparse if it has at most $k$ nonzero Fourier coefficients. For a function $f: \mathbb{F}_2^n \rightarrow \mathbb{R}$ and parameters $k$ and $d$, we prove a strong upper bound on the…

We show, under natural assumptions for qubit systems, that measurement-based quantum computations (MBQCs) which compute a non-linear Boolean function with high probability are contextual. The class of contextual MBQCs includes an example…

Keller and Kindler recently established a quantitative version of the famous Benjamini~--Kalai--Schramm Theorem on noise sensitivity of Boolean functions. The result was extended to the continuous Gaussian setting by Keller, Mossel and Sen…

In this note we consider Boolean functions defined on the discrete cube equipped with a biased product probability measure. We prove that if the spectrum of such a function is concentrated on the first two Fourier levels, then the function…

A function $f:\ \{-1,1\}^n\rightarrow \mathbb{R}$ is called pseudo-Boolean. It is well-known that each pseudo-Boolean function $f$ can be written as $f(x)=\sum_{I\in {\cal F}}\hat{f}(I)\chi_I(x),$ where ${\cal F}\subseteq \{I:\ I\subseteq…

A Sobolev type embedding for radially symmetric functions on the unit ball $B$ in $\mathbb R^n$, $n\geq 3$, into the variable exponent Lebesgue space $L_{2^\star + |x|^\alpha} (B)$, $2^\star = 2n/(n-2)$, $\alpha>0$, is known due to J.M. do…

Research on quantum computing has recently gained significant momentum since first physical devices became available. Many quantum algorithms make use of so-called oracles that implement Boolean functions and are queried with highly…

Given any ${\bf{a}}: = \left( {a_1 ,a_2 , \ldots ,a_n } \right)$ and ${\bf{b}}: = \left( {b_1 ,b_2 , \ldots ,b_n } \right)$ in $\mathbb{R}^n$. The $\textbf{n}$-fold convex function defined on $\left[ {{\bf{a}},{\bf{b}}} \right]$,…

Categorical data plays an important part in machine learning research and appears in a variety of applications. Models that can express large classes of real-valued functions on the Boolean cube are useful for problems involving…

Hypercontractivity is one of the most powerful tools in Boolean function analysis. Originally studied over the discrete hypercube, recent years have seen increasing interest in extensions to settings like the $p$-biased cube, slice, or…

A sharp isoperimetric inequality for the Hamming cube is proved at the critical exponent $\beta=\frac12$. This follows up on previous work, where such bounds were established for $\beta$ near $\frac12$. As a consequence, this result settles…

We study the deterministic query complexity of Boolean functions on slices of the hypercube. The $k^{th}$ slice $\binom{[n]}{k}$ of the hypercube $\{0,1\}^n$ is the set of all $n$-bit strings with Hamming weight $k$. We show that there…

This paper considers the Fourier transform over the slice of the Boolean hypercube. We prove a relationship between the Fourier coefficients of a function over the slice, and the Fourier coefficients of its restrictions. As an application,…

This paper describes a fundamental correspondence between Boolean functions and projection operators in Hilbert space. The correspondence is widely applicable, and it is used in this paper to provide a common mathematical framework for the…

We study nondeterministic quantum algorithms for Boolean functions f. Such algorithms have positive acceptance probability on input x iff f(x)=1. In the setting of query complexity, we show that the nondeterministic quantum complexity of a…

We give new quantum algorithms for evaluating composed functions whose inputs may be shared between bottom-level gates. Let $f$ be an $m$-bit Boolean function and consider an $n$-bit function $F$ obtained by applying $f$ to conjunctions of…