Manuscript Hawk02-C@2 · Hawk02-C.tex · theorem · bb332d66
Theorem: Identified complete-isometry comparison
Conventions and common-space comparison · lines 355–408 · proof included or linked
Hawk02-C@2#thm:C1, Hawk02-C@2#eq:scalaroverlap
Let be isometries on the same input and identified complete output spaces. Then
The allowance also bounds either partial-trace channel.
If , then
If is real, then
Proof. For every amplified trace-class operator ,
Its trace norm is at most . Divide by two and use partial-trace contractivity.
For any pure code–reference input , the output vectors have overlap
Their trace distance is . Convexity gives the same upper bound for mixed inputs, and every pure input attains it. The finite-input channel-discrimination characterization therefore proves (eq:scalaroverlap).
Finally,
when is real.
Displayed formulas in this passage
Hawk02-C@2#eq:scalaroverlap · line 366
unlabeled · line 359
unlabeled · line 371
unlabeled · line 378
unlabeled · line 393
unlabeled · line 403
Nearby in this section
- section: Conventions and common-space comparison
- definition: Definition: Complete-output assignment
- section: Conventions and common-space comparison
- section: Conventions and common-space comparison
- lemma: Lemma: Identity versus replacement
- lemma: Lemma: An erasure isometry and its exact errors
- section: Conventions and common-space comparison