相关论文: A Hypercontractive Inequality for Matrix-Valued Fu…

In hypercube approach to correlation functions in Chern-Simons theory (knot polynomials) the central role is played by the numbers of cycles, in which the link diagram is decomposed under different resolutions. Certain functions of these…

We study how well functions over the boolean hypercube of the form $f_k(x)=(|x|-k)(|x|-k-1)$ can be approximated by sums of squares of low-degree polynomials, obtaining good bounds for the case of approximation in $\ell_{\infty}$-norm as…

In this paper we study the complexity of quantum query algorithms computing the value of Boolean function and its relation to the degree of algebraic polynomial representing this function. We pay special attention to Boolean functions with…

It is well known that some important Markov semi-groups have a "regularization effect" -- as for example the hypercontractivity property of the noise operator on the Boolean hypercube or the Ornstein-Uhlenbeck semi-group on the real line,…

Bent functions, which are maximally nonlinear Boolean functions with even numbers of variables and whose Hamming distance to the set of all affine functions equals $2^{n-1}\pm 2^{\frac{n}{2}-1}$, were introduced by Rothaus in 1976 when he…

The vectorial Boolean functions are employed in cryptography to build block coding algorithms. An important criterion on these functions is their resistance to the differential cryptanalysis. Nyberg defined the notion of almost perfect…

We consider a version of the nearest-codeword problem on finite fields $\mathbb{F}_q$ using the Manhattan distance, an analog of the Hamming metric for non-binary alphabets. Similarly to other lattice related problems, this problem is…

The standard model of quantum circuits assumes operations are applied in a fixed sequential "causal" order. In recent years, the possibility of relaxing this constraint to obtain causally indefinite computations has received significant…

In this work we provide performance guarantees for hypocoercive non-reversible MCMC samplers $X_t$ with invariant measure $\mu_*$; our results apply in particular to the Langevin equation, Hamiltonian Monte-Carlo, and the bouncy particle…

This paper presents a new performance bound for estimation problems where the parameter to estimate lies in a Riemannian manifold (a smooth manifold endowed with a Riemannian metric) and follows a given prior distribution. In this setup,…

The matrix functions can be defined by Cauchy's integral formula and can be approximated by the linear combination of inverses of shifted matrices using a quadrature formula. In this paper, we show a concrete construction of a framework to…

We generalize the Beckner's type Poincar\'e inequality \cite{Beckner} to a large class of probability measures on an abstract Wiener space of the form $\mu\star\nu$, where $\mu$ is the reference Gaussian measure and $\nu$ is a probability…

The familiar second derivative test for convexity, combined with resolvent calculus, is shown to yield a useful tool for the study of convex matrix-valued functions. We demonstrate the applicability of this approach on a number of theorems…

Classically, Jensen's Inequality asserts that if $X$ is a compact convex set, and $f:K\to \mathbb{R}$ is a convex function, then for any probability measure $\mu$ on $K$, that $f(\text{bar}(\mu))\le \int f\;d\mu$, where $\text{bar}(\mu)$ is…

We prove that for any additive noise channel over $\mathbb{F}_q$, there exist error-correcting codes approaching channel capacity encodable by arithmetic circuits (with weighted addition gates) over $\mathbb{F}_q$ of size $O(n)$ and depth…

Bourgain's symmetrization theorem is a powerful technique reducing boolean analysis on product spaces to the cube. It states that for any product $\Omega_i^{\otimes d}$, function $f: \Omega_i^{\otimes d} \to \mathbb{R}$, and $q > 1$:…

Eigenvalues inequalities involving (log) convex/concav functions and Hermitian matrices, positive unital maps are considered. Simple proofs of Bhatia-Kittaneh inequality and Naimark dilation theorem are given.

We consider the problem of zero-error function computation with side information. Alice and Bob have correlated sources $X,Y$ with joint p.m.f. $p_{XY}(\cdot, \cdot)$. Bob wants to calculate $f(X,Y)$ with zero error. Alice encodes…

We prove that constant-depth quantum circuits are more powerful than their classical counterparts. To this end we introduce a non-oracular version of the Bernstein-Vazirani problem which we call the 2D Hidden Linear Function problem. An…

We prove a new inequality which improves on the classical Hardy inequality in the sense that a nonlinear integral quantity with super-quadratic growth, which is computed with respect to an inverse square weight, is controlled by the energy.…