Reachability and Termination Analysis of Concurrent Quantum Programs
From MaRDI portal
Publication:2914364
DOI10.1007/978-3-642-32940-1_7zbMath1364.68145arXiv1206.1935OpenAlexW1665191561MaRDI QIDQ2914364
Publication date: 25 September 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.1935
Quantum computation (81P68) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (4)
Reachability analysis of quantum Markov decision processes ⋮ Model-Checking Linear-Time Properties of Quantum Systems ⋮ Toward automatic verification of quantum programs ⋮ Decomposition of quantum Markov chains and its applications
This page was built for publication: Reachability and Termination Analysis of Concurrent Quantum Programs