2000 character limit reached
Open Quantum Random Walks: reducibility, period, ergodic properties (1405.2214v3)
Published 9 May 2014 in math.PR
Abstract: We study the analogues of irreducibility, period, and communicating classes for open quantum random walks, as defined by Attal et al. (J. Stat. Phys., 2012). We recover results similar to the standard ones for Markov chains, in terms of ergodic behavior, decomposition into irreducible subsystems, and characterization of stationary states.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.