No-Broadcasting Theorem
The no-broadcasting theorem gives an exact operational characterization of commutativity. In finite-dimensional quantum mechanics, one physical channel can place every state in a promised family into two output systems with both marginals unchanged if and only if all states in that family commute pairwise.
Broadcasting is weaker than cloning: the two correct marginals may belong to a correlated joint state. The theorem therefore reaches mixed-state families that the usual pure-state no-cloning argument does not describe.
Required background. Density Operators supplies the state space; Partial Trace supplies the marginal operation; and Quantum Operations supplies completely positive trace-preserving maps and Kraus operators.
Helpful background. Entangled States clarifies why a joint output need not be a product. The pure-state no-cloning boundary is recovered below without being assumed.
Broadcasting a family of states
Section titled “Broadcasting a family of states”Let be finite dimensional, and identify each output space and with . A channel
broadcasts a family when, for every ,
has marginals
The same channel must work without being told which member of the family was supplied.
No-broadcasting theorem. A family of density operators on a finite-dimensional Hilbert space is exactly broadcastable by one CPTP map if and only if
for every pair .
Pairwise commuting finite-dimensional Hermitian matrices are simultaneously diagonalizable. The theorem can therefore be read as follows: exactly the state families encoded in one common classical basis can be broadcast.
Constructing the channel for commuting states
Section titled “Constructing the channel for commuting states”Suppose the family commutes. Choose a common orthonormal eigenbasis so that
Define Kraus operators from the input to the two outputs by
They satisfy
so
is completely positive and trace preserving. On every promised input,
Tracing out either output gives . Operationally, this channel dephases in the common eigenbasis and writes the surviving classical label into both systems. Dephasing does not alter any state in the promised commuting family.
The output is generally not two independent copies:
Its two records are classically correlated. That distinction is why broadcasting can succeed for overlapping commuting mixed states even when cloning cannot.
Why noncommuting states cannot be broadcast
Section titled “Why noncommuting states cannot be broadcast”The difficult direction is necessity. A useful proof follows the fidelity argument of Barnum, Caves, Fuchs, Jozsa, and Schumacher. Define the root fidelity
This convention is the square root of the quantity that some texts call fidelity. It is monotone under every CPTP map:
A channel cannot make two inputs more distinguishable. Partial trace is a CPTP map and obeys the same inequality.
Assume one channel broadcasts two states and , with outputs and . Channel monotonicity and the marginal give
The marginal gives the same chain. Every inequality is therefore an equality:
This equality chain is necessary, but writing it down is not yet a proof of commutativity. A channel can preserve fidelity for a pair without broadcasting it. The nontrivial step is to impose the equality conditions for both output marginals.
The two-marginal equality step
Section titled “The two-marginal equality step”First suppose and are invertible. Fidelity also has the measurement representation
where the minimum is over POVMs. An optimal projective POVM may be chosen in an eigenbasis of the positive operator
which is the unique positive solution of
Let be its spectral projections, with . Because broadcasting preserves the input probabilities on each marginal, the two lifted POVMs
have the same classical overlap as the input-optimal POVM. The fidelity equalities force both lifted POVMs to be optimal for the output pair.
Here is the equality lemma needed for the remaining implication. It is the step that the fidelity sandwich by itself does not provide.
Two-marginal fidelity lemma. Let and be states on whose marginals satisfy
Suppose is a projective POVM that is optimal for , and that both lifted POVMs and are optimal for . Then there are nonnegative numbers and polar unitaries such that
To verify the lemma for either lifted projective POVM , choose a unitary extension of the polar partial isometry such that
Then
For an optimal measurement the endpoints agree, so both intermediate inequalities are equalities. Because the marginals are invertible, every nonzero has positive probability. Equality in each Hilbert–Schmidt Cauchy–Schwarz term therefore gives , with the common phase absorbed into and
Applying this argument to the two lifted PVMs gives the two displayed relations. Their polar unitaries may differ on the null spaces of the output states, which is why they were denoted and .
Apply the lemma with , , and . Define
Summing the equality relations over gives
Taking adjoint products and then the appropriate partial trace uses the broadcasting marginals to give
The positive solution of is unique: multiplying by on both sides shows that
Hence . Because is invertible, eliminating between the two summed relations yields, for the unitary ,
Act on the product eigenvector and compare norms. The left side has norm , while the right side has norm . Positivity of the eigenvalues therefore implies
The -basis matrix elements of the marginal are
If , the two vectors in every summand cannot both be nonzero: the first requires and the second requires . Thus the matrix element vanishes and . Finally,
so . The argument has now used both marginal equalities, the equality condition itself, and the uniqueness of explicitly.
For states that are not invertible, let and restrict to . This restriction also contains the output supports. If projects onto and a positive output has its marginal supported in , then
Positivity forces on the support of ; the other marginal gives the analogous statement for . Hence every broadcast output is supported in .
Define the broadcast state
Linearity means the channel also broadcasts every convex combination of and . For , the two states
are invertible on and are broadcast by the same channel. The invertible argument gives , while direct expansion gives
Hence . Applying this pairwise to a broadcast family proves necessity for the whole family.
Broadcasting versus cloning
Section titled “Broadcasting versus cloning”Cloning requires the stronger output condition
Fidelity is multiplicative on tensor products. If one channel cloned two states exactly, partial trace would recover each input from its output. The same two-sided monotonicity argument would therefore require
Thus must be or : the states have orthogonal supports or are identical. Overlapping commuting mixed states can therefore be broadcast but cannot be cloned into product copies.
For a pure input, broadcasting already reduces to cloning. If a bipartite state has the pure marginal , positivity forces the joint state to factor as
If the other marginal is the same pure state, then . Rank-one projectors commute only when they represent the same ray or orthogonal rays, recovering the exact deterministic no-cloning theorem.
Qubit examples
Section titled “Qubit examples”Consider a commuting -diagonal family
The Kraus channel with and broadcasts every member at once:
Both marginals equal .
By contrast, let
Their commutator is
If and are both nonzero, no exact channel broadcasts the pair. This includes noisy, genuinely mixed examples; purity is not the obstruction.
Scope and edge cases
Section titled “Scope and edge cases”Singleton and identical families. A singleton commutes trivially and can be broadcast by a constant preparation channel. Repeated copies of the same density operator do not make a nontrivial family.
Orthogonal supports. Orthogonal states commute and can be perfectly identified, after which a channel may prepare two records. They can even be cloned exactly.
Degenerate spectra. Pairwise commutativity, not nondegeneracy, is the criterion. Any common eigenbasis within degenerate subspaces gives a valid constructive channel.
Correlated output. Broadcasting constrains only the two marginals. The joint output may contain classical or quantum correlations; it need not be a product state.
External classical label. If a device is told which state was prepared, it can prepare as many copies as desired. The theorem assumes that the same channel receives only the unknown quantum input.
Exact finite-dimensional setting. The theorem here is deterministic and exact, with one input copy and two faithful marginals. Approximate, probabilistic, asymmetric, many-input, and infinite-dimensional broadcasting require separate statements and error measures.
Common pitfalls
Section titled “Common pitfalls”Calling the theorem universal no-copying. A known singleton or a commuting family is broadcastable. The obstruction is a promised family containing noncommuting alternatives.
Replacing broadcasting by cloning. Correct marginals need not be independent product copies. Commuting mixed states expose the difference.
Claiming that measurement and preparation always work. Measuring the common eigenbasis works for a commuting family because that dephasing leaves every promised state invariant. No single measurement has this property for a noncommuting family.
Stopping at fidelity preservation. Equality under the channel and one partial trace is not enough. Necessity uses the equality conditions for both marginals and the uniqueness of the positive operator .
Extending the theorem to infinite dimension without hypotheses. Support, continuity, normality, and operator-algebraic issues must be controlled in an infinite-dimensional version.
Exercises
Section titled “Exercises”1. Verify the constructive channel
Section titled “1. Verify the constructive channel”For , prove that the Kraus map is trace preserving and that it broadcasts every density operator diagonal in the basis .
Solution
Trace preservation follows from
For ,
Using and the analogous identity for , both marginals are .
2. Test a noncommuting qubit pair
Section titled “2. Test a noncommuting qubit pair”For and , calculate the commutator and determine exactly when the pair is broadcastable.
Solution
Since ,
The commutator vanishes exactly when or . In either case one state is maximally mixed and commutes with the other, so the pair is broadcastable. If , the no-broadcasting theorem forbids an exact broadcasting channel.
3. Derive the pure-state corollary
Section titled “3. Derive the pure-state corollary”Show that two rank-one projectors commute if and only if they are identical or orthogonal. Conclude that two distinct nonorthogonal pure states cannot be broadcast.
Solution
Let and . Their products are
If the overlap is zero, both products vanish. If it is nonzero and , the one-dimensional ranges of the two products coincide, so and define the same ray. The theorem therefore permits broadcasting only for identical or orthogonal pure states.
4. Check the rank-deficient reduction
Section titled “4. Check the rank-deficient reduction”With , verify
for the regularized states used in the necessity proof.
Solution
The regularized states are
Using bilinearity and antisymmetry of the commutator, the coefficient of is
All self-commutators vanish. Thus commutativity of the regularized pair for any implies commutativity of the original pair.
5. Use fidelity to rule out cloning
Section titled “5. Use fidelity to rule out cloning”Assume a channel maps both and to two product copies. Use fidelity monotonicity and multiplicativity to show that the two states must be identical or have orthogonal supports.
Solution
Monotonicity gives
Because , one also has . Both inequalities can hold only when or . Root fidelity is zero exactly for orthogonal supports and one exactly for identical states.
6. Complete the sector argument
Section titled “6. Complete the sector argument”Let with every , and suppose a state and a unitary obey
Show first that whenever . Then prove that the marginal of commutes with .
Solution
Taking norms after acting on gives
If , positivity makes the ratio different from one, so the norm must vanish. For ,
When , a nonzero first vector requires , whereas a nonzero second vector requires . These conditions cannot both hold, so every summand vanishes. Thus is block diagonal in the eigenspaces of , which is equivalent to .
References
Section titled “References”- H. Barnum, C. M. Caves, C. A. Fuchs, R. Jozsa, and B. Schumacher, “Noncommuting mixed states cannot be broadcast,” Physical Review Letters 76, 2818–2821, 1996, doi:10.1103/PhysRevLett.76.2818.
- D. Dieks, “Communication by EPR devices,” Physics Letters A 92, 271–272, 1982, doi:10.1016/0375-9601(82)90084-6.
- C. A. Fuchs and C. M. Caves, “Mathematical techniques for quantum communication theory,” Open Systems & Information Dynamics 3, 345–356, 1995, doi:10.1007/BF02228997.
- R. Jozsa, “Fidelity for mixed quantum states,” Journal of Modern Optics 41, 2315–2323, 1994, doi:10.1080/09500349414552171.
- W. K. Wootters and W. H. Zurek, “A single quantum cannot be cloned,” Nature 299, 802–803, 1982, doi:10.1038/299802a0.
Further reading
Section titled “Further reading”- M. M. Wilde, Quantum Information Theory, 2nd ed., Cambridge University Press, 2017, sections on fidelity, recoverability, and no-broadcasting.