Manuscript Oai069-A@1 · Oai069-A.tex · theorem · a4913aab
Theorem: Sharp coefficient-access verdicts
Access dependence, named effects, and sharp exclusions · lines 906–953 · proof included or linked
Oai069-A@1#thm:loss
For each sector, uniformly over gauge states and references:
both coefficient legs admit zero-error subsystem recovery;
one coefficient leg has optimal half-diamond error for complete qubit return;
no coefficient leg has optimal half-diamond error ;
one coefficient leg still exactly recovers the named effect .
Items two and three are bounds over all receiver-only CPTP decoders, not merely over the printed programmes.
Proof. Item one is Theorem thm:exact.
The channel retaining one leg is measure-and-prepare after discarding , hence entanglement breaking on . Fixing to a pure state and using a Bell input on , every receiver-only decoded output is separable across and the returned qubit. Its Bell overlap is at most : for a pure product vector this is Cauchy–Schwarz, and convexity gives the mixed separable case. The Bell projector therefore gives error at least .
Equation (eq:one-leg) attains the bound. Indeed , so the triangle inequality gives error at most , while the Bell output has orthogonal Bell components of weights . Composition with gives the same uniform upper bound.
Without coefficient legs, the accessible channel is independent of the qubit. For a fixed sector every decoded qubit is a replacement state . Its Bell-input output has overlap , so the error is at least . Returning attains , because qubit depolarization is the equal mixture of the four Pauli conjugations. Again composition with gives a uniform bound.
Finally, . Before the one-leg inverse, the corresponding received effect is
Its pullback is .
Displayed formulas in this passage
unlabeled · line 949