Speaker: Mingsheng Ying University of Technology Sydney and Tsinghua University
Time: 2015-04-15 15:30-2015-04-15 16:15
Venue: FIT 1-222

Abstract:

We introduce the notion of quantum Markov decision process (qMDP) as a semantic model of nondeterministic and concurrent quantum programs. It is shown by examples that qMDPs can be used in analysis of quantum algorithms and protocols. We study various reachability problems of qMDPs both for the finite-horizon and for the infinite-horizon. The (un)decidability and complexity of these problems are settled, or their relationships with certain long-standing open problems are clarified. We also develop an al- gorithm for finding optimal scheduler that attains the supremum reachability probability.

Short Bio: