Exact characterizations for quantum conditional mutual information and some other entropies

• URL: http://arxiv.org/abs/2603.14650v1
• Date: Sun, 15 Mar 2026 23:08:57 GMT
• Title: Exact characterizations for quantum conditional mutual information and some other entropies
• Abstract summary: The Lieb and Ruskai's's summation theorem shows that the conditional mutual information must be nonnegative.<n>We transform this problem by providing a summation characterization of the mutual information, along with characterizations for other entropies.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Lieb and Ruskai's strong subadditivity theorem, which shows that the conditional mutual information must be nonnegative, is fundamental in quantum theory. It has numerous applications, such as in quantum error correction. When the mutual information is zero, the Petz recovery map can be used to reconstruct the quantum channel. When the mutual information is small, one seeks to define an optimal recovery channel. To this end, a mathematical characterization of the mutual information is desirable. We address this problem by providing an exact characterization of the mutual information, along with characterizations for other entropies. Our controls are sharp, leaving no room for improvement, in the sense that we provide equalities, regardless of whether the mutual information (or remainder) is small or large. We transform the definitions of these entropies into a summation of explicitly constructed terms, and the definition of each term obviously demonstrates the desired positivity/convexity/concavity. The summation converges rapidly and absolutely in a chosen elementary norm.

Related papers

• Tight any-shot quantum decoupling [23.729027844524893]
  We prove a novel one-shot decoupling theorem formulated in terms of quantum entropy relative distance.<n>We show that this bound is ensemble-tight in quantum relative entropy distance.
  arXiv  Detail & Related papers  (2026-02-19T15:01:26Z)
• Fidelity of entanglement and quantum entropies: unveiling their relationship in quantum states and channels [2.4260465227277197]
  Entanglement serves as a fundamental resource for various quantum information processing tasks.<n>We examine the relationship between entanglement and various quantum entropies for general two-qubit states.<n>We derive the upper bound on R'enyi 2-entropy, conditional R'enyi 2-entropy, Tsallis 2-entropy, and conditional Tsallis 2-entropy, in terms of the fidelity of entanglement.
  arXiv  Detail & Related papers  (2025-06-13T07:08:03Z)
• Quantum conditional entropies from convex trace functionals [7.988085110283119]
  We study properties of trace functionals that generalize those in [Zhang, Adv. Math. 365:107053 ( 2020)], arising from a novel family of conditional entropies with applications in quantum information.<n>Building on new convexity results for these functionals, we establish data-processing inequalities and additivity properties for our entropies, demonstrating their operational significance.
  arXiv  Detail & Related papers  (2024-10-29T12:03:10Z)
• Quantum information scrambling in adiabatically-driven critical systems [49.1574468325115]
  Quantum information scrambling refers to the spread of the initially stored information over many degrees of freedom of a quantum many-body system. Here, we extend the notion of quantum information scrambling to critical quantum many-body systems undergoing an adiabatic evolution.
  arXiv  Detail & Related papers  (2024-08-05T18:00:05Z)
• Uncertainty relations in terms of generalized entropies derived from information diagrams [0.0]
  Inequalities between entropies and the index of coincidence form a long-standing direction of researches in classical information theory. This paper is devoted to entropic uncertainty relations derived from information diagrams.
  arXiv  Detail & Related papers  (2023-05-29T10:41:28Z)
• Integral formula for quantum relative entropy implies data processing inequality [0.0]
  We prove the monotonicity of quantum relative entropy under trace-preserving positive linear maps. For a simple application of such monotonicities, we consider any divergence' that is non-increasing under quantum measurements. An argument due to Hiai, Ohya, and Tsukada is used to show that the infimum of such a divergence' on pairs of quantum states with prescribed trace distance is the same as the corresponding infimum on pairs of binary classical states.
  arXiv  Detail & Related papers  (2022-08-25T16:32:02Z)
• Cone-Restricted Information Theory [4.358456799125693]
  We show which results in quantum information theory rely upon the positive semidefinite cone and which can be generalized. We present parallel results for the extended conditional min-entropy. In doing so, we extend the notion of k-superpositive channels to superchannels.
  arXiv  Detail & Related papers  (2022-06-09T06:27:48Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Shannon theory beyond quantum: information content of a source [68.8204255655161]
  We extend the definition of information content to operational probabilistic theories. We prove relevant properties as the subadditivity, and the relation between purity and information content of a state.
  arXiv  Detail & Related papers  (2021-12-23T16:36:06Z)
• Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification [56.61325554836984]
  The max-relative entropy together with its smoothed version is a basic tool in quantum information theory. We derive the exact exponent for the decay of the small modification of the quantum state in smoothing the max-relative entropy based on purified distance.
  arXiv  Detail & Related papers  (2021-11-01T16:35:41Z)
• R\'enyi divergence inequalities via interpolation, with applications to generalised entropic uncertainty relations [91.3755431537592]
  We investigate quantum R'enyi entropic quantities, specifically those derived from'sandwiched' divergence. We present R'enyi mutual information decomposition rules, a new approach to the R'enyi conditional entropy tripartite chain rules and a more general bipartite comparison.
  arXiv  Detail & Related papers  (2021-06-19T04:06:23Z)
• Shannon theory for quantum systems and beyond: information compression for fermions [68.8204255655161]
  We show that entanglement fidelity in the fermionic case is capable of evaluating the preservation of correlations. We introduce a fermionic version of the source coding theorem showing that, as in the quantum case, the von Neumann entropy is the minimal rate for which a fermionic compression scheme exists.
  arXiv  Detail & Related papers  (2021-06-09T10:19:18Z)
• Optimized quantum f-divergences [6.345523830122166]
  I introduce the optimized quantum f-divergence as a related generalization of quantum relative entropy. I prove that it satisfies the data processing inequality, and the method of proof relies upon the operator Jensen inequality. One benefit of this approach is that there is now a single, unified approach for establishing the data processing inequality for the Petz--Renyi and sandwiched Renyi relative entropies.
  arXiv  Detail & Related papers  (2021-03-31T04:15:52Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.