Title:Reachability Analysis of Quantum Markov Chains
Speaker: Mingsheng Ying University of Technology Sydney and Tsinghua University
Time: 2013-10-18 15:00-2013-10-18 16:00
Venue:FIT 1-222


This paper studies verification of quantum systems, including quantum programs. We consider 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.  

Short Bio: