Manuscript Hawk04-D@1 · Hawk04-D-v1.tex · theorem · 39b16f67
Theorem: Flagged-transfer calibration
Stage 1: two different finite calibration schedules › A single logical cell with an occupied-vacuum flag · lines 659–731 · proof included or linked
Hawk04-D@1#thm:flagged, Hawk04-D@1#eq:flagged, Hawk04-D@1#eq:flagged-errors, Hawk04-D@1#eq:flagged-energy
After pulses, the complete map has the form
where the occupied ranges of are orthogonal to their vacuum flags. Its optimal recovery and leakage are
An optimal decoder compresses the occupied radiation code and prepares on its orthogonal complement.
If
each pulse conserves . For one initially occupied cell,
For independent cells with the same , this expectation is , even for correlated logical labels.
Proof. Induction gives the pulse amplitudes above, and
This proves (eq:flagged) and its isometry property.
The accessible channel is
The stated decoder produces , with error . Any decoder's Bell overlap is at most , proving optimality.
The complement is
Replacement gives leakage at most . For an arbitrary replacement state, apply a CPTP pinching and retraction onto the occupied code block and vacuum flag. Let be its occupied weight. On a Bell input, the occupied Bell projector has expectation difference . The effect equal to that projector on the occupied block and identity on vacuum has difference . If , the first is at least ; if , the second is at least . This proves the leakage lower bound.
Each pulse mixes equal-energy one-excitation states and is the identity on all other sectors. It commutes with . The transfer probability is , proving the energy formula. Linearity and addition of the independent number observables prove the -cell statement.
Displayed formulas in this passage
Hawk04-D@1#eq:flagged · line 662
Hawk04-D@1#eq:flagged-errors · line 671
Hawk04-D@1#eq:flagged-energy · line 684
unlabeled · line 679
unlabeled · line 694
unlabeled · line 701
unlabeled · line 711