Reachability Probabilities of Quantum Markov Chains
classification
🪐 quant-ph
keywords
reachabilitybsccchainsmarkovpersistenceprobabilitiesquantumrepeated
pith:RJ6K3PDU Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{RJ6K3PDU}
Prints a linked pith:RJ6K3PDU badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.