Reachability Analysis of Quantum Markov Decision Processes
arXiv:1406.6146
Abstract
We introduce the notion of quantum Markov decision process (qMDP) as a semantic model of nondeterministic and concurrent quantum programs. It is shown by examples that qMDPs can be used in analysis of quantum algorithms and protocols. We study various reachability problems of qMDPs both for the finite-horizon and for the infinite-horizon. The (un)decidability and complexity of these problems are settled, or their relationships with certain long-standing open problems are clarified. We also develop an algorithm for finding optimal scheduler that attains the supremum reachability probability.
12 pages, 4 figures. Comments are welcome
References in corpus (13)
- Quantum algorithm for solving linear systems of equations
- Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
- A Quantum Random Walk Search Algorithm
- Exponential algorithmic speedup by quantum walk
- Quantum algorithms for supervised and unsupervised machine learning
- Experimental realisation of Shor's quantum factoring algorithm using qubit recycling
- Quantum Metropolis Sampling
- Thermalization in Nature and on a Quantum Computer
- A Quantum-Quantum Metropolis Algorithm
- Qualitative Analysis of Partially-observable Markov Decision Processes
- Quantum rejection sampling
- Reachability Probabilities of Quantum Markov Chains
- Reachability and Termination Analysis of Concurrent Quantum Programs