Unified Pseudoentropy Characterization

• The paper presents a unified pseudoentropy framework that consolidates various entropy notions via convex φ-entropies and universal simulators, establishing robust hardness bounds.
• It introduces a universal simulator theorem that employs multiaccuracy and weight-restricted calibration to witness computational gaps consistently for all convex φ-functions.
• The work extends the methodology to quantum-field and holographic settings using analytic continuation and contour-integral sum rules to relate pseudoentropy with CFT observables like a* and C_T.

Searching arXiv for the cited papers to ground the article in current literature. Unified pseudoentropy characterization denotes a class of frameworks in which pseudoentropy, or a pseudoentropy gap, is determined by a reduced set of structural data rather than by a separate ad hoc analysis for each entropy notion or geometry. In the computational-complexity literature, the characterization is formulated for a general family of convex entropy notions and expressed through a single universal simulator together with Bregman-divergence hardness bounds (Hu et al., 8 Jul 2025). In quantum-field-theoretic and holographic settings, closely related unifications express pseudoentropy through analytic continuation of ordinary entanglement data or through a small set of CFT observables such as $a^\star$ and $C_T$ (Guo et al., 2024, Anastasiou et al., 1 Dec 2025). The common theme is that pseudoentropy becomes tractable once it is embedded into a broader structural object: a KL-based hardness relation, a meromorphic family of reduced states, or a renormalized holographic functional.

1. Computational pseudoentropy as a hardness notion

A central formulation begins with a joint distribution specified by $X\sim\mu$ and a conditional law $g^*:\{0,1\}^n\to\Delta_L$, where $\Delta_L=\{p\in[0,1]^L:\sum_i p_i=1\}$. For any convex function $\phi:\Delta_L\to\mathbb R$, the $\phi$-entropy of a simulator $g$ is defined by

$H_\phi(g):=-\mathbb E_{x\sim\mu}[\phi(g(x))].$

The same framework introduces the Bregman divergence

$$D_\phi(g^*\|g):=\mathbb E_{x\sim\mu}\bigl[\phi(g^*(x))-\phi(g(x))-\langle g^*(x)-g(x),\nabla\phi(g(x))\rangle\bigr],$$

together with the indistinguishability class $C_T$0, consisting of simulators $C_T$1 that are $C_T$2-indistinguishable from $C_T$3 against all distinguishers of size $C_T$4 (Hu et al., 8 Jul 2025).

This formalism encompasses several standard entropy notions. The paper identifies Shannon entropy through $C_T$5, min-entropy through $C_T$6, and collision-entropy through $C_T$7 (Hu et al., 8 Jul 2025). The associated computational pseudoentropy gap at complexity $C_T$8 is

$C_T$9

In this formulation, pseudoentropy is not restricted to Shannon-style quantities; it becomes a parameterized family indexed by convex $X\sim\mu$0.

An earlier unification uses KL divergence directly. For a distributional search problem $X\sim\mu$1, hardness in relative entropy requires that for every pair of PPT algorithms $X\sim\mu$2,

$X\sim\mu$3

where $X\sim\mu$4 is uniform and $X\sim\mu$5 is supported on $X\sim\mu$6. This single notion implies both next-block pseudoentropy and next-block inaccessible entropy, thereby unifying two computational-entropy notions that had previously been used in different cryptographic constructions (Agrawal et al., 2019). The same paper shows that one-way functions satisfy this hardness notion, and in the canonical inversion problem for $X\sim\mu$7 the lower bound becomes $X\sim\mu$8 when $X\sim\mu$9 is $g^*:\{0,1\}^n\to\Delta_L$0-one-way (Agrawal et al., 2019).

The significance of these definitions is structural rather than purely notational. The later convex-$g^*:\{0,1\}^n\to\Delta_L$1 framework generalizes the KL-based picture from a specific divergence to a family of Bregman divergences, while retaining the interpretation that pseudoentropy measures a computational gap between the true conditional law and an efficiently simulable surrogate (Hu et al., 8 Jul 2025).

2. Universal simulator theorem and calibration-based proof architecture

