English
Related papers

Related papers: Strong Chain Rules for Min-Entropy under Few Bits …

200 papers

Subentropy is an entropy-like quantity that arises in quantum information theory; for example, it provides a tight lower bound on the accessible information for pure state ensembles, dual to the von Neumann entropy upper bound in Holevo's…

Quantum Physics · Physics 2015-12-31 Nilanjana Datta , Tony Dorlas , Richard Jozsa , Fabio Benatti

The paper suggests the concepts of an upper entropy and a lower entropy. We propose a new axiomatic definition, namely, upper entropy axioms, inspired by axioms of metric spaces, and also formulate lower entropy axioms. We also develop weak…

Probability · Mathematics 2015-06-22 Jin-Li Guo , Qi Suo

The minimum error entropy (MEE) criterion has been successfully used in fields such as parameter estimation, system identification and the supervised machine learning. There is in general no explicit expression for the optimal MEE estimate…

Information Theory · Computer Science 2015-04-14 Badong Chen , Guangmin Wang , Nanning Zheng , Jose C. Principe

Mobile sensor data has been proposed for security-critical applications such as device pairing, proximity detection, and continuous authentication. However, the foundational premise that these signals provide sufficient entropy remains…

Cryptography and Security · Computer Science 2025-10-28 Carlton Shepherd , Elliot Hurley

A definition of the nonadditive (nonextensive) conditional entropy indexed by q is presented. Based on the composition law in terms of it, the Shannon-Khinchin axioms are generalized and the uniqueness theorem is established for the Tsallis…

Quantum Physics · Physics 2007-05-23 Sumiyoshi Abe , A. K. Rajagopal

One of the earliest models of weak randomness is the Chor-Goldreich (CG) source. A $(t,n,k)$-CG source is a sequence of random variables $X=(X_1,\dots,X_t)\sim(\{0,1\}^n)^t$, where each $X_i$ has min-entropy $k$ conditioned on any fixing of…

Computational Complexity · Computer Science 2024-10-11 Jesse Goodman , Xin Li , David Zuckerman

Rare events attract more attention and interests in many scenarios of big data such as anomaly detection and security systems. To characterize the rare events importance from probabilistic perspective, the message importance measure (MIM)…

Information Theory · Computer Science 2019-01-07 Rui She , Shanyun Liu , Pingyi Fan

Maximum entropy models are increasingly being used to describe the collective activity of neural populations with measured mean neural activities and pairwise correlations, but the full space of probability distributions consistent with…

Biological Physics · Physics 2017-08-22 Badr F. Albanna , Christopher Hillar , Jascha Sohl-Dickstein , Michael R. DeWeese

We address the task of compression of fermionic quantum information. Due to the parity superselection rule, differently from the case of encoding of quantum information in qubit states, part of the information carried by fermionic systems…

Quantum Physics · Physics 2025-03-31 Paolo Perinotti , Alessandro Tosini , Leonardo Vaglini

Entropy quantifies the number of bits required to store objects under certain given assumptions. While this is a well established concept for strings, in the context of tries the state-of-the-art regarding entropies is less developed. The…

Data Structures and Algorithms · Computer Science 2025-12-15 Lorenzo Carfagna , Carlo Tosoni

Quantifying the similarity between symbolic sequences is a traditional problem in Information Theory which requires comparing the frequencies of symbols in different sequences. In numerous modern applications, ranging from DNA over music to…

Physics and Society · Physics 2016-04-18 Martin Gerlach , Francesc Font-Clos , Eduardo G. Altmann

Shannon Entropy is the preeminent tool for measuring the level of uncertainty (and conversely, information content) in a random variable. In the field of communications, entropy can be used to express the information content of given…

Information Theory · Computer Science 2024-11-06 Bill Kay , Audun Myers , Thad Boydston , Emily Ellwein , Cameron Mackenzie , Iliana Alvarez , Erik Lentz

This monograph presents a unified treatment of single- and multi-user problems in Shannon's information theory where we depart from the requirement that the error probability decays asymptotically in the blocklength. Instead, the error…

Information Theory · Computer Science 2015-04-13 Vincent Y. F. Tan

We consider the information flow on a system's observable $X$ corresponding to a positive-operator valued measure under a quantum measurement process $Y$ described by a completely positive instrument from the viewpoint of the relative…

Quantum Physics · Physics 2015-04-07 Yui Kuramochi , Masahito Ueda

The problem of lossless data compression with side information available to both the encoder and the decoder is considered. The finite-blocklength fundamental limits of the best achievable performance are defined, in two different versions…

Information Theory · Computer Science 2021-02-23 Lampros Gavalakis , Ioannis Kontoyiannis

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…

Quantum Physics · Physics 2008-02-13 Remigiusz Augusiak , Julia Stasińska , Pawel Horodecki

For a subexponential density, so far, there has been no positive conclusion or counter example to show whether it is almost decreasing. In this paper, a subexponential density supported on $\mathbb{R}^+\cup\{0\}$ without the almost decrease…

Probability · Mathematics 2018-08-21 Tao Jiang , Yuebao Wang , Zhaolei Cui

We explore the relation between entanglement entropy of quantum many body systems and the distribution of corresponding, properly selected, observables. Such a relation is necessary to actually measure the entanglement entropy. We show that…

Statistical Mechanics · Physics 2009-11-11 Israel Klich , Gil Refael , Alessandro Silva

Shannon's entropy power inequality (EPI) can be viewed as a statement of concavity of an entropic function of a continuous random variable under a scaled addition rule: $$f(\sqrt{a}\,X + \sqrt{1-a}\,Y) \ge a f(X) + (1-a) f(Y) \quad \forall…

Quantum Physics · Physics 2016-06-06 Koenraad Audenaert , Nilanjana Datta , Maris Ozols

Preserving biodiversity and ecosystem stability is a challenge that can be pursued through modern statistical mechanics modeling. Here we introduce a variational maximum entropy-based algorithm to evaluate the entropy in a minimal ecosystem…

Biological Physics · Physics 2018-10-17 Mattia Miotto , Lorenzo Monacelli