Quantum Tsallis Entropy Estimation

• Quantum Tsallis entropy is a nonadditive spectral functional used to quantify uncertainty in quantum states, generalizing von Neumann entropy for q≠1.
• It leverages QSVT-based estimators and shift tests to efficiently approximate trace powers, notably reducing complexity for purity estimation at q=2.
• The framework underpins complexity-theoretic insights, demonstrating BQP-hardness and guiding noise-sensitive estimation via projective measurement techniques.

Quantum Tsallis entropy estimation concerns the recovery or approximation of the nonadditive spectral functional

$S_q(\rho)=\frac{1-\operatorname{Tr}(\rho^q)}{q-1}$

for an unknown quantum state $\rho$, with $q>0$ and $q\neq 1$. Equivalently, it concerns estimation of the trace power $\operatorname{Tr}(\rho^q)$, since $S_q(\rho)$ is an affine function of that quantity. The subject sits at the intersection of quantum information, quantum algorithms, and complexity theory: it includes monotonicity under projective measurement, purity-based bounds at $q=2$, QSVT-based estimators for integer and non-integer orders, information-theoretic lower bounds, and promise-problem characterizations such as $\mathsf{BQP}$-hardness and $\mathsf{BQP}$-completeness (Jankovic, 2009, Wang, 3 Sep 2025, Liu et al., 2024).

1. Formal definition and estimation target

For a density operator $\rho$, the standard quantum Tsallis entropy is

$\rho$0

As $\rho$1, it converges to the von Neumann entropy,

$\rho$2

For integer $\rho$3, one may regard the task as estimating a degree-$\rho$4 spectral moment. In that regime, $\rho$5 (Wang, 3 Sep 2025).

A particularly important special case is $\rho$6. Then the Tsallis entropy becomes the logical entropy

$\rho$7

so estimation reduces to purity estimation. This is the simplest nontrivial member of the family and is central both in algorithmic work and in operational interpretations of noise (Tamir, 2017).

The same formalism is used for discrete distributions. For $\rho$8,

$\rho$9

Several quantum algorithms are formulated in a unified oracle model that treats distributions and density operators in parallel, so the study of Tsallis entropy estimation naturally spans both quantum-state and quantum-access-to-distribution settings (Wang, 3 Sep 2025).

2. Measurement monotonicity and noise-sensitive estimation

A foundational structural fact is that non-selective projective measurement does not decrease quantum Tsallis entropy. If $q>0$0 is a complete family of orthogonal projectors and

$q>0$1

then

$q>0$2

with equality iff $q>0$3. The proof separates the cases $q>0$4 and $q>0$5, using the concavity or convexity of $q>0$6 together with the sign of $q>0$7 in the Tsallis normalization (Jankovic, 2009).

This result is the Tsallis analogue of the standard von Neumann-entropy statement for dephasing. In estimation terms, it means that entropy computed after a projective measurement in a fixed basis is a “more mixed” post-measurement quantity, not an artificial entropy decrease. The same reasoning extends to the quantum unified $q>0$8-entropy in the sign regimes listed in the original analysis (Jankovic, 2009).

For $q>0$9, the interaction between entropy and noise becomes especially explicit. If a system starts in a pure state $q\neq 1$0, the environment starts in $q\neq 1$1, a unitary $q\neq 1$2 acts on system and environment, and

$q\neq 1$3

then the logical entropy satisfies the upper bound

$q\neq 1$4

The right-hand side is the sum of the absolute squares of the off-diagonal block terms in the post-interaction state before tracing out the environment. The same paper introduces a Tsallis-based entropy exchange and obtains the analogous bound for it (Tamir, 2017).

These measurement and noise results are not generic estimation algorithms, but they determine what quantities are naturally estimable after dephasing or environment coupling. They also explain why $q\neq 1$5 is often singled out: the entropy is directly tied to purity and block coherence, rather than to spectral logarithms (Tamir, 2017).

3. Quantum algorithmic frameworks

Two access models dominate the algorithmic literature. In the purified quantum query access model, one assumes an oracle

$q\neq 1$6

for a distribution, or

$q\neq 1$7

for a state with spectral decomposition

$q\neq 1$8

