arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1406.6146quant-phcs.LO
收藏

量子马尔可夫决策过程的可达性分析

Reachability Analysis of Quantum Markov Decision Processes

Shenggang Ying, Mingsheng Ying

摘要:

我们引入量子马尔可夫决策过程(qMDP)的概念作为一个语义模型的不确定性和并发量子程序。通过实例表明,qMDP可用于量子算法和协议的分析。我们研究了各种qMDP的可达性问题的有限地平线和无限地平线。解决了这些问题的(不)可判定性和复杂性,或者澄清了它们与某些长期未决问题的关系。我们还开发了一个算法,找到最佳的调度程序,达到上确界可达概率。

英文摘要:

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 algorithm for finding optimal scheduler that attains the supremum reachability probability.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