Abstract
A quantum channel is sufficient with respect to a set of input states if it can be reversed on this set. In the approximate version, the input states can be recovered within an error bounded by the decrease of the relative entropy under the channel. Using a new integral representation of the relative entropy in Frenkel (Integral formula for quantum relative entropy implies data processing inequality, Quantum 7, 1102 (2023)), we present an easy proof of a characterization of sufficient quantum channels and recoverability by preservation of optimal success probabilities in hypothesis testing problems, equivalently, by preservation of \(L_1\)-distance.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
One of the fundamental properties of quantum relative entropy is monotonicity under quantum channels, or the data processing inequality (DPI):
for any pair of quantum states \(\rho ,\sigma \) and any completely positive trace preserving map, [32, 52]. The DPI implies other important quantum entropic inequalities, such as the Holevo bound [18], strong subadditivity of von Neumann entropy (SSA) [31] or the joint convexity of relative entropy. In fact, SSA, joint convexity and DPI are all equivalent, see [44] and the proof of DPI in [32] is based on the SSA.
The question when the data processing inequality becomes an equality for a completely positive map and a pair of states was first answered by Petz [38, 39], who proved that, provided the relative entropy \(D(\rho \Vert \sigma )\) is finite, equality occurs if and only if the two states can be fully recovered. This means that there exists a channel \(\Psi \) such that \(\Psi \circ \Phi (\rho )=\rho \) and \(\Psi \circ \Phi (\sigma )=\sigma \). In this case, we say that the channel \(\Phi \) is sufficient with respect to the pair of states \(\{\rho ,\sigma \}\), in analogy with the classical notion of a statistic sufficient with respect to a family of probability distributions. Moreover, Petz proved that there exists a universal recovery channel \(\Phi _\sigma \), such that \(\Phi _\sigma \circ \Phi (\sigma )=\sigma \) and we have \(\Phi _\sigma \circ \Phi (\rho )=\rho \) if and only if the channel \(\Phi \) is sufficient with respect to \(\{\rho ,\sigma \}\).
Sufficiency, or sometimes called reversibility, of channels was studied in a number of subsequent works and several characterizations and applications were found, [17, 20, 24, 25, 33, 35, 46]. In particular, equality conditions for various forms of DPI were studied, e.g. [27, 30, 44], and their relation to sufficiency were examined for other information theoretic or statistical quantities, such as different versions of quantum f-divergences [15, 16], quantum Rényi relative entropies [15, 21,22,23], Holevo quantity [45], Fisher information and \(L_1\)-distance [20].
An approximate version of sufficiency, called (approximate) recoverability is a much stronger result stating that if the decrease in the relative entropy is small, there exists a channel that recovers \(\sigma \) perfectly while \(\rho \) is recovered up to a small error. First result of this form was proved in the work of Fawzi and Renner [8], who considered approximate quantum Markov chains. This was soon extended to more general channels [28, 48, 49, 53] and a variety of quantities such as f-divergences [4, 5], optimized f-divergences [11] and Fisher information [12]. An important result in this context is existence of an universal recovery channel \(\Phi ^u_\sigma \) depending only on the state \(\sigma \) such that [28]
here \(\Vert \cdot \Vert _1\) denotes the trace norm and \(F(\rho ,\sigma )=\Vert \rho ^{1/2}\sigma ^{1/2}\Vert _1\) is the fidelity. See also [6, 7, 11] for the respective results for normal states of von Neumann algebras.
In the simplest setting of quantum hypothesis testing, the null hypothesis \(H_0=\sigma \) is tested against the alternative \(H_1=\rho \). The tests are represented by operators \(0\le M\le I\), with the interpretation that \(\textrm{Tr}\,[\omega M]\) is the probability of rejecting the hypothesis if the true state is \(\omega \). For the test represented by M, the Bayes error probability for \(\lambda \in [0,1]\) is expressed as
and the test is Bayes optimal for \(\lambda \) if this error probability is minimal over all possible tests. It is quite clear that if we replace the states by \(\Phi (\sigma )\) and \(\Phi (\rho )\), the achievable error probabilities cannot be decreased. It is a natural question when the optimal error probabilities are preserved under \(\Phi \), which is equivalent to preservation of the \(L_1\)-norm:
In classical statistics, the theorem of Pfanzagl [40, 47] states that if the achievable error probabilities for a pair of probability measures \(\{P_0,P_1\}\) do not increase after transformation by a statistic T, then T must be sufficient with respect to \(\{P_0,P_1\}\). The corresponding result for quantum channels was investigated in [20, 26], and in [34] where more general risk functions for decision problems were considered. The equivalent question of preservation of the \(L_1\)-distance, with applications to error correction, was studied in [2, 50]. In all these works, additional conditions were needed, such as the equalities have to be assumed either for larger sets of states with a special structure, or for any number of copies of \(\rho \) and \(\sigma \). The case when \(\rho \) and \(\sigma \) commute, or the channel \(\Phi \) has commutative range, was solved in [20].
Many of the results on recoverability of channels rely on an integral representation of the relative entropies or other quantities in question such as f-divergences. These formulas are based on integral representation of operator convex functions. Recently, a new integral formula for the relative entropy of positive semidefinite matrices was proved in [9]. This formula can be easily extended to infinite dimensional Hilbert spaces and rewritten in terms of the optimal Bayes error probabilities. We use this formula for simple proofs of a characterization of recoverability of quantum channels by preserving hypothesis testing error probabilities, or equivalently \(L_1\)-distances, without any additional assumptions needed in the previous works.
2 Preliminaries
Throughout this paper, \(\mathcal {H}\) is a Hilbert space and we denote by \(\mathcal {T}(\mathcal {H})\) the set of operators with finite trace and by \(\mathcal {S}(\mathcal {H})\) the set of states (density operators) on \(\mathcal {H}\), that is, positive operators of trace 1. For a self-adjoint operator \(A\in B(\mathcal {H})\), \(A_\pm \) denotes the positive/negative part of A and for \(A\ge 0\), we denote the projection onto the support of A by \(\textrm{supp}(A)\). The \(L_1\)-distance in \(\mathcal {T}(\mathcal {H})\) is defined as
If \(S\in \mathcal {T}(\mathcal {H})\) is self-adjoint, then we have
and \(\textrm{Tr}\,[S_\pm ]=\tfrac{1}{2}(\Vert S\Vert _1\pm \textrm{Tr}\,[S])\).
A quantum channel \(\Phi \) is a completely positive trace preserving map \(\mathcal {T}(\mathcal {H})\rightarrow \mathcal {T}(\mathcal {K})\). The adjoint of \(\Phi \) is the map \(\Phi ^*:B(\mathcal {K})\rightarrow B(\mathcal {H})\), defined by
It is easily seen that \(\Phi ^*\) is completely positive and unital.
For positive operators \(\rho ,\sigma \in \mathcal {T}(\mathcal {H})\), the quantum relative entropy is defined as
![](http://media.springernature.com/lw396/springer-static/image/art%3A10.1007%2Fs11005-024-01775-2/MediaObjects/11005_2024_1775_Equ52_HTML.png)
Relative entropy satisfies the data processing inequality (1) which holds for any pair of states \(\rho ,\sigma \) and any quantum channel \(\Phi : \mathcal {T}(\mathcal {H})\rightarrow \mathcal {T}(\mathcal {K})\).
2.1 Quantum hypothesis testing and \(L_1\)-distance
In the problem of hypothesis testing, the task is to test the hypothesis \(H_0=\sigma \) against the alternative \(H_1=\rho \). Any test is represented by an effect on \(\mathcal {H}\), that is, an operator \(0\le M\le I\), corresponding to rejecting the hypothesis. For a test M, the error probabilities are
For \(\lambda \in (0,1)\), we define the Bayes optimal test as the minimizer of
The proof of the following description of the Bayes optimal tests can be found in [26].
Lemma 1
(Quantum Neyman-Pearson) Let \(\rho ,\sigma \) be states, \(\lambda \in (0,1)\) and put \(s=\frac{\lambda }{1-\lambda }\). A test M is a Bayes optimal test for \(\lambda ,\sigma ,\rho \) if and only if
where \(P_{s,\pm }=\textrm{supp}((\rho -s\sigma )_\pm )\) and \(P_{s,0}=I-P_{s,+}-P_{s,-}\). The optimal error probability is then
It is easily seen that the error probabilities and the related quantities in the above lemma are monotone under channels, in particular,
In fact, monotonicity holds if \(\Phi \) is a positive trace preserving map, so complete positivity is not needed.
2.2 Integral formula for the relative entropy
The following new integral representation of the relative entropy was proved by Frenkel in [9], in the case \(\dim (\mathcal {H})<\infty \).
Theorem 1
Let \(\rho ,\sigma \) be positive operators in \(\mathcal {T}(\mathcal {H})\). Then
Proof
By [9, Theorem 6], the equality holds if \(\dim (\mathcal {H})<\infty \). We will now prove that it can be extended to the case when \(\dim (\mathcal {H})=\infty \). Assume first that \(\textrm{supp}(\rho )\le \textrm{supp}(\sigma )\), so that we may assume that \(\sigma \) is faithful and \(\mathcal {H}\) is separable by restriction to the support of \(\sigma \). We will use a standard limiting argument to extend the finite dimensional result to the separable case.
Let \(P_n\) be an increasing sequence of finite rank projections such that \(\vee _n P_n=I\). Put \(\rho _n=P_n\rho P_n\), \(\sigma _n=P_n\sigma P_n\). Then restricted to the finite dimensional space \(P_n\mathcal {H}\), \(\rho _n\) and \(\sigma _n\) are positive semidefinite operators with \(\textrm{supp}(\rho _n)\le \textrm{supp}(\sigma _n)\). Moreover, \(\lim _n \textrm{Tr}\,[\rho _n]=\textrm{Tr}\,[\rho ]\), \(\lim _n\textrm{Tr}\,[\sigma _n]=\textrm{Tr}\,[\sigma ]\) and by [14, Theorem 4.5] we have \(D(\rho \Vert \sigma )=\lim _n D(\rho _n\Vert \sigma _n)\).
For \(t\in {\mathbb {R}}\) and \(n\in {\mathbb {N}}\), put
Then
where the inequality follows from \(0\le M_n\le P_n\le P_{n+1}\). Furthermore, since \(P_n\rightarrow I\) in the strong operator topology, we have using [13, Theorem 1] that
It follows that
Hence \(f_n\) is an increasing sequence of positive integrable functions converging pointwise to f. Since the integral formula holds in finite dimensions, we see using the Lebesgue monotone convergence theorem that
If \(\textrm{supp}(\rho )\not \le \textrm{supp}(\sigma )\), then there is some projection Q such that \(\textrm{Tr}\,[\sigma Q]=0\) and \(c:=\textrm{Tr}\,[\rho Q]>0\). Then for any \(t>1\) we have
and hence
In this case we also have \(D(\rho \Vert \sigma )=\infty \) by definition. \(\square \)
The integral formula leads to an easy proof of the fact that DPI for the relative entropy holds for all positive trace preserving maps. This fact was first proved in [36], using interpolation techniques.
For our purposes, the following form of the integral formula will be useful.
Corollary 1
Let \(\rho ,\sigma \in \mathcal {S}(\mathcal {H})\). Then for any \(\lambda ,\mu \ge 0\) such that \(\mu \sigma \le \rho \le \lambda \sigma \), we have
Proof
Since \(((1-t)\rho +t\sigma )_-=0\) for \(t\in [0,1]\), the integral splits into two parts, integrating over \(t\le 0\) and \(t\ge 1\). For the first integral, since \(1-t>0\), we have \(((1-t)\rho +t\sigma )_-=(1-t)(\rho -\frac{t}{t-1}\sigma )_-\) and
For \(t\ge 1\), we use \(((1-t)\rho +t\sigma )_-=((t-1)\rho -t\sigma )_+=(t-1)(\rho -\frac{t}{t-1}\sigma )_+\) and inserting into the integral, we obtain
The proof is finished by using the equality \(\textrm{Tr}\,[(\rho -s\sigma )_+]=1-s +\textrm{Tr}\,[(\rho -s\sigma )_-]\).
\(\square \)
Remark 1
The smallest value of \(\lambda \) in the above expression is related to the quantum max-relative entropy defined as
Similarly, the largest value of \(\mu \) is \(e^{-D_{\max }(\sigma \Vert \rho )}\). An important related quantity is the Hilbert projective metric [3]
See [41,42,43] for more details and interpretations in the context of quantum information theory. Note also that we may always put \(\mu =0\) and if \(\dim (\mathcal {H})<\infty \), then the condition that \(\rho \le \lambda \sigma \) for some \(\lambda >0\) is equivalent to \(\textrm{supp}(\rho )\le \textrm{supp}(\sigma )\), so it holds whenever \(D(\rho \Vert \sigma )\) is finite. In infinite dimensions, this condition is much more restrictive.
2.3 Sufficiency and recoverability for quantum channels
The following definition first appeared in [39] and can be seen as a quantum generalization of the classical notion of a sufficient statistic.
Definition 1
We say that a channel \(\Phi :B(\mathcal {H})\rightarrow B(\mathcal {K})\) is sufficient with respect to a set of states \(\mathcal {S}\subseteq \mathcal {S}(\mathcal {H})\) if there exists a channel \(\Psi :B(\mathcal {K})\rightarrow B(\mathcal {H})\) such that
For a state \(\sigma \in \mathcal {S}(\mathcal {H})\), we define an inner product \(\langle \,\cdot ,\cdot \,\rangle _\sigma \) in \(B(\textrm{supp}(\sigma ))\) by
It was proved in [39] that the (unique) linear map \(\Phi _\sigma : \mathcal {T}(\textrm{supp}(\Phi (\sigma )))\rightarrow \mathcal {T}(\textrm{supp}(\sigma ))\) determined by
is a channel, called the Petz dual of \(\Phi \) with respect to \(\sigma \) (or the Petz recovery map). Note that we always have \(\Phi _\sigma \circ \Phi (\sigma )=\sigma \) and as it was further proved in [39], if both \(\sigma \) and \(\Phi (\sigma )\) are faithful, then \(\Phi \) is sufficient with respect to \(\mathcal {S}\) if and only if \(\Phi _\sigma \circ \Phi (\rho )=\rho \) for all \(\rho \in \mathcal {S}\), so that \(\Phi _\sigma \) is a universal recovery channel.
Remark 2
If \(\dim (\mathcal {H})<\infty \), we obtain the familiar form of the Petz recovery channel:
We also define
and
for a probability measure \(\mu \) on \({\mathbb {R}}\). Clearly, all these maps are channels \(\mathcal {T}(\textrm{supp}(\Phi (\sigma )))\rightarrow \mathcal {T}(\textrm{supp}(\sigma ))\) that recover the state \(\sigma \).
Theorem 2
Assume that \(\rho ,\sigma \in \mathcal {S}(\mathcal {H})\) are such that \(D(\rho \Vert \sigma )<\infty \). Then the following are equivalent.
-
(i)
\(\Phi \) is sufficient with respect to \(\{\rho ,\sigma \}\);
-
(ii)
\(D(\Phi (\rho )\Vert \Phi (\sigma ))=D(\rho \Vert \sigma )\);
-
(iii)
\(\Phi _{\sigma ,t}\circ \Phi (\rho )=\rho \), for some \(t\in {\mathbb {R}}\);
-
(iv)
\(\Phi _{\sigma ,t}\circ \Phi (\rho )=\rho \), for all \(t\in {\mathbb {R}}\);
-
(v)
\(\Phi _{\sigma ,\mu }\circ \Phi (\rho )=\rho \) for some probability measure \(\mu \).
Proof
In finite dimensions the proof follows from [53, Theorem 3.3]. The proof in the general case will be given in the Appendix. \(\square \)
The following is an approximate version of sufficiency of channels, called recoverability of \(\Phi \).
Theorem 3
[28] Let \(\sigma \in \mathcal {S}(\mathcal {H})\). Then for any channel \(\Phi : \mathcal {T}(\mathcal {H})\rightarrow \mathcal {T}(\mathcal {K})\) there exists a channel \(\Phi ^u_\sigma : \mathcal {T}(\mathcal {K})\rightarrow \mathcal {T}(\mathcal {H})\) such that \(\Phi ^u_\sigma \circ \Phi (\sigma )=\sigma \) and for any \(\rho \in \mathcal {S}(\mathcal {H})\) we have
In the above theorem, \(F(\rho _0,\rho _1)\) is the fidelity
The second inequality in Theorem 3 is obtained using the inequality \(-\log (x)\ge 1-x\) for \(x\in (0,1)\) and the Fuchs-van de Graaf inequality, [10].
The universal recovery channel \(\Phi ^u_\sigma \) can be chosen as
here \(P=\textrm{supp}(\Phi (\sigma ))\) and \(\beta _0\) is the probability density function
Note that if \(\textrm{supp}(\rho )\le \textrm{supp}(\sigma )\), then \(\textrm{supp}(\Phi (\rho ))\le \textrm{supp}(\Phi (\sigma ))\), so that \(\Phi ^u_\sigma (\Phi (\rho ))=\Phi _{\sigma ,\beta _0}(\Phi (\rho ))\) and the statement in this case follows by [28, Theorem 2.1]. If \(\textrm{supp}(\rho )\not \le \textrm{supp}(\sigma )\), then \(D(\rho \Vert \sigma )=\infty \) and the inequality holds trivially.
3 Sufficiency and recoverability by hypothesis testing
The characterization in Theorem 2 and the integral formula in Corollary 1 now give an easy proof of characterization of sufficiency and recoverability by quantities related to hypothesis testing. Note that here we do not have to make any further assumptions about the states.
Theorem 4
Let \(\Phi :\mathcal {T}(\mathcal {H})\rightarrow \mathcal {T}(\mathcal {K})\) be a channel and let \(\rho ,\sigma \in \mathcal {S}(\mathcal {H})\). Then the following are equivalent.
-
(i)
\(P_e(\lambda , \Phi (\rho ),\Phi (\sigma ))= P_e(\lambda ,\rho ,\sigma )\), for all \(\lambda \in [0,1]\);
-
(ii)
\(\Vert \Phi (\rho )-s\Phi (\sigma )\Vert _1= \Vert \rho -s\sigma \Vert _1\), for all \(s\ge 0\);
-
(iii)
\(\textrm{Tr}\,[(\Phi (\rho )-s\Phi (\sigma ))_{+}]= \textrm{Tr}\,[(\rho -s\sigma )_{+}]\), for all \(s\ge 0\);
-
(iv)
\(\textrm{Tr}\,[(\Phi (\rho )-s\Phi (\sigma ))_{-}]= \textrm{Tr}\,[(\rho -s\sigma )_{-}]\), for all \(s\ge 0\);
-
(v)
\(\Phi \) is sufficient with respect to \(\{\rho ,\sigma \}\).
Proof
The equivalences between (i)-(iv) are clear from Lemma 1. Assume that (iv) holds. Suppose first that \(\rho \le \lambda \sigma \) for some \(\lambda >0\). Then also \(\Phi (\rho )\le \lambda \Phi (\sigma )\) and we have by Corollary 1
By Theorem 2, this implies (v). In the general case, let \(\sigma _0=\frac{1}{2}(\rho +\sigma )\), then \(\rho \le 2\sigma _0\) and it is easily seen that the equality (ii) implies a similar equality with \(\sigma \) replaced by \(\sigma _0\). It follows that \(\Phi \) is sufficient with respect to \(\{\rho ,\sigma _0\}\), which implies (v). The implication (v) \(\implies \) (ii) follows from monotonicity of the \(L_1\)-distance. \(\square \)
We are now interested in a similar result for recoverability. Assume first that there is a channel \(\Lambda : \mathcal {T}(\mathcal {K})\rightarrow \mathcal {T}(\mathcal {H})\) such that \(\Lambda \circ \Phi (\sigma )=\sigma \) and \(\Vert \Lambda \circ \Phi (\rho )-\rho \Vert _1\le \epsilon \). We then have
Using Lemma 1, we see that the resulting inequality in (4) is equivalent to any of the following inequalities
The following result gives the converse statement. Note that here we will need the assumption that the Hilbert projective metric \(D_\Omega (\rho \Vert \sigma )\) is finite, equivalently, that \(\mu \sigma \le \rho \le \lambda \sigma \) for some \(\mu ,\lambda >0\) (see Remark 1), to get a nontrivial result.
Theorem 5
Let \(\rho ,\sigma \in \mathcal {S}(\mathcal {H})\) and let \(\Phi :\mathcal {T}(\mathcal {H})\rightarrow \mathcal {T}(\mathcal {K})\) be a quantum channel. If
holds for some \(\epsilon \ge 0\), then there exists a channel \(\Lambda :\mathcal {T}(\mathcal {K})\rightarrow \mathcal {T}(\mathcal {H})\) such that \(\Lambda \circ \Phi (\sigma )=\sigma \) and
Moreover, we may take \(\Lambda =\Phi ^u_\sigma \) as in (3).
Proof
The statement is trivial if \(D_\Omega (\rho \Vert \sigma )=\infty \), so assume that \(\mu \sigma \le \rho \le \lambda \sigma \) for \(\mu ,\lambda >0\), \(\mu =e^{-D_{\max }(\sigma \Vert \rho )}\) and \(\lambda =e^{D_{\max }(\rho \Vert \sigma )}\). Then also \(\mu \Phi (\sigma )\le \Phi (\rho )\le \lambda \Phi (\sigma )\). By the assumptions, inequality (6) holds. Using Corollary 1, we get
The statement now follows by Theorem 3. \(\square \)
Remark 3
The recoverability result can be also formulated in the setting of comparison of statistical experiments, which is an extension of the classical theory of Blackwell [1], Törgersen [51] and Le Cam [29]. A (quantum) statistical experiment is any parametrized family of (quantum) states. For two experiments \({\mathcal {E}}\) and \({\mathcal {E}}_0\) with the same parameter set (not necessarily living on the same Hilbert space), we say that \({\mathcal {E}}_0\) is \((2,\epsilon )\)-deficient with respect to \({\mathcal {E}}\) if the error probabilities of testing problems involving elements of \({\mathcal {E}}_0\) are up to \(\epsilon \) not worse than those of corresponding testing problems for \({\mathcal {E}}\). See [19] for a more precise definition. In particular, for \({\mathcal {E}}_0=\{\rho _0,\sigma _0\}\) and \({\mathcal {E}}=\{\rho ,\sigma \}\), this amounts to the condition
Using Lemma 1, we see that this is equivalent to any of the inequalities
It is easily seen that this is true if there is some channel \(\Lambda \) such that \(\Vert \Lambda (\rho _0)-\rho \Vert _1\le \epsilon \) and \(\Vert \Lambda (\sigma _0)-\sigma \Vert _1\le \epsilon \). In the classical case the converse holds, but in the quantum case this is not true. We can obtain some form of the converse statement if \(\rho _0=\Phi (\rho )\) and \(\sigma _0=\Phi (\sigma )\), in a similar way as in Theorem 5.
Data availability
Data sharing is not applicable to this article as no datasets were generated or analyzed during the current study.
References
Blackwell, D.: Equivalent comparisons of experiments. Ann. Math. Stat. 24(2), 265–272 (1953). https://doi.org/10.1214/aoms/1177729032
Blume-Kohout, R., Ng, H.K., Poulin, D., Viola, L.: Information-preserving structures: a general framework for quantum zero-error information. Phys. Rev. A 82(6), 062306 (2010). https://doi.org/10.1103/PhysRevA.82.062306
Bushell, P.J.: Hilbert’s metric and positive contraction mappings in a Banach space. Arch. Ration. Mech. Anal. 52, 330–338 (1973). https://doi.org/10.1007/BF00247467
Carlen, E.A., Vershynina, A.: Recovery and the data processing inequality for quasi-entropies. IEEE Trans. Inf. Theory 64(10), 6929–6938 (2018). https://doi.org/10.1109/TIT.2018.2812038
Carlen, E.A., Vershynina, A.: Recovery map stability for the data processing inequality. J. Phys. A Math. Theor. 53(3), 035204 (2020). https://doi.org/10.1088/1751-8121/ab5ab7
Faulkner, T., Hollands, S.: Approximate recoverability and relative entropy II: 2-positive channels of general von Neumann algebras. Lett. Math. Phys. 112(2), 26 (2022). https://doi.org/10.1007/s11005-022-01510-9
Faulkner, T., Hollands, S., Swingle, B., Wang, Y.: Approximate recovery and relative entropy I: General von Neumann subalgebras. Commun. Math. Phys. 389(1), 349–397 (2022). https://doi.org/10.1007/s00220-021-04143-6
Fawzi, O., Renner, R.: Quantum conditional mutual information and approximate Markov chains. Commun. Math. Phys. 340(2), 575–611 (2015). https://doi.org/10.1007/s00220-015-2466-x
Frenkel, P.E.: Integral formula for quantum relative entropy implies data processing inequality. Quantum 7, 1102 (2023)
Fuchs, C.A., Van De Graaf, J.: Cryptographic distinguishability measures for quantum-mechanical states. IEEE Trans. Inf. Theory 45(4), 1216–1227 (1999). https://doi.org/10.1109/18.761271
Gao, L., Wilde, M.M.: Recoverability for optimized quantum f-divergences. J. Phys. A Math. Theor. 54(38), 385302 (2021). https://doi.org/10.1088/1751-8121/ac1dc2
Gao, L., Li, H., Marvian, I., Rouzé, C.: Sufficient statistic and recoverability via Quantum Fisher Information metrics. arXiv:2302.02341 (2023)
Grümm, H.: Two theorems about \(C_p\). Rep. Math. Phys. 4(3), 211–215 (1973). https://doi.org/10.1016/0034-4877(73)90026-8
Hiai, F.: Quantum \(f\)-divergences in von Neumann algebras. I. Standard \(f\)-divergences. J. Math. Phys. 59(10), 102202 (2018)
Hiai, F.: Quantum \(f\)-Divergences in von Neumann Algebras: Reversibility of Quantum Operations. Mathematical Physics Studies, Springer, Singapore (2021). https://doi.org/10.1007/978-981-33-4199-9
Hiai, F., Mosonyi, M.: Different quantum f-divergences and the reversibility of quantum operations. Rev. Math. Phys. 29(07), 1750023 (2017). https://doi.org/10.1142/S0129055X17500234
Hiai, F., Mosonyi, M., Petz, D., Bény, C.: Quantum f-divergences and error correction. Rev. Math. Phys. 23(07), 691–747 (2011). https://doi.org/10.1142/S0129055X11004412
Holevo, A.S.: Bounds for the quantity of information transmitted by a quantum communication channel. Problemy Peredachi Informatsii 9(3), 3–11 (1973)
Jenčová, A.: Comparison of quantum binary experiments. Rep. Math. Phys. 70(2), 237–249 (2012). https://doi.org/10.1016/S0034-4877(12)60043-3
Jenčová, A.: Reversibility conditions for quantum operations. Rev. Math. Phys. 24(07), 1250016 (2012). https://doi.org/10.1142/S0129055X1250016X
Jenčová, A.: Preservation of a quantum Rényi relative entropy implies existence of a recovery map. J. Phys. A 50, 085303 (2017). https://doi.org/10.1088/1751-8121/aa5661
Jenčová, A.: Rényi relative entropies and noncommutative \(L_p\)-spaces. Ann. Henri Poincaré 19, 2513–2542 (2018). https://doi.org/10.1007/s00023-018-0683-5
Jenčová, A.: Rényi relative entropies and noncommutative \(L_p\)-spaces II. Ann. Henri Poincaré 22, 3235–3254 (2021). https://doi.org/10.1007/s00023-021-01074-9
Jenčová, A., Petz, D.: Sufficiency in quantum statistical inference: a survey with examples. Infin. Dimens. Anal. Quantum Probab. Relat. Top. 9(03), 331–351 (2006). https://doi.org/10.1142/S0219025706002408
Jenčová, A., Petz, D.: Sufficiency in quantum statistical inference. Commun. Math. Phys. 263, 259–276 (2006). https://doi.org/10.1007/s00220-005-1510-7
Jenčová, A.: Quantum hypothesis testing and sufficient subalgebras. Lett. Math. Phys. 93, 15–27 (2010). https://doi.org/10.1007/s11005-010-0398-0
Jenčová, A., Ruskai, M.B.: A unified treatment of convexity of relative entropy and related trace functions, with conditions for equality. Rev. Math. Phys. 22, 1099–1121 (2010)
Junge, M., Renner, R., Sutter, D., Wilde, M.M., Winter, A.: Universal recovery maps and approximate sufficiency of quantum relative entropy. Ann. Henri Poincaré 19(10), 2955–2978 (2018). https://doi.org/10.1007/s00023-018-0716-0
Le Cam, L.: Sufficiency and approximate sufficiency. Ann. Math. Stat. 35(4), 1419–1455 (1964). https://doi.org/10.1214/aoms/1177700372
Leditzky, F., Rouzé, C., Datta, N.: Data processing for the sandwiched Rényi divergence: a condition for equality. Lett. Math. Phys. 107(1), 61–80 (2017). https://doi.org/10.1007/s11005-016-0896-9
Lieb, E.H., Ruskai, M.B.: Proof of the strong subadditivity of quantum-mechanical entropy. Les rencontres physiciens-mathématiciens de Strasbourg-RCP25 19, 36–55 (1973). https://doi.org/10.1063/1.1666274
Lindblad, G.: Completely positive maps and entropy inequalities. Commun. Math. Phys. 40, 147–151 (1975). https://doi.org/10.1007/BF01609396
Łuczak, A.: Quantum sufficiency in the operator algebra framework. Int. J. Theor. Phys. 53(10), 3423–3433 (2014). https://doi.org/10.1007/s10773-013-1747-4
Łuczak, A.: On a general concept of sufficiency in von Neumann algebras. Probab. Math. Stat. 35, 313–324 (2015)
Mosonyi, M., Petz, D.: Structure of sufficient quantum coarse-grainings. Lett. Math. Phys. 68, 19–30 (2004). https://doi.org/10.1007/s11005-004-4072-2
Müller-Hermes, A., Reeb, D.: Monotonicity of the quantum relative entropy under positive maps. Ann. Henri Poincaré 18, 1777–1788 (2017). https://doi.org/10.1007/s00023-017-0550-9
Paulsen, V.: Completely Bounded Maps and Operator Algebras. Cambridge University Press, Cambridge (2002)
Petz, D.: Sufficient subalgebras and the relative entropy of states of a von Neumann algebra. Commun. Math. Phys. 105(1), 123–131 (1986). https://doi.org/10.1007/BF01212345
Petz, D.: Sufficiency of channels over von Neumann algebras. Q. J. Math. 39(1), 97–108 (1988). https://doi.org/10.1093/qmath/39.1.97
Pfanzagl, J.: A characterization of sufficiency by power functions. Metrika 21(1), 197–199 (1974). https://doi.org/10.1007/BF01893900
Reeb, D., Kastoryano, M.J., Wolf, M.M.: Hilbert’s projective metric in quantum information theory. J. Math. Phys. 52(8), 082201 (2011). https://doi.org/10.1063/1.3615729
Regula, B.: Probabilistic transformations of quantum resources. Phys. Rev. Lett. 128(11), 110505 (2022). https://doi.org/10.1103/PhysRevLett.128.110505
Regula, B., Lami, L., Wilde, M.M.: Postselected quantum hypothesis testing (2022). arXiv:2209.10550
Ruskai, M.B.: Inequalities for quantum entropy: a review with conditions for equality. J. Math. Phys. 43(9), 4358–4375 (2002). https://doi.org/10.1063/1.1497701
Shirokov, M.E.: Reversibility conditions for quantum channels and their applications. Sbornik Mathematics 204(8), 1215 (2013). https://doi.org/10.1070/SM2013v204n08ABEH004337
Shirokov, M.E.: Reversibility of a quantum channel: general conditions and their applications to bosonic linear channels. J. Math. Phys. 54(11), 112201 (2013). https://doi.org/10.1063/1.4827436
Strasser, H.: Mathematical Theory of Statistics. Walter de Gruyter, Berlin (1985). https://doi.org/10.1515/9783110850826
Sutter, D., Tomamichel, M., Harrow, A.W.: Strengthened monotonicity of relative entropy via pinched Petz recovery map. IEEE Trans. Inf. Theory 62(5), 2907–2913 (2016). https://doi.org/10.1109/TIT.2016.2545680
Sutter, D., Berta, M., Tomamichel, M.: Multivariate trace inequalities. Commun. Math. Phys. 352, 37–58 (2017). https://doi.org/10.1007/s00220-016-2778-5
Ticozzi, F., Viola, L.: Quantum information encoding, protection, and correction from trace-norm isometries. Phys. Rev. A 81(3), 032313 (2010). https://doi.org/10.1103/PhysRevA.81.032313
Törgersen, E.: Comparison of Statistical Experiments. Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge (1991). https://doi.org/10.1017/CBO9780511666353
Uhlmann, A.: Relative entropy and the Wigner-Yanase-Dyson-Lieb concavity in an interpolation theory. Commun. Math. Phys. 54, 21–32 (1977). https://doi.org/10.1007/BF01609834
Wilde, M.M.: Recoverability in quantum information theory. Proc. R. Soc. A Math. Phys. Eng. Sci. 471(2182), 20150338 (2015). https://doi.org/10.1098/rspa.2015.0338
Acknowledgements
I am grateful to Mark Wilde and Fumio Hiai for their comments on an earlier version of the manuscript. The research was supported by the grant VEGA 2/0142/20 and the Slovak Research and Development Agency Grant APVV-20-0069.
Funding
Open access funding provided by The Ministry of Education, Science, Research and Sport of the Slovak Republic in cooperation with Centre for Scientific and Technical Information of the Slovak Republic.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The author declares that there is no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix: Proof of Theorem 2
Appendix: Proof of Theorem 2
The implication (i) \(\implies \) (ii) follows by the data processing inequality (1), (ii) \(\implies \) (iii) (with \(t=0\)) was proved in [24, 39]. The implications (iii) \(\implies \) (i) and (iv) \(\implies \) (v) \(\implies \) (i) are easy, so the only thing left to prove is (i) \(\implies \) (iv).
By the assumption \(D(\rho \Vert \sigma )<\infty \), we have that \(\textrm{supp}(\rho )\le \textrm{supp}(\sigma )\) and also \(\textrm{supp}(\Phi (\rho ))\le \textrm{supp}(\Phi (\sigma )\). We may therefore assume that both \(\sigma \) and \(\Phi (\sigma )\) are faithful, by restriction to the respective supports.
With this assumption, we will also need to recall some further properties of sufficient channels from [24, 39]. Let us denote by \(u_t\) and \(v_t\) the Connes cocycles
then \(u_t\) and \(v_t\) are one-parameter families of isometries satisfying the conditions
By the results of [24, 39], we can see that if \(\Phi \) is sufficient with respect to \(\{\rho ,\sigma \}\), then \(u_t\) is in the multiplicative domain of the unital completely positive map \(\Phi _\sigma ^*\) and similarly \(v_t\) is in the multiplicative domain of \(\Phi ^*\), see [37, Theorem 3.18] for the definition and properties of multiplicative domains. Moreover, \(\Phi ^*(v_t)=u_t\) and \(\Phi _\sigma ^*(u_t)=v_t\). It follows that for any \(s,t\in {\mathbb {R}}\),
and similarly \(\Phi _\sigma ^*(\sigma ^{it}u_s\sigma ^{-it})=\Phi (\sigma )^{it}v_s\Phi (\sigma )^{-it}\). Let now \(A\in B(\mathcal {H})\), we have for all \(s,t\in {\mathbb {R}}\),
and the analytic continuation to \(s=-\tfrac{1}{2}i\) of the last expression becomes \(\textrm{Tr}\,[A\rho ]\). On the other hand, using the above properties of the cocycles and of multiplicative domains, we get by the definition of the Petz dual
here the analytic continuation to \(s=-\tfrac{1}{2}i\) equals
Since A and t were arbitrary, this finishes the proof of (i) \(\implies \) (iv).
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Jenčová, A. Recoverability of quantum channels via hypothesis testing. Lett Math Phys 114, 31 (2024). https://doi.org/10.1007/s11005-024-01775-2
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11005-024-01775-2