Reachability and termination analysis of concurrent quantum programs

Publication Type:
Conference Proceeding
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012, 7454 LNCS pp. 69 - 83
Issue Date:
Filename Description Size
Thumbnail2012001822OK.pdf270.06 kB
Adobe PDF
Full metadata record
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. © 2012 Springer-Verlag.
Please use this identifier to cite or link to this item: