Reachability and termination analysis of concurrent quantum programs

Authors:
Nengkun Yu;Mingsheng Ying
Affiliations:
Tsinghua University, China;University of Technology, Sydney, Australia
Venue:
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Year:
2012

Citing 17
Cited 1

Verification of probabilistic programs

SIAM Journal on Computing
Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
Termination of Probabilistic Concurrent Program

ACM Transactions on Programming Languages and Systems (TOPLAS)
Quantum computation and quantum information

Quantum computation and quantum information
Toward a quantum process algebra

Proceedings of the 1st conference on Computing frontiers
Towards a quantum programming language

Mathematical Structures in Computer Science
Communicating quantum processes

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Relations among quantum processes: bisimilarity and congruence

Mathematical Structures in Computer Science
Quantum weakest preconditions

Mathematical Structures in Computer Science
Types and typechecking for Communicating Quantum Processes

Mathematical Structures in Computer Science
Probabilistic bisimulations for quantum processes

Information and Computation
QMC: A Model Checker for Quantum Systems

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
An algebra of quantum processes

ACM Transactions on Computational Logic (TOCL)
An Algebraic Language for Distributed Quantum Computing

IEEE Transactions on Computers
Quantum loop programs

Acta Informatica
Bisimulation for quantum processes

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Floyd--hoare logic for quantum programs

ACM Transactions on Programming Languages and Systems (TOPLAS)

Reachability probabilities of quantum markov chains

CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

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.