Related papers: Better bounds for the union-closed sets conjecture…
The Shapley-Folkman theorem shows that Minkowski averages of uniformly bounded sets tend to be convex when the number of terms in the sum becomes much larger than the ambient dimension. In optimization, Aubin and Ekeland [1976] show that…
Gaussian distribution of a quantum state with continuous spectrum is known to maximize the Shannon entropy at a fixed variance. Applying it to a pair of canonically conjugate quantum observables $\hat x$ and $\hat p$, quantum entropic…
We derive and implement a new way to find lower bounds on the smallest limiting trace-to-degree ratio of totally positive algebraic integers and improve the previously best known bound to 1.80203. Our method adds new constraints to Smyth's…
We consider the problem of hypothesis testing for discrete distributions. In the standard model, where we have sample access to an underlying distribution $p$, extensive research has established optimal bounds for uniformity testing,…
Entanglement is not only the resource that fuels many quantum technologies but also plays a key role for some of the most profound open questions of fundamental physics. Experiments controlling quantum systems at the single quantum level…
The best techniques for the constrained maximum-entropy sampling problem, a discrete-optimization problem arising in the design of experiments, are via a variety of concave continuous relaxations of the objective function. A standard…
Finding the minimal relative entropy of two quantum states under semidefinite constraints is a pivotal problem located at the mathematical core of various applications in quantum information theory. An efficient method for providing…
This note has a twofold purpose. To improve the best known lower estimates of the Hardy-Littlewood inequality for $m$-linear forms in $\ell_{p}$ spaces and to provide a closed formula encompassing the cases $p>2m$ and $% p=2m.$ Our approach…
Recently it was shown that if a given state fulfils the reduction criterion it must also satisfy the known entropic inequalities. Now the questions arises whether on the assumption that stronger criteria based on positive but not completely…
Evaluating the statistical dimension is a common tool to determine the asymptotic phase transition in compressed sensing problems with Gaussian ensemble. Unfortunately, the exact evaluation of the statistical dimension is very difficult and…
The Kneser--Poulsen conjecture asserts that the volume of a union of balls in Euclidean space cannot be increased by bringing their centres pairwise closer. We prove that its natural information-theoretic counterpart is true. This follows…
We present the generalized state-dependent entropic uncertainty relations in multiple measurements setting, and the optimal lower bound is obtained by considering different measurement sequences. We then apply this uncertainty relation to…
We discuss the approach to estimate aggregation and adaptive estimation based upon (nearly optimal) testing of convex hypotheses. We show that in the situation where the observations stem from {\em simple observation schemes} and where set…
The best bound known on 2-locally distillable entanglement is that of Vedral and Plenio, involving a certain measure of entanglement based on relative entropy. It turns out that a related argument can be used to give an even stronger bound;…
We use two available methods, the Duhem-Gibbs relation and the entropy formula in terms of particle phase space distributions, to calculate the entropy in a quark combination model. The entropy of the system extracted from the Duhem-Gibbs…
This paper revisits a fundamental problem in statistical inference from a non-asymptotic theoretical viewpoint $\unicode{x2013}$ the construction of confidence sets. We establish a finite-sample bound for the estimator, characterizing its…
We derive an optimal entropic uncertainty relation for an arbitrary pair of observables in a two-dimensional Hilbert space. Such a result, for the simple case we are considering, definitively improves all the entropic uncertainty relations…
Moment-closure methods are popular tools to simplify the mathematical analysis of stochastic models defined on networks, in which high dimensional joint distributions are approximated (often by some heuristic argument) as functions of lower…
We develop an information-theoretic approach to study the Kneser--Poulsen conjecture in discrete geometry. This leads us to a broad question regarding whether R\'enyi entropies of independent sums decrease when one of the summands is…
The entropy accumulation theorem states that the smooth min-entropy of an $n$-partite system $A = (A_1, \ldots, A_n)$ is lower-bounded by the sum of the von Neumann entropies of suitably chosen conditional states up to corrections that are…