The main unified theorem states that for a family $g^*:\{0,1\}^n\to\Delta_L$2 of convex $g^*:\{0,1\}^n\to\Delta_L$3 whose subgradient maps can be approximately computed in non-uniform time $g^*:\{0,1\}^n\to\Delta_L$4, there exists a single simulator $g^*:\{0,1\}^n\to\Delta_L$5 such that simultaneously for every $g^*:\{0,1\}^n\to\Delta_L$6,

$g^*:\{0,1\}^n\to\Delta_L$7

with

$g^*:\{0,1\}^n\to\Delta_L$8

Conversely, for every time bound $g^*:\{0,1\}^n\to\Delta_L$9, there is $\Delta_L=\{p\in[0,1]^L:\sum_i p_i=1\}$0 such that

$\Delta_L=\{p\in[0,1]^L:\sum_i p_i=1\}$1

This is the paper’s unified pseudoentropy-hardness characterization: the same $\Delta_L=\{p\in[0,1]^L:\sum_i p_i=1\}$2 simultaneously witnesses computational hardness and computational randomness for all $\Delta_L=\{p\in[0,1]^L:\sum_i p_i=1\}$3 (Hu et al., 8 Jul 2025).

A key identity underlying the theorem is

$\Delta_L=\{p\in[0,1]^L:\sum_i p_i=1\}$4

The right-hand side is controlled by two conditions. The first is standard computational indistinguishability, identified in the paper with multiaccuracy. The second is weight-restricted calibration: for a family $\Delta_L=\{p\in[0,1]^L:\sum_i p_i=1\}$5 of weight functions $\Delta_L=\{p\in[0,1]^L:\sum_i p_i=1\}$6, the simulator $\Delta_L=\{p\in[0,1]^L:\sum_i p_i=1\}$7 satisfies $\Delta_L=\{p\in[0,1]^L:\sum_i p_i=1\}$8-weight-restricted calibration if

$\Delta_L=\{p\in[0,1]^L:\sum_i p_i=1\}$9

The paper’s main technical point is that multiaccuracy together with weight-restricted calibration suffices for the general pseudoentropy characterization (Hu et al., 8 Jul 2025).

This formulation is explicitly connected to fairness methodology. The paper states that weight-restricted calibration from the recent literature on algorithm fairness, along with standard computational indistinguishability, enhances the Complexity-Theoretic Regularity Lemma and the Leakage Simulation Lemma, and yields an exponential improvement in the complexity dependency on the alphabet size compared to a multicalibration-based approach (Hu et al., 8 Jul 2025). A plausible implication is that the theorem is not merely a restatement of known pseudoentropy equivalences, but a transfer of proof technology across research areas.

The same work also proves lower bounds. Even when $\phi:\Delta_L\to\mathbb R$0 contains one simple $\phi:\Delta_L\to\mathbb R$1, and even when only one calibration distinguisher or one weight function is enforced, any $\phi:\Delta_L\to\mathbb R$2 satisfying multiaccuracy plus weight-restricted calibration must have circuit size at least $\phi:\Delta_L\to\mathbb R$3. The paper concludes that exponential dependence on $\phi:\Delta_L\to\mathbb R$4 is inherent once computability assumptions on $\phi:\Delta_L\to\mathbb R$5 are dropped, and that full multicalibration or calibrated multiaccuracy must also incur $\phi:\Delta_L\to\mathbb R$6 blow-up in the worst case (Hu et al., 8 Jul 2025).

3. Relation to KL-hardness, next-block pseudoentropy, and inaccessible entropy

The 2019 KL-based framework provides the immediate predecessor of the universal characterization. It introduces hardness in relative entropy for search problems and then derives two branches from the same starting point (Agrawal et al., 2019).

For next-block pseudoentropy, the construction proceeds by fixing the honest generator $\phi:\Delta_L\to\mathbb R$7, converting relative pseudoentropy into next-block relative pseudoentropy by splitting $\phi:\Delta_L\to\mathbb R$8 into $\phi:\Delta_L\to\mathbb R$9-bit blocks, and then invoking an equivalence between KL gap and pseudoentropy gap on logarithmic-size blocks: $\phi$0 This yields the theorem that if $\phi$1 is a one-way function, then for $\phi$2 partitioned into $\phi$3 blocks of size $\phi$4, the joint distribution $\phi$5 has real entropy $\phi$6 but next-block pseudoentropy at least $\phi$7 (Agrawal et al., 2019).

