<div dir="ltr"><div><div><div><div><div>Dear colleagues,<br><br></div>Next week on Friday we have a talk by Prof. Mingsheng Ying<br></div>(UT Sydney & Tsinghua). He visits us on the occasion of the<br>PhD defense of Takahiro Kubota (<a href="http://hagi.is.s.u-tokyo.ac.jp/~tk/">http://hagi.is.s.u-tokyo.ac.jp/~tk/</a>)<br>

</div>which is on the same date, 13:00-15:00 in the same room.<br></div><br></div>Feel free to join us. See you there!<br><br>Best regards,<br>
Ichiro Hasuo<br><a href="http://www-mmm.is.s.u-tokyo.ac.jp/?plain=false&lang=en&pos=seminar" target="_blank">http://www-mmm.is.s.u-tokyo.ac.jp/?plain=false&lang=en&pos=seminar</a><span></span><span></span><br>


<br><div><div><br><hr><span style="font-size:19px;font-family:Arial;color:rgb(0,0,0);background-color:rgb(255,255,255);font-weight:bold;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"></span><p dir="ltr" style="line-height:1.15;margin-top:0pt;margin-bottom:0pt">

<span style="font-size:19px;font-family:Arial;color:rgb(0,0,0);background-color:rgb(255,255,255);font-weight:bold;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline">Fri 7 February 2014, 16:30-18:00</span></p>

<p dir="ltr" style="line-height:1.15;margin-top:0pt;margin-bottom:0pt"><a href="http://quantum-lab.org/mingsheng/" style="text-decoration:none"><span style="font-size:15px;font-family:Arial;color:rgb(17,85,204);background-color:rgb(255,255,255);font-weight:normal;font-style:normal;font-variant:normal;text-decoration:underline;vertical-align:baseline">Mingsheng Ying</span></a><span style="font-size:15px;font-family:Arial;color:rgb(0,0,0);background-color:rgb(255,255,255);font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> (University of Technology Sydney & Tsinghua University)<br class="">

</span><span style="font-size:15px;font-family:Arial;color:rgb(0,0,0);background-color:rgb(255,255,255);font-weight:bold;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline">Reachability Analysis of Quantum Markov Chains</span></p>

<p dir="ltr" style="line-height:1.15;margin-top:0pt;margin-bottom:0pt"><span style="font-size:11px;font-family:Arial;color:rgb(0,0,0);background-color:rgb(255,255,255);font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline">$BM}3XIt(B7$B9f4[(B</span><span style="font-size:11px;font-family:Arial;color:rgb(255,0,0);background-color:rgb(255,255,255);font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline">2$B3,(B 214$B65<<(B</span><span style="font-size:11px;font-family:Arial;color:rgb(0,0,0);background-color:rgb(255,255,255);font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline">   </span><span style="font-size:11px;font-family:Arial;color:rgb(255,0,0);background-color:rgb(255,255,255);font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline">Room 214</span><span style="font-size:11px;font-family:Arial;color:rgb(0,0,0);background-color:rgb(255,255,255);font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline">, School of Science Bldg. No. 7</span></p>

<p dir="ltr" style="line-height:1.15;margin-top:0pt;margin-bottom:0pt"><span style="font-size:11px;font-family:Arial;color:rgb(0,0,0);background-color:rgb(255,255,255);font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline">$B%"%/%;%9!'(B</span><a href="https://www-mmm.is.s.u-tokyo.ac.jp/indexj.html" style="text-decoration:none"><span style="font-size:11px;font-family:Arial;color:rgb(0,0,0);background-color:rgb(255,255,255);font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> </span><span style="font-size:11px;font-family:Arial;color:rgb(17,85,204);background-color:rgb(255,255,255);font-weight:normal;font-style:normal;font-variant:normal;text-decoration:underline;vertical-align:baseline">https://www-mmm.is.s.u-tokyo.ac.jp/indexj.html</span></a><span style="font-size:11px;font-family:Arial;color:rgb(0,0,0);background-color:rgb(255,255,255);font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> $B!J0lHV2<!K(B<br class="">

Access:</span><a href="http://www-mmm.is.s.u-tokyo.ac.jp/" style="text-decoration:none"><span style="font-size:11px;font-family:Arial;color:rgb(0,0,0);background-color:rgb(255,255,255);font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> </span><span style="font-size:11px;font-family:Arial;color:rgb(17,85,204);background-color:rgb(255,255,255);font-weight:normal;font-style:normal;font-variant:normal;text-decoration:underline;vertical-align:baseline">http://www-mmm.is.s.u-tokyo.ac.jp/</span></a><span style="font-size:11px;font-family:Arial;color:rgb(0,0,0);background-color:rgb(255,255,255);font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> (see bottom)</span></p>

<br><span style="font-size:11px;font-family:Arial;color:rgb(0,0,0);background-color:rgb(255,255,255);font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"></span><p dir="ltr" style="line-height:1.15;margin-top:0pt;margin-bottom:0pt">

<span style="font-size:12px;font-family:Arial;color:rgb(102,102,102);background-color:rgb(255,255,255);font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline">The talk will be based on our Concur'12 and Concur'13 papers, which study verification of quantum systems, including quantum programs, modelled by quantum Markov chains (qMCs). We consider three kinds of long-term behaviour, namely reachability, repeated reachability and persistence, of 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.</span></p>

<br></div></div></div>