Manuscript X-Enter@1 · X-Enter.tex · section · 484b71bc

General programs and selective distance

Option C: bounded-segment tolerance and visibility › General programs and selective distance · lines 1097–1166

X-Enter@1#eq:programbound, X-Enter@1#eq:contractive

Back to manuscript

Define

For , equation (eq:variation) gives

where

This follows by integrating the derivative block by block. The trace norm of a block-diagonal Hermitian record is the sum of its block trace norms. For classical laws, replace the trace norms in by .

There is also a program-independent estimate:

Indeed, a positive trace-preserving map contracts the trace norm on Hermitian differences. For , positivity, the triangle inequality, and trace preservation give

This standard contraction principle is also recorded in Watrous (Corollary 3.40). Direct differentiation of (eq:state) gives

Integration proves (eq:contractive).

For arbitrary encodings, constancy on a bounded segment need not imply constancy outside it. For the retained amplitude family, however, exact selective constancy on any nontrivial segment still forces . After dividing its zero derivative by , one obtains

throughout the segment; two different values of force both operators to vanish. The useful alternative here is approximate closure, not an exact loophole in Option A.

Displayed formulas in this passage

  • X-Enter@1#eq:programbound · line 1108

  • X-Enter@1#eq:contractive · line 1128

  • unlabeled · line 1100

  • unlabeled · line 1115

  • unlabeled · line 1136

  • unlabeled · line 1146

  • unlabeled · line 1159

Nearby in this section