For next-block inaccessible entropy, the same KL-hardness condition is processed differently. The generator is made online and blockwise, a simulator is instantiated via rejection sampling, and a KL sum is converted into a sum of conditional Shannon-entropy gaps. The resulting theorem states that if $\phi$8 is a one-way function, then for $\phi$9 partitioned into $g$0-bit blocks, the joint $g$1 has next-block accessible entropy at most $g$2, equivalently inaccessible entropy $g$3 (Agrawal et al., 2019).

The paper emphasizes a “duality” between these two directions: next-block pseudoentropy and next-block inaccessible entropy are different projections of the same joint-KL-hardness requirement. The later convex-$g$4 theorem generalizes this idea. Rather than proving one pseudoentropy theorem for Shannon entropy, another for min-entropy, and a third for collision entropy, it produces a single universal witness for all convex $g$5 in the target family (Hu et al., 8 Jul 2025). This suggests a progression from unifying two search-problem entropy notions to unifying an entire class of entropy notions themselves.

4. Analytic continuation and sum-rule formulations in many-body and field-theoretic pseudoentropy

A different unification appears in the pseudoentropy of transition matrices. Given two pure states $g$6 and $g$7, the normalized transition matrix is

$g$8

with reduced transition matrix $g$9. The pseudoentropy is

$H_\phi(g):=-\mathbb E_{x\sim\mu}[\phi(g(x))].$0

which is generally complex, and is computed through pseudo-Rényi entropies

$H_\phi(g):=-\mathbb E_{x\sim\mu}[\phi(g(x))].$1

followed by analytic continuation in $H_\phi(g):=-\mathbb E_{x\sim\mu}[\phi(g(x))].$2 (Guo et al., 2024).

The unifying step is to regard both the density matrix of a superposition state and the transition matrix as special values of a single meromorphic family. For the superposition $H_\phi(g):=-\mathbb E_{x\sim\mu}[\phi(g(x))].$3, the paper introduces

$H_\phi(g):=-\mathbb E_{x\sim\mu}[\phi(g(x))].$4

and a normalized $H_\phi(g):=-\mathbb E_{x\sim\mu}[\phi(g(x))].$5 with $H_\phi(g):=-\mathbb E_{x\sim\mu}[\phi(g(x))].$6. For $H_\phi(g):=-\mathbb E_{x\sim\mu}[\phi(g(x))].$7, $H_\phi(g):=-\mathbb E_{x\sim\mu}[\phi(g(x))].$8 is an ordinary Hermitian density matrix whose reduced entropy is standard entanglement entropy. In the limit $H_\phi(g):=-\mathbb E_{x\sim\mu}[\phi(g(x))].$9, $$D_\phi(g^*\|g):=\mathbb E_{x\sim\mu}\bigl[\phi(g^*(x))-\phi(g(x))-\langle g^*(x)-g(x),\nabla\phi(g(x))\rangle\bigr],$$0 tends to $$D_\phi(g^*\|g):=\mathbb E_{x\sim\mu}\bigl[\phi(g^*(x))-\phi(g(x))-\langle g^*(x)-g(x),\nabla\phi(g(x))\rangle\bigr],$$1, so the pseudoentropy emerges as the entropy of the same analytic family evaluated at a different point in the complex parameter space (Guo et al., 2024).

This yields a contour-integral sum rule. The paper derives

$$D_\phi(g^*\|g):=\mathbb E_{x\sim\mu}\bigl[\phi(g^*(x))-\phi(g(x))-\langle g^*(x)-g(x),\nabla\phi(g(x))\rangle\bigr],$$2

equivalently

$$D_\phi(g^*\|g):=\mathbb E_{x\sim\mu}\bigl[\phi(g^*(x))-\phi(g(x))-\langle g^*(x)-g(x),\nabla\phi(g(x))\rangle\bigr],$$3

