Quick Navigation

Overview Topics Abstract Importance Paper Tools References Reactions Discussion Publication Related

Topics

Quantum Optimization Quantum Simulation Quantum State Preparation Representation

Reachability and Termination Analysis of Concurrent Quantum Programs

arXiv

Authors: Nengkun Yu, Mingsheng Ying

Year

2012

Paper ID

8694

Status

Preprint

Abstract Read

~2 min

Abstract Words

Citations

N/A

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.

Why This Paper Matters

This paper contributes to the Quantum Simulation research area in the Quantum Articles archive.
It adds a 2012 reference point for readers tracking recent quantum research.
We introduce a Markov chain model of concurrent quantum programs.

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Become a member Sign in

Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

[1] DOI https://doi.org/arXiv:1206.1935 [2] arXiv https://arxiv.org/abs/1206.1935 [3] Publisher https://arxiv.org/abs/1206.1935

Local Citation Graph (Related-Paper Links)

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0

Likes: 0 Dislikes: 0

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.