Manuscript Hawk07-A@1 · Hawk07-A.tex · definition · f9c0f5da

Definition: Decoder program

One specified decoder core › A deterministic finite prescription · lines 935–950

Hawk07-A@1#def:decoder, Hawk07-A@1#eq:SDP

Choose a minimizing solution of

minimize subject to t /2 C_{D} \geq 0, Tr_{L} C_{D} = I_{R^{'}}, Z \geq J_{Δ} (C), Z \geq - J_{Δ} (C), Tr_{L} Z \leq t I_{L^{'}}, t \geq 0.

Among optimal decoder Choi matrices, choose the one minimizing the squared Frobenius norm. Call the resulting map $D_{*}$ .

Displayed formulas in this passage

Hawk07-A@1#eq:SDP · line 938
$minimize subject to t /2 C_{D} \geq 0, Tr_{L} C_{D} = I_{R^{'}}, Z \geq J_{Δ} (C), Z \geq - J_{Δ} (C), Tr_{L} Z \leq t I_{L^{'}}, t \geq 0.$