Reachability Probabilities of Quantum Markov Chains
Quantum Physics
2013-06-10 v2
Abstract
This paper studies three kinds of long-term behaviours, 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.
Cite
@article{arxiv.1304.0060,
title = {Reachability Probabilities of Quantum Markov Chains},
author = {Shenggang Ying and Yuan Feng and Nengkun Yu and Mingsheng Ying},
journal= {arXiv preprint arXiv:1304.0060},
year = {2013}
}
Comments
Accepted by Concur 2013. Comments are welcome