Related papers: A Hypercontractive Inequality for Matrix-Valued Fu…
We generalize the concepts of weak quantum logarithmic Sobolev inequality (LSI) and weak hypercontractivity (HC), introduced in the quantum setting by Olkiewicz and Zegarlinski, to the case of non-primitive quantum Markov semigroups (QMS).…
We explore the fundamental origin of the quantum advantage behind random access code. We propose new temporal inequalities compatible with noninvasive-realist models and show that any non-zero quantum advantage of n bits encoded to 1-bit…
Many applications of quantum computing in the near term rely on variational quantum circuits (VQCs). They have been showcased as a promising model for reaching a quantum advantage in machine learning with current noisy intermediate scale…
We prove the Courtade-Kumar conjecture, which states that the mutual information between any Boolean function of an $n$-dimensional vector of independent and identically distributed inputs to a memoryless binary symmetric channel and the…
This note contains two simple observations. First, by the weak factorization of product $H^1$ (Ferguson--Lacey, Lacey--Terwilleger), we obtain a multi-parameter analogue of Hardy's inequality. Second, as a dual statement, the Fourier…
In this paper we give a simple proof of inequalities of integrals of functions which are the composition of nonnegative continous convex functions on a vector space ${\bf R}^m$ and vector-valued functions in a weakly compact subset of a…
This is a continuation of our previous work 0712.4092. It is well known that various isoperimetric inequalities imply their functional ``counterparts'', but in general this is not an equivalence. We show that under certain convexity…
By using optimal mass transportation and a quantitative H\"older inequality, we provide estimates for the Borell-Brascamp-Lieb deficit on complete Riemannian manifolds. Accordingly, equality cases in Borell-Brascamp-Lieb inequalities…
The strongly correlated systems we use to realise quantum error-correcting codes may give rise to high-weight, problematic errors. Encouragingly, we can expect local quantum error-correcting codes with no string-like logical operators $-$…
In 1931 Bohnenblust and Hille proved that for each m-homogeneous polynomial $\sum_{|\alpha| = m} a_\alpha z^\alpha$ on $\C^n$ the $\ell^{\frac{2m}{m+1}}$-norm of its coefficients is bounded from above by a constant $C_m$ (depending only on…
High-rate concatenated quantum codes offer a promising pathway toward fault-tolerant quantum computation, yet designing efficient decoders that fully exploit their error-correction capability remains a significant challenge. In this work,…
Consider the linear space of functions on the binary hypercube and the linear operator $S_\delta$ acting by averaging a function over a Hamming sphere of radius $\delta n$ around every point. It is shown that this operator has a…
Let $ m, n $ be integers such that $ \frac{n}{2} > m \geq 1 $ and let $ (M, g) $ be a closed $ n-$dimensional Riemannian manifold. We prove there exists some $ B \in \mathbb{R} $ depending only on $ (M, g) $, $ m $, and $ n $ such that for…
By using a new way to encode Boolean functions in a reversible gate, an algorithm is developed in quantum computing over Z_2, symbolized QC/2, (as opposed to QC over C) that needs only one function evaluation to solve the Grover Database…
We prove an inequality for functions on the discrete cube extending the edge-isoperimetric inequality for sets. This inequality turns out to be equivalent to the following claim about random walks on the cube: Subcubes maximize 'mean first…
We show an equivalence between 1-query quantum algorithms and representations by degree-2 polynomials. Namely, a partial Boolean function $f$ is computable by a 1-query quantum algorithm with error bounded by $\epsilon<1/2$ iff $f$ can be…
In this note, we study a quantitative extension of the John-Nirenberg inequality for the Hardy-Littlewood maximal function of a $\operatorname{BMO}$ function. More precisely, for every nonconstant locally integrable function $f$ such that…
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…
We study the extremal competitive ratio of Boolean function evaluation. We provide the first non-trivial lower and upper bounds for classes of Boolean functions which are not included in the class of monotone Boolean functions. For the…
In this paper, we establish a new bound tying together the effective length and the maximum correlation between the outputs of an arbitrary pair of Boolean functions which operate on two sequences of correlated random variables. We derive a…