In the white-box purified access model, the state-preparation circuit $q\neq 1$9 is given explicitly and has size $\operatorname{Tr}(\rho^q)$0 (Wang, 3 Sep 2025, Liu et al., 2024).

For integer orders, the baseline method is the Shift test, which generalizes the SWAP test. It estimates $\operatorname{Tr}(\rho^q)$1 from a cyclic shift on $\operatorname{Tr}(\rho^q)$2 copies of $\operatorname{Tr}(\rho^q)$3, and with amplitude estimation gives additive-error complexity $\operatorname{Tr}(\rho^q)$4 (Wang, 3 Sep 2025).

The modern alternative is QSVT. Its standard pipeline is: construct a block-encoding of $\operatorname{Tr}(\rho^q)$5, approximate $\operatorname{Tr}(\rho^q)$6 by a polynomial, implement the polynomial of $\operatorname{Tr}(\rho^q)$7 through QSVT, and estimate $\operatorname{Tr}(\rho^q)$8 through a Hadamard test. In the white-box setting for constant non-integer $\operatorname{Tr}(\rho^q)$9, the key technical ingredient is an efficiently computable uniform polynomial approximation to positive power functions on the full interval, which avoids the exponential rank dependence that arose in earlier approaches (Liu et al., 2024).

A different framework is multi-level estimation for functionals $S_q(\rho)$0 of a discrete distribution. It partitions amplitudes into exponentially shrinking intervals, uses non-destructive singular value discrimination via gapped phase estimation with branch marking, applies local QSVT polynomials on each interval, and estimates the levelwise contributions by amplitude estimation. The method avoids high control overhead and uses only 4 extra qubits beyond those needed for the projected unitary encoding (Chen et al., 5 May 2026).

Regime	Access/model	Complexity
Integer $S_q(\rho)$1	Purified query access	$S_q(\rho)$2
Constant non-integer $S_q(\rho)$3	White-box purified access	$S_q(\rho)$4 queries; $S_q(\rho)$5 time
$S_q(\rho)$6 for discrete distributions	Purified oracle	$S_q(\rho)$7
$S_q(\rho)$8 for discrete distributions	Purified oracle	$S_q(\rho)$9
$q=2$0 for discrete distributions	Purified oracle	$q=2$1
$q=2$2 for discrete distributions	Purified oracle	$q=2$3

The first line is the integer-order estimator based on block-encodings, QSVT, polynomial approximation of monomials, and a Hadamard test (Wang, 3 Sep 2025). The second line gives the white-box non-integer result for constant $q=2$4 (Liu et al., 2024). The remaining lines are the multi-level bounds for quantum estimation of $q=2$5-Tsallis entropy of discrete distributions (Chen et al., 5 May 2026).

4. Integer orders, non-integer orders, and the near-$q=2$6 regime

For integer $q=2$7, the main current result is an estimator with additive error $q=2$8 and query complexity

$q=2$9

Its polynomial component uses a degree

$\mathsf{BQP}$0

approximation to $\mathsf{BQP}$1 on $\mathsf{BQP}$2. The resulting dependence on $\mathsf{BQP}$3 improves the folklore $\mathsf{BQP}$4 Shift-test approach by a $\mathsf{BQP}$5 factor, up to polylogarithmic terms (Wang, 3 Sep 2025).

For constant non-integer $\mathsf{BQP}$6, the white-box setting exhibits a qualitatively different algorithmic picture. Estimation of $\mathsf{BQP}$7, and hence of $\mathsf{BQP}$8, can be done in time $\mathsf{BQP}$9 with query complexity

$\mathsf{BQP}$0

This is described as an exponential improvement over prior $\mathsf{BQP}$1-time methods in the white-box model for general $\mathsf{BQP}$2-qubit states (Liu et al., 2024).

The regime $\mathsf{BQP}$3 is algorithmically harder in the presently available quantum results, and the sharpest bounds in the supplied literature are for quantum access to discrete distributions rather than general density operators. There, the multi-level framework yields

$\mathsf{BQP}$4

queries for $\mathsf{BQP}$5, together with a lower bound $\mathsf{BQP}$6 on the distribution-size dependence (Chen et al., 5 May 2026).

