Dispensing of quantum information beyond no-broadcasting theorem -- is it possible to broadcast anything genuinely quantum?

No-broadcasting theorem is one of the most fundamental results in quantum information theory; it guarantees that the simplest attacks on any quantum protocol, based on eavesdropping and copying of quantum information, are impossible. Due to the fundamental importance of the no-broadcasting theorem, it is essential to understand the exact boundaries of this limitation. We generalize the standard definition of broadcasting by restricting the set of states which we want to broadcast and restricting the sets of measurements which we use to test the broadcasting. We show that in some of the investigated cases broadcasting is equivalent to commutativity, while in other cases commutativity is not necessary.


I. INTRODUCTION
The no-cloning theorem is perhaps the most famous limitation in quantum information processing. The impossibility to duplicate an unknown quantum state makes a fundamental difference between classical and quantum information processing. The no-cloning theorem is nowadays seen not only as an obstacle but a fact that enables e.g. secure communication protocols. Namely, since an unknown quantum state cannot be perfectly duplicated it follows that a potential eavesdropper on a quantum communication channel cannot capture messages without being detected. The no-cloning theorem is not an isolated feature of quantum theory but links to other impossibility statements such as the no-information-without-disturbance theorem and the non-existence of joint measurement for arbitrary pairs of measurements [1]. In that perspective, the violation of Bell inequalities can be seen as an experimental proof of the no-cloning theorem.
Later, an important distinction between cloning and broadcasting was made [2] and in the present work we concentrate on the latter concept, hence we recall their difference. A (hypothetical) perfect cloning device takes an unknown pure state ρ as an input and gives a composite system in a joint state ρ ⊗ ρ as an output. Even in a classical theory this condition cannot hold for all mixed states, therefore it makes more sense to pose it only for pure quantum states. In fact, the originally presented version of the no-cloning theorem formulates cloning for pure states and derives a contradiction from their superposition structure [3]. The defining condition for a perfect broadcasting device is weaker than cloning; it is only required that the output is a joint state ω of a bipartite system that has the duplicate of the initial state ρ as its both marginal states, i.e., the partial traces of ω are tr 1 [ω] = tr 2 [ω] = ρ. The broadcasting condition captures the essence of the possibility to duplicate classical information as in a classical theory; the perfect cloning device for pure states is also a perfect broadcasting device that broadcasts all classical states, pure and mixed. In quantum theory the impossibility of universal and perfect broadcasting follows from the no-cloning theorem. This is due to the fact that a joint state with pure marginal states is necessarily a product state, hence for pure states broadcasting is the same as cloning. Therefore, taken only as categorical no-go statements, the no-cloning theorem and the no-broadcasting theorem are equivalent. We emphasize that the previous statements and also all the later developments in this work assume that there is one input copy. If there are more input copies, then no-cloning and no-broadcasting become separated and broadcasting of qubit states is, in fact, possible if there are four or more input copies available [4,5].
The separation between cloning and broadcasting becomes relevant when one considers approximate, non-universal or otherwise imperfect scenarios. The underlying theme is to find and characterize possible quantum devices that function as a cloning or broadcasting device in some approximate or limited manner. The sole no-go statement does not prevent the existence of a device with arbitrarily small nonzero deviation from the hypothetical cloning or broadcasting device. Since the existence of such an almost perfect device would evidently ruin the essence and practical consequences of the no-go theorems, this topic is important and various approximate scenarios have been exhaustively studied earlier [6,7]. In approximate scenarios the distinction between cloning and broadcasting is not sharp as an actual device can be compared to both of these hypothetical devices and it simulates them imperfectly. Roughly speaking, if the aim is optimal approximate broadcasting, then the quality of output states is tested on the individual subsystems and no attention is paid to their joint state. In contrast to approximate scenarios, one can consider perfectly accurate but non-universal cloning or broadcasting devices, meaning that the input state is not completely arbitrary but belongs to some known subset of states. In this case the distinction between cloning and broadcasting is clear since the performance of the device is required to be perfectly that of the hypothetical device, just not on all states. It has been shown that a set of quantum states that can be broadcasted with a single quantum channel is contained in the simplex generated by a set of distinguishable states. In other words, maximal subsets of states that can be broadcasted are replicas of classical state spaces in the given quantum state space.
In the current work we generalize the setting of accurate but limited broadcasting. We formulate the concept of a broadcasting test, where the capability of a quantum channel to broadcast is tested with a setup consisting of some specified test states and test measurements. This formulation covers several interesting scenarios as special cases, some of which have been investigated earlier and some new arising naturally from the introduced framework. We prove that the defining condition of a broadcasting test reduces to a mathematical condition on factorization maps, determined by the corresponding test measurements. The derived condition on factorization maps avoids irrelevant details and provides tools to study any given broadcasting test. Further, the formulation of a broadcasting test in terms of factorization maps leads to a new viewpoint, where broadcasting can be seen as a certain kind of congruency relation on quantum channels. We prove that this relation is strictly stronger than the compatibility relation on quantum channels. In the final section we will study broadcasting in two specific cases: when the sets of measurements used to test the broadcasting are restricted and when the set of states and set of measurements on one side are restricted. We show that in all cases commutativity is sufficient for broadcasting, but, surprisingly, we also show that commutativity is strictly not necessary by constructing concrete examples of scenarios which are broadcastable, but not commutative. This complements the earlier result on broadcastable set of states where commutativity was often shown to be necessary. The general concept of a broadcasting test allows to study intermediate cases, where limitations are both of states and measurements.

