Path trace.m

From Spinach Documentation Wiki
Jump to: navigation, search

Liouvillian path tracing. Treats the user-supplied Liouvillian as the adjacency matrix of a graph, computes the weakly connect- ed subgraphs of that graph and returns a cell array of project- ors into the corresponding independently evolving subspaces. Syntax:


where L is the Liouvillian and rho is the initial state (in the case of source state screening) or the detection state (if des- tination state screening is used). The output is a cell array of projectors into independently evolving reduced subspaces. Those projectors are to be used as follows:

          L_reduced=P'*L*P;     rho_reduced=P'*rho;

Further information is available here: