Manuscript Em03-E@1 · Em03-E-v1.tex · section · c4b07e6a

Exact coherent transfer

E5: constructed coherent access and decoder implementation › Exact coherent transfer · lines 1478–1502

Em03-E@1#eq:accessbudget

Let receiver preparation have trace-distance error $e_{A}$ , independent of the cells and their references. Allow a joint bounded transfer perturbation $Δ H_{A} (t)$ , including cross-cell and spectator coupling. Then

ϵ_{acc} = min {1, e_{A} + \int ∥Δ H_{A} (t) ∥ d t}

bounds the complete coherent-access error by Lemma lem:stability.

An optional whole-block erasure is a complete flagged channel

E_{ℓ} (X) = (1 - ℓ) A_{0} (X) + ℓ tr (X) ∣ access - failed ⟩ ⟨ access - failed ∣ .

Its distance from ideal access in the enlarged interface is exactly $ℓ$ , because its failure flag is orthogonal to all ordinary outputs. It is not a postselected survival model.

Displayed formulas in this passage

Em03-E@1#eq:accessbudget · line 1484
$ϵ_{acc} = min {1, e_{A} + \int ∥Δ H_{A} (t) ∥ d t}$
unlabeled · line 1493
$E_{ℓ} (X) = (1 - ℓ) A_{0} (X) + ℓ tr (X) ∣ access - failed ⟩ ⟨ access - failed ∣ .$

Exact coherent transfer

Displayed formulas in this passage

Nearby in this section