II. BROADCASTING TESTS
By a quantum channel we mean a completely positive and trace preserving linear map from a quantum state space to another quantum state space. These are the physically realizable inputoutput processes. Let us consider a scenario where a quantum channel Λ ∶ S → S ⊗S is planned to be used to broadcast an unknown state to two parties. Here S is a fixed state space of d-dimensional quantum system. Generally, a channel from S to S ⊗ S (or more generally to S ⊗n ) is called a broadcasting channel, irrespective of its action. Here we use S ⊗ S to denote the tensor product of quantum state spaces, S ⊗ S is the state space consisting of density matrices on the tensor product of the underlying Hilbert spaces. The broadcasting condition is for all ρ ∈ T , A ∈ A and B ∈ B. If there exists a channel Λ that passes a broadcasting test (T , A, B), then we say that the triple (T , A, B) is broadcastable.

III. REFORMULATION OF BROADCASTING TESTS
We begin this section with a simple observation. The equations (2) and (3)  In the following we present a mathematically equivalent form of broadcasting tests. To do this, we introduce an equivalence relation that partitions the state space according to a particular test.
Firstly, we say that a measurement A distinguishes two states ρ and σ if A(ρ) ≠ A(σ), meaning that the measurement outcome distributions for these states are different. We further say that a subset  For any A ⊆ O, we denote the equivalence classes in the equivalence relation ≈ A as We further denote

