Home Contact Chinese CAS
Home  About Us    Research     People   International Cooperation   News     Papers   Education & Training  Join Us
Location: Home > Research > Colloquia & Seminars

Reachability Probabilities of Quantum Markov Chains
【2013.5.23 10:00am,S712】

 Date:03-12-2013 Page Views:
Print
Text Size: A A A
Close

 2013-5-17 

  Colloquia & Seminars 

  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

 

 

[ Close ]  [ Top ]
  Copyright © 2012, All Rights Reserved, National Center for Mathematics and Interdisciplinary Sciences, CAS
Tel: 86-10-62613242 Fax: 86-10-62616840 E-mail: ncmis@amss.ac.cn