Related papers: Quantum reverse hypercontractivity: its tensorizat…
In this paper, we introduce and study the class of {\it enriched strictly pseudocontractive mappings} in Hilbert spaces and extend the corresponding convergence theorem (Theorem 12) in [Browder, F. E., Petryshyn, W. V., {\it Construction of…
The ultimate limits of quantum state discrimination are often thought to be captured by asymptotic bounds that restrict the achievable error probabilities, notably the quantum Chernoff and Hoeffding bounds. Here we study hypothesis testing…
The purpose of this article is to expose an algebraic closure property of supersolutions to certain diffusion equations. This closure property quickly gives rise to a monotone quantity which generates a hypercontractivity inequality. Our…
How violently do two quantum operators disagree? Different fields of physics feature different measures of incompatibility: (i) In quantum information theory, entropic uncertainty relations constrain measurement outcomes. (ii) In condensed…
The main contribution of this paper is a strong converse result for $K$-hop distributed hypothesis testing against independence with multiple (intermediate) decision centers under a Markov condition. Our result shows that the set of type-II…
The support recovery problem consists of determining a sparse subset of a set of variables that is relevant in generating a set of observations, and arises in a diverse range of settings such as compressive sensing, and subset selection in…
There is a one-to-one correspondence between strong inversions on knots in the three-sphere and a special class of four-ended tangles. We compute the reduced Khovanov homology of such tangles for all strong inversions on knots with up to 9…
This is a comprehensive review on fault-tolerant topological quantum computation with the surface codes. The basic concepts and useful tools underlying fault-tolerant quantum computation, such as universal quantum computation, stabilizer…
We consider classical message transmission under entanglement assistance for compound memoryless and arbitrarily varying quantum channels. In both cases, we prove general coding theorems together with corresponding weak converse bounds. In…
We investigate the classical communication over quantum channels when assisted by no-signaling (NS) and positive-partial-transpose-preserving (PPT) codes, for which both the optimal success probability of a given transmission rate and the…
We establish a family of coercive Korn-type inequalities for generalised incompatible fields in the superlinear growth regime under sharp criteria. This extends and unifies several previously known inequalities that are pivotal to 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…
Traditional uncertainty relations dictate a minimal amount of noise in incompatible projective quantum measurements. However, not all measurements are projective. Weak measurements are minimally invasive methods for obtaining partial state…
In this paper, we study the strong convergence of an algorithm to solve the variational inequality problem which extends(Thong et al, Numerical Algorithms. 78, 1045-1060 (2018)). We have reduced and refined some of their algorithm's…
We prove that the exponent of the entropy of one dimensional projections of a log-concave random vector defines a 1/5-seminorm. We make two conjectures concerning reverse entropy power inequalities in the log-concave setting and discuss…
In this paper, we generalize the log-Sobolev inequalities to R\'enyi--Sobolev inequalities by replacing the entropy with the two-parameter entropy, which is a generalized version of entropy and closely related to R\'enyi divergences. We…
We derive upper bounds on the rate of transmission of classical information over quantum channels by block codes with a given blocklength and error probability, for both entanglement-assisted and unassisted codes, in terms of a unifying…
This paper introduces a notion of gradient and an infimal-convolution operator that extend properties of solutions of Hamilton Jacobi equations to more general spaces, in particular to graphs. As a main application, the hypercontractivity…
We find a tight characterization of the strong converse exponent for randomness extraction against quantum side information. In contrast to previous tight bounds, we employ a composable error criterion given by the fidelity (or purified…
Reverse H\"{o}lder inequalities for a class of functions on a probability space constitute an important tool in Analysis in Probability. After revisiting how a (modified) log-Sobolev inequality can be used to derive reverse H\"{o}lder…