Manuscript Hawk05-B@1 · Hawk05-B.tex · theorem · f2e5d4f5

Theorem: Whole ambient code: exact errors

The Page curve and whole-code recovery are different tasks › An exact full-code calibration in the same model · lines 943–991 · proof included or linked

Hawk05-B@1#thm:fullcode, Hawk05-B@1#eq:fullcode, Hawk05-B@1#eq:fullrecord

Back to manuscript

For every fixed , at a cut with , , the coherent channels satisfy

If the returned radiation is destructively read out, its classical channel satisfies

In particular, a midpoint mean-entropy peak does not imply accurate recovery of the whole -dimensional input.

Proof. Conjugating the logical target by leaves the optimization unchanged. The coherent channel becomes . The decoder appending has error , by the Weyl twirl on . For the reverse bound, use the product Bell input . After is lost, its reference is independent of every decoder input. The decoded full Bell overlap is at most . This proves the recovery formula.

The complementary channel is . Replacement by has distance at most . Fixing the input on and testing a Bell input on gives the matching lower bound for every replacement.

For record-only access, the measurement effects on the transformed code are

If is any decoder output, its full Bell overlap is

The decoder preparing attains the bound: its channel is , the average of phase/Weyl conjugations, one of which is the identity. Separating that term proves the matching upper bound.

Displayed formulas in this passage

  • Hawk05-B@1#eq:fullcode · line 947

  • Hawk05-B@1#eq:fullrecord · line 953

  • unlabeled · line 979

  • unlabeled · line 983

Nearby in this section