Manuscript XXII-F@1 · XXII-F.tex · section · 67821705
Standing approximation failure tests
Readout, limiting tests, and dynamics separation › Standing approximation failure tests · lines 1540–1601
The following remain scoped tests, not sufficient premises for extraction CheungXXIIB,CheungXXIID.
• Boundary generation versus attainment. For
every nonzero finite conical combination is interior to , by the strict triangle inequality, but by density. A generated null boundary need not contain an attained generator or implemented protocol.
• Finite-stencil delay. If all step velocities lie in a fixed finite , with , choose a unit vector . Then . An endpoint within of satisfies
by projection onto . When , vanishing spatial error forces an arrival lower bound . When it is zero, sufficiently accurate arrival is impossible.
• Moving arrival jumps. Compare a channel returning a failure flag before and identity with a success flag after , with the corresponding jump at . Even if , orthogonal flags between the two arrival times give uniform half-diamond distance one. Endpoint topology does not assert uniform convergence through such an unmatched jump.
• Accumulation is model dependent. For the qubit replacement channel , let . Idempotence gives
Thus , with , can leave error . Failure of a telescoping upper bound to vanish, by itself, is not a lower bound for every noise or correction model.
• Tolerance versus exact influence. Channels uniformly within of one intervention-independent channel have signalling strength at most , not necessarily zero. The family is at distance from replacement and transmits a bit with distinguishability . A tolerance graph is not the exact graph (eq:influence).
Displayed formulas in this passage
unlabeled · line 1548
unlabeled · line 1563
unlabeled · line 1585