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

Physical review. E

Uncertainty relation for symmetric Petz-Rényi relative entropy

Domingos S. P. Salazar

Published May 20, 2024• 2 citations
Publisher

Abstract

Holevo introduced a fidelity between quantum states that is symmetric and as effective as the trace distance in evaluating their similarity. This fidelity is bounded by a function of the trace distance, a relationship to which we will refer as Holevo's inequality. More broadly, Holevo's fidelity is part of a one-parameter family of symmetric Petz-Rényi relative entropies, which in turn satisfy a Pinsker's-like inequality with respect to the trace distance. Although Holevo's inequality is tight, Pinsker's inequality is loose for this family. We show that the symmetric Petz-Rényi relative entropies satisfy a tight inequality with respect to the trace distance, improving Pinsker's and reproducing Holevo's as a specific case. Additionally, we show how this result emerges from a symmetric Petz-Rényi uncertainty relation, a result that encompasses several relations in quantum and stochastic thermodynamics.

DOI
10.1103/physreve.109.l052106

Related papers

Symmetric Petz-Rényi relative entropy uncertainty relation

Domingos S. P. Salazar

Holevo introduced a fidelity between quantum states that is symmetric and as effective as the trace norm in evaluating their similarity. This fidelity is bounded by a function of the trace norm, a relationship to which we will refer as Holevo's inequality. More broadly, Holevo's fidelity is part of a one-parameter family of symmetric Petz-Rényi relative entropies, which in turn satisfy a Pinsker's-like inequality with respect to the trace norm. Although Holevo's inequality is tight, Pinsker's inequality is loose for this family. We show that the symmetric Petz-Rényi relative entropies satisfy a tight inequality with respect to the trace norm, improving Pinsker's and reproducing Holevo's as a specific case. Additionally, we show how this result emerges from a symmetric Petz-Rényi uncertainty relation, a result that encompasses several relations in quantum and stochastic thermodynamics.

arXiv:2402.01390•Feb 2, 2024•0 citations

Rényi–Holevo inequality from α-z-Rényi relative entropies

Diego G. Bussandri, Grzegorz Rajchel-Mieldzioć, Pedro W. Lamberti +1 more

We investigate bounds in the transmission of classical information through quantum systems. Our focus lies in the generalized Holevo theorem, which provides a single-letter Holevo-like inequality from arbitrary quantum distance measures. Through the introduction of the [Formula: see text]-[Formula: see text]-Rényi relative entropies, which comprise known relevant quantities such as the Rényi relative entropy and the sandwiched Rényi relative entropy, we establish the Holevo–Rényi inequality. This result leads to a quantum bound for the [Formula: see text]-mutual information, suggesting new insights into communication channel performance and the fundamental limits for reliability functions in memoryless multi-letter communication channels.

arXiv:2309.04539•International Journal of Quantum Information•Apr 30, 2024•2 citations

Recoverability for Holevo's Just-as-Good Fidelity

Mark M. Wilde

Holevo's just-as-good fidelity is a similarity measure for quantum states that has found several applications. One of its critical properties is that it obeys a data processing inequality: the measure does not decrease under the action of a quantum channel on the underlying states. In this paper, I prove a refinement of this data processing inequality that includes an additional term related to recoverability. That is, if the increase in the measure is small after the action of a partial trace, then one of the states can be nearly recovered by the Petz recovery channel, while the other state is perfectly recovered by the same channel. The refinement is given in terms of the trace distance of one of the states to its recovered version and also depends on the minimum eigenvalue of the other state. As such, the refinement is universal, in the sense that the recovery channel depends only on one of the states, and it is explicit, given by the Petz recovery channel.

arXiv:1801.02800•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2018•9 citations

Recoverability for Holevo's Just-as-Good Fidelity

Mark M. Wilde

