Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userApproximate recoverability and relative entropy II: 2-positive channels of general v. Neumann algebras
71
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We generalize our results in paper I in this series to quantum channels between general v. Neumann algebras, proving the approximate recoverability of states which undergo a small change in relative entropy through the channel. To this end, we derive a strengthened form of the quantum data processing inequality for the change in relative entropy of two states under a channel between two v. Neumann algebras. Compared to the usual inequality, there is an explicit lower bound involving the fidelity between the original state and a recovery channel.
rate research
Read More
We prove the existence of a universal recovery channel that approximately recovers states on a v. Neumann subalgebra when the change in relative entropy, with respect to a fixed reference state, is small. Our result is a generalization of previous results that applied to type-I v. Neumann algebras by Junge at al. [arXiv:1509.07127]. We broadly follow their proof strategy but consider here arbitrary v. Neumann algebras, where qualitatively new issues arise. Our results hinge on the construction of certain analytic vectors and computations/estimations of their Araki-Masuda $L_p$ norms. We comment on applications to the quantum null energy condition.
Based on the resource theory for quantifying the coherence of quantum channels, we introduce a new coherence quantifier for quantum channels via maximum relative entropy. We prove that the maximum relative entropy for coherence of quantum channels is directly related to the maximally coherent channels under a particular class of superoperations, which results in an operational interpretation of the maximum relative entropy for coherence of quantum channels. We also introduce the conception of sub-superchannels and sub-superchannel discrimination. For any quantum channels, we show that the advantage of quantum channels in sub-superchannel discrimination can be exactly characterized by the maximum relative entropy of coherence for quantum channels. Similar to the maximum relative entropy of coherence for channels, the robustness of coherence for quantum channels has also been investigated. We show that the maximum relative entropy of coherence for channels provides new operational interpretations of robustness of coherence for quantum channels and illustrates the equivalence of the dephasing-covariant superchannels, incoherent superchannels, and strictly incoherent superchannels in these two operational tasks.
We prove that the minimal Renyi entropy of order 2 (RE2) output of a positive-partial-transpose(PPT)-inducing channel joint to an arbitrary other channel is equal to the sum of the minimal RE2 output of the individual channels. PPT-inducing channels are channels with a Choi matrix which is bound entangled or separable. The techniques used can be easily recycled to prove additivity for some non-PPT-inducing channels such as the depolarizing and transpose depolarizing channels, though not all known additive channels. We explicitly make the calculations for generalized Werner-Holevo channels as an example of both the scope and limitations of our techniques.
The property of superadditivity of the quantum relative entropy states that, in a bipartite system $mathcal{H}_{AB}=mathcal{H}_A otimes mathcal{H}_B$, for every density operator $rho_{AB}$ one has $ D( rho_{AB} || sigma_A otimes sigma_B ) ge D( rho_A || sigma_A ) +D( rho_B || sigma_B) $. In this work, we provide an extension of this inequality for arbitrary density operators $ sigma_{AB} $. More specifically, we prove that $ alpha (sigma_{AB})cdot D({rho_{AB}}||{sigma_{AB}}) ge D({rho_A}||{sigma_A})+D({rho_B}||{sigma_B})$ holds for all bipartite states $rho_{AB}$ and $sigma_{AB}$, where $alpha(sigma_{AB})= 1+2 || sigma_A^{-1/2} otimes sigma_B^{-1/2} , sigma_{AB} , sigma_A^{-1/2} otimes sigma_B^{-1/2} - mathbb{1}_{AB} ||_infty$.
In this paper, we derive a new generalisation of the strong subadditivity of the entropy to the setting of general conditional expectations onto arbitrary finite-dimensional von Neumann algebras. The latter inequality, which we call approximate tensorization of the relative entropy, can be expressed as a lower bound for the sum of relative entropies between a given density and its respective projections onto two intersecting von Neumann algebras in terms of the relative entropy between the same density and its projection onto an algebra in the intersection, up to multiplicative and additive constants. In particular, our inequality reduces to the so-called quasi-factorization of the entropy for commuting algebras, which is a key step in modern proofs of the logarithmic Sobolev inequality for classical lattice spin systems. We also provide estimates on the constants in terms of conditions of clustering of correlations in the setting of quantum lattice spin systems. Along the way, we show the equivalence between conditional expectations arising from Petz recovery maps and those of general Davies semigroups.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
