Reachability and Termination Analysis of Concurrent Quantum Programs
Logic in Computer Science
2012-06-12 v1 Quantum Physics
Abstract
We introduce a Markov chain model of concurrent quantum programs. This model is a quantum generalization of Hart, Sharir and Pnueli's probabilistic concurrent programs. Some characterizations of the reachable space, uniformly repeatedly reachable space and termination of a concurrent quantum program are derived by the analysis of their mathematical structures. Based on these characterizations, algorithms for computing the reachable space and uniformly repeatedly reachable space and for deciding the termination are given.
Cite
@article{arxiv.1206.1935,
title = {Reachability and Termination Analysis of Concurrent Quantum Programs},
author = {Nengkun Yu and Mingsheng Ying},
journal= {arXiv preprint arXiv:1206.1935},
year = {2012}
}
Comments
Accepted by Concur'12. Comments are welcome