sets of all equivalence classes in
T and S, respectively. It follows that we can introduce the factorization map F A ∶ S → S A as Further, for any A ∈ A we define a map A ′ on S A as This is well-defined since by construction every A ∈ A is constant on the equivalence classes [ρ] A .
We therefore have for all ρ ∈ S.
Example 1. (Factorization maps on a qubit.) Let us consider a qubit system. The qubit states can be parametrized with Bloch vectors ⃗ r ∈ R 3 , ⃗ r ≤ 1, via the correspondence ρ = 1 2 (1 + r x σ x + r y σ y + r z σ z ), where σ x , σ y , σ z are the Pauli matrices. We denote by X, Y, Z the measurements that measure the components of the Bloch vector ⃗ r. For instance, X(ρ) = ( 1 2 (1 + r x ), 1 2 (1 − r x )). We can identify the set S X of all equivalence classes with the interval [−1, 1] and the factorization Fig. 2(a)). In this representation the map X ′ is given by X ′ (p) = The description is analogous for Y and Z, but becomes different if A consists of two measurements, say X and Y. We can identify the set S {X,Y} with the disk {(x, y) ∶ x 2 + y 2 ≤ 1} and the factorization map F {X,Y} is then F {X,Y} (ρ) = (tr [ρσ x ] , tr [ρσ y ]) (see Fig. 2(b)). The maps If A consists of all three measurements X, Y and Z, then the set is informationally complete. The factorization map F {X,Y,Z} is then simply the bijection between the qubit state space and the unit ball.
With the previous concepts we now express the broadcasting test condition in terms of factorization maps as follows.
for all ρ ∈ T .
Proof. Assume that a channel Λ passes the broadcasting test (T , A, B). For any A ∈ A and ρ ∈ T . Therefore, we get ) and so (8) holds. In a similar fashion we get ρ ≈ B tr 1 [Λ(ρ)] and so also (9) holds.
Let us then assume that (8) and (9) hold. For A ∈ A and ρ ∈ T we have where we have used (7) twice. For any B ∈ B we have and thereby Λ passes the broadcasting test (T , A, B).
The previously expressed statement that a broadcasting test depends only on the corresponding factorization maps and not on the specific details of measurements is a simple but useful fact. In the following we demonstrate the consequences of Prop. 1.
Example 2. (Uniform antidiscrimination of qubit states.) Antidiscrimination of states ρ 1 , . . . , ρ n means that there is a n-outcome measurement that gives always a different outcome than what is encoded in a state, i.e., tr [ρ x A x ] = 0 for all x = 1, . . . , n. A stronger form is uniform antidiscrimination, which further requires that the other outcomes are obtained with uniform probability, i.e., for all x, y = 1, . . . , n. In the case of a qubit system, uniform antidiscrimination is possible for n = 2, 3, 4 but not for higher n [10]. We can then ask if there is a channel that broadcasts these antidiscrimination setups, meaning that we look at a broadcasting test with T = {ρ 1 , . . . , ρ n }, (12) is satisfied (see Fig. 3). We consider the cases n = 2, 3, 4 separately.
For n = 2 uniform antidiscrimination is implemented with two perfectly distinguishable states and A is the measurement that discriminates them, just we relabel to outcomes to get antidiscrimination.
As a set of perfectly distinguishable states is broadcastable, the task is possible.
For n = 4 uniform antidiscrimination is implemented with four states that have Bloch vectors pointing to the corners of a regular tetrahedron. The measurement A has rank-1 effects that point to the opposite directions. We conclude that A is informationally complete, therefore there is no channel that passes the broadcasting test as the states do not belong to a simplex generated by jointly distinguishable states.
The case n = 3 is the most interesting as it is not as evident as the previous two cases. Uniform antidiscrimination is implemented with three states that have Bloch vectors pointing to the corners of a equilateral triangle. The measurement A has rank-1 effects that point to the opposite directions.
Without loosing generality we can assume that the states and effects are in the plane spanned by . We conclude that a channel that passes the broadcasting test would implement the hypothetical perfect broadcasting device of the disk state space, which is a contradiction as only classical state spaces admit broadcasting [8]. Therefore, the test is not broadcastable.
By using factorization maps we get an easy proof for the fact that the smallest amount of noise that one needs to add in order to make the scenario broadcastable is either 0 or 1. Thus adding white noise to non-broadcastable measurements does not make them broadcastable. This was already observed in slightly different forms in [9,11,12].
Proposition 2. Let A and B be subsets of measurements and define A s and B t to be the noisy versions of A and B: where s, t ∈ (0, 1] are fixed noise parameters and C denotes the set of coin-toss measurements, i.e., POVMs such that every element is proportional to the identity operator 1. Proof. For any s ≠ 0, the equivalence classes determined by A and A s are the same. This means that the respective factorization maps are the same, hence the claim follows from Prop. 1. We emphasize that Prop. 2 refers to the situation where noisy measurements are measured and the measurement outcome distributions are compared to the expected distributions. In contrast, the optimal quantum cloning device [13,14] can be seen as performing universal broadcasting at the cost of adding noise to all measurements (see e.g. [15]).
From now on, we will mostly write broadcasting tests in terms of the corresponding factorization maps. This will simplify our calculations as it is easier to consider two maps instead of two subsets of measurements. Moreover, we will use (8) and (9) to generalize the idea of broadcasting tests also to broadcasting of channels.

