Reachability probabilities of quantum Markov chains

Publication Type:
Conference Proceeding
Citation:
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013, 8052 LNCS pp. 334 - 348
Issue Date:
2013-08-28
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2013002063OK.pdf281.14 kB
Adobe PDF
This paper studies three kinds of long-term behaviour, namely reachability, repeated reachability and persistence, of quantum Markov chains (qMCs). As a stepping-stone, we introduce the notion of bottom strongly connected component (BSCC) of a qMC and develop an algorithm for finding BSCC decompositions of the state space of a qMC. As the major contribution, several (classical) algorithms for computing the reachability, repeated reachability and persistence probabilities of a qMC are presented, and their complexities are analysed. © 2013 Springer-Verlag.
Please use this identifier to cite or link to this item: