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

arXiv:2208.06840 · Quantum Information Processing

Coherence as entropy increment for Tsallis and Rényi entropies

Anna Vershynina

Published Feb 23, 2023• 4 citations
arXivHTMLPDF
DOI
10.1007/s11128-023-03872-y

Related papers

The Tsallis Relative 2-Entropy of Coherence for Qubit System

Lian-He Shao, Yongming Li

International Journal of Theoretical Physics•Jul 7, 2017•2 citations

Ordering states with Tsallis relative $$\alpha $$ α -entropies of coherence

Fu-Gang Zhang, Lian-He Shao, Yu Luo +1 more

arXiv:1607.01591•Quantum Information Processing•Dec 22, 2016•16 citations

Nearly Sample-Optimal Estimators for Quantum Rényi and Tsallis Entropies

Kean Chen, Qisheng Wang

In this paper, we provide estimators for quantum Rényi and Tsallis entropies with nearly optimal sample complexity. Specifically, for order $α$, dimension $d$, and additive error $\varepsilon$, 1. For $0 < α< 1$, the sample complexity is $O(d^{1+1/α}/\varepsilon^{1/α} + d^{1/α-1}/\varepsilon^{2})$ for Rényi entropy and $O(d^{1+1/α}/\varepsilon^{1/α} + d^{2-2α}/\varepsilon^2)$ for Tsallis entropy. In particular, for $0 < α\leq 1/2$, the sample complexity for both entropies is $O(d^{1+1/α}/\varepsilon^{1/α})$. 2. For non-integer $α> 1$, the sample complexity is $O(d^2/\varepsilon^{1/α} + d^{1-1/α}/\varepsilon^2)$ for Rényi entropy. Our upper bounds improve the quantum Rényi entropy estimators due to Acharya, Issa, Shende, and Wagner (2017) and the quantum Tsallis entropy estimators due to Chen, Liu, and Wang (2026), and match the lower bounds recently established by Wang (2026).

quant-pharXiv:2608.18070•Aug 19, 2026•4 citations

A bound on expectation values and variances of quantum observables via Rényi entropy and Tsallis entropy

Sujuan Zhang, Jing Li

Entropy is a key concept of quantum information theory. The entropy of a quantum system is a measure of its randomness and has many applications in quantum communication protocols, quantum coherence, and so on. In this paper, based on the Rényi entropy and Tsallis entropy, we derive the bounds of the expectation value and variance of a quantum observable. By the maximal value of Rényi entropy, we show an upper bound on the product of variance and entropy. Furthermore, we obtain the reverse uncertainty relation for the product and sum of the variances for [Formula: see text] observables respectively.

International Journal of Quantum Information•Apr 1, 2021•2 citations

Some properties of Tsallis and Tsallis–Lin quantum relative entropies

Reza Asgharzadeh Jelodar, Hossein Mehri‐Dehnavi, Hamzeh Agahi

Physica A Statistical Mechanics and its Applications•Dec 31, 2020•5 citations

Rényi Entropy and the Uncertainty Relations

Iwo Białynicki‐Birula

AIP conference proceedings•Jan 1, 2007•41 citations
Ordering states with Tsallis relative α\alpha α α -entropies of coherence
In this paper, we provide estimators for quantum Rényi and Tsallis entropies with nearly optimal sample complexity. Specifically, for order ααα, dimension ddd, and additive error ε\varepsilonε, 1. For 0<α<10 < α< 10<α<1, the sample complexity is O(d1+1/α/ε1/α+d1/α−1/ε2)O(d^{1+1/α}/\varepsilon^{1/α} + d^{1/α-1}/\varepsilon^{2})O(d1+1/α/ε1/α+d1/α−1/ε2) for Rényi entropy and O(d1+1/α/ε1/α+d2−2α/ε2)O(d^{1+1/α}/\varepsilon^{1/α} + d^{2-2α}/\varepsilon^2)O(d1+1/α/ε1/α+d2−2α/ε2) for Tsallis entropy. In particular, for 0<α≤1/20 < α\leq 1/20<α≤1/2, the sample complexity for both entropies is O(d1+1/α/ε1/α)O(d^{1+1/α}/\varepsilon^{1/α})O(d1+1/α/ε1/α). 2. For non-integer α>1α> 1α>1, the sample complexity is O(d2/ε1/α+d1−1/α/ε2)O(d^2/\varepsilon^{1/α} + d^{1-1/α}/\varepsilon^2)O(d2/ε1/α+d1−1/α/ε2) for Rényi entropy. Our upper bounds improve the quantum Rényi entropy estimators due to Acharya, Issa, Shende, and Wagner (2017) and the quantum Tsallis entropy estimators due to Chen, Liu, and Wang (2026), and match the lower bounds recently established by Wang (2026).
Entropy is a key concept of quantum information theory. The entropy of a quantum system is a measure of its randomness and has many applications in quantum communication protocols, quantum coherence, and so on. In this paper, based on the Rényi entropy and Tsallis entropy, we derive the bounds of the expectation value and variance of a quantum observable. By the maximal value of Rényi entropy, we show an upper bound on the product of variance and entropy. Furthermore, we obtain the reverse uncertainty relation for the product and sum of the variances for [Formula: see text] observables respectively.