Abstract
We connect two key concepts in quantum information: compatibility and divisibility of quantum channels. Two channels are compatible if they can be both obtained via marginalization from a third channel. A channel divides another channel if it reproduces its action by sequential composition with a third channel. (In)compatibility is of central importance for studying the difference between classical and quantum dynamics. The relevance of divisibility stands in its close relationship with the onset of Markovianity. We emphasize the simulability character of compatibility and divisibility, and, despite their structural difference, we find a set of channels – self-degradable channels – for which the two notions coincide. We also show that, for degradable channels, compatibility implies divisibility, and that, for anti-degradable channels, divisibility implies compatibility. These results provide physical insights and motivate further research on these classes of channels and shed new light on the meaning of these two largely studied notions.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
Quantum theory is so far the best available framework to describe the microscopic world. It consists of a normative set of assumptions and rules designed to deal with phenomena with no classical explanation. Its predictive power is undeniable. Nonetheless, it also opens up room for puzzling behaviours having no classical counterpart [1,2,3,4,5]. The root cause of all these remarkably odd phenomena is still unclear [6], and even quantum-to-classical and classical-to-quantum transitions are yet to be fully understood – although, from a dynamical perspective, there have been robust proposals for obtaining such understanding [7,8,9].
What is undebatable, though, is that incompatibility of observables is a key feature of quantum theory [10, 11]. In this work we focus on the generalization of this notion to quantum channels. Intuitively, compatibility between two quantum channels can be seen as on-demand simulability of those channels via a third, larger CPTP map [12,13,14,15,16,17,18] - in much the same way that joint measurability can be seen as on-demand simulabililty [10, 19, 20]. For quantum maps, this third channel contains, at all times, the information about the two original maps. More precisely, we say that two channels are compatible when their individual action can be recovered from a third quantum map via marginalization (Fig. 1) [15]. It is within this perspective that we associate compatibility and simulability.
Our second main concept, divisibility, has a long history within the open quantum dynamics community [21,22,23,24], where it is traditionally equaled to memoryless, or Markovian, processes [25,26,27]. Classical Markovian processes are governed by the Chapman-Kolmogorov equations and it turns out that a divisible dynamics is described by a functional expression that satisfies a similar set of equations [28]. More recently, it has become clearer that memoryless quantum processes deserve a different and less involved treatment [29, 30] and that divisibility makes no explicit reference to memory. We say that a quantum channel Ψ divides another channel Φ when it is possible to find a third CPTP map 𝜃 such that Φ = 𝜃 ∘Ψ, where ∘ denotes sequential composition (Fig. 2). In this sense, it is clear that divisibility of maps should not be seen as characterizing memory, but rather as a signal of how one can simulate the action of a given map with the aid of two others.
So far we have emphasized the simulability aspects exhibited by compatibility and divisibility. Undeniably, there are many other intriguing features associated with both concepts [10, 31, 32] , however, in this work, it is exactly the idea that they allow for some sort of simulability that we want to put forward and use as a motivation to bring them together. Compatibility amounts for the existence of a third quantum channel holding all the necessary information to simulate the original channels, whereas divisibility says that one of the maps can be simulated as a post-processing of the other. In both it is clear the existence of an external channel whose use can reveal the action of (at least one of) the original channels. Simply put, the former can be seen as a sort of simulability in parallel, and the latter as expressing a sequential-like simulability.
Even in the light of this shared simulation feature, at a first glance, one may consider compatibility and divisibility as radically different concepts, with radically distinct body of applications. Our contribution comes to show that this is not entirely the case. Depending on the physical properties of the involved channels and on how the environment exchanges information with the evolving system, it might be the case that compatibility implies divisibility, or that divisibility implies compatibility, or that compatibility equals divisibility. To obtain a full equivalence, we will have to touch on a third and unexpected ingredient: self-degradable channels [33,34,35,36]. These are channels that allow one to obtain information about the evolution of the system looking only at the evolution of the environment and vice versa (see Section 3.1 for the precise definition).
In recent years, (self-)degradable channels have been extensively studied in the literature [34, 35, 37, 38]. The main reason of their importance is that they have a simple mathematical form that allows one to compute (sometimes even with a closed, analytic expression) the quantum and private classical capacities [34, 35]. Our contribution highlights that they are not only a result of mathematical convenience, but they are the channels for which the physical notions of compatibility and divisibility are related. As such, they are channels describing a dynamics with specific physical features.
This paper is organized as follows. Section 2 presents a list with the key concepts we want to connect in our work. Our main findings are in Section 3, where we establish that divisibility equals compatibility for self-degradable channels. Degradability is somehow a necessary and sufficient condition for the equivalence, and we comment why in sub-Section 3.2. A physical intuition behind our results can be found in sub-Section 3.3. We conclude our main exposition approaching limitations and further works in Section 4. We have also prepared a few appendices to make the text richer and easier to read. Appendix A comes with an expanded discussion of all the definitions we are using in this work - it is intended for an audience not familiarized with the concepts we are dealing with. In the Appendix B present three paradigmatic examples. First, we show that plain divisibility does not imply compatibility. Secondly, we show that compatibility also does not imply divisibility. Thirdly, we explore how poor a resource theory of compatibility would be. The last appendix, Appendix C explains in more details why divisibility and compatibility are not connected in general.
2 Main Definitions
In this preparatory section, we collect the key definitions we need to establish a bridge between compatibility and divisibility. Namely, we give precise definitions for what we mean by divisibility, compatibility and degradability. A more in-depth discussion about these concepts can be found in Appendix A.
Definition 2.1 (Divisibility for two channels)
Let ψB|A and ϕC|A be two cptp maps. We say that ψB|A dividesϕC|A whenever there exists another cptp map 𝜃C|B such that
We will refer to 𝜃C|B as the quotient map.
Remark 1
Definition 2.1 says that whenever ψB|A divides ϕC|A, it is possible to recover the action of the latter through the action of the former - given we have access to the quotient map 𝜃B|C. In other words, we can say that ϕC|A can be simulated through ψB|A.
Definition 2.2 (Compatibility)
Let ψB|A and ϕC|A be two cptp maps. We say that ψB|A is compatible with ϕC|A whenever there exists another cptp map
such that, for every ρA in \(\mathcal {D}({\mathscr{H}}_{A})\), the following equations
hold true. The channel 𝜃BC|A is called the compatibilizer for ψB|A and ϕC|A. When it is not possible to find a channel satisfying (3) and (4) above, we say that ψB|A and ϕC|A are incompatible.
Remark 2
Simply put, Definition 2.2 says that whenever two channels are compatible there exists a larger channel that can be used to recover the action of the original ones. A bit more precisely, if 𝜃BC|A is a compatibilizer for ψB|A and ϕC|A, then 𝜃BC|A carries simultaneously the information of how ψB|A and ϕC|A act on \(\mathcal {D}({\mathscr{H}}_{A})\). Finally, one should notice a clear asymmetry between defs. 2.2 and 2.1. Whenever ψB|A is compatible with ϕC|A, it is immediate that ϕB|A is also compatible with ψC|A. However, the same argument does not hold true for divisibility, as it might be the case that ψB|A divides ϕC|A but not the other way around - see Appendix B.
Definition 2.3 (Complementary Channel)
Let ψB|A be a quantum channel and
be its Lindblad-Stinespring representation, where \(V:{\mathscr{H}}_{A} \rightarrow {\mathscr{H}}_{B} \otimes {\mathscr{H}}_{E}\) is an isometry. The complementary channel of ψB|A, with respect to the dilation \(V:{\mathscr{H}}_{A} \rightarrow {\mathscr{H}}_{B} \otimes {\mathscr{H}}_{E}\), is defined as:
where the trace now is performed over \({\mathscr{H}}_{B}\).
Remark 3
Note we are defining complementary channels with respect to a particular representation. A given quantum channel ψB|A might end up being associated with many complementary channels, as distinct dilations may lead to distinct complementary channels. In our work, the complementary channel to a given quantum channel will mean that we have tacitly assumed a particular Lindblad-Stinespring representation. We comment further on this issue in Appendix A.
Definition 2.4 (Degradable Maps)
A quantum channel ψB|A is called degradable when there exists another quantum channel λE|B such that
where \(\psi _{E|A}^{c}\) is complementary to ψB|A. On the other hand, when \(\psi _{E|A}^{c}\) is degradable, the original map ψB|A is called anti-degradable.
Remark 4
We discuss degradability and anti-degradability in more details in Appendix A - they have been thoroughly studied in the past and are crucial for estimating channel capacity bounds. For the time being, one can understand degradable maps as that class of quantum channels that divides their own complementary channels - see Fig. 6. Moreover, these properties are independent of the particular complementary channel considered
Definition 2.5 (Self-Degradable Maps)
A channel ψB|A is self-degradable (or self-complementary) whenever it coincides with its complementary map. More precisely,
with \(\mathcal {D}({\mathscr{H}}_{B}) \simeq \mathcal {D}({\mathscr{H}}_{E})\).
3 Main Results
This section contains our main results. Here we establish that the notion of degradability is preponderant to connect divisibility and compatibility. Simply put, our result says that for self-degradable channels, compatibility implies divisibility, as well as divisibility implies compatibility.
The fact we need an auxiliary element to connect compatibility and divisibility may not be entirely clear at this stage. But it is the case that, with no further assumptions, neither divisibility implies compatibility nor vice-versa - see Appendices ?? and ??. Remarkable is that the necessary and somehow sufficient conditions for equivalence coalesces onto the notion of degradability, as we discuss in sub-Section 3.2.
We have already introduced the concept of degradability for quantum channels [33,34,35,36] in the previous section. Section 3.1 contains our main results. Section 3.2 analyses the possible reasons for the success in connecting compatibility and divisibility when restricted to degradable channels. In sub-Section 3.3, we give a physical interpretation of our results.
3.1 (Anti)Degradable and Self-degradable Channels - Connecting Divisibility with Compatibility
We start off this section stating the main result that makes possible to connect divisibility with compatibility [13].
Theorem 3.1 (Compatibility and Ordering)
Two quantum channels ϕC|A and ψB|A are compatible if and only if there exists a cptp map 𝜃C|E such that \(\phi _{C|A}=\theta _{C|E} \circ \psi _{E|A}^{c}\).
This theorem is not new and has already appeared in the literature before - see ref. [13]. Simply saying, it establishes a connection between compatibility and the ordering determined by the composition of maps. In Appendix A we provide an alternative proof for this result in a language that matches with the present work and that is potentially more familiar to a broader community of quantum information. We also comment on how the compatibility as an ordering relationship does not accept catalysis - being, therefore, a poor resource theory (see Appendix B).
Technically speaking, the most natural way to leverage the content of Theorem 3.1 consists of demanding that ψB|A and its complement \(\psi _{E|A}^{c}\) verify a composition rule. This is exactly the key assumption we adopt to finally put together the concepts of divisible maps and compatibility. At a first sight, that class of maps might seem too restrictive or merely an exercise of mathematical abstraction but, as it turns out, these maps have been thoroughly investigated in the literature [35, 38,39,40], or more recently in [41], and have a concrete physical meaning, as we will discuss in Section 3.2.
Given our purposes, we have all the ingredients needed for our main equivalence to hold. The proof is going to involve a combination of Theorem 3.1 and Definition 2.4.
Theorem 3.2
Let ψB|A and ϕC|A be two quantum channels. The following statements hold true:
-
i)
If ψB|A is degradable and ψB|A and ϕC|A are compatible, then ψB|A divides ϕC|A.
-
ii)
If ψB|A is anti-degradable and ψB|A divides ϕC|A, then ψB|A and ϕC|A are compatible.
Proof
Initially, let us assume that ψB|A and ϕC|A are compatible. In this case, Theorem 3.1 ensures that there exists 𝜃C|E such that \(\phi _{C|A}=\theta _{C|E} \circ \psi _{E|A}^{c}\). Now, because ψB|A is degradable, it is possible to write down its complementary map as \(\psi _{E|A}^{c}=\lambda _{E|B} \circ \psi _{B|A}\), with λE|B a cptp map. Hence, ϕC|A = (𝜃C|E ∘ λE|B) ∘ ψB|A and ψ divides ϕ.
On the other hand, let us assume now that ψB|A divides ϕC|A. In this case, there exists 𝜃C|B such that ϕC|A = 𝜃C|B ∘ ψB|A. Now, as we have assumed that ψB|A is anti-degradable, there exists another cptp map λB|E with \(\psi _{B|A}=\lambda _{B|E} \circ \psi _{E|A}^{c}\). Hence, \(\phi _{C|A}=(\theta _{C|B} \circ \lambda _{B|E}) \circ \psi _{E|A}^{c}\) and, because of Theorem 3.1, ψ is compatible with ϕ. □
Straightforwardly from Theorem 3.2, it follows that with self-degradable channels we can cut out the middle maps λE|B and λB|E. In this very particular case compatibility equals divisibility. We formalize it in a corollary.
Corollary 3.3
Let ψB|A and ϕC|A be two quantum channels. Assume that ψB|A is self-degradable. The following statements are equivalent:
-
i)
ψB|A and ϕC|A are compatible.
-
ii)
ψB|A divides ϕC|A.
Remark 5
To begin with, note that if we had been working within the usual framework of open quantum dynamics, where it is given a discrete family \(\mathcal {F}=\{ \psi _{X_{t}|X_{0}}\}_{t}\) of cptp maps (see Appendix A), in order to ensure that compatibility implies divisibility of \(\mathcal {F}\), we would have to assume that every member of that family (but the last one) is degradable. Recursive use of Theorem 3.2 would guarantee that, for being two-by-two compatible, the whole dynamics is Markovian. Analogously, anti-degradability plus the usual definition of divisibility would imply compatibility between consecutive time steps. Finally, despite being rather restrictive, the full equivalence expressed by Corollary 3.3 neatly bridges the two concepts. Recall that, for qubits, self-complementarity rules-out the simplest cases of reversible and completely depolarizing channels [40].
Overall, we have seen that if we assume degradability or anti-degradability we can see compatibility and divisibility within a closer perspective. Mathematically speaking, although Theorem 3.2 puts an end to the story, it remains to explain why we have been forced to demand for (anti)degradable maps. Moreover, it is important to reason about the physical meaning of the results.
3.2 Why (anti)Degradable Maps?
Let us recall that Theorem 3.2 assumes (anti)degradability to establish a connection between divisibility and compatibility. It is natural to ponder over what is the role played by (anti)degradability in these statements. In the next proposition we show that (anti)degradability emerges naturally from assuming compatibility and divisibility.
Proposition 3.4
If ψB|A and ϕC|A are compatible channels such that ϕC|A = 𝜃C|B ∘ ψB|A, for a given cptp map 𝜃C|B, then ϕC|A is anti-degradable.
Proof
To begin with, because ψB|A and ϕC|A are compatible, there is another cptp map 𝜃B|E such that \(\psi _{B|A} = \theta _{B|E} \circ \phi _{E|A}^{c}\). Now, as ϕC|A = 𝜃C|B ∘ ψB|A, we conclude:
□
Notice that, in Proposition 3.4, not only we are getting anti-degradability out of the result, rather than plain degradability, but also note that it is ϕ which ends up being anti-degradable. Remember that in Theorem 3.2 we had to demand either degradability or anti-degradability of ψ to obtain divisibility or compatibility, respectively.
An alternative version of the above proposition is also possible. Instead of requiring compatibility for the channels ψB|A and ϕC|A, we could have asked for compatibility between the conjugate version of the channels. Similarly to Proposition 3.4’s proof, we would have obtained that ψ must be degradable. Other variants can also be obtained if we move around the super-index indicating the conjugate channel.
3.3 Physical Intuition
We conclude this section discussing the physical intuition behind our results. To begin with, consider the two diagrams displayed in Fig. 6. Roughly speaking, they show that degradable maps are those in which the evolution of the environment can be fully determined if we monitor the system. To be a bit more precise, the environment evolved states are fully encoded in the system, in the sense that one can recover any environment evolved state by a suitable, but fixed, physical operation that can be done on the system alone. For anti-degradable maps, a similar picture holds, but with the environment and system papers reversed. Self-degradable maps are, therefore, those in which system and environment are on equal footing, to the extent that we can imagine to do process tomography on the system to obtain the information on the evolution of the environment and vice-versa. Let us focus on this class of maps.
The content of Theorem 3.1 is that if ψB|A and ϕC|A are compatible, the compatibilizer 𝜃BC|A also stores in itself the information about the environment described by \(\psi ^{c}_{E|A}\), and vice versa. It is as if the black-box of Fig. 1 were taken so large that it also encompasses the environment of a Lindblad-Stinespring dilation for ψB|A, and so that \(\psi ^{c}_{E|A}\) contains the information of ϕC|A. In fact,
Now, self-degradability says that we can bring ψB|A back into the game, as environment and system are on equal footing, \(\psi ^{c}_{E|A}=\psi _{B|A}\). As a consequence, ψB|A ends up dividing ϕC|A, thus containing information about it. On the other hand, assuming that ψB|A divides ϕC|A, with the former being self-degradable, it is possible to write ϕC|A in terms of the environment in \(\psi ^{c}_{E|A}\). In this way, one can find an appropriate large box 𝜃BC|A involving the environment E for ψB|A, such that it acts as the compatibilizer for ψB|A and ϕC|A. In brief, self-degradability bridges in both directions the evolution of environment and system (up to a function), and this is the very key point in equating compatibility and divisibility, as we can make the compatibilizer large enough to accommodate the environment.
There is also an alternative form of seeing why anti-degradability together with divisibility implies compatibility. Suppose that ψB|A is anti-degradable and, additionally, that it divides ϕC|A. Self-degradability of ψB|A implies that ψB|A is self-compatible (cf. Theorem 3.2). In other words, there is a channel
such that:
with \(\mathcal {D}({\mathscr{H}}_{B}) \simeq \mathcal {D}({\mathscr{H}}_{B^{\prime }})\). As ψB|A divides ϕC|A, there must exist a cptp map 𝜃C|B verifying ϕC|A = 𝜃C|B ∘ ψB|A. Now, define \({\Theta }_{CB^{\prime }|A}:=(\theta _{C|A} \otimes \text {id}_{B^{\prime }}) \circ {\Psi }_{BB^{\prime }|A}\). This composition satisfies:
The newly defined quantum channel \({\Theta }_{CB^{\prime }|A}\) is, then, the compatibilizer of ψB|A and ϕC|A. In sum, the anti-degradability of ψB|A allowed for its extension as a larger channel \({\Psi }_{BB^{\prime }|A}\) that simulates on demand the action of ψ regardless the output we block. Sticking the quotient map 𝜃C|A into one of outputs of Ψ, we gain the compatibilizer of ψ and ϕ. This is the case simply because one end keeps behaving like ψ, while the other (with 𝜃) starts behaving like ϕ - see Fig. 3
4 Conclusions
In this work we have established a connection between compatibility and divisibility of cptp maps (summarized in Fig. 4). We have shown that for self-degradable maps there is a direct equivalence between the two concepts: compatibility implies divisibility and vice versa. Slightly relaxing this hypothesis, compatible and degradable maps are divisible. Furthermore, divisible and anti-degradable maps are compatible. These implications and equivalences do not hold true if we remove (anti)degradability from the body of hypothesis, as we have managed to show that neither compatibility directly implies divisibility nor that divisibility directly implies compatibility in general. Interestingly, the latter is a consequence of the no-broadcasting theorem.
Apart from some cases, it is known that determining whether or not a certain map, or a family of maps, is (anti)degradable is not a trivial task. However, if one knows beforehand that degradability holds, Theorem 3.2 can be used to determine divisibility with a number of SDPs that scales with the size of the family under consideration. Recall that from an information theoretical perspective, the authors of ref. [42] have come up with an algorithm that must implement an infinite number of SDPs to determine the divisibility of a single pair of maps. With extra information, our results might be useful in this case.
In addition to the usefulness of our result for assessing the divisibility or compatibility of this particular class of channels, we also provide physical insights into the meaning of (anti)degradable channels. They are not only the channels that have particularly simplified mathematical expressions that allow one to compute the quantum and classical capacities (in general, uncomputable), but they are the channels for which the physical notions of compatibilty and divisibility are related.
There are, of course, open questions that originate from this work. A natural one is whether the class of self-degradable channels identifies the class of channels for which compatibility equals divisibility. This question alone motivates further research on this special class of channels. To name other open challenges, consider for instance the argument of example 3. There we constructed a situation where the maps are compatible and not-divisible. Our entire construction was based upon the intuition that conditionally independent maps are not divisible. Although this makes sense, and although it works for that example, we still lack a general mathematical proof of this statement. We can push this direction even further: it is still unknown whether or not compatible maps possess at least one compatibilizer respecting conditional independence. This will also be explored in a future work.
Finally, we recognize the limitations of our work. The conditions for Theorem 3.2 and Corollary 3.3 are quite restrictive. Nonetheless, we emphasize how our work puts together two concepts that, up to this day, had always been thought of being separate. Each of these concepts has its own toolbox, and we believe that our work can help to pave-down a new road allowing for an interplay of these toolboxes. We have also been able to identify open questions that should be explored in future research.
Notes
Although we are more inclined to agree with ref. [25], which is more cautious in associating divisibility with memoryless processes
References
Bell, J.: . Rev. Mod. Phys. 38, 447 (1966)
Bell, J.S.: . Physics Physique Fizika 1, 195 (1964). https://doi.org/10.1103/PhysicsPhysiqueFizika.1.195
Kochen, S., Specker, E.: . J. Math. Mechan. 17, 59 (1967)
Wootters, W.K., Zurek, W.H.: . Nature 299, 802–803 (1982). ISSN 0028-0836, 1476–4687
Jennings, D., Leifer, M.: . Contemp. Phys. 57, 60 (2015). arXiv:1501.03202
Spekkens, R.W.: . Phys. Rev. A 75, 032110 (2007). https://doi.org/10.1103/PhysRevA.75.032110
Zurek, W.H.: . Nat. Phys. 5, 181–188 (2009). ISSN 1745-2473, 1745–2481
Blume-Kohout, R., Zurek, W.H.: . Phys. Rev. A 73, 062310 (2006). https://doi.org/10.1103/PhysRevA.73.062310
Brandão, F.G.S.L., Piani, M., Horodecki, P.: . Nat. Commun. 6, 7908 (2015). ISSN 2041–1723
Wolf, M.M., Perez-Garcia, D., Fernandez, C.: . Phys. Rev. Lett. 103, 230402 (2009). https://doi.org/10.1103/PhysRevLett.103.230402
Uola, R., Kraft, T., Abbott, A.A.: . Phys. Rev. A 101, 052306 (2020). https://doi.org/10.1103/PhysRevA.101.052306
Heinosaari, T., Miyadera, T., Ziman, M.: . J. Phys. A Math. Theoret. 49, 123001 (2016). https://doi.org/10.1088/1751-8113/49/12/123001
Heinosaari, T., Miyadera, T.: . J. Phys. A. Math. Theoret. 50, 135302 (2017). https://doi.org/10.1088/1751-8121/aa5f6b
Heinosaari, T., Kiukas, J., Reitzner, D., Schultz, J.: . J. Phys. A. Math. Theoret. 48, 435301 (2015). https://doi.org/10.1088/1751-8113/48/43/435301
Girard, M., Vala, M.P., Sikora, J.: Jordan products of quantum channels and their compatibility. arXiv:2009.03279 [quant-ph] (2020)
Carmeli, C., Heinosaari, T., Miyadera, T., Toigo, A.: . J. Math. Phys. 60, 122202 (2019). https://doi.org/10.1063/1.5126496
Mori, J.: . Phys. Rev. A 101, 032331 (2020). https://doi.org/10.1103/PhysRevA.101.032331
Haapasalo, E., Kraft, T., Miklin, N., Uola, R.: Quantum marginal problem and incompatibility. arXiv:1909.02941 [quant-ph] (2020)
Guerini, L., Bavaresco, J., Terra Cunha, M., Acín, A.: . J. Math. Phys. 58, 092102 (2017). https://doi.org/10.1063/1.4994303
Bluhm, A., Jencova, A., Nechita, I.: Incompatibility in general probabilistic theories, generalized spectrahedra, and tensor norms. arXiv:2011.06497 [quant-ph] (2020)
Gorini, V., Kossakowski, A., Sudarshan, E.C.G.: . J. Math. Phys. 17, 821 (1976). https://doi.org/10.1063/1.522979
Lindblad, G.: . Commun. Math. Phys. 65, 281–294 (1979). ISSN 0010-3616, 1432–0916
Kretschmann, D., Werner, R.F.: . Phys. Rev. A 72, 062323 (2005). https://doi.org/10.1103/PhysRevA.72.062323
Milz, S., A. Pollock, F., Modi, K.: . Open Syst. Inform. Dynam. 24, 1740016 (2017). https://doi.org/10.1142/S1230161217400169
Milz, S., Kim, M.S., Pollock, F.A., Modi, K.: . Phys. Rev. Lett. 123, 040401 (2019). https://doi.org/10.1103/PhysRevLett.123.040401
Buscemi, F., Datta, N.: . Phys. Rev. A 93, 012101 (2016). https://doi.org/10.1103/PhysRevA.93.012101
Rivas, Á., Huelga, S.F., Plenio, M.B.: . Rep. Progress Phys. 77, 094001 (2014). https://doi.org/10.1088/0034-4885/77/9/094001
Milz, S., Sakuldee, F., Pollock, F.A., Modi, K.: . Quantum 4, 255 (2020). ISSN 2521-327X, https://doi.org/10.22331/q-2020-04-20-255
Pollock, F.A., Rodríguez-Rosario, C., Frauenheim, T., Paternostro, M., Modi, K.: . Phys. Rev. A 97, 012127 (2018). https://doi.org/10.1103/PhysRevA.97.012127
Carteret, H.A., Terno, D.R., Życzkowski, K.: . Phys. Rev. A 77, 042113 (2008). https://doi.org/10.1103/PhysRevA.77.042113
D’Ariano, G.M., Macchiavello, C., Perinotti, P.: . Phys. Rev. Lett. 95, 060503 (2005). https://doi.org/10.1103/PhysRevLett.95.060503
Barnum, H., Caves, C.M., Fuchs, C.A., Jozsa, R., Schumacher, B.: . Phys. Rev. Lett. 76, 2818 (1996). https://doi.org/10.1103/PhysRevLett.76.2818
Smith, G., Smolin, J.A., Winter, A.: . IEEE Trans. Inf. Theory 54, 4208 (2008)
Cubitt, T.S., Ruskai, M.B., Smith, G.: . J. Math. Phys. 49, 102104 (2008). https://doi.org/10.1063/1.2953685
Brádler, K., Dutil, N., Hayden, P., Muhammad, A.: . J. Math. Phys. 51, 072201 (2010). https://doi.org/10.1063/1.3449555
Holevo, A.S.: . Theory Probab. Appl. 51, 92–100 (2007). ISSN 0040-585X, 1095–7219
Devetak, I., Shor, P.W.: . Commun. Math. Phys. 256, 287–303 (2005). ISSN 0010-3616, 1432–0916
Sutter, D., Scholz, V.B., Winter, A., Renner, R.: . IEEE Trans. Inf. Theory 63, 7832–7844 (2017). ISSN 0018-9448, 1557–9654
Smaczynski, M., Roga, W., Życzkowski, K.: . Open. Syst. Inf. Dyn. 23, 1650014 (2016). https://doi.org/10.1142/S1230161216500141
Paddock, C., Chen, J.: A characterization of antidegradable qubit channels. arXiv:1712.03399 [quant-ph] (2017)
Czartowski, J., Braun, D., Życzkowski, K.: . International Journal of Quantum Information 17, 1950046 (2019). https://doi.org/10.1142/S0219749919500461
Duarte, C., Kolb, B., Cavalcanti, D: Simple verification of divisibility - to appear (2021)
Leifer, M.S., Spekkens, R.W.: . Phys. Rev. A 88, 052130 (2013). https://doi.org/10.1103/PhysRevA.88.052130
Leifer, M.S., Spekkens, R.W.: . J. Phys. A Math. Theoret. 47, 275301 (2014). https://doi.org/10.1088/1751-8113/47/27/275301
Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press, Cambridge (2010)
Schmid, D., Ried, K., Spekkens, R.W.: . Phys. Rev. A 100, 022112 (2019). https://doi.org/10.1103/PhysRevA.100.022112
Breuer, H.-P., Laine, E.-M., Piilo, J., Vacchini, B.: . Rev. Mod. Phys. 88, 021002 (2016). https://doi.org/10.1103/RevModPhys.88.021002
Wolf, M.M., Eisert, J., Cubitt, T.S., Cirac, J.I.: . Phys. Rev. Lett. 101, 150402 (2008). https://doi.org/10.1103/PhysRevLett.101.150402
Watrous, J.: The Theory of Quantum Information. Cambridge University Press, Cambridge (2018)
King, C., Matsumoto, K., Nathanson, M., Ruskai, M.B.: . arXiv:0509126 [quant-ph] (2005)
Leifer, M., Poulin, D.: . Annals of Physics 323, 1899 (2008). http://www.sciencedirect.com/science/article/pii/S0003491607001509
Plenio, M.B., Virmani, S.: . Quantum info. Comput. 7, 1–51 (2007). ISSN, 1533–7146
Horodecki, R., Horodecki, P., Horodecki, M., Horodecki, K.: . Rev. Mod. Phys. 81, 865 (2009). https://doi.org/10.1103/RevModPhys.81.865
Jonathan, D., Plenio, M.B.: . Phys. Rev. Lett. 83, 3566 (1999). https://doi.org/10.1103/PhysRevLett.83.3566
Fritz, T.: . Math. Struct. Comput. Sci. 27, 850–938 (2017)
Acknowledgments
Cristhiano Duarte wishes to thank Nadja Bernardes, Fernando de Melo, Matt Leifer, Zoltán Zimborás and Marcelo Terra Cunha for all the extremely useful discussions. R. Drumond acknowledges the support from Brazilian agencies Coordenação de Aperfeiçoamento de Pessoal de Nível Superior-Finance Code 001, and FAPEMIG. This paper is a result of the Brazilian National Institute of Science and Technology on Quantum Information. L. Catani acknowledges the support by the Fetzer Franklin Fund of the John E. Fetzer Memorial Trust and by the Army Research Office (ARO) (Grant No. W911NF-18-1-0178). This research was supported by the Fetzer Franklin Fund of the John E. Fetzer Memorial Trust and by grant number FQXi-RFP-IPW-1905 from the Foundational Questions Institute and Fetzer Franklin Fund, a donor advised fund of Silicon Alley Community Foundation. This research was also supported by the National Research, Development and Innovation Office of Hungary (NKFIH) through the Quantum Information National Laboratory of Hungary and through the grant FK 135220.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendices
Appendix : A: Main Definitions - Expanded and Commented
To facilitate the reading, we will stick with the notation of refs. [43, 44]. In other words,
will always represents a quantum map from \(\mathcal {D}({\mathscr{H}}_{X})\) to \(\mathcal {D}({\mathscr{H}}_{Y})\). The sub-index Y |X is in parallel with the standard conditional probability language and ought to be read as Y given X.
The sections below contain the standard definitions of divisibility and compatibility. These two topics are sub-branches of quantum information and lines of research in their own, and, as such, we will not treat them comprehensively here. To help the reader, we will briefly motivate the main definitions and point to the standard literature.
1.1 A.1: Divisibility
It has become broadly accepted that discrete evolution of open quantum systems should be represented by a family \(\mathcal {F}=\{\psi _{X_{k}|X_{0}}\}_{k=1}^{T}\) of CPTP maps [24, 26, 45]. In this family, each channel
represents a quantum process happening from a initial time step t = t0 to a posterior time t = tk. Given a quantum system evolving according to the family \(\mathcal {F}\), if ρ0 represents the state of this system at t = t0, its evolved state at t = tk is given by \(\rho _{k}=\psi _{X_{k}|X_{0}}(\rho _{0})\).
This definition captures the idea that there is some quantum process happening between two time steps. However, the t0-to-tk evolution is not natural in a dynamical sense. Instead of having a family dictating the evolution from t0 to tk, one would expect to have a sequential family of CPTP maps, say \(\mathcal {F}^{\prime }=\{\psi _{X_{k+1}|X_{k}}\}_{k=0}^{T-1}\), governing how the system changes between to consecutive time steps tk-to-tk+ 1. It is the existence of this second collection of CPTP maps that divisibility, or Markovianity, talks about [25,26,27].
Definition A.1 (CP-Divisibility)
Let \(\mathcal {F}=\{\psi _{X_{0}|X_{k}}\}_{k=1}^{T}\) be a family of maps representing the dynamics of an open quantum system. Each map
being a completely positive trace preserving map. We say that this family is CP-divisible, or that the dynamics is Markovian, whenever there exists another family of maps \(\mathcal {F}^{\prime }=\{\psi _{X_{k+1}|X_{k}}\}_{k=0}^{T-1}\) such that
Remark 6
In other words, Definition A.1 says that a family of t0-to-tk quantum channels is (CP-)divisible when it is possible to find intermediate channels tk-to-tk+ 1 that “match” the original family. This matching is expressed by stating that it is possible to simulate any process happening from t0-to-tk+ 1 provided that it is known what happens in t0-to-tk and tk-to-tk+ 1. Figure 5 illustrates this argument.
In Definition A.1 we have also used the term ”Markovianity” as a synonym of (CP-)divisibility. To make this choice more transparent, we need to explain this point in more details. Basically, a classical stochastic process is a family {Xk}k of random variables where it is possible to define a joint σ −algebra. This process is Markovian when \(\mathbb {P}(X_{k}|X_{k-1},...,X_{1}) = \mathbb {P}(X_{k}|X_{k-1})\) holds true for every k. In plain English, the information necessary do determine what will happen at tk is fully determined by the knowledge of what happened at tk− 1, hence a memoryless process. Markovian processes have a neat equation governing \(\mathbb {P}(X_{k}|X_{k-1})\) that only involves intermediate time-steps: the Chapman-Kolmogorov equation . Roughly speaking, if {Xk}k is Markovian, then for every t > k > r [28]:
It is exactly the parallel between (A6) and (A5) that justifies the comparison between the classical and quantum cases, and motivates the use of the name “Markovianity” for the quantum case. This is still a topic of ongoing research [25, 29, 46] and intense debate Footnote 1. We refer to [25] and [47, 48] for a thorough analysis of this subject - including the distinction between time dependent v. time independent cases.
Specializing to the case of only two maps, we can write down a more direct definition of divisibility. As a matter of fact, this variant definition not only turns more explicit an asymmetry which is always hidden away in the usual definition of divisibility, but it also emphasizes another mathematical aspect present in the original definition.
Definition A.2
Let ψB|A and ϕC|A be two cptp maps. We say that ψB|A dividesϕC|A whenever there exists another cptp map 𝜃C|B such that
We will refer to 𝜃C|B as the quotient map.
Remark 7
In general, divisibility is an asymmetric notion. In other words, with no extra assumptions, we cannot say that ϕC|A divides ψB|A whenever the latter divides the former. There are many ways to get this symmetry back, for instance one could ask for quotient maps that are invertible and whose inverse is cptp. In this rather restrictive case, divisibility becomes an equivalence relation (reflexive, transitive and symmetric). Back to the general case, it is exactly the this lack of symmetry that renders the comparison between divisibility (asymmetric) and compatibility (symmetric) so tricky.
When considering only two maps, the alternative Definition 2.1 makes clearer the simulability rationale: to obtain the action of ϕC|A it suffices to know 𝜃C|B and ψB|A. Broadly speaking, we can interpret the map 𝜃C|B as containing the piece of information that is necessary to define ϕC|A via composition with ψB|A. We will adopt a similar perspective when interpreting compatibility in the next section.
1.2 A.2: Compatibility
One of the foundational cornerstones of quantum theory is the existence of observables that cannot be simultaneously, or jointly, measured. In other words, quantum theory does not rule out the presence of incompatible observables. This fact is very well known, and goes all the way back to the Heisenberg’s uncertainty principle. Moreover, we can say that incompatibility is crucial to the foundations of quantum physics, as incompatible measurements are the root cause allowing for violations of Bell inequalities [10]. As a matter of fact, quantum (in)compatibility is not restricted only to POVM’s. This short section shows how to lift the concept of incompatibility from measurements to quantum channels.
Broadly speaking, two quantum channels are compatible when they can be enlarged, seen as being just one, and have their action recovered by tracing out part of this larger structure. The idea behind the concept of compatibility, therefore, is associated to the existence of a larger quantum channel that can, on-demand, be used to recover the action of the two original quantum channels. Precisely put [12],
Definition A.3 (Compatibility)
Let ψB|A and ϕC|A be two cptp maps. We say that ψB|A is compatible with ϕC|A whenever there exists another cptp map
such that, for every ρA in \(\mathcal {D}({\mathscr{H}}_{A})\), the following equations
hold true. The channel 𝜃BC|A is called the compatibilizer for ψB|A and ϕC|A. When it is not possible to find a channel satisfying (A9) and (A10) above, we say that ψB|A and ϕC|A are incompatible.
1.3 A.3: Complementary and Compatibility
We here follow the standard treatment for describing the evolution of an open quantum system: for not being isolated, it interacts with a (multipartite) environment; initially the pair system-environment is described by a product state; following a closed dynamics, system and environment evolve according to a family of unitary maps \(\mathcal {U}_{t}\); the state of the system is, at any posterior time, obtained by tracing out the degrees of freedom of the environment [9, 49]. The resultant of this process is a family of cptp maps {ψt|0}t where the environment is always being traced-out:
What if, instead of tracing-out the environment, we trace out the system? The authors of [9] have thoroughly explored the consequences of doing this. Here, closely following [33,34,35,36] we will implement a more modest approach. Referring back to the main topic of this work, the main idea here is to show how one can use this natural way of constructing channels to reconcile divisibility and compatibility. We begin with a definition [34]:
Definition A.4 (Complementary Channel)
Let ψB|A be a quantum channel and
be its Lindblad-Stinespring representation, where \(V:{\mathscr{H}}_{A} \rightarrow {\mathscr{H}}_{B} \otimes {\mathscr{H}}_{E}\) is an isometry. The complementary channel of ψB|A is defined as:
where the trace now is performed over \({\mathscr{H}}_{B}\).
Broadly speaking, the complementary channel \(\psi ^{c}_{E|A}\) describes the evolution of the environment in correspondence to the evolution of the system described by ψB|A.
Remark 8
There are alternative, equivalent ways to introduce complementary channels. For example, instead of starting from the Lindblad-Stinespring representation, if we had started from a Kraus decomposition \(\psi _{B|A}(\cdot )={\sum }_{i=1}^{M}K_{i}(\cdot )K_{i}^{\ast }\), the complementary map \(\psi _{B|A}^{c}\) to this channel, with this particular Kraus representation, would be:
The connection between (A13) and (A14) is established noticing that from an isometry \(V:{\mathscr{H}}_{A} \rightarrow {\mathscr{H}}_{B} \otimes {\mathscr{H}}_{E}\) it is possible to define a valid set of Kraus operators \(\{K_{i}:=V \otimes |{i}\rangle \}_{i=1}^{d_{E}}\) and, vice versa, that from a set of Kraus operators \(\{K_{i}\}_{i=1}^{M}\) it is possible to form an isometry \(V:={\sum }_{i=1}^{M}K_{i} \otimes |{i}\rangle\).
The study of complementary channels goes back to the works of A. Holevo [36], M. B. Ruskai plus collaborators [34, 50] and I. Devetak with P. Shor [37]. This class of channels play a role in quantum information theory and, remarkably, as we mentioned before, in the foundations of quantum mechanics in the attempt to explain the emergence of an objective macroscopic reality [9]. Expanding the former role a bit further, in this work, we will use the concept of complementarity as a mechanism to connect compatible with divisible maps. The theorem below (proven in ref. [13]) is the very first to do so.
Theorem A.5 (Compatibility and Ordering)
Two quantum channels ϕC|A and ψB|A are compatible if and only if there exists a cptp map 𝜃C|E such that \(\phi _{C|A}=\theta _{C|E} \circ \psi _{E|A}^{c}\).
In other words, the compatibility between ϕC|A and ψB|A means that \(\psi _{E|A}^{c}\) divides ϕC|A. This theorem connects the parallel character of compatibility with the sequential character of divisibility (of the complementary channel). It is also important to notice about Theorem A.5 that it restores the symmetry lost in our first attempt. With the cost of considering the complement of a map not the map itself, the theorem says that not only we can write ϕC|A using a manipulated version of ψB|A, but also that the other way round does hold true: we can write ψB|A via a modification of ϕC|A.
Secondly, within the proof of the Theorem A.5 it is already present the construction of a possible map making the passage between \(\psi _{B|A}^{c}\) and ϕC|A. We here provide a sketch of the proof. We refer to [13] for an alternative and full proof of Theorem A.5.
Assuming ψB|A and ϕC|A compatible, their compatibilizer 𝜃BC|A has a Lindblad-Stinespring form
where \(V:{\mathscr{H}}_{A} \rightarrow ({\mathscr{H}}_{B} \otimes {\mathscr{H}}_{C}) \otimes {\mathscr{H}}_{E}\) is an isometry. Now, we can extract an alternative Lindblad-Stinespring form for ψB|A via (A15), and use this alternative form to define a complementary map. This direct construction will suffice to conclude the argument. As a matter of fact,
and considering \({\mathscr{H}}_{C} \otimes {\mathscr{H}}_{E}\) as a new environment, we can define
To conclude,
by simply rewriting 𝜃C|E as the partial trace.
Third, in Theorem A.5 we are tacitly assuming the existence of one particular Lindblad-Stinespring dilation for ψB|A. Even though the result holds true for a particular dilation, and its equivalence class, it might be the case that for other distinct dilations the result does not hold true [13]. Although this is an important point to bear in mind, it does not affect nor weaken our main results. It suffices to think of ψB|A as the quantum channel originating from the interaction with a fixed environment E, so its action and, more importantly, its dilation is already naturally given by \(\psi _{B|A}(\rho _{A}) = \text {Tr}_{CE}\left [ V \rho _{A} V^{\ast }\right ]\). This is exactly how the complementary maps were originally introduced in the literature.
Finally, the theorem clearly indicates which sub-collection of cptp maps we must consider. Intuitively, we will work with those classes of channels in which there is a relation between them and their complementary.
1.4 A.4: (Anti)Degradable and Self-degradable Channels
Technically speaking, the most natural way to leverage the content of Theorem A.5 consists of demanding that ψB|A and its complement \(\psi _{E|A}^{c}\) verify a composition rule. This is exactly the key assumption we adopt to finally put together the concepts of divisible maps and compatibility. At a first sight, that class of maps might seem too restrictive or merely an exercise of mathematical abstraction but, as it turns out, these maps have been thoroughly investigated in the literature [35, 38,39,40], or more recently in [41], and have a concrete physical meaning, as we will discuss in Section 3.2 in the main text. We begin this section formally defining such class of maps (see Fig. 6):
Definition A.6 (Degradable Maps)
A quantum channel ψB|A is called degradable when there exists another quantum channel λE|B such that
where \(\psi _{E|A}^{c}\) is complementary to ψB|A. On the other hand, when \(\psi _{E|A}^{c}\) is degradable, the original map ψB|A is called anti-degradable.
Remark 9
Simply put, a degradable channel is a channel that appropriately divides its complementary channel.
As we mentioned, the structure of degradable and anti-degradable maps has been deeply explored in the literature before, mainly in the context of quantum information. As an example, it has been shown that, for these channels, the calculation of quantum and private classical capacities (two quantities not even known to be computable in general) simplify massively, to the point that for some degradable channels it is even possible to obtain closed, analytic expressions [34, 35]. Additionally, even though the set of all degradable channels is not convex, it is known that the set of anti-degradable channels is convex and properly contains all the prepare-and-measure maps [34], which implies that anti-degradable maps have positive measure within the set of all channels. In terms of structures, in ref. [37], the authors have shown that channels having simultaneously diagonalizable Kraus maps are degradable. Additionally, approximate notions of degradability and anti-degradability have also been recently explored in the literature [38].
Albeit being very particular, a special case is when λE|B is the identity channel idE. This special case will be useful later in our discussions and we denote it as follows.
Definition A.7 (Self-Degradable Maps)
A channel ψB|A is self-degradable (or self-complementary) whenever it coincides with its complementary map. More precisely,
One can easily read from (A19) and (A20) that it must be the case that output and environment are the same, in other words \({\mathscr{H}}_{E}={\mathscr{H}}_{B}\). As a simple example, consider also the case where \(\dim ({\mathscr{H}}_{A})=\dim ({\mathscr{H}}_{B})=2\). In this case it has been shown that nor the completely depolarizing channel nor any unitary channel is self-complementary [39]. Roughly speaking, we can interpret this argument as to showing that self-complementary channels cannot be too noisy nor too reversible. For qubits, the general structure of these channels was investigated in ref. [39]. Any Kraus decomposition {K1,K2} of a self-complementary channel must obey:
with α ∈ [0,π] and β ∈ [0, 2π]. The most paradigmatic example being the dephasing channel, where α = 0 =β.
Appendix : B: Examples and Counter-Examples
Example 1
The most paradigmatic example of incompatibility, that will be used later on, is related to the no-broadcasting theorem [13, 15, 32]: consider ψA|A = idA = ϕA|A, where \((id)_{A}:\mathcal {D}({\mathscr{H}}_{A}) \rightarrow \mathcal {D}({\mathscr{H}}_{A})\) is the identity channel. If there existed a compatibilizer for this case, there would exist a linear map 𝜃AA|A such that:
which would, in turn, imply a universal broadcast machine. We are forced to conclude that the identity map idA is not self-compatible [13]. This example shows also that compatibility of quantum channels is mathematically rich and complex, despite having a simple definition and a very straightforward information theoretical interpretation.
Example 2
The second example shows how we can construct as many compatible channels as we want and, on top of that, the following construction also explicitly exhibits the compatibilizer. Given two non-trivial and finite-dimensional Hilbert spaces \({\mathscr{H}}_{B}\) and \({\mathscr{H}}_{C}\), define \({\mathscr{H}}_{A}:={\mathscr{H}}_{B} \otimes {\mathscr{H}}_{C}\). Now, chose \(\tilde {\psi }_{B|B}\) and \(\tilde {\phi }_{C|C}\) arbitrarily. Finally, define ψB|A and ψC|A acting on \(\mathcal {D}({\mathscr{H}}_{A})\) via:
for every \(\rho _{A}\in {\mathscr{H}}_{A}\). Now, the main claim is that ψB|A and ψC|A are compatible and, additionally, that \(\tilde {\psi }_{B|B} \otimes \tilde {\phi }_{C|C}\) is their compatibilizer. As a matter of fact:
Note that this series of equations is simply a consequence of trace-preservation. With the same argument it can be shown that \(\text {Tr}_{C}\left [ (\tilde {\psi }_{B|B} \otimes \tilde {\phi }_{C|C}) \rho _{A} \right ] = \phi _{C|A}(\rho _{A})\). In conclusion, not only the maps defined in (B2) and (B3) are compatible, but also the factorized map \(\tilde {\psi }_{B|B} \otimes \tilde {\phi }_{C|C}\) is their compatibilizer.
Intuitively, two ingredients are necessary to run the second example. First, we have defined \({\mathscr{H}}_{A}\) to be the tensor product of \({\mathscr{H}}_{B}\) and \({\mathscr{H}}_{C}\); we have opened room for parallel and independent action of the two channels. Secondly, we have explored this room and defined ψB|A as if it was acting only on B and, likewise, ϕC|A as if it was acting only on C. Even though there might be correlations between B and C codified in ρA, the knowledge of what is happening in A renders B and C conditionally independent [43, 51]. Basically, in this example, the compatibility of the two maps is a direct consequence of these two points. The tensor structure of A opened up space for enlarging the maps, and their conditional independence was crucial to remove either one on-demand.
Example 3
This last example shows that, in contrast with the resource theory of entanglement [52, 53], there is no catalysis [54, 55] of compatibility . More precisely, we will see that if \(\psi _{B|A} \otimes \chi _{B^{\prime }|A^{\prime }}\) is compatible with \(\phi _{C|A} \otimes \chi _{B^{\prime \prime }|A^{\prime }}\), then ψB|A and ϕC|A are also compatible. As a matter of fact, compatibility between \(\psi _{B|A} \otimes \chi _{B^{\prime }|A^{\prime }}\) and \(\phi _{C|A} \otimes \chi _{B^{\prime \prime }|A^{\prime }}\) implies the existence of \(\tilde {\theta }_{BB^{\prime }CB^{\prime \prime }|AA^{\prime }}\) such that
and
for every \(\rho _{AA^{\prime }}\). We define a compatibilizer for ψB|A and ϕC|A using (B5) and (B6) above as:
for each ρA, where d\(_{A^{\prime }}\) is the dimension of \({\mathscr{H}}_{A^{\prime }}\). To check that 𝜃BC|A is a valid compatibilizer, it suffices to trace either system out of (B7):
Similarly, the same argument leads to \(\text {Tr}_{B}\left [ \theta _{BC|A}(\rho _{A}) \right ]= \phi _{C|A}(\rho _{A})\) for every ρA. To sum up, our construction says that it does not matter if an auxiliary channel is plugged into ψB|A and ϕC|A. If those channels are not compatible to begin with, they will remain incompatible even with the help of an external channel \(\chi _{B^{\prime }|A}\). In other words, in the sense of [54, 55] there is no catalysis of compatibility.
As will become clearer, the examples we explore here have only been chosen because they will be useful to investigate the connection between compatibility and divisibility later on. Nonetheless, we hope that they have been sufficiently illustrative to the reader who is unfamiliar with the field. Compatibility constitutes an active research topic, and this short sub-section does not represent an exhaustive review of it. For recent developments on compatibility we suggest [13] and [15].
Appendix : C: Compatibility and Divisibility are not Connected in General
As hinted in the introduction (Section 1), divisibility and compatibility can be both associated with the notion of simulability. Although the simulability encoded in Definition A.3 comes, intuitively, in a parallel form and the simulability of Definition A.2 in a sequential form, they both consist of writing down a map in terms of others. It is exactly this shared common feature that has originally motivated our study. We wanted to know if parallel simulability implied sequential simulability and also if sequential simulability implied parallel simulability.
Section C, makes clear that these implications do not hold true in general, and sub-Section C addresses what is wrong with them. The main reason lies indeed in the conflict between the sequential and parallel characters of the two notions.
Nonetheless, as shown in the main text, it is remarkable that if we restrict our argument to a certain class of important quantum channels, we can readily connect the two concepts. The Section 3 in the main text addresses exactly this point. We think it is instructive to discuss our original guesses and the counter-examples to them. We dedicate this appendix to that discussion.
1.1 C.1: Conjectures and Counter-Examples
Let us start with a first attempt. Conjecture 1 states that divisibility should imply compatibility. In other words, it says that parallel simulability could be turned into sequential simulability.
Conjecture 1
If ψB|A divides ϕC|A, then it must be the case that ψB|A is compatible with ϕC|A.
It is not so difficult to come up with a counter-example for this statement. As it turns out, we have already discussed a counter-example for this conjecture before, more precisely in Section A. Referring back to example 1, it suffices to take \({\mathscr{H}}_{A}={\mathscr{H}}_{B}={\mathscr{H}}_{C}\) and ψB|A = idA = ϕC|A. Even though ψB|A divides ϕC|A – with the quotient map being nothing but 𝜃C|B = idA, there is no compatibilizer for this case. In conclusion, the first conjecture does not hold true in general.
Because we are building our argument upon the non-universal broadcasting theorem, we can formulate, in this context, a follow-up question: what if one requires more structure on A? For instance, if we restricted ourselves, and considered divisibility and compatibility only on \(\mathcal {A}\), a commuting sub-algebra of \(\mathcal {D}({\mathscr{H}}_{A})\), then in this case the conjecture 1 would follow [16]. As we will be focusing on general properties of channels, in this work we will not approach restricted domains for the channels. We leave this point open for further investigations.
The second conjecture talks about the converse direction. It explores the possibility of having sequential-like simulability as a building block for parallel simulability.
Conjecture 2
If ψB|A is compatible with ϕC|A, then it must be the case that ψB|A divides ϕC|A.
As we had already anticipated, this conjecture also does not hold true. To show this we will use again a previous example. We have learned from Example 2, in Appendix B, how to construct compatible maps ψB|A and ϕC|A whose compatibilizer is \(\tilde {\psi }_{B|B}\) and \(\tilde {\phi }_{C|C}\). It suffices, for instance, to consider the case where \(\tilde {\psi }_{B|B}\) is the completely depolarizing map [45] and \(\tilde {\phi }_{C|C} = \text {id}_{C}\). If there existed a quotient map 𝜃C|B for this example, it would be a many-to-one relation, and therefore not even a function.
In conclusion, both conjectures do not hold true at this level of generality, and we will try and explain the reasons why in the section below.
1.2 C.2: Discussion: What Went Wrong?
To begin with, conjecture 1 expresses the idea that divisible channels can be seen as a realization of a larger channel that allows to recover the original channels by the appropriate tracing out. This is indeed a too strong claim. First, note that if we assume divisibility, the quotient channel has, in general, a preferred direction; ψB|A dividing ϕC|A implies a channel from B to C such that ϕC|A = 𝜃C|B ∘ ψB|A. In this sense, not only the simulability is a sequential-like simulability, but also it has a preferred direction. In opposition, because of the parallel character, compatibility is more symmetrical. This very aspect also plagues conjecture 2, as we will see in the next paragraph. Secondly, as we pointed out before, the set of channels considered in our conjecture is too broad and too general. We mentioned that if one is willing to pay the cost of restricting the domain of the involved channels to something smaller and with more structure, it is the case that the trade-off must secure a truth value for the statement. Although we think this is a point deserving further investigation, we will not do so here, as we are more concerned with which properties of the channels that can make the conjectures to be true.
Conjecture 2 not only suffers from the same symmetry v. asymmetry issue already discussed before, but also from the tension between divisibility and the parallel character defining compatibility. The symmetry v. asymmetry tension manifested here is due to the lack of preferred direction of compatible channels. With no further assumptions, if compatibility implied ψ dividing ϕ, it should also be true that ϕ divided ψ, and we have already discussed a case ruling out this possibility. The second point, that of exploring the parallel simulability of the channels, is what we tried and explored in example 2. It shows that independent, or conditionally independent, channels might be compatible as well as not-divisible for the very same reason: their action is, broadly speaking, in parallel. Once again, although we think that a connection between conditional independent channels and compatibility is expected, we will not investigate any further their relationship in this work.
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
Duarte, C., Catani, L. & Drumond, R.C. Relating Compatibility and Divisibility of Quantum Channels. Int J Theor Phys 61, 189 (2022). https://doi.org/10.1007/s10773-022-05165-z
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s10773-022-05165-z