Relative entropies play important roles in classical and quantum information theory. In this paper, we discuss the sandwiched Rényi relative entropy for [Formula: see text] on [Formula: see text] (the cone of positive trace-class operators acting on an infinite-dimensional complex Hilbert space [Formula: see text]) and characterize all surjective maps preserving the sandwiched Rényi relative entropy on [Formula: see text]. Such transformations have the form [Formula: see text] for each [Formula: see text], where [Formula: see text] and [Formula: see text] is either a unitary or an anti-unitary operator on [Formula: see text]. Particularly, all surjective maps preserving sandwiched Rényi relative entropy on [Formula: see text] (the set of all quantum states on [Formula: see text]) are necessarily implemented by either a unitary or an anti-unitary operator.
Relative entropies play important roles in classical and quantum information theory. In this paper, we discuss the sandwiched Rényi relative entropy for [Formula: see text] on [Formula: see text] (the cone of positive trace-class operators acting on an infinite-dimensional complex Hilbert space [Formula: see text]) and characterize all surjective maps preserving the sandwiched Rényi relative entropy on [Formula: see text]. Such transformations have the form [Formula: see text] for each [Formula: see text], where [Formula: see text] and [Formula: see text] is either a unitary or an anti-unitary operator on [Formula: see text]. Particularly, all surjective maps preserving sandwiched Rényi relative entropy on [Formula: see text] (the set of all quantum states on [Formula: see text]) are necessarily implemented by either a unitary or an anti-unitary operator.
Maximal Rényi Relative Entropy for α>2
Quantum relative entropies play a fundamental role in quantum information theory. In the classical setting, Rényi relative entropies constitute, up to linear combinations, the most general class of relative entropies, naturally motivating the search for their minimal and maximal quantum extensions. The minimal extension is known to be the reverse sandwiched Rényi relative entropy for α∈[0,1/2) and the sandwiched Rényi relative entropy for α≥1/2. In contrast, the maximal extension had previously been identified only for α∈[0,2], where it is given by the geometric Rényi relative entropy. In this work, we complete this characterization by proving that for α>2, the maximal extension is given by the α-z Rényi relative entropy with z=α−1. As an application, we determine when an energy-incoherent state can be transformed into an energy-coherent state by a Gibbs-preserving operation assisted by an uncorrelated catalyst, thereby fully characterizing the coherence-generating power of this class of operations in the catalytic setting.
Itis well known that in quantum information quantum relative is monotonically decreasing under the completely positive and trace-preserving maps. For a new proposed sandwiched R\'enyi quantum relative, a map that is linear trace-preserving and whose Hilber-Schmidt adjoint map satisfies Schwarz inequality, monotonicity still holds. We give a new proof of monotonicity of sandwiched R\'enyi relative entropy for α∈[21,1). The proof is based on complex interplotation techniques, which already has been used to prove monotonicity under trace-preserving and positive map for α∈(1,∞).
We explore the role of sandwiched Renyi relative entropy in AdS/CFT and in finite-dimensional models of holographic quantum error correction. In particular, in the context of operator algebra quantum error correction, we discuss a suitable generalization of sandwiched Renyi relative entropy over finite-dimensional von Neumann algebras. It is then shown that the equality of bulk and boundary sandwiched relative Renyi entropies is equivalent to algebraic encoding of bulk and boundary states, the Ryu-Takayanagi formula, the equality of bulk and boundary relative entropy, and subregion duality. This adds another item to an equivalence theorem between the last four items established in arxiv:1607.03901. We then discuss the sandwiched Renyi relative entropy defined in terms of modular operators, and show that this becomes the definition naturally suited to the finite-dimensional models of holographic quantum error correction. Finally, we explore some numerical calculations of sandwiched Renyi relative entropies for a simple holographic random tensor network in order to obtain a better understanding of corrections to the exact equality of bulk and boundary sandwiched relative Renyi entropy.
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.
The quantum Rényi relative entropies play a prominent role in quantum information theory, finding applications in characterizing error exponents and strong converse exponents for quantum hypothesis testing and quantum communication theory. On a different thread, quantum Gaussian states have been intensely investigated theoretically, motivated by the fact that they are more readily accessible in the laboratory than are other, more exotic quantum states. In this paper, we derive formulas for the quantum Rényi relative entropies of quantum Gaussian states. We consider both the traditional (Petz) Rényi relative entropy as well as the more recent sandwiched Rényi relative entropy, finding formulas that are expressed solely in terms of the mean vectors and covariance matrices of the underlying quantum Gaussian states. Our development handles the hitherto elusive case for the Petz–Rényi relative entropy when the Rényi parameter is larger than one. Finally, we also derive a formula for the max-relative entropy of two quantum Gaussian states, and we discuss some applications of the formulas derived here.
Quantum information theory is built on entropic quantities; among them, the sandwiched Rényi relative entropy is a fundamental divergence with various applications, and its data processing inequality (DPI) under quantum channels is a cornerstone result. In this work, we present a Lean 4 library for quantum information, designed as a reusable formal infrastructure for theoretical analysis. As a central demonstration of the library, we formalize the DPI for the sandwiched Rényi relative entropy for positive semidefinite operators on finite-dimensional quantum systems. The library provides a basis-independent operator-theoretic framework for finite-dimensional quantum mechanics compatible with the standard mathematical library Mathlib, including reusable interfaces for finite-dimensional systems, states, channels, tensor products, partial traces, Choi operators, Kraus representations, and Stinespring representations. It also builds infrastructure for noncommutative trace inequalities, including operator monotonicity and convexity via the real continuous functional calculus, block-operator positivity, Hilbert-Schmidt operator spaces, Jensen's operator inequality, generalized perspectives, operator power means, and Lieb-Ando trace inequalities. On top of this framework, we formalize entropy-specific ingredients for the DPI: variational formulas for the sandwiched quasi-entropy via Young and reverse-Young inequalities, tensor-product compatibility of real powers, and Haar measures on unitary groups. Together, these components yield a Lean formalization of the DPI, give strong subadditivity as a corollary, and provide the last missing component needed to complete the Lean formalization of the generalized quantum Stein's lemma. More broadly, the development provides machine-checkable foundations for future formalized and AI-assisted research in quantum information theory.