Lean, informalized

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

Proposition 12.14 - Any local protocol run on a shared pure state is matched by one measurement of Alice and one unitary of Bob

From a pure state, one round of communication suffices.

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 Proposition

Alice holds a quantum system AA and Bob a quantum system BB, and they share a pure state |ψ⟩|\psi\rangle of the pair. They are restricted to local operations and classical communication (LOCC): each may measure their own system or apply a unitary to it, and announce a measurement outcome to the other, for as many rounds as they like and in either direction, every step chosen in view of the outcomes announced before it. Suppose some such protocol takes |ψ⟩|\psi\rangle to a state σ\sigma of the pair whatever the outcomes. Then one round does the same: Alice makes a single measurement and announces its outcome jj, Bob applies a unitary VjV_j chosen by jj, and the pair is left in σ\sigma.

Systems and Operations

A quantum system SS is a physical system whose state space is a finite dimensional complex Hilbert space.✦ The composite system A⊗BA \otimes B of two quantum systems AA and BB is the quantum system whose state space is the tensor product of the state spaces of AA and BB; Alice holds the first factor, Bob the second.✦

A state ρ\rho of a quantum system SS is a positive operator of unit trace on the state space of SS.✦ A pure state |ψ⟩|\psi\rangle of SS is a unit vector in the state space of SS, ⟨ψ|ψ⟩=1\langle\psi|\psi\rangle = 1✦, and the state it determines is the projector |ψ⟩⟨ψ||\psi\rangle\langle\psi| onto it.✦

A unitary UU of SS, an evolution of SS as a closed system, is an operator on the state space of SS with U†U=UU†=IU^\dagger U = U U^\dagger = I.✦ A measurement on SS with a finite set of outcomes is a family of measurement operators MjM_j on the state space of SS, one for each outcome jj, that satisfy the completeness relation ∑jMj†Mj=I.\sum_j M_j^\dagger M_j = I .(1)✦

Alice acts on the first factor of a state ρ\rho of A⊗BA \otimes B. A unitary UU of hers takes ρ\rho to (U⊗I)ρ(U⊗I)†(U \otimes I)\rho(U \otimes I)^\dagger, and a measurement {Mj}\{M_j\} on AA gives the outcome jj with probability pjp_j and, when pj≠0p_j \neq 0, leaves the state ρj\rho_j: pj=tr⁡[(Mj⊗I)ρ(Mj⊗I)†],ρj=(Mj⊗I)ρ(Mj⊗I)†pj.p_j = \operatorname{tr}\bigl[(M_j \otimes I)\,\rho\,(M_j \otimes I)^\dagger\bigr], \qquad \rho_j = \frac{(M_j \otimes I)\,\rho\,(M_j \otimes I)^\dagger}{p_j} .(2) Bob acts on the second factor in the same way: a unitary VV of his takes ρ\rho to (I⊗V)ρ(I⊗V)†(I \otimes V)\rho(I \otimes V)^\dagger, and a measurement {Mj}\{M_j\} on BB acts through I⊗MjI \otimes M_j.

LOCC Protocols

An LOCC protocol PP between Alice and Bob is either the stopped protocol, which does nothing further, or a first step followed by a protocol.✦ The first step is one of four. Alice measures AA with a measurement {Mj}\{M_j\} of nn outcomes, announces the outcome jj to Bob, and continues with a protocol PjP_j chosen by jj.✦ Bob measures BB, announces his outcome to Alice, and continues in the same way. Alice applies a unitary UU to AA and continues with a protocol P′P', or Bob applies a unitary VV to BB and continues with P′P'.✦

A protocol PP transforms a state ρ\rho of A⊗BA \otimes B into a state σ\sigma of A⊗BA \otimes B, written ρ→Pσ\rho \xrightarrow{P} \sigma, when run on ρ\rho it ends in σ\sigma whatever outcomes occur.✦ By its first step, P stops:ρ→Pσ when ρ=σ,Alice measures {Mj}, then Pj:ρ→Pσ when ρj→Pjσ for every j with pj≠0,Alice applies U, then P′:ρ→Pσ when (U⊗I)ρ(U⊗I)†→P′σ,\begin{aligned} &\text{$P$ stops:} &&\rho \xrightarrow{P} \sigma \text{ when } \rho = \sigma,\\ &\text{Alice measures $\{M_j\}$, then $P_j$:} &&\rho \xrightarrow{P} \sigma \text{ when } \rho_j \xrightarrow{P_j} \sigma \text{ for every $j$ with } p_j \neq 0,\\ &\text{Alice applies $U$, then $P'$:} &&\rho \xrightarrow{P} \sigma \text{ when } (U \otimes I)\,\rho\,(U \otimes I)^\dagger \xrightarrow{P'} \sigma, \end{aligned}(3)✦ and likewise for Bob’s two steps. A state ρ\rho can be transformed into σ\sigma by LOCC, written ρ→LOCCσ\rho \xrightarrow{\text{LOCC}} \sigma, when some protocol transforms ρ\rho into σ\sigma.

The one way protocol given by a measurement {Mj}j=1n\{M_j\}_{j=1}^{n} on AA and unitaries V1,…,VnV_1, \dots, V_n of BB has Alice measure and announce jj, then Bob apply VjV_j, and then stops.✦ By (3) it transforms ρ\rho into σ\sigma exactly when (I⊗Vj)ρj(I⊗Vj)†=σfor every j with pj≠0.(I \otimes V_j)\,\rho_j\,(I \otimes V_j)^\dagger = \sigma \quad \text{for every $j$ with } p_j \neq 0 .(4) A state ρ\rho of A⊗BA \otimes B reaches σ\sigma by one way LOCC, written ρ→one wayσ\rho \xrightarrow{\text{one way}} \sigma, when some one way protocol transforms ρ\rho into σ\sigma.✦

The Claim

Theorem 1. Let |ψ⟩|\psi\rangle be a pure state of the composite system A⊗BA \otimes B of two quantum systems, and σ\sigma a state of A⊗BA \otimes B. For an LOCC protocol PP: |ψ⟩⟨ψ|→Pσ⇒|ψ⟩⟨ψ|→one wayσ.|\psi\rangle\langle\psi| \xrightarrow{P} \sigma \;\Longrightarrow\; |\psi\rangle\langle\psi| \xrightarrow{\text{one way}} \sigma .(5)✦ If some LOCC protocol transforms |ψ⟩⟨ψ||\psi\rangle\langle\psi| into σ\sigma, then |ψ⟩⟨ψ||\psi\rangle\langle\psi| reaches σ\sigma by one way LOCC: |ψ⟩⟨ψ|→LOCCσ⇒|ψ⟩⟨ψ|→one wayσ.|\psi\rangle\langle\psi| \xrightarrow{\text{LOCC}} \sigma \;\Longrightarrow\; |\psi\rangle\langle\psi| \xrightarrow{\text{one way}} \sigma .(6)✦

What Is Checked

The claim is stated over a pure state |ψ⟩|\psi\rangle of the composite system A⊗BA \otimes B, taken through its projector |ψ⟩⟨ψ||\psi\rangle\langle\psi|, a state σ\sigma of A⊗BA \otimes B, the LOCC protocols, the transformation (3) of a state by a protocol, and reachability by one way LOCC.

Of these constructions the library proves that the projector onto a unit vector is a density operator, so that |ψ⟩⟨ψ||\psi\rangle\langle\psi| is a state of A⊗BA \otimes B.