Towards a functorial description of quantum relative entropy
Abstract
A Bayesian functorial characterization of the classical relative entropy (KL divergence) of finite probabilities was recently obtained by Baez and Fritz. This was then generalized to standard Borel spaces by Gagné and Panangaden. Here, we provide preliminary calculations suggesting that the finite-dimensional quantum (Umegaki) relative entropy might be characterized in a similar way. Namely, we explicitly prove that it defines an affine functor in the special case where the relative entropy is finite. A recent non-commutative disintegration theorem provides a key ingredient in this proof.
Keywords:
Bayesian inversion disintegration optimal hypothesis.1 Introduction and outline
In 2014, Baez and Fritz provided a categorical Bayesian characterization of the relative entropy of finite probability measures using a category of hypotheses [1]. This was then extended to standard Borel spaces by Gagné and Panangaden in 2018 [5]. An immediate question remains as to whether or not the quantum (Umegaki) relative entropy [12] has a similar characterization.111The ordinary Shannon and von Neumann entropies were characterized in [2] and [7], respectively, in a similar categorical setting. The purpose of the present work is to begin filling this gap by using the recently proved non-commutative disintegration theorem [9].
The original motivation of Baez and Fritz came from Petz’ characterization of the quantum relative entropy [11], which used a quantum analogue of hypotheses known as conditional expectations. Although Petz’ characterization had some minor flaws, which were noticed in [1], we believe Petz’ overall idea is correct when formulated on an appropriate category of non-commutative probability spaces and non-commutative hypotheses. In this article, we show how the Umegaki relative entropy defines an affine functor that vanishes on the subcategory of non-commutative optimal hypotheses for faithful states. The chain rule for quantum conditional entropy is a consequence of functoriality. The non-faithful case will be addressed in future work, where we hope to provide a characterization of the quantum relative entropy as an affine functor.
2 The categories of hypotheses and optimal hypotheses
In this section, we introduce non-commutative analogues of the categories from [1]. All -algebras here are finite-dimensional and unital. All -homomorphisms are unital unless stated otherwise. denotes the algebra of matrices. If is a linear map, denotes the linear map sending to , where is the adjoint (conjugate transpose) of . Linear maps between algebras are written with squiggly arrows , while -homomorphisms are written as straight arrows . The acronym CPU stands for “completely positive unital.” If and are matrix algebras, then denotes the partial trace over and is the unique linear map determined by for and . If is a state on , its quantum entropy is denoted by (cf. [7, Definition 2.20]).
Definition 1
Let be the category of non-commutative probability spaces, whose objects are pairs , with a -algebra and a state on . A morphism is a pair with a -homomorphism and a CPU map (called a hypothesis), such that
The composition rule in is given by
Let be the subcategory of with the same objects but whose morphisms are pairs as above and is an optimal hypothesis, i.e. .
The subcategories of and consisting of commutative -algebras are equivalent to the categories and from [1] by stochastic Gelfand duality (cf. [6, Sections 2.5 and 2.6], [4], and [9, Corollary 3.23]).
Notation 1
On occasion, the notation , , and will be used to mean
where are finite sets, often taken to be ordered sets , , for convenience (cf. [9, Section 5] and/or [7, Example 2.2]). Note that every element of (and analogously for and ) is of the form , with . Furthermore, , , and will refer to states on , , and , respectively, with decompositions of the form
If is a linear map, its component is the linear map obtained from the composite , where the first and last maps are the (non-unital) inclusion and projection, respectively.
Definition 2
Let and be as in Notation 1. A morphism in is said to be in standard form iff there exist non-negative integers such that (cf. [7, Lemma 2.11] and [3, Theorem 5.6])
which is a direct sum of block diagonal matrices. The number is called the multiplicity of in associated to . In this case, each will occasionally be decomposed as , where denote the matrix units of and is a matrix.
If is in standard form and if and are states on and (as in Notation 1) such that , then (cf. [7, Lemma 2.11] and [9, Proposition 5.67])
(2.1) |
The standard form of a morphism will be useful later for proving functoriality of relative entropy, and it will allow us to formulate expressions more explicitly in terms of matrices.
Lemma 1
Given a morphism in , with and be as in Notation 1, there exists a unitary such that is a morphism in that is in standard form. Furthermore, if is in , then is also in .
Proof
First, is in for any unitary because
so that the two required conditions hold. Second, the fact that a unitary exists such that is in the form in Definition 2 is a standard fact regarding (unital) -homomorphisms between direct sums of matrix algebras [3, Theorem 5.6]. Finally, if is in , which means , then is also in because .
Although the composite of two morphisms in standard form is not necessarily in standard form, a permutation can always be applied to obtain one. Furthermore, a pair of composable morphisms in can also be simultaneously rectified. This is the content of the following lemmas.
Lemma 2
Given a composable pair in , there exist unitaries and such that
is a pair of composable morphisms in that are both in standard form.
Proof
Lemma 3
Given a composable pair in , each in standard form, there exist permutation matrices such that
is also in standard form, where and the multiplicities of are given by
Proof
The composite is given by
The matrix takes the more explicit form (with zeros in unfilled entries)
From this, one sees that the number of times appears on the diagonal is . However, the positions of are not all next to each other. Hence, a permutation matrix is needed to put them into standard form.
Notation 2
Given a composable pair in standard form as in Lemma 3, the states and will be decomposed as
Lemma 4
Given a morphism in standard form as in Notation 2 such that all states are faithful, there exist strictly positive matrices for all and such that
Proof
Because and are disintegrations of and , respectively, the claim follows from the non-commutative disintegration theorem [9, Theorem 5.67] and the fact that is an injective -homomorphism. The matrices are strictly positive by the faithful assumption.
If is composable pair, a consequence of Lemma 4 is
(2.2) |
3 The relative entropy as a functor
Definition 3
Set to be the assignment that sends a morphism to (the assignment is trivial on objects). Here, is the one object category associated to any monoid222The morphisms of from that single object to itself equals the set and the composition is the monoid multiplication. Here, the monoid is under addition (with the convention that for all . , is the relative entropy of two states on the same -algebra, which is defined on an ordered pair of states , with (meaning implies ), on by
where by convention. If , then .
Lemma 5
Proof
Left as an exercise.
Proposition 1
For a composable pair in (with all states and CPU maps faithful),333Faithfulness guarantees the finiteness of all expressions. More generally, our proof works if the appropriate absolute continuity conditions hold. Also, note that the “conditional expectation property” in [11] is a special case of functoriality applied to a composable pair of morphisms of the form , where is the unique unital linear map. Indeed, Petz’ , , , , , and , are our , , , , , and , respectively ( is the same). i.e. .
Proof
By Lemma 5, it suffices to assume and are in standard form. To prove the claim, we expand each term. First,444Equation (3.1) is a generalization of Equation (3.2) in [1], which plays a crucial role in proving many claims. We will also use it to prove affinity of .
(3.1) |
The last equality follows from the properties of the trace, partial trace, and logarithms of tensor products. By similar arguments,
(3.2) |
and
(3.3) |
Hence, , which proves the claim.
Example 1
The usual chain rule for the quantum conditional entropy is a special case of Proposition 1. To see this, set with . Given a density matrix on , we implement subscripts to denote the associated density matrix after tracing out a subsystem. The chain rule for the conditional entropy states
(3.4) |
where (for example)
is the quantum conditional entropy of given . One can show that
by applying Proposition 1 to the composable pair
where and are the standard inclusions, , , and and are the CPU maps given by , and . This reproduces (3.4).
Proposition 1 does not fully prove functoriality of . One still needs to check functoriality in case one of the terms is infinite (eg. if , then at least one of or must be infinite, and conversely). This will be addressed in future work. In the remainder, we prove affinity of .
Definition 4
Given , set . The -weighted convex sum of objects and in is given by the pair , where whenever The convex sum of and is the morphism . A functor is affine iff for all pairs of morphisms in and .
Proposition 2
Let and be two morphisms for which and are finite. Then .
Proof
When , the claim follows from the convention . For , temporarily set . Then
where we have used bars to denote analogous expressions for the algebras, morphisms, and states with bars over them. From this, the property of logarithms is used to complete the proof.
In summary, we have taken the first steps towards illustrating that the quantum relative entropy may have a functorial description along similar lines to those of the classical one in [1]. Using the recent non-commutative disintegration theorem [9], we have proved parts of affinity and functoriality of the relative entropy. The importance of functoriality comes from the connection between the quantum relative entropy and the reversibility of morphisms [10, Theorem 4]. For example, optimal hypotheses are Bayesian inverses [8, Theorem 8.3], which admit stronger compositional properties [8, Propositions 7.18 and 7.21] than alternative recovery maps in quantum information theory [13, Section 4].555One must assume faithfulness for some of the calculations in [13, Section 4]. The compositional properties in [8, Proposition 7.21], however, need no such assumptions. In future work, we hope to prove functoriality (without any faithfulness assumptions), continuity, and a complete characterization.
Acknowledgements. The author thanks the reviewers of GSI’21 for their numerous helpful suggestions. This research has also received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (QUASIFT grant agreement 677368).
References
- [1] Baez, J.C., Fritz, T.: A Bayesian characterization of relative entropy. Theory Appl. Categ. 29(16), 422–457 (2014)
- [2] Baez, J.C., Fritz, T., Leinster, T.: A characterization of entropy in terms of information loss. Entropy 13(11), 1945–1957 (2011). https://doi.org/10.3390/e13111945
- [3] Farenick, D.R.: Algebras of linear transformations. Universitext, Springer-Verlag, New York (2001). https://doi.org/10.1007/978-1-4613-0097-7
- [4] Furber, R., Jacobs, B.: From Kleisli categories to commutative -algebras: probabilistic Gelfand duality. Log. Methods Comput. Sci. 11(2), 1:5, 28 (2015). https://doi.org/10.2168/LMCS-11(2:5)2015
- [5] Gagné, N., Panangaden, P.: A categorical characterization of relative entropy on standard Borel spaces. In: The Thirty-third Conference on the Mathematical Foundations of Programming Semantics (MFPS XXXIII), Electron. Notes Theor. Comput. Sci., vol. 336, pp. 135–153. Elsevier Sci. B. V., Amsterdam (2018). https://doi.org/10.1016/j.entcs.2018.03.020
- [6] Parzygnat, A.J.: Discrete probabilistic and algebraic dynamics: a stochastic Gelfand–Naimark theorem (2017), arXiv preprint: 1708.00091 [math.FA]
- [7] Parzygnat, A.J.: A functorial characterization of von Neumann entropy (2020), arXiv preprint: 2009.07125 [quant-ph]
- [8] Parzygnat, A.J.: Inverses, disintegrations, and Bayesian inversion in quantum Markov categories (2020), arXiv preprint: 2001.08375 [quant-ph]
- [9] Parzygnat, A.J., Russo, B.P.: Non-commutative disintegrations: existence and uniqueness in finite dimensions (2019), arXiv preprint: 1907.09689 [quant-ph]
- [10] 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
- [11] Petz, D.: Characterization of the relative entropy of states of matrix algebras. Acta Math. Hung. 59(3-4), 449–455 (1992). https://doi.org/https://doi.org/10.1007/BF00050907
- [12] Umegaki, H.: Conditional expectation in an operator algebra. IV. entropy and information. Kodai Math. Sem. Rep. 14(2), 59–85 (1962). https://doi.org/10.2996/kmj/1138844604
- [13] Wilde, M.M.: Recoverability in quantum information theory. Proc. R. Soc. A. 471, 20150338 (2015). https://doi.org/10.1098/rspa.2015.0338