Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Mathematical Physics

Standard thermal statistics with q-entropies

Gustavo Guerberoff, G. A. Raggio

Published Apr 1, 1996• 31 citations
Publisher

Abstract

We report results on the quantum thermal statistics à la Gibbs–Shannon–Szilard–Jaynes based on q-entropies Sq[ρ]=(q−1)−1(1−tr(ρq)) (0<q≠1) and the internal energy functional U[ρ]=tr(ρH) proposed by C. Tsallis [J. Stat. Phys. 52, 479–487 (1988)].
DOI
10.1063/1.531479

Related papers

Non-standard thermal statistics with q-entropies

Gustavo Guerberoff, Pedro A. Pury, G. A. Raggio

We consider the quantum thermal statistics à la Gibbs–Shannon–Szilard–Jaynes based on q-entropies Sq[ρ]=(q−1)−1(1−tr(ρq)) (0<q≠1) and the non-standard ‘‘internal energy’’ functionals Uq[ρ]=tr(ρqH) proposed by C. Tsallis [J. Stat. Phys. 52, 479–487 (1988)].

Journal of Mathematical Physics•Apr 1, 1996•21 citations

On Estimating the Trace of Quantum State Powers

Yupan Liu, Qisheng Wang

We investigate the computational complexity of estimating the trace of quantum state powers tr(ρq) for annqubit mixed quantum state ρ, given its state-preparation circuit of size poly(n). This quantity is closely related to and often interchangeable with the Tsallis entropy Sq(ρ) = 1—tr(ρq)/q—1, whereq= 1 corresponds to the von Neumann entropy. For any non-integerq≥ 1 + Ω(1), we provide a quantum estimator for Sq(ρ) with time complexity poly(n), exponentially improving the prior best results of exp(n)due to Acharya, Issa, Shende, and Wagner (ISIT 2019), Wang, Guan, Liu, Zhang, and Ying (TIT 2024)| Wang, Zhang, and Li (TIT 2024), and Wang and Zhang (TIT 2025). Our speedup is achieved by introducing efficiently computableuniform approximationsof positive power functions into quantum singular value transformation. Our quantum algorithm reveals a sharp phase transition between the case ofq= 1 and constantq> 1 in the computational complexity of the Quantumq-Tsallis Entropy Difference Problem (TsallisQEDq), particularly deciding whether the difference Sq(ρ0)−Sq(ρ1) is at least 0.001 or at most −0.001: • For any 1 + Ω (1) ≤q≤ 2, TsallisQEDqis BQP-complete, which implies that Purity Estimation is also BQP-complete. • For any 1≤q≤1+1/n— 1, TsallisQED q is QSZK-hard, leading to hardness of approximating the von Neumann entropy because Sq(ρ) ≤ S (ρ), as long as BQPQSZK. The hardness results are derived from reductions based on new inequalities for the quantumq-Jensen–(Shannon–)Tsallis divergence with 1 ≤q≤ 2, which are of independent interest.

arXiv:2410.13559•IEEE Transactions on Information Theory•Apr 14, 2026•0 citations

Entropic Functionals in Quantum Statistical Mechanics

Vojkan Jakšić, Claude‐Alain Pillet

We describe quantum entropic functionals and outline a research program dealing with entropic fluctuations in non-equilibrium quantum statistical mechanics.

arXiv:1301.3332•Jan 15, 2013•1 citation

Subadditivity of q-entropies for q>1

Koenraad M. R. Audenaert

I prove a basic inequality for Schatten q-norms of quantum states on a finite-dimensional bipartite Hilbert space H1⊗H2: 1+∥ρ∥q⩾∥Tr1ρ∥q+∥Tr2ρ∥q. This leads to a proof—in the finite-dimensional case—of Raggio’s conjecture [G. A. Raggio, J. Math. Phys. 36, 4785 (1995)] that the q-entropies Sq(ρ)=(1−Tr[ρq])∕(q−1) are subadditive for q>1; that is, for any state ρ, Sq(ρ) is not greater than the sum of the Sq of its reductions, Sq(ρ)⩽Sq(Tr1ρ)+Sq(Tr2ρ).

arXiv:0705.1276•Journal of Mathematical Physics•Aug 1, 2007•78 citations

ENTROPIC FUNCTIONALS IN QUANTUM STATISTICAL MECHANICS

Vojkan Jakšić, Claude‐Alain Pillet

We describe quantum entropic functionals and outline a research program dealing with entropic fluctuations in non-equilibrium quantum statistical mechanics.

WORLD SCIENTIFIC eBooks•Oct 1, 2013•4 citations

A Short Note on Quantum Entropies

Amelia Carolina Sparavigna

In quantum statistical mechanics, the extension of the classical Gibbs entropy is the von Neumann entropy, obtained from a quantum-mechanical system described by means of its density matrix. Here we shortly discuss this entropy and the use of generalized entropies instead of it

•Jan 11, 2016•1 citation
We investigate the computational complexity of estimating the trace of quantum state powers tr(ρq) for annqubit mixed quantum state ρ, given its state-preparation circuit of size poly(n). This quantity is closely related to and often interchangeable with the Tsallis entropy Sq(ρ) = 1—tr(ρq)/q—1, whereq= 1 corresponds to the von Neumann entropy. For any non-integerq≥ 1 + Ω(1), we provide a quantum estimator for Sq(ρ) with time complexity poly(n), exponentially improving the prior best results of exp(n)due to Acharya, Issa, Shende, and Wagner (ISIT 2019), Wang, Guan, Liu, Zhang, and Ying (TIT 2024)| Wang, Zhang, and Li (TIT 2024), and Wang and Zhang (TIT 2025). Our speedup is achieved by introducing efficiently computableuniform approximationsof positive power functions into quantum singular value transformation. Our quantum algorithm reveals a sharp phase transition between the case ofq= 1 and constantq> 1 in the computational complexity of the Quantumq-Tsallis Entropy Difference Problem (TsallisQEDq), particularly deciding whether the difference Sq(ρ0)−Sq(ρ1) is at least 0.001 or at most −0.001: • For any 1 + Ω (1) ≤q≤ 2, TsallisQEDqis BQP-complete, which implies that Purity Estimation is also BQP-complete. • For any 1≤q≤1+1/n— 1, TsallisQED q is QSZK-hard, leading to hardness of approximating the von Neumann entropy because Sq(ρ) ≤ S (ρ), as long as BQPQSZK. The hardness results are derived from reductions based on new inequalities for the quantumq-Jensen–(Shannon–)Tsallis divergence with 1 ≤q≤ 2, which are of independent interest.