Holevo's just-as-good fidelity is a similarity measure for quantum states that has found several applications. One of its critical properties is that it obeys a data processing inequality: the measure does not decrease under the action of a quantum channel on the underlying states. In this paper, I prove a refinement of this data processing inequality that includes an additional term related to recoverability. That is, if the increase in the measure is small after the action of a partial trace, then one of the states can be nearly recovered by the Petz recovery channel, while the other state is perfectly recovered by the same channel. The refinement is given in terms of the trace distance of one of the states to its recovered version and also depends on the minimum eigenvalue of the other state. As such, the refinement is universal, in the sense that the recovery channel depends only on one of the states, and it is explicit, given by the Petz recovery channel. Full version of this paper is accessible at arXiv:1801.02800

Civil War Book Review•Aug 15, 2018•5 citations

Petz–Rényi relative entropy in QFT from modular theory

Markus B. Fröb, Leonardo Sangaletti

Abstract We consider the generalization of the Araki–Uhlmann formula for relative entropy to Petz–Rényi relative entropy. We compute this entropy for a free scalar field in the Minkowski wedge between the vacuum and a coherent state, as well as for the free chiral current in a thermal state. In contrast to the relative entropy which in these cases only depends on the symplectic form and thus reduces to the classical entropy of a wave packet, the Petz–Rényi relative entropy also depends on the symmetric part of the two-point function and is thus genuinely quantum. We also consider the relation with standard subspaces, where we define the Rényi entropy of a vector and show that it admits an upper bound given by the entropy of the vector.

arXiv:2411.09696•Letters in Mathematical Physics•Mar 17, 2025•4 citations

Sharp Continuity of Petz and Sandwiched Rényi Conditional Entropies

Hao-Chung Cheng, Po-Chieh Liu

We determine the sharp modulus of continuity, in trace distance, of the optimized Petz and sandwiched Rényi conditional entropies for every order $α\in[\frac12,1)$. If two bipartite states are within trace distance $δ$, then both conditional entropies differ by at most $\frac{1}{1-α} \log[(1-\varepsilon)^α +(D-1)^{1-α}\varepsilon^α]$, where $\varepsilon := \min\{δ,1-1/D\}$ and $D$ is the effective dimension, given by the dimension of the first subsystem times the largest possible Schmidt rank. For every distance constraint $δ\in[0,1]$, the bound is attained by an isotropic pair with a maximally entangled anchor. Taking $α\uparrow1$ recovers the recent sharp continuity bound of quantum conditional entropy by Berta et al. [arXiv:2607.24687]. The proof linearizes the relevant concave Rényi functional at a comparison point dictated by the isotropic equality family. Schmidt-rank domination extends the equality geometry to an arbitrary anchor state, after which trace-distance duality and a noncommutative calibration estimate control the perturbation and anchor term without weakening the sharp constant. The latter estimate requires matrix analysis and is assisted by ChatGPT 5.6 Sol.

