Lean, informalized

Nielsen & Chuang · Chapter 8, Quantum noise and quantum operations · p. 395

Problem 8.2 - Teleportation through any shared state: the results have total probability one, and recovery makes the induced map injective

Teleportation results that Bob can undo determine the input.

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

Alice holds a system AA in an unknown state ρ\rho and wants Bob to end up with it. They share a state σ\sigma of two further systems, BB on Alice’s side and CC on Bob’s, and σ\sigma may be any state, maximally entangled or not. Alice measures AA and BB together and tells Bob her result ii. Each result occurs with some probability and leaves Bob’s system in a state that depends on ρ\rho; Bob then works on CC alone, according to ii, to get ρ\rho back. The probabilities of Alice’s results add up to one. And if Bob’s operation for the result ii returns every input, the state that ii leaves on his side determines the input.✦

Systems and States

A quantum system SS is described by its state space, a finite dimensional complex Hilbert space.✦ The composite system S⊗TS \otimes T of two systems SS and TT is the system whose state space is the tensor product of their state spaces.✦ A state ρ\rho of SS is a positive operator of unit trace on the state space of SS, also called a density operator. For a state ρ\rho of SS and a state σ\sigma of TT, the product state ρ⊗σ\rho \otimes \sigma is the state of S⊗TS \otimes T given by the tensor product of the operators ρ\rho and σ\sigma.✦

An identification ee of a system SS with a system TT is a linear isometric bijection from the state space of SS onto that of TT; its inverse e−1e^{-1} identifies TT with SS. The relabelling of a state ρ\rho of SS along ee is the state eρe−1e \rho e^{-1} of TT.✦ The regrouping α\alpha of three systems AA, BB and CC is the identification of A⊗(B⊗C)A \otimes (B \otimes C) with (A⊗B)⊗C(A \otimes B) \otimes C that sends |u⟩⊗(|v⟩⊗|w⟩)|u\rangle \otimes (|v\rangle \otimes |w\rangle) to (|u⟩⊗|v⟩)⊗|w⟩(|u\rangle \otimes |v\rangle) \otimes |w\rangle.✦

The reduced states of a state ρ\rho of a composite system S⊗TS \otimes T are its partial traces: Tr⁡Tρ\operatorname{Tr}_T \rho, a state of SS, and Tr⁡Sρ\operatorname{Tr}_S \rho, a state of TT. A unitary UU of a system SS is an operator on the state space of SS with U†U=UU†=1U^\dagger U = U U^\dagger = 1, and the evolution of a state ρ\rho of SS under UU is the state UρU†U \rho U^\dagger. Given finitely many states ρk\rho_k of SS and weights wk≥0w_k \geq 0 adding up to one, their mixture is the state of SS with density operator ∑kwkρk\sum_k w_k \rho_k.✦

Measurements

A measurement mm on a system SS with a finite set KK of outcomes is a family of measurement operators MkM_k on the state space of SS, one for each outcome kk, satisfying the completeness relation ∑kMk†Mk=1\sum_k M_k^\dagger M_k = 1.✦ The positive operator valued measure (POVM) of mm is the family of positive operators Ek=Mk†MkE_k = M_k^\dagger M_k, which add up to the identity.✦ Performed on a state ρ\rho of SS, the measurement gives the outcome kk with probability p(k)=Tr⁡(MkρMk†)=Tr⁡(Ekρ)p(k) = \operatorname{Tr}(M_k \rho M_k^\dagger) = \operatorname{Tr}(E_k \rho), and when p(k)≠0p(k) \neq 0 the state after that outcome is MkρMk†/p(k)M_k \rho M_k^\dagger / p(k).

For a measurement mm on SS and a further system TT, the measurement of mm on the first factor of S⊗TS \otimes T is the measurement on S⊗TS \otimes T with the same outcomes as mm and the operators Mk⊗1TM_k \otimes 1_T.✦ A POVM on SS is a family of positive operators FiF_i on the state space of SS that add up to the identity, and the measurement of a POVM {Fi}\{F_i\} is the measurement on SS whose operators are the square roots Fi\sqrt{F_i}.✦ The coarse graining of mm along a map g:K→Ig \colon K \to I into a finite set II is the measurement of the POVM Fi=∑k:g(k)=iEkF_i = \sum_{k :\, g(k) = i} E_k, in which all outcomes with the same image under gg are merged into one.✦

Alice’s Measurement

The three systems start in the product state ρ⊗σ\rho \otimes \sigma of A⊗(B⊗C)A \otimes (B \otimes C). Regrouped so that Alice’s two systems stand together, this is the state of (A⊗B)⊗C(A \otimes B) \otimes C χ=α(ρ⊗σ)α−1.\chi = \alpha \, (\rho \otimes \sigma) \, \alpha^{-1} .(1)✦

