Path trace.m

Liouvillian path tracing. Treats the user-supplied Liouvillian as the adjacency matrix of a graph, computes the weakly connected subgraphs of that graph and returns a cell array of projectors into independently evolving populated subspaces.

Syntax

    projectors=reduce(spin_system,L,rho)

Arguments

    L   -  Liouvillian matrix 

    rho -  the initial state (source state screening)
           or the detection state (destination state
           screening)

Outputs

  projectors - a cell array of projectors into independently
               evolving populated subspaces. The projectors 
               are to be used as follows:

                  L_reduced=P'*L*P;    (for matrices)
                  rho_reduced=P'*rho;  (for state vectors)

Notes

Further information on how this function works is available in our papers on this subject:

            http://dx.doi.org/10.1063/1.3398146
            http://dx.doi.org/10.1016/j.jmr.2011.03.010

See also

reduce.m, zte.m, symmetry.m, krylov.m

Version 2.2, authors: Ilya Kuprov, Matthew Krzystyniak