Manuscript Em05-A@1 · Em05-A-v1.tex · theorem · 9cac0def
Theorem: Exact specified-decoder performance
A complete specified decoder and optimal-recovery boundaries · lines 700–774 · proof included or linked
Em05-A@1#thm:specified, Em05-A@1#eq:decoded, Em05-A@1#eq:specifiedError, Em05-A@1#eq:BellFid, Em05-A@1#eq:WorstFid, Em05-A@1#eq:decodedBell, Em05-A@1#eq:decodedConc
The decoded channel is
It satisfies
For the Bell-input decoded state,
the two-qubit concurrence is
No optimality of is asserted for intermediate .
Proof. The odd occupations in (eq:rhoR) contribute after decoding. The decoded lower-right entry is , and its off-diagonal entry is . The upper-left entry is . This proves (eq:decoded).
A half-diamond distance between channels is at most one. The identity and replacement by attain distance one on input . Homogeneity therefore gives (eq:specifiedError).
The replacement term's Bell overlap is , proving (eq:BellFid). For any purified input, the target overlap of (eq:decoded) is at least , because the replacement contribution is nonnegative. Input gives zero replacement contribution and attains , proving (eq:WorstFid).
For concurrence, use Wootters' definition Wootters: the concurrence is the positive part of the largest square-root eigenvalue of minus the other three, where
In the ordered basis , (eq:decodedBell) is
The square-root eigenvalues are
Their difference is .
Displayed formulas in this passage
Em05-A@1#eq:decoded · line 703
Em05-A@1#eq:specifiedError · line 711
Em05-A@1#eq:BellFid · line 711
Em05-A@1#eq:WorstFid · line 711
Em05-A@1#eq:decodedBell · line 717
Em05-A@1#eq:decodedConc · line 724
unlabeled · line 755
unlabeled · line 759
unlabeled · line 769