Manuscript Em05-B@1 · Em05-B-v1.tex · proposition · 6c050f5b
Proposition: Completeness, conditional states, and no signaling
The specified decoder and its flagged instrument › Visible off-code events · lines 1107–1164 · proof included or linked
Em05-B@1#prop:instrument, Em05-B@1#eq:codeBranch, Em05-B@1#eq:offBranch, Em05-B@1#eq:referencedCodeBranch, Em05-B@1#eq:referencedOffBranch
The map is CPTP and
Writing , its logical branches are
For input (eq:input), their probabilities are
For a referenced input , put . The unnormalized branch outputs are
Whenever , the conditional state is . The unconditional reference obeys
Proof. The branch Kraus operators are precisely the code and off-code groups used in Theorem thm:specified. Their effects sum to ; attaching orthogonal classical labels makes their sum CPTP. Equations (eq:codeBranch)–(eq:offBranch) follow by grouping (eq:rhoR). Applying the same operator identities with a reference gives (eq:referencedCodeBranch) and (eq:referencedOffBranch). Trace preservation yields the final identity.
Displayed formulas in this passage
Em05-B@1#eq:codeBranch · line 1114
Em05-B@1#eq:offBranch · line 1114
Em05-B@1#eq:referencedCodeBranch · line 1135
Em05-B@1#eq:referencedOffBranch · line 1135
unlabeled · line 1110
unlabeled · line 1126
unlabeled · line 1148