Manuscript Oai280-B@1 · Oai280-B.tex · section · 6d92ab75

Privacy, perfectness, and exact access-dependent recovery

Privacy, perfectness, and exact access-dependent recovery · lines 366–385

Oai280-B@1#eq:accesschannels

For $A \subseteq {1, \dots, 5}$ , let $A ˉ$ be its complement, and order both subsets increasingly. Let

Π_{A} : H_{\partial} ⟶ H_{A} \otimes H_{A ˉ}

be the corresponding tensor permutation. Define

N_{A} (M) C_{A} (M) = Tr_{A ˉ} (Π_{A} V M V^{†} Π_{A}^{†}), = Tr_{A} (Π_{A} V M V^{†} Π_{A}^{†}) .

These are two reductions of the same encoding.

Displayed formulas in this passage

Oai280-B@1#eq:accesschannels · line 375
$N_{A} (M) C_{A} (M) = Tr_{A ˉ} (Π_{A} V M V^{†} Π_{A}^{†}), = Tr_{A} (Π_{A} V M V^{†} Π_{A}^{†}) .$
unlabeled · line 371
$Π_{A} : H_{\partial} ⟶ H_{A} \otimes H_{A ˉ}$