Reachability and Termination Analysis of Concurrent Quantum Programs
classification
💻 cs.LO
quant-ph
keywords
concurrentquantumreachablespaceprogramsterminationanalysischaracterizations
pith:A73IPBQG Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{A73IPBQG}
Prints a linked pith:A73IPBQG badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.