quant-pharXiv:2608.04947•Aug 6, 2026•0 citations
Holevo introduced a fidelity between quantum states that is symmetric and as effective as the trace distance in evaluating their similarity. This fidelity is bounded by a function of the trace distance, a relationship to which we will refer as Holevo's inequality. More broadly, Holevo's fidelity is part of a one-parameter family of symmetric Petz-Rényi relative entropies, which in turn satisfy a Pinsker's-like inequality with respect to the trace distance. Although Holevo's inequality is tight, Pinsker's inequality is loose for this family. We show that the symmetric Petz-Rényi relative entropies satisfy a tight inequality with respect to the trace distance, improving Pinsker's and reproducing Holevo's as a specific case. Additionally, we show how this result emerges from a symmetric Petz-Rényi uncertainty relation, a result that encompasses several relations in quantum and stochastic thermodynamics.
Holevo introduced a fidelity between quantum states that is symmetric and as effective as the trace norm in evaluating their similarity. This fidelity is bounded by a function of the trace norm, a relationship to which we will refer as Holevo's inequality. More broadly, Holevo's fidelity is part of a one-parameter family of symmetric Petz-Rényi relative entropies, which in turn satisfy a Pinsker's-like inequality with respect to the trace norm. Although Holevo's inequality is tight, Pinsker's inequality is loose for this family. We show that the symmetric Petz-Rényi relative entropies satisfy a tight inequality with respect to the trace norm, improving Pinsker's and reproducing Holevo's as a specific case. Additionally, we show how this result emerges from a symmetric Petz-Rényi uncertainty relation, a result that encompasses several relations in quantum and stochastic thermodynamics.
We investigate bounds in the transmission of classical information through quantum systems. Our focus lies in the generalized Holevo theorem, which provides a single-letter Holevo-like inequality from arbitrary quantum distance measures. Through the introduction of the [Formula: see text]-[Formula: see text]-Rényi relative entropies, which comprise known relevant quantities such as the Rényi relative entropy and the sandwiched Rényi relative entropy, we establish the Holevo–Rényi inequality. This result leads to a quantum bound for the [Formula: see text]-mutual information, suggesting new insights into communication channel performance and the fundamental limits for reliability functions in memoryless multi-letter communication channels.
Holevo's just-as-good fidelity is a similarity measure for quantum states that has found several applications. One of its critical properties is that it obeys a data processing inequality: the measure does not decrease under the action of a quantum channel on the underlying states. In this paper, I prove a refinement of this data processing inequality that includes an additional term related to recoverability. That is, if the increase in the measure is small after the action of a partial trace, then one of the states can be nearly recovered by the Petz recovery channel, while the other state is perfectly recovered by the same channel. The refinement is given in terms of the trace distance of one of the states to its recovered version and also depends on the minimum eigenvalue of the other state. As such, the refinement is universal, in the sense that the recovery channel depends only on one of the states, and it is explicit, given by the Petz recovery channel.
Holevo's just-as-good fidelity is a similarity measure for quantum states that has found several applications. One of its critical properties is that it obeys a data processing inequality: the measure does not decrease under the action of a quantum channel on the underlying states. In this paper, I prove a refinement of this data processing inequality that includes an additional term related to recoverability. That is, if the increase in the measure is small after the action of a partial trace, then one of the states can be nearly recovered by the Petz recovery channel, while the other state is perfectly recovered by the same channel. The refinement is given in terms of the trace distance of one of the states to its recovered version and also depends on the minimum eigenvalue of the other state. As such, the refinement is universal, in the sense that the recovery channel depends only on one of the states, and it is explicit, given by the Petz recovery channel. Full version of this paper is accessible at arXiv:1801.02800
Abstract We consider the generalization of the Araki–Uhlmann formula for relative entropy to Petz–Rényi relative entropy. We compute this entropy for a free scalar field in the Minkowski wedge between the vacuum and a coherent state, as well as for the free chiral current in a thermal state. In contrast to the relative entropy which in these cases only depends on the symplectic form and thus reduces to the classical entropy of a wave packet, the Petz–Rényi relative entropy also depends on the symmetric part of the two-point function and is thus genuinely quantum. We also consider the relation with standard subspaces, where we define the Rényi entropy of a vector and show that it admits an upper bound given by the entropy of the vector.
We determine the sharp modulus of continuity, in trace distance, of the optimized Petz and sandwiched Rényi conditional entropies for every order α∈[12,1)α\in[\frac12,1)α∈[21​,1). If two bipartite states are within trace distance δδδ, then both conditional entropies differ by at most 11−αlog⁡[(1−ε)α+(D−1)1−αεα]\frac{1}{1-α} \log[(1-\varepsilon)^α +(D-1)^{1-α}\varepsilon^α]1−α1​log[(1−ε)α+(D−1)1−αεα], where ε:=min⁡{δ,1−1/D}\varepsilon := \min\{δ,1-1/D\}ε:=min{δ,1−1/D} and DDD is the effective dimension, given by the dimension of the first subsystem times the largest possible Schmidt rank. For every distance constraint δ∈[0,1]δ\in[0,1]δ∈[0,1], the bound is attained by an isotropic pair with a maximally entangled anchor. Taking α↑1α\uparrow1α↑1 recovers the recent sharp continuity bound of quantum conditional entropy by Berta et al. [arXiv:2607.24687]. The proof linearizes the relevant concave Rényi functional at a comparison point dictated by the isotropic equality family. Schmidt-rank domination extends the equality geometry to an arbitrary anchor state, after which trace-distance duality and a noncommutative calibration estimate control the perturbation and anchor term without weakening the sharp constant. The latter estimate requires matrix analysis and is assisted by ChatGPT 5.6 Sol.