Alice performs a measurement mm on A⊗BA \otimes B with outcomes kk in a finite set KK; on the three systems it is the measurement on the first factor, with operators Mk⊗1CM_k \otimes 1_C. The outcome kk has the probability p(k)=Tr⁡[(Mk⊗1C)χ(Mk⊗1C)†]p(k) = \operatorname{Tr}\bigl[ (M_k \otimes 1_C) \, \chi \, (M_k \otimes 1_C)^\dagger \bigr](2) and, when p(k)≠0p(k) \neq 0, leaves Bob’s system in the reduced state of the state after the outcome, τk=Tr⁡A⊗B[(Mk⊗1C)χ(Mk⊗1C)†p(k)].\tau_k = \operatorname{Tr}_{A \otimes B} \biggl[ \frac{(M_k \otimes 1_C) \, \chi \, (M_k \otimes 1_C)^\dagger}{p(k)} \biggr] .(3)

Bob does not learn kk. Alice reports the result i=g(k)i = g(k), for a map g:K→Ig \colon K \to I into a finite set II of results, so the measurement Bob hears about is the coarse graining along gg of Alice’s measurement on the first factor. The result ii has the probability p(i)=Tr⁡(Fiχ),Fi=∑k:g(k)=i(Mk⊗1C)†(Mk⊗1C),p(i) = \operatorname{Tr}(F_i \, \chi) , \qquad F_i = \sum_{k :\, g(k) = i} (M_k \otimes 1_C)^\dagger (M_k \otimes 1_C) ,(4) When p(i)≠0p(i) \neq 0, the state the result ii induces on Bob’s system is the mixture of the states τk\tau_k of those outcomes, each weighted by its probability given ii: ℰˆi(ρ)=∑k:g(k)=ip(k)p(i)τk.\hat{\mathcal{E}}_i(\rho) = \sum_{k :\, g(k) = i} \frac{p(k)}{p(i)} \, \tau_k .(5)✦

Bob’s Recovery

Bob reads his system as Alice’s through an identification ee of AA with CC. A recovery RR of Bob’s is given by an ancilla, a system DD in a state ω\omega, and a unitary UU of C⊗DC \otimes D: it adjoins DD in the state ω\omega, applies UU, traces out DD and relabels what remains along e−1e^{-1}. A state τ\tau of CC goes to the state of AA R(τ)=e−1Tr⁡D[U(τ⊗ω)U†]e.R(\tau) = e^{-1} \operatorname{Tr}_D \bigl[ U (\tau \otimes \omega) U^\dagger \bigr] \, e .(6)✦

A recovery RR of Bob’s, built from an ancilla DD, a state ω\omega of DD and a unitary UU of C⊗DC \otimes D, succeeds for the result ii when it returns every state ρ\rho of AA giving the result ii a nonzero probability: R(ℰˆi(ρ))=ρ.R\bigl( \hat{\mathcal{E}}_i(\rho) \bigr) = \rho .(7)✦

The Claim

Theorem 1. Fix Alice’s measurement mm on A⊗BA \otimes B and her map gg from outcomes to results, the shared state σ\sigma of B⊗CB \otimes C and the identification ee of AA with CC, and suppose Bob’s recovery succeeds for the result ii. Then for any two states ρ1\rho_1 and ρ2\rho_2 of AA that both give ii a nonzero probability, ℰˆi(ρ1)=ℰˆi(ρ2)only ifρ1=ρ2.\hat{\mathcal{E}}_i(\rho_1) = \hat{\mathcal{E}}_i(\rho_2) \quad \text{only if} \quad \rho_1 = \rho_2 .(8)✦

Theorem 2. For any measurement mm of Alice’s on A⊗BA \otimes B, any map gg from its outcomes to results, any shared state σ\sigma of B⊗CB \otimes C and any input state ρ\rho of AA, the probabilities of the results add up to one: ∑i∈Ip(i)=1.\sum_{i \in I} p(i) = 1 .(9)✦

What Is Checked

The first theorem is stated over the induced state (5), built from the regrouped state (1), the probabilities (2) and (4) and the states (3), and over Bob’s recovery (6) with its condition of success (7). The second is stated over the probability (4) alone.

About these constructions the library proves that they stay among states and measurements. The induced state is a state of CC: its weights p(k)/p(i)p(k)/p(i) are nonnegative and add up to one. The measurement on the first factor satisfies the completeness relation because (Mk⊗1)†(Mk⊗1)=Mk†Mk⊗1(M_k \otimes 1)^\dagger (M_k \otimes 1) = M_k^\dagger M_k \otimes 1, and the measurement of a POVM satisfies it because Fi†Fi=Fi\sqrt{F_i}^{\,\dagger} \sqrt{F_i} = F_i. The state after an outcome of nonzero probability, the partial traces, the product state, the relabelled state and the evolved state UρU†U \rho U^\dagger are all density operators.