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:quant-ph/0403187 · Linear Algebra and its Applications

On trace inequalities and their applications to noncommutative communication theory

Kenjiro Yanagi, Shigeru Furuichi, Ken Kuriyama

Published Oct 21, 2004• 5 citations
arXivHTMLPDF
DOI
10.1016/j.laa.2004.08.027

Related papers

Noncommutative versions of inequalities in quantum information theory

Ali Reza Dadkhah, Mohammad Sal Moslehian, Kenjiro Yanagi

arXiv:1905.02014•Analysis and Mathematical Physics•May 15, 2019•5 citations

Noncommutative analogues of the Cramér-Rao inequality in the quantum measurement theory

Alexander Semenovich Holevo

Lecture notes in mathematics•Jan 1, 1976•10 citations

Optimal Trace Inequalities for Single-Shot Quantum Information

Gilad Gour

Single-shot quantum information theory is governed not only by entropy exponents, but also by the finite-resource constants that multiply them. These constants directly affect the quantitative performance of decoupling, covering, convex-splitting, position-based decoding, and one-shot communication protocols, yet they are often inherited from nonoptimal scalar estimates or from classical-to-quantum lifting arguments that introduce additional losses. In this work we show that the operator layer-cake representation provides a mechanism for lifting sharp scalar inequalities to the noncommutative setting without loss. Using an iterative Riemann--Stieltjes integration-by-parts method, we derive sharp quantum trace inequalities that tighten several standard single-shot bounds. For a logarithmic trace inequality recently introduced by Cheng \emph{et al.}\ and subsequently used in quantum covering and decoupling problems, we determine the exact optimal prefactor, replacing the previously known constant by a smaller Lambert-$W$ constant and proving universal optimality for positive operators. We also completely characterize the threshold behavior that appears under normalization to quantum states. In addition, we establish optimal two-sided collision-divergence inequalities, which lead to improved position-based decoding and single-shot classical communication bounds. These results show that several finite-resource bounds in single-shot quantum information can be tightened, and that within the layer-cake Rényi-divergence framework the resulting constants are genuine optimality barriers rather than artifacts of the proof.

quant-pharXiv:2604.14617•Apr 17, 2026•1 citation

A trace inequality arising from quantum information theory

Jun Ichi Fujii

Linear Algebra and its Applications•Jan 8, 2005•25 citations

Multivariate trace inequalities, p-fidelity, and universal recovery beyond tracial settings

Marius Junge, Nicholas D. LaRacuente

Trace inequalities are general techniques with many applications in quantum information theory, often replacing the classical functional calculus in noncommutative settings. The physics of quantum field theory and holography, however, motivates entropy inequalities in type III von Neumann algebras that lack a semifinite trace. The Haagerup and Kosaki Lp spaces enable re-expressing trace inequalities in non-tracial von Neumann algebras. In particular, we show this for the generalized Araki–Lieb–Thirring and Golden–Thompson inequalities from the work of Sutter et al. [Commun. Math. Phys. 352(1), 37 (2017)]. Then, using the Haagerup approximation method, we prove a general von Neumann algebra version of universal recovery map corrections to the data processing inequality for relative entropy. We also show subharmonicity of a logarithmic p-fidelity of recovery. Furthermore, we prove that the non-decrease of relative entropy is equivalent to the existence of an L1-isometry implementing the channel on both input states.

arXiv:2009.11866•Journal of Mathematical Physics•Dec 1, 2022•9 citations

Relative entropy representations via tracial joint spectral measures

Lukas Schmitt

We show that for positive semidefinite $A$ and $B$ the relative entropy can be written as $D(A\|B)=2\int a\log(a/b)\,\mathrm{d}μ_{A,B}(a,b)$, where $μ_{A,B}$ denotes Heinävaara's tracial joint spectral measure. This allows us to obtain a unified derivation of several known integral representations of relative entropy from scalar equalities. Scalar inequalities can be used in the same way to derive Pinsker-type bounds. We further show that the testing curve $t\mapsto \mathrm{tr}[A-tB]_+$ is piecewise affine exactly when $A$ and $B$ commute, which is equivalent to their testing region being a polygon. This gives a characterization of noncommutativity through the curvature. As further applications, we derive inequalities for relative entropy variance and the loss of relative entropy under positive trace-preserving maps.

quant-pharXiv:2609.12547•Sep 14, 2026•1 citation
Single-shot quantum information theory is governed not only by entropy exponents, but also by the finite-resource constants that multiply them. These constants directly affect the quantitative performance of decoupling, covering, convex-splitting, position-based decoding, and one-shot communication protocols, yet they are often inherited from nonoptimal scalar estimates or from classical-to-quantum lifting arguments that introduce additional losses. In this work we show that the operator layer-cake representation provides a mechanism for lifting sharp scalar inequalities to the noncommutative setting without loss. Using an iterative Riemann--Stieltjes integration-by-parts method, we derive sharp quantum trace inequalities that tighten several standard single-shot bounds. For a logarithmic trace inequality recently introduced by Cheng \emph{et al.}\ and subsequently used in quantum covering and decoupling problems, we determine the exact optimal prefactor, replacing the previously known constant by a smaller Lambert-WWW constant and proving universal optimality for positive operators. We also completely characterize the threshold behavior that appears under normalization to quantum states. In addition, we establish optimal two-sided collision-divergence inequalities, which lead to improved position-based decoding and single-shot classical communication bounds. These results show that several finite-resource bounds in single-shot quantum information can be tightened, and that within the layer-cake Rényi-divergence framework the resulting constants are genuine optimality barriers rather than artifacts of the proof.
Trace inequalities are general techniques with many applications in quantum information theory, often replacing the classical functional calculus in noncommutative settings. The physics of quantum field theory and holography, however, motivates entropy inequalities in type III von Neumann algebras that lack a semifinite trace. The Haagerup and Kosaki Lp spaces enable re-expressing trace inequalities in non-tracial von Neumann algebras. In particular, we show this for the generalized Araki–Lieb–Thirring and Golden–Thompson inequalities from the work of Sutter et al. [Commun. Math. Phys. 352(1), 37 (2017)]. Then, using the Haagerup approximation method, we prove a general von Neumann algebra version of universal recovery map corrections to the data processing inequality for relative entropy. We also show subharmonicity of a logarithmic p-fidelity of recovery. Furthermore, we prove that the non-decrease of relative entropy is equivalent to the existence of an L1-isometry implementing the channel on both input states.
We show that for positive semidefinite AAA and BBB the relative entropy can be written as D(A∥B)=2∫alog⁡(a/b) dμA,B(a,b)D(A\|B)=2\int a\log(a/b)\,\mathrm{d}μ_{A,B}(a,b)D(A∥B)=2∫alog(a/b)dμA,B​(a,b), where μA,Bμ_{A,B}μA,B​ denotes Heinävaara's tracial joint spectral measure. This allows us to obtain a unified derivation of several known integral representations of relative entropy from scalar equalities. Scalar inequalities can be used in the same way to derive Pinsker-type bounds. We further show that the testing curve t↦tr[A−tB]+t\mapsto \mathrm{tr}[A-tB]_+t↦tr[A−tB]+​ is piecewise affine exactly when AAA and BBB commute, which is equivalent to their testing region being a polygon. This gives a characterization of noncommutativity through the curvature. As further applications, we derive inequalities for relative entropy variance and the loss of relative entropy under positive trace-preserving maps.