564 research outputs found
Reachability and Termination Analysis of Concurrent Quantum Programs
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.Comment: Accepted by Concur'12. Comments are welcom
Quantum partially observable Markov decision processes
We present quantum observable Markov decision processes (QOMDPs), the quantum analogs of partially observable Markov decision processes (POMDPs). In a QOMDP, an agent is acting in a world where the state is represented as a quantum state and the agent can choose a superoperator to apply. This is similar to the POMDP belief state, which is a probability distribution over world states and evolves via a stochastic matrix. We show that the existence of a policy of at least a certain value has the same complexity for QOMDPs and POMDPs in the polynomial and infinite horizon cases. However, we also prove that the existence of a policy that can reach a goal state is decidable for goal POMDPs and undecidable for goal QOMDPs.National Science Foundation (U.S.) (Grant 0844626)National Science Foundation (U.S.) (Grant 1122374)National Science Foundation (U.S.) (Waterman Award
A Sample-Driven Solving Procedure for the Repeated Reachability of Quantum CTMCs
Reachability analysis plays a central role in system design and verification.
The reachability problem, denoted , asks whether the system
will meet the property after some time in a given time interval .
Recently, it has been considered on a novel kind of real-time systems --
quantum continuous-time Markov chains (QCTMCs), and embedded into the
model-checking algorithm. In this paper, we further study the repeated
reachability problem in QCTMCs, denoted , which
concerns whether the system starting from each \emph{absolute} time in will
meet the property after some coming \emph{relative} time in . First
of all, we reduce it to the real root isolation of a class of real-valued
functions (exponential polynomials), whose solvability is conditional to
Schanuel's conjecture being true. To speed up the procedure, we employ the
strategy of sampling. The original problem is shown to be equivalent to the
existence of a finite collection of satisfying samples. We then present a
sample-driven procedure, which can effectively refine the sample space after
each time of sampling, no matter whether the sample itself is successful or
conflicting. The improvement on efficiency is validated by randomly generated
instances. Hence the proposed method would be promising to attack the repeated
reachability problems together with checking other -regular properties
in a wide scope of real-time systems
Bounded Model Checking for Probabilistic Programs
In this paper we investigate the applicability of standard model checking
approaches to verifying properties in probabilistic programming. As the
operational model for a standard probabilistic program is a potentially
infinite parametric Markov decision process, no direct adaption of existing
techniques is possible. Therefore, we propose an on-the-fly approach where the
operational model is successively created and verified via a step-wise
execution of the program. This approach enables to take key features of many
probabilistic programs into account: nondeterminism and conditioning. We
discuss the restrictions and demonstrate the scalability on several benchmarks
Vector Reachability Problem in
The decision problems on matrices were intensively studied for many decades
as matrix products play an essential role in the representation of various
computational processes. However, many computational problems for matrix
semigroups are inherently difficult to solve even for problems in low
dimensions and most matrix semigroup problems become undecidable in general
starting from dimension three or four.
This paper solves two open problems about the decidability of the vector
reachability problem over a finitely generated semigroup of matrices from
and the point to point reachability (over rational
numbers) for fractional linear transformations, where associated matrices are
from . The approach to solving reachability problems
is based on the characterization of reachability paths between points which is
followed by the translation of numerical problems on matrices into
computational and combinatorial problems on words and formal languages. We also
give a geometric interpretation of reachability paths and extend the
decidability results to matrix products represented by arbitrary labelled
directed graphs. Finally, we will use this technique to prove that a special
case of the scalar reachability problem is decidable
Decomposition of quantum Markov chains and its applications
© 2018 Elsevier Inc. Markov chains have been widely employed as a fundamental model in the studies of probabilistic and stochastic communicating and concurrent systems. It is well-understood that decomposition techniques play a key role in reachability analysis and model-checking of Markov chains. (Discrete-time) quantum Markov chains have been introduced as a model of quantum communicating systems [1] and also a semantic model of quantum programs [2]. The BSCC (Bottom Strongly Connected Component) and stationary coherence decompositions of quantum Markov chains were introduced in [3–5]. This paper presents a new decomposition technique, namely periodic decomposition, for quantum Markov chains. We further establish a limit theorem for them. As an application, an algorithm to find a maximum dimensional noiseless subsystem of a quantum communicating system is given using decomposition techniques of quantum Markov chains
- …