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

Reports on Mathematical Physics

On the Shannon entropy and related functionals on convex sets

Armin Uhlmann

Published Oct 1, 1970• 40 citations
Publisher
DOI
10.1016/0034-4877(70)90009-1

Related papers

A possible generalization Shannon’s entropy using q-calculus

Nelson Flores-Gallegos

Journal of Mathematical Chemistry•Aug 16, 2022•5 citations

Some applications of the Hermite–Hadamard inequality for log‐convex functions in quantum divergences

Fatemeh Hassanzad, Hossein Mehri‐Dehnavi, Hamzeh Agahi

One of the beautiful and very simple inequalities for a convex function is the Hermite–Hadamard inequality. The concept of ‐convexity is a strong variant of convexity. In this paper, by the Hermite–Hadamard inequality, we introduce two‐parametric Tsallis quantum relative entropy, two‐parametric Tsallis–Lin quantum relative entropy, and two‐parametric quantum Jensen–Shannon divergence in quantum information theory. Then some properties of quantum Tsallis–Jensen–Shannon divergence for two density matrices are investigated by this inequality.

Mathematical Methods in the Applied Sciences•Feb 24, 2022•0 citations

Uncertainty relations expressed by Shannon-like entropies

Vladimír Majerník, Eva Majerníková, Serge Shpyrko

Abstract Besides the well-known Shannon entropy, there is a set of Shannon-like entropies which have applications in statistical and quantum physics. These entropies are functions of certain parameters and converge toward Shannon entropy when these parameters approach the value 1. We describe briefly the most important Shannon-like entropies and present their graphical representations. Their graphs look almost identical, though by superimposing them it appears that they are distinct and characteristic of each Shannon-like entropy. We try to formulate the alternative entropic uncertainty relations by means of the Shannon-like entropies and show that all of them equally well express the uncertainty principle of quantum physics.

Open Physics•Sep 1, 2003•23 citations

On the discretization of probability density functions and the continuous Rényi entropy

Diógenes Campos

Pramana•Jul 18, 2015•3 citations

Remarks on A-entropy

Alfred Wehrl

Reports on Mathematical Physics•Dec 1, 1977•19 citations

Entropy, Optimization and Coding Theory

Cunlu Zhou

Entropy is a central concept in many different disciplines, and many important applications involving entropy can be viewed as entropy optimization problems. In this dissertation we study a class of symmetric (conic) programming problems with nonlinear convex objective functions in the context of Euclidean Jordan algebras, which includes the so-called quantum (von Neumann) entropy optimization as a special case. Quantum entropy optimization plays an important role in many areas such as quantum computing, quantum information theory, machine learning, etc. We develop a long-step path-following algorithm for such optimization problems. The theoretical framework is developed for functions compatible (in the sense of Nesterov and Nemirovski) with the standard barrier function - lndet(x). Complexity estimates similar to the case of a linear-quadratic objective function are established, and the theoretical scheme is implemented for the quantum entropy optimization problem. The Shannon entropy optimization problem can be viewed as a special case of the quantum entropy optimization problem with diagonal matrices. We briefly discuss one application of the Shannon entropy optimization in coding theory, namely evaluating the asymptotic pseudoweight enumerators for protograph-based low-density parity-check (LDPC) codes. In the end we also briefly discuss some future work related to quantum relative entropy optimization.

•Jan 1, 2019•1 citation
One of the beautiful and very simple inequalities for a convex function is the Hermite–Hadamard inequality. The concept of ‐convexity is a strong variant of convexity. In this paper, by the Hermite–Hadamard inequality, we introduce two‐parametric Tsallis quantum relative entropy, two‐parametric Tsallis–Lin quantum relative entropy, and two‐parametric quantum Jensen–Shannon divergence in quantum information theory. Then some properties of quantum Tsallis–Jensen–Shannon divergence for two density matrices are investigated by this inequality.
Abstract Besides the well-known Shannon entropy, there is a set of Shannon-like entropies which have applications in statistical and quantum physics. These entropies are functions of certain parameters and converge toward Shannon entropy when these parameters approach the value 1. We describe briefly the most important Shannon-like entropies and present their graphical representations. Their graphs look almost identical, though by superimposing them it appears that they are distinct and characteristic of each Shannon-like entropy. We try to formulate the alternative entropic uncertainty relations by means of the Shannon-like entropies and show that all of them equally well express the uncertainty principle of quantum physics.
Entropy is a central concept in many different disciplines, and many important applications involving entropy can be viewed as entropy optimization problems. In this dissertation we study a class of symmetric (conic) programming problems with nonlinear convex objective functions in the context of Euclidean Jordan algebras, which includes the so-called quantum (von Neumann) entropy optimization as a special case. Quantum entropy optimization plays an important role in many areas such as quantum computing, quantum information theory, machine learning, etc. We develop a long-step path-following algorithm for such optimization problems. The theoretical framework is developed for functions compatible (in the sense of Nesterov and Nemirovski) with the standard barrier function - lndet(x). Complexity estimates similar to the case of a linear-quadratic objective function are established, and the theoretical scheme is implemented for the quantum entropy optimization problem. The Shannon entropy optimization problem can be viewed as a special case of the quantum entropy optimization problem with diagonal matrices. We briefly discuss one application of the Shannon entropy optimization in coding theory, namely evaluating the asymptotic pseudoweight enumerators for protograph-based low-density parity-check (LDPC) codes. In the end we also briefly discuss some future work related to quantum relative entropy optimization.