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

Linear Algebra and its Applications

On upper bound for the quantum entropy

Waldemar Hebisch, Robert Olkiewicz, Bogusław Zegarliński

Published May 1, 2001• 2 citations
Publisher
DOI
10.1016/s0024-3795(01)00244-0

Related papers

A Note on Quantum Entropy

Frank Hansen

arXiv:1511.09189•Mathematical Physics Analysis and Geometry•May 12, 2016•1 citation

Smooth min-max relative entropy based bounds for one-shot classical and quantum state redistribution.

Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi

We study the problem of state redistribution both in the classical (shared randomness assisted) and quantum (entanglement assisted) one-shot settings and provide new upper bounds on the communication required. Our classical bounds are in terms of smooth-min and max relative entropies and the quantum bounds are in terms of max relative entropy and Renyi relative entropy of order $\frac{1}{2}$. We also consider a special case of this problem in the classical setting, previously studied by Braverman and Rao (2011). We show that their upper bound is optimal. In addition we provide an alternate protocol achieving a priory different looking upper bound. However, we show that our upper bound is essentially the same as their upper bound and hence also optimal. For the quantum case, we show that our achievability result is upper bounded by the achievability result obtained in Berta, Christandl, Touchette (2016).

•Feb 8, 2017•2 citations

THE ASYMPTOTIC BEHAVIOR OF QUANTUM ε-ENTROPY

Shigeo Akashi

QP-PQ, quantum probability and white noise analysis•Oct 1, 1991•0 citations

Upper continuity bound on the quantum quasi-relative entropy

Anna Vershynina

We provide an upper bound on the quasi-relative entropy in terms of the trace distance. The bound is derived for any operator monotone decreasing function and either mixed qubit or classical states. Moreover, we derive an upper bound for the Umegaki and Tsallis relative entropies in the case of any finite-dimensional states. The bound for the relative entropy improves the known bounds for some states in any dimensions larger than four. The bound for the Tsallis entropy improves the known bounds.

arXiv:1904.00795•Journal of Mathematical Physics•Oct 1, 2019•5 citations

NOTES ON QUANTUM ENTROPY

Makoto Ohya, D�nes Petz

WORLD SCIENTIFIC eBooks•Feb 1, 2008•2 citations

Quantum uncertainty relations of Tsallis relative α entropy coherence based on MUBs

Fu-Gang Zhang

Abstract In this paper, we discuss quantum uncertainty relations of Tsallis relative α entropy coherence for a single qubit system based on three mutually unbiased bases. For α ∈ 1 2 , 1 ∪ ( 1 , 2 ] , the upper and lower bounds of sums of coherence are obtained. However, the above results cannot be verified directly for any α ∈ 0 , 1 2 . Hence, we only consider the special case of α = 1 n + 1 , where n is a positive integer, and we obtain the upper and lower bounds. By comparing the upper and lower bounds, we find that the upper bound is equal to the lower bound for the special α = 1 2 , and the differences between the upper and the lower bounds will increase as α increases. Furthermore, we discuss the tendency of the sum of coherence, and find that it has the same tendency with respect to the different θ or φ, which is opposite to the uncertainty relations based on the Rényi entropy and Tsallis entropy.

Communications in Theoretical Physics•Dec 13, 2021•2 citations
We study the problem of state redistribution both in the classical (shared randomness assisted) and quantum (entanglement assisted) one-shot settings and provide new upper bounds on the communication required. Our classical bounds are in terms of smooth-min and max relative entropies and the quantum bounds are in terms of max relative entropy and Renyi relative entropy of order 12\frac{1}{2}21​. We also consider a special case of this problem in the classical setting, previously studied by Braverman and Rao (2011). We show that their upper bound is optimal. In addition we provide an alternate protocol achieving a priory different looking upper bound. However, we show that our upper bound is essentially the same as their upper bound and hence also optimal. For the quantum case, we show that our achievability result is upper bounded by the achievability result obtained in Berta, Christandl, Touchette (2016).
Abstract In this paper, we discuss quantum uncertainty relations of Tsallis relative α entropy coherence for a single qubit system based on three mutually unbiased bases. For α ∈ 1 2 , 1 ∪ ( 1 , 2 ] , the upper and lower bounds of sums of coherence are obtained. However, the above results cannot be verified directly for any α ∈ 0 , 1 2 . Hence, we only consider the special case of α = 1 n + 1 , where n is a positive integer, and we obtain the upper and lower bounds. By comparing the upper and lower bounds, we find that the upper bound is equal to the lower bound for the special α = 1 2 , and the differences between the upper and the lower bounds will increase as α increases. Furthermore, we discuss the tendency of the sum of coherence, and find that it has the same tendency with respect to the different θ or φ, which is opposite to the uncertainty relations based on the Rényi entropy and Tsallis entropy.