Near $\mathsf{BQP}$7, a separate perturbative line studies first-order expansions of Tsallis entropy and $\mathsf{BQP}$8-exponential MaxEnt distributions around the Boltzmann–Gibbs point. In that framework,

$\mathsf{BQP}$9

and the corresponding first-order $\rho$0-exponential deformation is

$\rho$1

The same work emphasizes that its relevance to quantum theory is indirect, since it is not a detailed quantum operator formalism (Ferri et al., 2016). This suggests a perturbative viewpoint for weak nonextensivity, rather than a direct quantum-state estimation algorithm.

5. Lower bounds and computational complexity

The modern lower-bound theory begins with a reduction from entropy estimation to distribution distinguishability. For integer $\rho$2, the hard instances

$\rho$3

have Tsallis entropies that differ by $\rho$4, while their Hellinger distance is $\rho$5. By Belovs’ theorem, distinguishing them requires $\rho$6 quantum queries, which yields the lower bound

$\rho$7

for Tsallis entropy estimation. This matches the QSVT-based upper bound up to a polylogarithmic factor (Wang, 3 Sep 2025).

The same paper turns the algorithmic statement into an approximation-theoretic one. If a polynomial of degree $\rho$8 approximates $\rho$9 sufficiently well, then Tsallis entropy can be estimated with roughly $\rho$00 queries. Combining this with the lower bound gives

$\rho$01

and hence

$\rho$02

for constant $\rho$03 in the stated range (Wang, 3 Sep 2025).

A complementary complexity-theoretic line studies promise problems. In the Tsallis entropy difference problem, there is a phase transition at $\rho$04: for any $\rho$05, TsallisQED$\rho$06 is $\rho$07-complete, whereas for $\rho$08, TsallisQED$\rho$09 is $\rho$10-hard (Liu et al., 2024). For entropy approximation rather than entropy difference, the 2026 hardness theory proves that the rank-2 version of TsallisQEA$\rho$11 is $\rho$12-hard for every positive real order $\rho$13. Combined with prior upper bounds, this yields $\rho$14-completeness for low-rank TsallisQEA$\rho$15 when $\rho$16, and for unrestricted TsallisQEA$\rho$17 when $\rho$18 (Liu, 7 Jan 2026).

The central reduction in the all-orders hardness result exploits the exact rank-2 identity

$\rho$19

so that Tsallis entropy becomes a binary-entropy function of a pure-state overlap. New inequalities comparing Tsallis binary entropies of different orders then transfer hardness from the order-2 case to all positive orders (Liu, 7 Jan 2026).

6. Statistical benchmarks, extensions, and related estimands

Beyond worst-case query complexity, the subject includes exact statistical formulas for benchmark ensembles. For a bipartite random pure state on $\rho$20 with $\rho$21, the reduced-state Tsallis entropy

$\rho$22

admits exact mean and variance formulas in terms of finite sums of terminating hypergeometric functions. The quadratic case $\rho$23 simplifies to

$\rho$24

These expressions provide exact fluctuation baselines for purity-deficit estimation in random bipartite states (Wei, 2018).

A closely related but distinct task is estimation of the quantum $\rho$25-Tsallis relative entropy

$\rho$26

This reduces to estimation of the affinity

$\rho$27

again through block-encodings, polynomial approximation, QSVT, Hadamard tests, and amplitude estimation. For $\rho$28, the task is directly tied to the quantum Hellinger distance, and the resulting estimator yields a tolerant quantum state certification procedure with sample complexity $\rho$29 in the stated setting (Bao et al., 1 Oct 2025).

Taken together, these lines define the present scope of quantum Tsallis entropy estimation. At one end are structural monotonicity and purity-based bounds under projective measurement and noise; at another are QSVT-based estimators with optimal or near-optimal dependence on $\rho$30 and $\rho$31; and at a third are promise-problem characterizations showing that the task can capture the computational power of quantum computation itself. The current literature therefore treats Tsallis entropy not merely as a deformed entropy functional, but as a concrete estimation target whose behavior depends sharply on the entropy order, the access model, and the rank structure of the underlying state (Jankovic, 2009, Tamir, 2017, Wang, 3 Sep 2025, Liu, 7 Jan 2026).