English
Related papers

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

200 papers

This paper makes two contributions towards determining some well-studied optimal constants in Fourier analysis \newa{of Boolean functions} and high-dimensional geometry. \begin{enumerate} \item It has been known since 1994 \cite{GL:94} that…

Computational Complexity · Computer Science 2013-05-06 Anindya De , Ilias Diakonikolas , Rocco A. Servedio

Let f:{-1,1}^n -> R be a real function on the hypercube, given by its discrete Fourier expansion, or, equivalently, represented as a multilinear polynomial. We say that it is Boolean if its image is in {-1,1}. We show that every function on…

Discrete Mathematics · Computer Science 2013-11-13 Tom Gur , Omer Tamuz

Quasi-Monte Carlo (QMC) methods for high dimensional integrals over unit cubes and products of spheres are well-studied in literature. We study QMC tractability of integrals of functions defined over the product of $m$ copies of the simplex…

Numerical Analysis · Mathematics 2015-04-29 Kinjal Basu

We prove a new vectorial functional inequality of Poincar\'{e}-Beckner type. The inequality may be interpreted as an entropy-entropy production one for a gradient flow in the metric space of Radon measures. The proof uses subtle analysis of…

Functional Analysis · Mathematics 2019-08-09 S. Kondratyev , L. Monsaingeon , D. Vorotnikov

We examine the number T of queries that a quantum network requires to compute several Boolean functions on {0,1}^N in the black-box model. We show that, in the black-box model, the exponential quantum speed-up obtained for partial functions…

Quantum Physics · Physics 2007-05-23 Robert Beals , Harry Buhrman , Richard Cleve , Michele Mosca , Ronald de Wolf

Talagran's correlation inequality provides quantitative lower bounds on the covariance of two increasing Boolean functions in terms of their coordinate influences, but, in general, a logarithmic loss is necessary. Motivated by a question of…

Combinatorics · Mathematics 2026-05-19 Fan Chang , Yu Chen

The hypercontractivity is proved for the Markov semigroup associated to a class of finite/infinite dimensional stochastic Hamiltonian systems. Consequently, the Markov semigroup is exponentially convergent to the invariant probability…

Probability · Mathematics 2016-12-08 Feng-Yu Wang

This paper presents a novel framework for high-dimensional nonlinear quantum computation that exploits tensor products of amplified vector and matrix encodings to efficiently evaluate multivariate polynomials. The approach enables the…

Quantum Physics · Physics 2025-10-01 Matthias Deiml , Daniel Peterseim

In this paper, we establish a new inequality 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…

Information Theory · Computer Science 2017-02-07 Farhad Shirani , S. Sandeep Pradhan

We study functional inequalities (Poincar\'e, Cheeger, log-Sobolev) for probability measures obtained as perturbations. Several explicit results for general measures as well as log-concave distributions are given.The initial goal of this…

Probability · Mathematics 2021-01-28 Patrick Cattiaux , Arnaud Guillin

The logarithmic Sobolev inequality for the Hamming cube {0,1}^n states that for any real-valued function f on the cube holds E(f,f) \ge 2 Ent(f^2), where E(f,f) is the appropriate Dirichlet form (also known as "sum of influences"). We show…

Combinatorics · Mathematics 2008-07-11 Alex Samorodnitsky

A $\{00,01,10,11\}$-valued function on the vertices of the $n$-cube is called a $t$-resilient $(n,2)$-function if it has the same number of $00$s, $01$s, $10$s and $11$s among the vertices of every subcube of dimension $t$. The Friedman and…

Combinatorics · Mathematics 2019-02-04 Denis S. Krotov

In the paper we study the infimum convolution inequalites. Such an inequality was first introduced by B. Maurey to give the optimal concentration of measure behaviour for the product exponential measure. We show how IC-inequalities are tied…

Probability · Mathematics 2014-09-19 Rafał Latała , Jakub Onufry Wojtaszczyk

The conventional paradigm of quantum computing is discrete: it utilizes discrete sets of gates to realize bitstring-to-bitstring mappings, some of them arguably intractable for classical computers. In parameterized quantum approaches, the…

Quantum Physics · Physics 2025-12-12 Adrián Pérez-Salinas , Mahtab Yaghubi Rad , Alice Barthe , Vedran Dunjko

We prove an intrinsic equivalence between strong hypercontractivity and a strong logarithmic Sobolev inequality for the cone of logarithmically subharmonic functions. We introduce a new large class of measures, Euclidean regular and…

Functional Analysis · Mathematics 2019-08-15 Piotr Graczyk , Todd Kemp , Jean-Jacques Loeb

A quantum algorithm is exact if, on any input data, it outputs the correct answer with certainty (probability 1). A key question is: how big is the advantage of exact quantum algorithms over their classical counterparts: deterministic…

Quantum Physics · Physics 2014-07-11 Andris Ambainis

In this paper, we show that every $(2^{n-1}+1)$-vertex induced subgraph of the $n$-dimensional cube graph has maximum degree at least $\sqrt{n}$. This result is best possible, and improves a logarithmic lower bound shown by Chung, F\"uredi,…

Combinatorics · Mathematics 2019-09-02 Hao Huang

Boolean functions on the space $F_{2}^m$ are not only important in the theory of error-correcting codes, but also in cryptography, where they occur in private key systems. In these two cases, the nonlinearity of these function is a main…

Number Theory · Mathematics 2015-06-26 Francois Rodier

A Boolean function on n variables is q-resilient if for any subset of at most q variables, the function is very likely to be determined by a uniformly random assignment to the remaining n-q variables; in other words, no coalition of at most…

Computational Complexity · Computer Science 2016-04-19 Raghu Meka

This note is concerned with an extension, at second order, of an inequality on the discrete cube $C_n=\{-1,1\}$ (equipped with the uniform measure) due to Talagrand (\cite{TalL1L2}). As an application, the main result of this note is a…

Probability · Mathematics 2019-10-22 Kevin Tanguy