Related papers: A Hypercontractive Inequality for Matrix-Valued Fu…
We investigate what we term "generalized sup-convolutions". We show that functional inequalities that enjoy an interpretation as sup-convolution inequalities can be deduced from the special case of indicator functions corresponding to a…
We prove a version of the quantum de Finetti theorem: permutation-invariant quantum states are well approximated as a probabilistic mixture of multi-fold product states. The approximation is measured by distinguishability under fully…
Most correlation inequalities for high-dimensional functions in the literature, such as the Fortuin-Kasteleyn-Ginibre (FKG) inequality and the celebrated Gaussian Correlation Inequality of Royen, are qualitative statements which establish…
We show that almost all n-bit Boolean functions have bounded-error quantum query complexity at least n/2, up to lower-order terms. This improves over an earlier n/4 lower bound of Ambainis, and shows that van Dam's oracle interrogation is…
Several classes of quantum circuits have been shown to provide a quantum computational advantage under certain assumptions. The study of ever more restricted classes of quantum circuits capable of quantum advantage is motivated by possible…
We prove an analogue of Bonami's (hypercontractive) lemma for complex-valued functions on $\mathcal{L}(V,W)$, where $V$ and $W$ are vector spaces over a finite field. This inequality is useful for functions on $\mathcal{L}(V,W)$ whose…
In this work we revisit the Boolean Hidden Matching communication problem, which was the first communication problem in the one-way model to demonstrate an exponential classical-quantum communication separation. In this problem, Alice's…
We prove the Courtade-Kumar conjecture, for several classes of n-dimensional Boolean functions, for all $n \geq 2$ and for all values of the error probability of the binary symmetric channel, $0 \leq p \leq 1/2$. This conjecture states that…
This paper gives a nearly tight characterization of the quantum communication complexity of the permutation-invariant Boolean functions. With such a characterization, we show that the quantum and randomized communication complexity of the…
Fourier analysis on the Boolean hypercube is fundamentally defined as the orthogonal decomposition of the space of pseudo-Boolean functions with respect to the uniform probability measure. In this work, we propose an ANOVA-based…
Infinite-dimensional, holomorphic functions have been studied in detail over the last several decades, due to their relevance to parametric differential equations and computational uncertainty quantification. The approximation of such…
We prove strong hypercontractivity (SHC) inequalities for logarithmically subharmonic functions on $\RR^n$ and different classes of measures: Gaussian measures on $\RR^n$, symmetric Bernoulli and symmetric uniform probability measures on…
For positive definite matrices $A$ and $B$, the Araki-Lieb-Thirring inequality amounts to an eigenvalue log-submajorisation relation for fractional powers $$\lambda(A^t B^t) \prec_{w(\log)} \lambda^t(AB), \quad 0<t\le 1,$$ while for…
Consider a point-to-point communication system in which the transmitter holds a binary message of length $m$ and transmits a corresponding codeword of length $n$. The receiver's goal is to recover a Boolean function of that message, where…
The problem of learning Boolean linear functions from quantum examples w.r.t. the uniform distribution can be solved on a quantum computer using the Bernstein-Vazirani algorithm. A similar strategy can be applied in the case of noisy…
We strengthen, in two different ways, the so called Borell-Brascamp- Lieb inequality in the class of power concave functions with compact support. As examples of applications we obtain two quantitative versions of the Brunn- Minkowski…
We develop a new technique for proving concentration inequalities which relate between the variance and influences of Boolean functions. Using this technique, we 1. Settle a conjecture of Talagrand [Tal97] proving that $$\int_{\left\{…
Quantum computing is a promising new area of computing with quantum algorithms offering a potential speedup over classical algorithms if fault tolerant quantum computers can be built. One of the first applications of the classical computer…
In this paper we develop a general theoretical tool for the establishment of the boundedness of notoriously difficult operators (such as potentials) on certain specific types of rearrangement-invariant function spaces from analogous…
We study the dimensional Brunn-Minkowski inequality for even log-concave probability measures $\mu$ on $\mathbb{R}^n$ via an analytic approach based on diffusion operators and gradient estimates. Our main result asserts that for every pair…