@inproceedings{56b7a175eb574669a4e802ece10ca019,
title = "Reachability and termination analysis of concurrent quantum programs",
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.",
keywords = "concurrent programs, Quantum computation, reachability, termination",
author = "Nengkun Yu and Mingsheng Ying",
year = "2012",
doi = "10.1007/978-3-642-32940-1\_7",
language = "English",
isbn = "9783642329395",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "69--83",
booktitle = "Concurrency Theory - 23rd International Conference, CONCUR 2012, Proceedings",
note = "23rd International Conference on Concurrency Theory, CONCUR 2012 ; Conference date: 04-09-2012 Through 07-09-2012",
}