Tumula information is a bipartite correlation measure defined as the doubly minimized reversed quantum relative entropy that vanishes on product states.
It forms a hierarchical framework with umlaut and lautum information, providing key operational significance in asymmetric quantum hypothesis testing.
Extensions to quantum channels reveal super-additivity and variational structures, highlighting both numerical challenges and insights into channel capacities.
Searching arXiv for the primary and related papers to ground the article.
arXiv search: tumula information (Schmitt et al., 17 Mar 2026)
Tumula information is a bipartite correlation measure introduced as the doubly minimized reversed analogue of mutual information. For a finite-dimensional bipartite quantum state ρAB, it is defined by
T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),
where D(⋅∥⋅) is the quantum relative entropy. In the same framework, the lautum information is L(A:B)ρ:=D(ρA⊗ρB∥ρAB), and the umlaut information is U(A:B)ρ:=τBinfD(ρA⊗τB∥ρAB). Tumula information therefore arises by reversing the arguments of relative entropy and then minimizing over both factors of the product benchmark. Its main significance is operational: in composite asymmetric quantum hypothesis testing against product alternatives, the Sanov exponent is exactly the tumula information, while the reverse direct exponent is governed by its Petz–Rényi generalization (Schmitt et al., 17 Mar 2026).
1. Definition and placement among reversed correlation measures
The standard mutual information of a bipartite state ρAB has the relative-entropy form
I(A:B)ρ=D(ρAB∥ρA⊗ρB).
The reversed form is the lautum information,
L(A:B)ρ:=D(ρA⊗ρB∥ρAB),
and tumula information is the doubly minimized reversed version,
T(A:B)ρ:=σA,τBinfD(σA⊗τB∥ρAB).
In the classical case, for a joint distribution PXY,
T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),0
The usual support condition for quantum relative entropy applies: T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),1 is finite only if T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),2, equivalently T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),3 (Schmitt et al., 17 Mar 2026).
The three reversed correlation measures form a hierarchy because the optimization domains are nested:
T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),4
Hence
T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),5
This establishes tumula information as the least constrained member of the reversed family.
2. Petz–Rényi formulation and variational structure
The Petz divergence of order D(⋅∥⋅)6 is
D(⋅∥⋅)7
For D(⋅∥⋅)8, it is finite if D(⋅∥⋅)9; for L(A:B)ρ:=D(ρA⊗ρB∥ρAB)0, it is finite if L(A:B)ρ:=D(ρA⊗ρB∥ρAB)1. It is extended by limits at L(A:B)ρ:=D(ρA⊗ρB∥ρAB)2 and L(A:B)ρ:=D(ρA⊗ρB∥ρAB)3. A central identity for L(A:B)ρ:=D(ρA⊗ρB∥ρAB)4 is
L(A:B)ρ:=D(ρA⊗ρB∥ρAB)5
Using this divergence, the paper introduces three Petz–Rényi lautum-information variants:
L(A:B)ρ:=D(ρA⊗ρB∥ρAB)6
L(A:B)ρ:=D(ρA⊗ρB∥ρAB)7
L(A:B)ρ:=D(ρA⊗ρB∥ρAB)8
The last quantity is the doubly minimized Petz–Rényi lautum information, abbreviated PRLI (Schmitt et al., 17 Mar 2026).
The reverse identity connects PRLI directly to Petz–Rényi mutual information:
L(A:B)ρ:=D(ρA⊗ρB∥ρAB)9
U(A:B)ρ:=τBinfD(ρA⊗τB∥ρAB)0
U(A:B)ρ:=τBinfD(ρA⊗τB∥ρAB)1
The limits at U(A:B)ρ:=τBinfD(ρA⊗τB∥ρAB)2 recover the relative-entropy quantities:
U(A:B)ρ:=τBinfD(ρA⊗τB∥ρAB)3
The optimization problem admits explicit partial minimizers. For U(A:B)ρ:=τBinfD(ρA⊗τB∥ρAB)4, if U(A:B)ρ:=τBinfD(ρA⊗τB∥ρAB)5 is fixed and U(A:B)ρ:=τBinfD(ρA⊗τB∥ρAB)6, then
U(A:B)ρ:=τBinfD(ρA⊗τB∥ρAB)7
and symmetrically
U(A:B)ρ:=τBinfD(ρA⊗τB∥ρAB)8
At U(A:B)ρ:=τBinfD(ρA⊗τB∥ρAB)9, the corresponding partial minimizers become exponential maps:
ρAB0
ρAB1
These formulas provide the basic fixed-point structure for numerical evaluation (Schmitt et al., 17 Mar 2026).
3. Structural properties
Tumula information and its PRLI extension satisfy a broad list of information-theoretic properties. For ρAB2 and local channels ρAB3, ρAB4,
ρAB5
At ρAB6, this yields the local data-processing inequality
The Rényi dependence is regular in several senses. The map I(A:B)ρ=D(ρAB∥ρA⊗ρB).2 is monotone nondecreasing and continuous on I(A:B)ρ=D(ρAB∥ρA⊗ρB).3. On I(A:B)ρ=D(ρAB∥ρA⊗ρB).4, I(A:B)ρ=D(ρAB∥ρA⊗ρB).5 is convex. For I(A:B)ρ=D(ρAB∥ρA⊗ρB).6, I(A:B)ρ=D(ρAB∥ρA⊗ρB).7 is continuously differentiable, and its derivative can be written in terms of doubly minimized PRMI:
I(A:B)ρ=D(ρAB∥ρA⊗ρB).8
Several special values are explicit:
I(A:B)ρ=D(ρAB∥ρA⊗ρB).9
For L(A:B)ρ:=D(ρA⊗ρB∥ρAB),0, the minimizing pair L(A:B)ρ:=D(ρA⊗ρB∥ρAB),1 is unique, and its supports satisfy
L(A:B)ρ:=D(ρA⊗ρB∥ρAB),2
The behavior on special classes of states is sharply characterized. If L(A:B)ρ:=D(ρA⊗ρB∥ρAB),3 is pure, then L(A:B)ρ:=D(ρA⊗ρB∥ρAB),4 when the state is product, and L(A:B)ρ:=D(ρA⊗ρB∥ρAB),5 otherwise. If L(A:B)ρ:=D(ρA⊗ρB∥ρAB),6 is diagonal in product bases, corresponding to a classical-classical state with joint distribution L(A:B)ρ:=D(ρA⊗ρB∥ρAB),7, then for all L(A:B)ρ:=D(ρA⊗ρB∥ρAB),8,
An additional asymptotic characterization replaces the double minimization by universal permutation-invariant states T(A:B)ρ:=σA,τBinfD(σA⊗τB∥ρAB).2 and T(A:B)ρ:=σA,τBinfD(σA⊗τB∥ρAB).3. For T(A:B)ρ:=σA,τBinfD(σA⊗τB∥ρAB).4,
T(A:B)ρ:=σA,τBinfD(σA⊗τB∥ρAB).5
and at T(A:B)ρ:=σA,τBinfD(σA⊗τB∥ρAB).6,
T(A:B)ρ:=σA,τBinfD(σA⊗τB∥ρAB).7
4. Operational meaning in asymmetric hypothesis testing
The principal operational interpretation of tumula information is formulated in composite asymmetric binary quantum state discrimination. For a POVMT(A:B)ρ:=σA,τBinfD(σA⊗τB∥ρAB).8 at blocklength T(A:B)ρ:=σA,τBinfD(σA⊗τB∥ρAB).9, the worst-case type-I and type-II errors are
PXY0
The reverse direct exponent quantifies the optimal decay of type-II error under a type-I decay constraint of the form PXY1, while the Sanov exponent quantifies the optimal decay of type-I error under a fixed type-II constraint PXY2 (Schmitt et al., 17 Mar 2026).
For the singly minimized setting, with
PXY3
and alternatives of the form
PXY4
the reverse direct exponent is
PXY5
For the doubly minimized setting, with
PXY6
and either
PXY7
or
PXY8
the reverse direct exponent is governed by the doubly minimized PRLI:
PXY9
for
T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),00
where
T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),01
The same expression also holds when the supremum is taken over T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),02 (Schmitt et al., 17 Mar 2026).
The Sanov interpretation is more direct. Under the same doubly minimized product alternatives,
T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),03
hence
T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),04
This identifies tumula information exactly with the optimal large-deviation rate for mistaking the true correlated source for any product source in the corresponding reverse-testing problem.
The zero-rate limits place mutual, lautum, umlaut, and tumula information in a single asymptotic scheme. In particular, when the alternatives are doubly optimized over product states and a technical threshold T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),05 vanishes,
T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),06
while in the reverse setting with the same alternative classes,
T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),07
5. Extension from states to channels
The paper extends tumula information from states to quantum channels. For a channel T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),08,
T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),09
where T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),10 and the supremum is over pure states T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),11. In Choi form,
T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),12
with T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),13 the unnormalized Choi operator (Schmitt et al., 17 Mar 2026).
This channel quantity is super-additive:
T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),14
Consequently the regularized quantity
T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),15
exists by Fekete’s lemma and equals T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),16.
For classical-to-quantum channels T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),17 with orthonormal basis T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),18, the paper gives two explicit variational forms. Defining
T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),19
one has
T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),20
and equivalently
T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),21
The corresponding channel umlaut information is
T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),22
By setting T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),23 one obtains
For classical channels T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),25,
T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),26
and the explicit forms are
T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),27
as well as
T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),28
Super-additivity persists:
T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),29
A notable special case is the identity channel T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),30 on a classical alphabet T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),31:
T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),32
Hence any classical channel T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),33 obeys
T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),34
At the same time, the zero-rate unassisted error exponent T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),35 is infinite. The paper therefore concludes that tumula information, even after regularization, cannot serve as an assisted reliability exponent in the classical setting. For channel-level comparison, the work explicitly relates its findings to previous results on channel umlaut information (Girardi et al., 27 Mar 2025, Schmitt et al., 17 Mar 2026).
6. Examples, computation, and broader context
Several examples delimit the range of possible behavior. If T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),36, then
T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),37
If T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),38 is pure and entangled, then T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),39; in particular, the Bell state has infinite tumula information. For classical-classical states, the problem reduces exactly to the classical optimization over product distributions, and the classical upper bound
Closed-form formulas beyond product states, pure states, and classical-classical states are not given in the paper. For T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),41, numerical evaluation can proceed by alternating minimization using the Sibson-based partial minimizers
T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),42
and for T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),43 by fixed-point iterations based on
T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),44
For T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),45, uniqueness of the minimizer pair makes this optimization well posed.
Conceptually, tumula information occupies a specific position within the landscape of correlation measures. Mutual information governs forward-testing exponents, whereas tumula information governs reverse-testing exponents against product alternatives. At T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),46 the hierarchy
T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),47
measures how the exponent changes as the product benchmark becomes less constrained. This suggests that tumula information is the natural reversed quantity when both factors of the null product structure are composite, rather than fixed by the marginals.
The broader information-theoretic context is complementary rather than overlapping. Recent work has shown that mutual information can be upper-bounded by Fisher information, both classically and quantumly, yielding bounds on Bayesian quadratic cost and on Holevo information (Górecki et al., 2024). Related work shows that, under a sub-Gaussian score assumption, processed Fisher information is bounded linearly by mutual information or by channel capacity, with applications to distributed estimation and strong data-processing inequalities (Barnes et al., 2021). Those results concern mutual information and Fisher-information control rather than tumula information directly, but they clarify the distinct operational niche occupied by the reversed measures.
The main open questions identified in the tumula-information paper concern channel interpretations in genuinely quantum settings and structural characterization beyond the explicitly solved cases. In the classical channel setting the paper gives a negative answer to an analogue of the meta-converse interpretation. In the quantum channel setting, by contrast, T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),48 can be infinite, for example for noiseless quantum channels, and whether T(A:B)ρ:=σA∈S(A),τB∈S(B)infD(σA⊗τB∥ρAB),49 or its PRLI variants characterize meaningful exponents or capacities in quantum-assisted scenarios remains open (Schmitt et al., 17 Mar 2026).