IV. BROADCASTING OF CHANNELS
There is a slightly different viewpoint to broadcasting that allows a more flexible starting point.
From Prop. 1 we conclude that the broadcasting condition demands that Λ copies the test state but is 'invisible' for factorization maps. Instead of factorization maps, we can insert any single-system channels into that condition and this leads to the following definition.
, be channels and let T ⊆ S be a convex set. We say that In this case we also say that Φ 1 and Φ 2 are T -broadcastable.
The conditions (15)-(16) can be again seen as a sort of broadcasting test; if we are acting with Φ 1 and Φ 2 on the duplicates, then it seems like Λ is a perfect broadcasting device.
Definition 2 resembles the definition of compatibility of channels [16,17], but has a crucial difference. Namely, we recall that two channels Φ i ∶ S → S i , i ∈ {1, 2}, are compatible if there exists a channel Λ ∶ S → S 1 ⊗ S 2 such that for all ρ ∈ S, we have Further, Φ 1 and Φ 2 are called T -compatible if this condition holds for all ρ ∈ T ⊂ S [18]. By comparing (15)- (16) to (17)- (18) we see that the latter requires that Λ can reproduce the actions of Φ 1 and Φ 2 , while in the former Λ should duplicate the input state and let Φ 1 and Φ 2 act on the duplicates. In the following we show that broadcastability is a stronger requirement than compatibility, although for some classes of channels they are equivalent properties.
, be channels and let T ⊆ S be a convex set.
In the following example we demonstrate that broadcastability is a strictly stronger relation for channels than compatibility.
Example 3. (Invertible channels are not broadcastable but can be compatible) Assume Φ 1 and Φ 2 are channels that are invertible, but we do not require the inverses to be positive. If Φ 1 and Φ 2 are broadcastable, we can apply the inverse maps to (15) and (16) and get ρ = tr 2 [Λ(ρ)] = tr 1 [Λ(ρ)]. It follows that Λ is a universal broadcasting device, which contradicts the no-broadcasting theorem.
We conclude that a pair of invertible channels is not broadcastable. However, there are compatible pairs of invertible channels. For instance, a partially dephasing channel ∆ µ (ρ) = µρ is invertible for all parameters 0 < µ ≤ 1. Two such channels are compatible for suitably small parameters [19,20]. As for subsets of measurements, we can assign factorization maps for subsets of channels. For our purposes, it is enough to have the following definition for single channels although an analogous definition can be phrased for subset of channels. For ρ, σ ∈ S, we define ρ ≈ Φ σ if Φ(ρ) = Φ(σ). Let S Φ be the set of equivalence classes of ≈ Φ and let F Φ ∶ S → S Φ be the corresponding factorization map. We introduce a map Φ ′ on S Φ as for all ρ ∈ S. This is again well-defined since by construction Φ is constant on the equivalence classes of ≈ Φ . We therefore have and the channel Φ hence factorizes through F Φ . We note that F Φ is the identity map for injective channels Φ.
We will next show that for broadcasting tests one can restrict to the case of broadcastable factorization channels.
Proof. The proof is almost the same as proof of Prop. 1. Let Λ ∶ S → S ⊗ S be the the channel that passes the broadcasting test (T , Φ 1 , Φ 2 ). Let ρ ∈ T . We have from which it follows that and so we must have which shows that Λ passes the broadcasting test (T , F Φ 1 , Φ 2 ).
Let us then assume that Λ passes the broadcasting test (T , F Φ 1 , Φ 2 ) and let ρ ∈ T . We have which shows that Λ passes the broadcasting test (T , Φ 1 , Φ 2 ).
One can also obtain the same result as above for broadcasting tests with two subsets of channels, similarly as we did earlier with two subsets of measurements. The results and their proofs would be the same.

V. SPECIAL CASES
In this section we are going to look closely at special cases of broadcasting of measurements.
We have already seen that all other introduced scenarios can be reduced to this one. We will first show that commutativity of the measurements or some measurements and states is sufficient for broadcastability.
Proposition 5. If A and B are mutually commuting, then a broadcasting test (T , A, B) is broadcastable.
Proof. If A and B are mutually commuting, then there is an isomorphism Proof. We can again use [21,Theorem 1.] to show that H is isomorphic to ⊕ n k=1 H A k ⊗ H T k and, up to an isomorphism, we have where now p k ≥ 0 and ∑ n k=1 p k = 1 are just to ensure proper normalization of ρ. The result follows immediately, since A measures only the classical information encoded in the probability distribution p k .
A. The case when S ⊂ span (T ) As the first special case we will assume that S ⊂ span (T ), which is a generalization of the case when T = S. If all of the measurements in A commute, then according to Prop. 5 the test is broadcastable. This is the case when all of the measurements in A can be post-processed from a single projective measurement. To be more specific, let H 3 be the qutrit Hilbert space, A, A) is broadcastable, the channel that passes the broadcasting test is defined as To see that Λ passes the broadcasting test, simply observe that and so measuring A will yield the correct probability. In the following example we will show that commutativity is only sufficient but not necessary condition for broadcastability; the main idea is that if we extend the Hilbert space, then we have some freedom in the choice of A i in (27).
where M is an arbitrary measurement supported on span ({ 4⟩, 5⟩}), that is, This implies that M i j⟩ = 0 for all i ∈ {1, 2, 3} and j ∈ {1, 2, 3}. One can choose M i such that they do not mutually commute, which then implies that also A i do not commute. To see that (T , A, A) is broadcastable, simply consider channel defined analogically as in (27), that is Λ(ρ) = ∑ 3 i=1 tr [ρA i ] ii⟩⟨ii . We again have and the result follows from tr [ i⟩⟨i A j ] = δ ij for all i ∈ {1, 2, 3} and j ∈ {1, 2, 3}.

