Speaker

   Prof. Mingsheng Ying,Tsinghua University, China and University of Technology, Sydney, Australia

　　Title

   Reachability Probabilities of Quantum Markov Chains                      

　　Time

　　2013.5.23 10:00am                                 

　　Venue

　　S712

　　Abstract

We study verification of programs for future quantum computers. Quantum programs are modelled by quantum Markov chains (qMCs). Three kinds of long-term behaviours of qMCs are considered of, namely reachability, repeated reachability and persistence. 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.

　　Affiliation