Manuscript Psy03-A@1 · Psy03-A.tex · theorem · b30eb6e9
Theorem: Classical Markov boundary of the quantum network
The exact classical boundary · lines 1389–1425 · proof included or linked
Psy03-A@1#thm:classicalboundary, Psy03-A@1#eq:markov
If , the node populations obey, for every initial density operator,
They do not depend on initial node coherence. Diagonal inputs remain diagonal. Node dephasing has no effect on these population trajectories.
With diagonal preparations, node-basis readouts, and interventions specified by nonnegative substochastic matrices whose complete sum is stochastic, every allowed record history has an exact classical continuous-time Markov realization.
Proof. For , the gain term contributes to population . Its anticommutator removes from population . Summing gives (eq:markov). The node-projector dissipators have zero diagonal contribution. At a diagonal state they generate no off-diagonal terms.
An intervention matrix acts on diagonal populations by . Its branch probability is the sum of the resulting entries. Between interventions, the Markov propagator acts by a stochastic matrix. Products of these matrices give exactly the same unnormalized history populations and record probabilities as the quantum maps. Induction proves the complete-history claim.
Displayed formulas in this passage
Psy03-A@1#eq:markov · line 1393