Tumula information and doubly minimized Petz Renyi lautum information
- URL: http://arxiv.org/abs/2603.17005v1
- Date: Tue, 17 Mar 2026 18:00:05 GMT
- Title: Tumula information and doubly minimized Petz Renyi lautum information
- Abstract summary: We introduce the corresponding Petz Renyi version, which we call the doubly minimized Petz Renyi lautum information (PRLI)<n>We derive several general properties of these correlation measures and provide an operational interpretation in the context of hypothesis testing.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We study a doubly minimized variant of the lautum information - a reversed analogue of the mutual information - defined as the minimum relative entropy between any product state and a fixed bipartite quantum state; we refer to this measure as the tumula information. In addition, we introduce the corresponding Petz Renyi version, which we call the doubly minimized Petz Renyi lautum information (PRLI). We derive several general properties of these correlation measures and provide an operational interpretation in the context of hypothesis testing. Specifically, we show that the reverse direct exponent of certain binary quantum state discrimination problems is quantified by the doubly minimized PRLI of order $α\in (0,1/2)$, and that the Sanov exponent is determined by the tumula information. Furthermore, we investigate the extension of the tumula information to channels and compare its properties with previous results on the channel umlaut information [Girardi et al., arXiv:2503.21479].
Related papers
- On the Minimax Regret of Sequential Probability Assignment via Square-Root Entropy [70.10668953625247]
We show that the minimax regret for the case of no side information can be upper bounded in terms of sequential square-root entropy.<n>For the problem of sequential probability assignment with side information, we develop both upper and lower bounds based on the aforementioned entropy.
arXiv Detail & Related papers (2025-03-22T17:26:34Z) - Min-reflected entropy = doubly minimized Petz Renyi mutual information of order 1/2 [0.0]
We put the spotlight on the min-reflected entropy, i.e., the Renyi reflected entropy in the limit $n rightarrow infty$.<n>We show that, for general bipartite quantum states, this measure is identical to another measure originating from the field of quantum information theory.
arXiv Detail & Related papers (2025-02-25T18:27:38Z) - Rate-reliability tradeoff for deterministic identification [49.126395046088014]
We find that for positive exponents linear scaling is restored, now with a rate that is a function of the reliability exponents.<n>We also show that even if only one of the two errors is required to be exponentially small, the linearithmic scaling is lost.
arXiv Detail & Related papers (2025-02-04T15:09:14Z) - Doubly minimized Petz Renyi mutual information: Properties and operational interpretation from direct exponent [0.0]
The doubly minimized Petz Renyi mutual information of order $alphain (1/2,1)$ is defined as the minimization of the Petz divergence of order $alpha$ of a fixed bipartite quantum state.<n>We show that the direct exponent of certain binary quantum state discrimination problems is determined by the doubly minimized Petz Renyi mutual information of order $alphain (1/2,1)$.
arXiv Detail & Related papers (2024-06-03T18:01:00Z) - Local Additivity Revisited [0.0]
We make a number of simplifications in Gour and Friedland's proof of local additivity of minimum output entropy of a quantum channel.
We use a different approach to reduce the general case to that of a square positive definite matrix.
We extend this result to the maximum relative entropy with respect to a fixed reference state.
arXiv Detail & Related papers (2021-11-22T17:51:24Z) - Tight Exponential Analysis for Smoothing the Max-Relative Entropy and
for Quantum Privacy Amplification [56.61325554836984]
The max-relative entropy together with its smoothed version is a basic tool in quantum information theory.
We derive the exact exponent for the decay of the small modification of the quantum state in smoothing the max-relative entropy based on purified distance.
arXiv Detail & Related papers (2021-11-01T16:35:41Z) - Information-Theoretic Generalization Bounds for Iterative
Semi-Supervised Learning [81.1071978288003]
In particular, we seek to understand the behaviour of the em generalization error of iterative SSL algorithms using information-theoretic principles.
Our theoretical results suggest that when the class conditional variances are not too large, the upper bound on the generalization error decreases monotonically with the number of iterations, but quickly saturates.
arXiv Detail & Related papers (2021-10-03T05:38:49Z) - CLUB: A Contrastive Log-ratio Upper Bound of Mutual Information [105.73798100327667]
We propose a novel Contrastive Log-ratio Upper Bound (CLUB) of mutual information.
We provide a theoretical analysis of the properties of CLUB and its variational approximation.
Based on this upper bound, we introduce a MI minimization training scheme and further accelerate it with a negative sampling strategy.
arXiv Detail & Related papers (2020-06-22T05:36:16Z) - The information capacity of entanglement-assisted continuous variable
measurement [0.0]
We investigate the entropy reduction and entanglement-assisted classical capacity (information gain) of continuous variable quantum measurements.
We establish a fundamental property of the entropy reduction of a measurement.
In the case of one mode, the gain of entanglement assistance is investigated in detail.
arXiv Detail & Related papers (2020-04-11T08:06:33Z) - Approximate MMAP by Marginal Search [78.50747042819503]
We present a strategy for marginal MAP queries in graphical models.
The proposed confidence measure is properly detecting instances for which the algorithm is accurate.
For sufficiently high confidence levels, the algorithm gives the exact solution or an approximation whose Hamming distance from the exact one is small.
arXiv Detail & Related papers (2020-02-12T07:41:13Z) - A tripartite entanglement in de Sitter spacetime [0.0]
We investigate the quantum correlation for tripartite entangled states in de Sitter space.
For a large expansion rate, the tripartite mutual information has a large negative value.
We relate this result with the challenge of recovering information from local measurements.
arXiv Detail & Related papers (2019-09-30T04:48:53Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.