Lean, informalized

Nielsen & Chuang · Chapter 12, Quantum information theory · p. 603

Problem 12.4 - A copying map that respects mixtures fails on every proper mixture of two states it copies

A machine that copies two states cannot copy their mixtures.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Exercise

A copying machine takes a system SS in some state, together with a blank system BB prepared in a fixed state σ\sigma, and returns two systems of the kind of SS, each in the state SS came in with. The machine is linear: fed a mixture of two inputs, it returns the same mixture of the two outputs. Suppose it copies two different states ρ1\rho_1 and ρ2\rho_2 of SS. Show that it copies no mixture of ρ1\rho_1 and ρ2\rho_2 in which each occurs with a probability strictly between 00 and 11.✦

Systems and States

A quantum system SS is a physical system whose state space is a finite dimensional complex Hilbert space.✦ The composite system S⊗TS \otimes T of two quantum systems SS and TT is the quantum system whose state space is the tensor product of the state spaces of SS and TT.✦

A state ρ\rho of SS is a positive operator of unit trace on the state space of SS, a density operator.✦

The mixture of two states ρ\rho and ρ′\rho' of SS with weight pp, a real number with 0≤p≤10 \le p \le 1, is the state of SS with density operator pρ+(1−p)ρ′,p\rho + (1-p)\rho',(1)✦ the state prepared by choosing ρ\rho with probability pp and ρ′\rho' otherwise. The product state ρ⊗σ\rho \otimes \sigma of a state ρ\rho of SS and a state σ\sigma of TT is the state of S⊗TS \otimes T whose density operator is the tensor product of the two, acting as ρ\rho on the first factor and as σ\sigma on the second.✦

The Claim

The machine is a map EE taking each state of S⊗BS \otimes B to a state of S⊗SS \otimes S. The map EE respects mixtures if, for every weight qq with 0≤q≤10 \le q \le 1 and all states τ1\tau_1 and τ2\tau_2 of S⊗BS \otimes B, E(qτ1+(1−q)τ2)=qE(τ1)+(1−q)E(τ2).E\bigl(q\tau_1 + (1-q)\tau_2\bigr) = q\,E(\tau_1) + (1-q)\,E(\tau_2).(2) Let σ\sigma be a state of BB, the blank state. The map EE copies a state ρ\rho of SS if E(ρ⊗σ)=ρ⊗ρ.E(\rho \otimes \sigma) = \rho \otimes \rho.(3)

Theorem 1. Let SS and BB be quantum systems, σ\sigma a state of BB, and EE a map from the states of S⊗BS \otimes B to the states of S⊗SS \otimes S that respects mixtures, (2). Let ρ1\rho_1 and ρ2\rho_2 be two different states of SS that EE copies, (3), and let pp be a real number with 0<p<10 < p < 1. Then the mixture ρ=pρ1+(1−p)ρ2\rho = p\rho_1 + (1-p)\rho_2 is not copied: E(ρ⊗σ)≠ρ⊗ρ.E(\rho \otimes \sigma) \neq \rho \otimes \rho.(4)✦

What Is Checked

The claim is stated over the states of the composite systems S⊗BS \otimes B and S⊗SS \otimes S: every input and every target in it is a product state.

About these constructions the library proves that a convex combination of two density operators with weights pp and 1−p1-p is again positive with trace one, and that so is the tensor product of two density operators.