Manuscript Oai280-C@1 · Oai280-C.tex · theorem · 7d44b8c0
Theorem: Selected operational access map
One connected two-cell encoding › Optimal errors for selected access classes · lines 903–956 · proof included or linked
Oai280-C@1#thm:accessmap
For the ideal encoding , the optimal unrestricted half-diamond errors for the following declared targets and access classes are:
No value is asserted here for an unlisted mixed access pattern.
Proof. For , the channel is constant. The subsystem optimum is by the qubit replacement argument; the upper bound is unchanged by composing with . For full two-qubit recovery, a maximally entangled four-dimensional input has overlap with every replacement Choi state. The replacement attains error , by the sixteen-term two-qubit Pauli expansion of .
For the hybrid target, identify the output with and write . Its normalized Choi state is supported on
It has support probability one. A replacement Choi state has support probability , because . Thus the error is at least . For the upper bound, is the equal mixture of and , whereas is the equal mixture of all sixteen Pauli conjugations. Their difference is times a difference of two channels, so its half-diamond norm is at most .
For left-only triple or four-leg access, is returned exactly and no information about is available. Replacing by gives full-bulk error ; a Bell input on gives the matching lower bound. For the hybrid target, returning a fair sector label gives error . The lower bound follows by using the two orthogonal sector inputs with the same logical state: they have identical accessible outputs, so a single decoder cannot be closer than to both orthogonal target outputs. The two-triple case is Theorem thm:patch.
Displayed formulas in this passage
unlabeled · line 907
unlabeled · line 930