and from this obtains a pseudo-Rényi sum rule and, under analyticity assumptions, the pseudoentropy formula

$$D_\phi(g^*\|g):=\mathbb E_{x\sim\mu}\bigl[\phi(g^*(x))-\phi(g(x))-\langle g^*(x)-g(x),\nabla\phi(g(x))\rangle\bigr],$$4

In the simplest case this gives an exact unit-circle expression; in the general case, residue terms from singularities outside the unit circle must be added (Guo et al., 2024).

The paper also relates the validity of the simple sum rule to the singularity structure of $$D_\phi(g^*\|g):=\mathbb E_{x\sim\mu}\bigl[\phi(g^*(x))-\phi(g(x))-\langle g^*(x)-g(x),\nabla\phi(g(x))\rangle\bigr],$$5, including branch cuts introduced by $$D_\phi(g^*\|g):=\mathbb E_{x\sim\mu}\bigl[\phi(g^*(x))-\phi(g(x))-\langle g^*(x)-g(x),\nabla\phi(g(x))\rangle\bigr],$$6. This suggests that the unified characterization is geometric as well as algebraic: pseudoentropy is encoded in the analytic structure of an entropy function in the complex $$D_\phi(g^*\|g):=\mathbb E_{x\sim\mu}\bigl[\phi(g^*(x))-\phi(g(x))-\langle g^*(x)-g(x),\nabla\phi(g(x))\rangle\bigr],$$7-plane (Guo et al., 2024).

5. Holographic pseudoentropy in dS/CFT: characterization by $$D_\phi(g^*\|g):=\mathbb E_{x\sim\mu}\bigl[\phi(g^*(x))-\phi(g(x))-\langle g^*(x)-g(x),\nabla\phi(g(x))\rangle\bigr],$$8 and $$D_\phi(g^*\|g):=\mathbb E_{x\sim\mu}\bigl[\phi(g^*(x))-\phi(g(x))-\langle g^*(x)-g(x),\nabla\phi(g(x))\rangle\bigr],$$9

In dS/CFT, pseudoentropy is defined as the von Neumann entropy of a transition matrix and computed holographically from codimension-two extremal surfaces in de Sitter space. The extremal surface $C_T$00 splits into timelike and spacelike pieces, and its area is generally complex; the real and imaginary parts encode spacelike and timelike entanglement (Anastasiou et al., 20 Feb 2026). For a small shape deformation of a unit-radius ball,

$C_T$01

the universal part of the pseudoentropy admits the expansion

$C_T$02

with

$C_T$03

and

$C_T$04

The coefficient $C_T$05 is the Pochhammer symbol $C_T$06 (Anastasiou et al., 1 Dec 2025).

The derivation expands the holographic pseudoentropy functional $C_T$07 around the spherical extremal surface. The linearized embedding modes satisfy extrinsic-curvature equations in Lorentzian and Euclidean segments, and parity-odd contributions from timelike and spacelike sectors cancel, leaving a quadratic correction fixed by the stress-tensor two-point function $C_T$08 (Anastasiou et al., 1 Dec 2025). The paper states that the resulting formula has exactly the same form as the Mezei result for unitary AdS/CFT entanglement entropy under the analytic continuation $C_T$09 (Anastasiou et al., 1 Dec 2025).

The same work checks quadratic-curvature gravity with Lagrangian $C_T$10 via the Dong–Camps functional and finds the same “sphere + $C_T$11 correction” structure, with

$C_T$12

where

$C_T$13

The paper concludes that perturbative pseudoentropy shape dependence is universal for all non-unitary holographic CFTs with a two-derivative or higher-curvature dual (Anastasiou et al., 1 Dec 2025).

A renormalized formulation sharpens this characterization. Using replica geometry and the on-shell action of conformal gravity, the renormalized pseudoentropy is defined by

$C_T$14

In $C_T$15 this uses Weyl-squared gravity; in $C_T$16 it uses the unique six-dimensional LPP combination. The resulting renormalized pseudoentropy automatically subtracts all power-law and log divergences, and for a spherical entangling surface the universal term is proportional to the complex type-A charge $C_T$17. For infinitesimal deformations away from the sphere, the theory recovers at quadratic order an analytic continuation of the Mezei-like formula, now governed by $C_T$18 (Anastasiou et al., 20 Feb 2026).

