English
Related papers

Related papers: Tight entropy bound based on p-quasinorms

200 papers

We define a one-parameter family of entropies, each assigning a real number to any probability measure on a compact metric space (or, more generally, a compact Hausdorff space with a notion of similarity between points). These entropies…

Metric Geometry · Mathematics 2020-12-17 Tom Leinster , Emily Roff

Entropy is a fundamental property of both classical and quantum systems, spanning myriad theoretical and practical applications in physics and computer science. We study the problem of obtaining estimates to within a multiplicative factor…

Quantum Physics · Physics 2021-11-23 Tom Gur , Min-Hsiu Hsieh , Sathyawageeswar Subramanian

This paper derives bounds for two omnipresent information theoretic measures, the Shannon entropy and its complementary dual, the extropy. Based on a large size data set from a logconcave model, the said bounds are obtained for the entropy…

Statistics Theory · Mathematics 2025-07-21 Konstantinos Zografos

In this paper, we study entropic uncertainty relations on a finite-dimensional Hilbert space and provide several tighter bounds for multi-measurements, with some of them also valid for R\'{e}nyi and Tsallis entropies besides the Shannon…

Quantum Physics · Physics 2016-05-02 Yunlong Xiao , Naihuan Jing , Shao-Ming Fei , Tao Li , Xianqing Li-Jost , Teng Ma , Zhi-Xi Wang

We discuss algorithms for estimating the Shannon entropy h of finite symbol sequences with long range correlations. In particular, we consider algorithms which estimate h from the code lengths produced by some compression algorithm. Our…

Statistical Mechanics · Physics 2017-04-24 Thomas Schürmann , Peter Grassberger

For a measurable map $T$ and a sequence of $T$-invariant probability measures $\mu_n$ that converges in some sense to a $T$-invariant probability measure $\mu$, an estimate from below for the Kolmogorov--Sinai entropy of $T$ with respect to…

Dynamical Systems · Mathematics 2014-08-08 B. Gurevich

We prove lower bounds for the entanglement of formation and the squashed entanglement for any a bipartite density matrix in terms of the conditional entropy of the bipartite state with respect to either of its partial traces, and prove that…

Quantum Physics · Physics 2015-06-04 Eric A. Carlen , Elliott H. Lieb

We conclude a sequence of work by giving near-optimal sketching and streaming algorithms for estimating Shannon entropy in the most general streaming model, with arbitrary insertions and deletions. This improves on prior results that obtain…

Data Structures and Algorithms · Computer Science 2008-12-18 Nicholas J. A. Harvey , Jelani Nelson , Krzysztof Onak

We derive again the upper entropy bound for a charged object by employing thermodynamics of the Kerr-Newman black hole linearised with respect to its electric charge

General Relativity and Quantum Cosmology · Physics 2015-06-25 B. Linet

We investigate the additivity properties for both bipartite and multipartite systems by using entropic uncertainty relations (EUR) defined in terms of the joint Shannon entropy of probabilities of local measurement outcomes. In particular,…

Quantum Physics · Physics 2025-02-25 Alberto Riccardi , Giovanni Chesi , Chiara Macchiavello , Lorenzo Maccone

Information plays an important role in our understanding of the physical world. We hence propose an entropic measure of information for any physical theory that admits systems, states and measurements. In the quantum and classical world,…

Quantum Physics · Physics 2010-05-04 Anthony J. Short , Stephanie Wehner

The precise one-shot characterisation of operational tasks in classical and quantum information theory relies on different forms of smooth entropic quantities. A particularly important connection is between the hypothesis testing relative…

Quantum Physics · Physics 2026-04-29 Bartosz Regula , Ludovico Lami , Nilanjana Datta

We present a method for computing the topological entropy of one-dimensional maps. As an approximation scheme, the algorithm converges rapidly and provides both upper and lower bounds.

chao-dyn · Physics 2009-10-22 N. J. Balmforth , E. A. Spiegel , C. Tresser

We show how to improve the semicontinuity bounds in [1] by optimizing the proof of the basic technical lemma. In this optimization we apply the modified version of the trick used in the resent article [2]. The most important applications…

Quantum Physics · Physics 2024-09-18 M. E. Shirokov

Shannon entropy is widely used to quantify the uncertainty of discrete random variables. But when normalized to the unit interval, as is often done in practice, it no longer conveys the alphabet sizes of the random variables being studied.…

Information Theory · Computer Science 2022-07-26 John Çamkıran

It is well known that to estimate the Shannon entropy for symbolic sequences accurately requires a large number of samples. When some aspects of the data are known it is plausible to attempt to use this to more efficiently compute entropy.…

Data Analysis, Statistics and Probability · Physics 2018-05-18 Andrew D. Back , Daniel Angus , Janet Wiles

We derive exact values and new bounds for the Shannon capacity of two families of graphs: the $q$-Kneser graphs and the tadpole graphs. We also construct a countably infinite family of connected graphs whose Shannon capacity is not attained…

Combinatorics · Mathematics 2026-01-28 Nitay Lavi , Igal Sason

The Renyi entropy plays an essential role in quantum information theory. We study the continuity estimation of the Renyi entropy. An inequality relating the Renyi entropy difference of two quantum states to their trace norm distance is…

Quantum Physics · Physics 2017-01-11 Zhihua Chen , Zhihao Ma , Ismail Nikoufar , Shaoming Fei

We explore asymptotically optimal bounds for deviations of Bernoulli convolutions from the Poisson limit in terms of the Shannon relative entropy and the Pearson $\chi^2$-distance. The results are based on proper non-uniform estimates for…

Probability · Mathematics 2019-08-13 S. G. Bobkov , G. P. Chistyakov , F. Götze

We prove a Bernstein-type bound for the difference between the average of negative log-likelihoods of independent discrete random variables and the Shannon entropy, both defined on a countably infinite alphabet. The result holds for the…

Information Theory · Computer Science 2021-06-24 Yunpeng Zhao
‹ Prev 1 3 4 5 6 7 10 Next ›