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

Numerically solving partial differential equations is a ubiquitous computational task with broad applications in many fields of science. Quantum computers can potentially provide high-degree polynomial speed-ups for solving PDEs, however…

Certain trace inequalities related to matrix logarithm are shown. These results enable us to give a partial answer of the open problem conjectured by A.S.Holevo. That is, concavity of the auxiliary function which appears in the random…

For a hyponormal operator, C. R. Putnam's inequality gives an upper bound on the norm of its self-commutator. In the special case of a Toeplitz operator with analytic symbol in the Smirnov space of a domain, there is also a geometric lower…

The goal in function property testing is to determine whether a black-box Boolean function has a certain property or is epsilon-far from having that property. The performance of the algorithm is judged by how many calls need to be made to…

Since the seminal work of Paturi and Simon \cite[FOCS'84 & JCSS'86]{PS86}, the unbounded-error classical communication complexity of a Boolean function has been studied based on the arrangement of points and hyperplanes. Recently,…

Various miscellaneous functional inequalities are deduced for the so-called generalized inverse trigonometric and hyperbolic functions. For instance, functional inequalities for sums, difference and quotient of generalized inverse…

This study examines the potential for fault-tolerant quantum computers to provide utility in fluid dynamics simulations, with a focus on drag force calculations for ship hull design. We assess whether quantum algorithms can surpass…

A Boolean function $f$ on $n$ variables is said to be a bent function if the absolute value of all its Walsh coefficients is $2^{n/2}$. Our main result is a new asymptotic lower bound on the number of Boolean bent functions. It is based on…

Function inversion is the problem that given a random function $f: [M] \to [N]$, we want to find pre-image of any image $f^{-1}(y)$ in time $T$. In this work, we revisit this problem under the preprocessing model where we can compute some…

We study the notion of reverse hypercontractivity. We show that reverse hypercontractive inequalities are implied by standard hypercontractive inequalities as well as by the modified log-Sobolev inequality. Our proof is based on a new…

Contraction properties of transport maps between probability measures play an important role in the theory of functional inequalities. The actual construction of such maps, however, is a non-trivial task and, so far, relies mostly on the…

An inequality of Brascamp and Lieb provides a bound on the covariance of two functions with respect to log-concave measures. The bound estimates the covariance by the product of the $L^2$ norms of the gradients of the functions, where the…

The method of transfer functions is developed as a tool for studying Bell inequalities, alternative quantum theories and the associated physical properties of quantum systems. Non-negative probabilities for transfer functions result in…

Recent studies on stability and contractivity have highlighted the importance of semi-inner products, which we refer to as pairings, associated with general norms. A pairing is a binary operation that relates the derivative of a curve's…

Coded computing is a reliable and fault-tolerant mechanism for implementing large computing tasks over a distributed set of worker nodes. While a majority of coded computing frameworks address accurate computation of the target functions,…

Quantum annealing is a heuristic quantum algorithm which exploits quantum resources to minimize an objective function embedded as the energy levels of a programmable physical system. To take advantage of a potential quantum advantage, one…

We estimate linear functionals in the classical deconvolution problem by kernel estimators. We obtain a uniform central limit theorem with $\sqrt{n}$-rate on the assumption that the smoothness of the functionals is larger than the…

I. M. Milin proposed, in his 1971 paper, a system of inequalities for the logarithmic coefficients of normalized univalent functions on the unit disk of the complex plane. This is known as the Lebedev-Milin conjecture and implies the…

We study relaxations of entanglement-assisted quantum channel coding and establish that non-signaling assistance and a natural semi-definite programming relaxation\, -- \,termed meta-converse\, -- \,are equivalent in terms of success…

We define tests of boolean functions which distinguish between linear (or quadratic) polynomials, and functions which are very far, in an appropriate sense, from these polynomials. The tests have optimal or nearly optimal trade-offs between…