Reachability probabilities of quantum markov chains

  • Authors:

  • Shenggang Ying;Yuan Feng;Nengkun Yu;Mingsheng Ying

  • Affiliations:

  • Tsinghua University, China,University of Technology, Sydney, Australia;Tsinghua University, China,University of Technology, Sydney, Australia;Tsinghua University, China,University of Technology, Sydney, Australia;Tsinghua University, China,University of Technology, Sydney, Australia

  • Venue:
  • CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.