Theorem 2. Assume that S ⊂ span (T ). Then (T , A, A) is broadcastable if and only if there is a
single measurement G such that the norm of every non-zero operator in G is 1, i.e., G λ ∈ {0, 1}, ∀λ and every measurement in A can be post-processed from G, i.e., for every A ∈ A and every i we where p(i A, λ) ≥ 0 and ∑ i p(i A, λ) = 1.
Proof. To see that this is sufficient, we only need to show that (S, {G}, {G}) passes the broadcasting test. If G λ = 1, then there is unit vector λ⟩ ∈ H such that G λ λ⟩ = λ⟩. Since ∑ λ G λ = 1, we then Proof. Assume that (T , A, A) is broadcastable, the result follows by showing that the measurement G λ as described in Thm. 2 can be post-processed from a projective measurement. It is then straightforward to show that A i and B j commute for every A, B ∈ A and for all i, j.
If G is dichotomic, i.e., it has only two outcomes, then it is commutative, so we need to consider only the case when G is at least trichotomic, i.e., it has at least three nonzero outcomes. Since then for these three outcomes we must have G λ = 1, it follows that we must have at least dim(H) = 3, in which case G is projective measurement. Thus the only case we need to investigate is when dim(H) = 4 and G has three nonzero outcomes, since with four nonzero outcomes G is again projective measurement. So let dim(H) = 4 and let { i⟩} 4 i=1 be a suitable orthonormal basis. Then G i = i⟩⟨i + M i for i ∈ {1, 2, 3}, which implies that M i = α i 4⟩⟨4 for all i ∈ {1, 2, 3} and thus again G can be post-processed from a single projective measurement.
In the general case when A ≠ B commutativity is also a sufficient but not necessary criterion for broadcasting. This is demonstrated by the following example, where we use B(H) to denote the set of operators on the Hilbert space H. i=1 be an orthonormal basis and let P = ∑ 4 i=1 i⟩⟨i . Then P H is a fourdimensional Hilbert space, thus it can be seen as tensor product of two qubit Hilbert spaces H 2 , dim(H 2 ) = 2, i.e., P H = H 2 ⊗ H 2 . Moreover let ι ∶ B(H 2 ) → B(H 6 ) be the embedding defined by ι( i⟩⟨j ) = i + 5⟩⟨j + 5 for i, j ∈ {0, 1}, that is ι maps operators on H 2 to operators on P ⊥ B(H 6 ).
Let A, B be projective measurements on H 2 given as where { i⟩} 1 i=0 is an orthonormal basis of H 2 and ±⟩ = 1 Let ∆ µ ∶ B(H 2 ) → B(H 2 ) be the partially dephasing channel given as ∆ µ (ρ) = µ(ρ) + (1 − µ) 1 2 . It is known that for µ ≤ 1 3 the channel ∆ µ is self-compatible, i.e., there is a channel . We now define measurementsÃ,B on H 6 such that they do not commute, but are broadcastable. Let where 1 2 is the identity on H 2 and the terms A i ⊗ 1 2 and 1 2 ⊗ B i are supported on P H 6 = H 2 ⊗ H 2 .
In order to construct the channel Λ that passes the broadcasting test (T , A, B) we will need the auxiliary channel Π ∶ B(P H 6 ) → B(P H 6 ⊗ P H 6 ) defined for X 1 , X 2 ∈ B(H 2 ) as Π(X 1 ⊗ X 2 ) = X 1 ⊗ 1 2 ⊗ 1 2 ⊗X 2 and extended by linearity, here we are heavily relying on the identification P H 6 = H 2 ⊗H 2 . Then let is the inverse to ι. Λ clearly is completely positive, we only need to prove that it is trace-preserving, but this follows from tr [(Π(P ρP ))(P ⊗ P )] = tr [ρP ] and tr (Π ○ Ψ ○ ι −1 )(P ⊥ ρP ⊥ )(P ⊗ P ) = tr [ρP ⊥ ]. Finally, to show that Λ passes the broadcasting test the proof forB j is similar.