Taken together, these results yield a particularly compact holographic characterization: the universal pseudoentropy of a slightly deformed sphere is determined, up to overall factors, by $C_T$19 at order $C_T$20 and by $C_T$21 at order $C_T$22 (Anastasiou et al., 1 Dec 2025). A plausible implication is that the holographic analogue of unified pseudoentropy is a data-reduction principle: low-order pseudoentropy shape dependence collapses onto the two simplest CFT observables.

6. Adjacent unified-entropy frameworks and scope of the term

The term pseudoentropy also appears in adjacent quantum-information and cosmology literatures, though not always in the same technical sense. In the study of quantum channels, any functional of the form

$C_T$23

is called a pseudoentropy, and the framework interpolates between Rényi entropy, Tsallis entropy, and von Neumann entropy. The map $C_T$24-entropy of a quantum channel is defined as the unified $C_T$25-entropy of its rescaled dynamical matrix, or equivalently of its Choi state: $C_T$26 This gives a unified treatment of unraveling entropy, map entropy, continuity bounds, additivity properties, and Lindblad-type inequalities for channels (Rastegin, 2011).

In CMB analysis, several pseudoentropy measures are introduced as fast surrogates for Wehrl entropy. The projection pseudoentropy, angular pseudoentropy, and range angular pseudoentropy are all rotationally invariant and sensitive to non-Gaussianity, anisotropy, and statistical dependence of spherical harmonic coefficients. The angular pseudoentropy in particular reduces computation to diagonalization of a $C_T$27 matrix and is reported to be computable up to $C_T$28 in minutes rather than days (Minkov et al., 2018).

These neighboring uses do not define the same object as computational pseudoentropy gaps or dS/CFT transition-matrix pseudoentropy. The shared pattern is instead methodological. Each setting embeds a difficult entropy-like quantity into a broader family—convex $C_T$29-entropies, meromorphic continuations, unified $C_T$30-entropies, or SU(2)-covariant channels—and then extracts universal behavior from that embedding. This suggests that “unified pseudoentropy characterization” functions less as a single cross-disciplinary definition than as a recurring research strategy.

7. Limitations, special cases, and open directions

The computational characterization is broad but not cost-free. Its positive theorem assumes that the subgradient maps $C_T$31 are approximately computable in non-uniform time $C_T$32, while the lower-bound theorem shows that exponential dependence on the alphabet size is unavoidable without such assumptions (Hu et al., 8 Jul 2025). The same paper treats Shannon entropy by perturbing $C_T$33 away from the boundary of $C_T$34, because $C_T$35 is unbounded there, and treats min-entropy through $C_T$36, where $C_T$37 (Hu et al., 8 Jul 2025).

In the KL-based precursor, the next-block theorems rely on $C_T$38-bit blocks, on online generation, and in the inaccessible-entropy direction on rejection sampling. The framework is modular, but the quantitative reductions are explicitly tuned to block decompositions and search-problem structure (Agrawal et al., 2019).

In the analytic-continuation approach to transition-matrix pseudoentropy, the simplest unit-circle sum rule is exact only when no additional singularities contribute outside the contour. The paper therefore tracks poles and branch cuts of $C_T$39, and includes extra residue terms when needed (Guo et al., 2024). In the holographic dS/CFT context, the small-deformation expansion is perturbative in $C_T$40, the status of $C_T$41 and higher orders is left open, and the class of non-unitary CFTs with $C_T$42 is not captured by the quadratic formula (Anastasiou et al., 1 Dec 2025). The renormalized pseudoentropy program also notes that a fully covariant removal of all UV divergences is still under development (Anastasiou et al., 20 Feb 2026).

Across these settings, unified pseudoentropy characterization is therefore best understood as a precise but domain-dependent principle: pseudoentropy becomes universal when it can be reduced to a small set of computational, analytic, or CFT data, yet the reduction remains sensitive to regularity assumptions, contour singularities, or the perturbative regime in which the characterization is derived.