Manuscript Em03-G@1 · Em03-G-v1.tex · theorem · 0bb3a8a3
Theorem: Compact scalar transmission and recovery
Compact ordered realization and source-input stability › An error bound on the finite-dimensional source input · lines 1473–1507 · proof included or linked
Em03-G@1#thm:compacttransmission, Em03-G@1#eq:compactrecovery
For the compact ordered model and decoder ,
The decoded Bell and worst-case entanglement fidelities are at least , and
For every desired positive recovery allowance, finite compact ordered source parameters exist with below that allowance, within the stated growing-resource family.
In particular, finite compact parameters exist for which the identified outgoing scalar packet channel is not entanglement breaking.
Proof. Postcompose Theorem thm:stability with the same complete decoder and use Theorem thm:matchedrecovery. Effect contraction proves the fidelity and witness bounds.
First choose finite so that is small. For that fixed , is finite and positive. Lemma lem:bridge permits finite making arbitrarily small, while the time slabs remain ordered. If , the witness is negative.
Displayed formulas in this passage
Em03-G@1#eq:compactrecovery · line 1476
unlabeled · line 1485
Nearby in this section
- section: An error bound on the finite-dimensional source input
- theorem: Theorem: Referenced two-pulse profile stability
- section: An error bound on the finite-dimensional source input
- example: Example: A nonvacuous analytical parameter certificate
- section: An error bound on the finite-dimensional source input