B. The case when B is info-complete
It is sufficient that B is infomationally-complete. In this case we obtain the following result: Theorem 3. Assume that B is informationally-complete. If (T , A, B) is broadcastable, then for every A ∈ A there isÃ ∈ O(S) such that A(ρ) =Ã(ρ) for all ρ ∈ T andÃ i commutes with every Proof. The proof of is in the Appendix B.
Finally we present a simple example that demonstrates why we sometimes need to useÃ instead of A.

VI. CONCLUSIONS
The no-broadcasting theorem is among the most important limitations in quantum information processing. It has, however, very strong assumptions as it uses all states and all measurements in its usual formulation. In the current work we generalized the setting of accurate but limited broadcasting and introduce the concept of a broadcasting test. This enables to pose the question of the exact conditions when broadcasting is possible. Earlier studies have already revealed that commutativity, either between states or measurements, makes broadcasting possible and that is not surprising as the scenario is then effectively classical, but, as we have shown, commutativity is not necessary for broadcasting in general.
We have characterized the conditions for broadcastability in certain important special classes of broadcasting tests. While we did not cover the most general scenario, even the special cases that we have investigated turned out to provide nontrivial and unexpected results. We have also investigated generalizations of broadcasting to channels and we have shown that such generalizations can be mapped back to the case considering only states and measurements.
Future investigations into broadcasting can be done along several lines: one can, of course, attempt to solve the most general scenario, but this will likely be a hard task. Another option would be, in the spirit of [8], to generalize our results to more general systems, such as the ones described by operational probabilistic theories [22] or general probabilistic theories [23,24]. Yet another line of research would be to consider approximate broadcasting, that is allowed to return the correct result only with some probability, and generalize our result in this direction. such that for all X ∈ B(H) + , we have Π(X) ∈ Fix(Φ) + and Π is idempotent, i.e., Π 2 = Π. Moreover Π is unital and: (a) if Φ is completely positive, then Π is completely positive, then the main idea of the proof is that Π ≈ lim n→∞ Π n . In order to make the limit meaningful we will show that the sequence {Π n } ∞ n=1 contains a convergent subsequence.
First of all observe that 1 ∈ Fix(Φ) since Φ is unital. Define and so for every X ∈ B 1 we have 0 ≤ 1 2 (1+X) ≤ 1, or, equivalently, for any X ∈ B 1 there is E ∈ B(H), and again from positivity of Φ. We thus get Since for every X ∈ B 1 we have X ≤ 1 and for every hermitian Y ∈ B(H) such that Y ≤ 1 we have Y ∈ B 1 , we can express the superoperator norm of Φ as and using (A6) we get Φ ≤ 1. We then have which shows that the sequence {Π n } ∞ n=1 is a subset of the unit ball of superoperators. It follows that there is a convergent subsequence {Π n j } ∞ j=1 , see e.g. [25,Theorem 28.2]. Denote Let us first of all show that Π is positive. Let X ∈ L(H) + , then Since ∑ n j k=1 Φ k (X) ≥ 0, Π(X) is the limit of positive operators. But then Π(X) ≥ 0 since the positive cone B(H) + is closed.
In order to show that Φ ○ Π = Π, which is equivalent to Π(X) ∈ Fix(Φ) for X ∈ B(H) + , we will need to show that {Π n j +1 } ∞ j=1 converges to the same limit as {Π n j } ∞ j=1 . First note that where we can use (A11) and that {Π n j } ∞ j=1 converges to Π to show that lim j→∞ Π n j +1 = Π. We now have and so Π(X) ∈ Fix(Φ) for all X ∈ B(H) + .
To show that Π is idempotent we only need to show Π(Y ) = Y for all Y ∈ Fix(Φ), then Π 2 = Π follows from Π(X) ∈ Fix(Φ). We have Since Φ is unital, we have that 1 ∈ Fix(Φ) and so Π is unital as well.
Finally if Φ is completely positive, then also Φ k is completely positive, which implies that Π n is completely positive and so Π is a limit of completely positive maps. It then follows that also Π is completely positive. and so Π is also trace preserving.
Theorem 2. Assume that S ⊂ span (T ). Then (T , A, A) is broadcastable if and only if there is a single measurement G such that the norm of every non-zero operator in G is 1, i.e., G λ ∈ {0, 1}, ∀λ and every measurement in A can be post-processed from G, i.e., for every A ∈ A and every i we where p(i A, λ) ≥ 0 and ∑ i p(i A, λ) = 1.
Proof. Let Λ be the channel that passes the broadcasting test, then we have Λ * (A i ⊗1) = Λ * (1⊗A i ) = A i . We can now, without the loss of generality, assume that SWAP ○Λ = Λ, for example by replacing Λ with 1 2 (Λ+SWAP ○Λ), which also passes the same broadcasting test whenever Λ does. Here SWAP is the defined as SWAP(ρ 1 ⊗ ρ 2 ) = ρ 2 ⊗ ρ 1 . We then have that tr 1 Since Φ is trace preserving, we have that Φ * is unital and thus, according to Lemma A. Here Fix(Φ * ) * + can be understood as the cone generated by states of some suitable operational theory [23,24] and Fix(Φ * ) + as the dual cone generated by the effect algebra.
Since T is a convex set, there is some element σ ∈ T such that its support contains the supports of all other states in T . Let P = supp(σ) be the projection onto the support of σ. Note that since σ ∈ Fix(Φ 2 ), we have Φ 2 (P B(H)P ) ⊆ P B(H)P . Let us replace the channels Φ 1 and Φ 2 with their restrictions to P B(H)P ≡ B(P H), then Φ 2 is a channel B(P H) → B(P H) compatible with the channel Φ 1 ∶ B(P H) → B(H) and T ⊆ Fix(Φ 2 ), so that Fix(Φ 2 ) contains a full rank state. According to Lemma A.1, there is a unital completely positive idempotent map whose range is the set of fixed points Fix(Φ * 2 ). Let Π 2 denote the adjoint of this map, then it is easily seen that Π 2 is an idempotent channel such that Fix(Π 2 ) = Fix(Φ 2 ). Since compatibility is preserved by post-processings, Π 2 = Π 2 ○ Φ 2 is compatible with Φ 1 . We may therefore assume that Φ 2 is an idempotent channel with a full rank fixed state.
Let us recall some well known facts, for the convenience of the reader. Let Π ∶ B(H) → B(H) be an idempotent channel which has a full rank fixed state σ. First, note that the adjoint map Π * ∶ B(H) → B(H) is an idempotent unital completely-positive map whose range is a subalgebra of B(H). Indeed, the range of Π * is clearly a self-adjoint linear subspace containing 1, it is therefore enough to prove that Π * (X * X) = X * X for all X = Π * (X). By the Schwarz inequality for unital completely-positive maps [26,Prop. 3.3], we have Π * (X * X) ≥ Π * (X) * Π * (X) = X * X (B4) and since σ ∈ Fix(Π), we have tr [σ(Π * (X * X) − X * X)] = 0, so that Π * (X * X) = X * X. Moreover Π * is a conditional expectation, which means that it has the conditional expectation property Since the range of Π * is a subalgebra in B(H), it is generated by projections it contains. It is therefore enough to show that any projection Q = Π * (Q) commutes with all elements of the form Φ * (X), X ∈ B(K). We may also restrict to effects, 0 ≤ X ≤ I K , since these generate B(K). In this case Φ * (X) is an effect as well and using the joint channel, it is easily seen that it is compatible with Q. Since Q is a projection, this shows that Q must commute with Φ * (X).
For the converse, assume that Φ * and Π * have commuting ranges, then the map is unital and completely positive (e.g. [27,Prop. VI.4.23]), and its adjoint is a joint channel for Φ and Π.
Theorem 3. Assume that B is informationally-complete. If (T , A, B) is broadcastable, then for every A ∈ A there isÃ ∈ O(S) such that A(ρ) =Ã(ρ) for all ρ ∈ T andÃ i commutes with every ρ ∈ T .