Reachability analysis of quantum Markov decision processes

DOI10.1016/j.ic.2018.09.001zbMath1407.68341arXiv1406.6146OpenAlexW2963975928WikidataQ129293481 ScholiaQ129293481MaRDI QIDQ1627964

Shenggang Ying, Ming Sheng Ying

Publication date: 3 December 2018

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.6146

zbMATH Keywords

reachabilityMarkov decision processquantum programmingsemantic model

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Quantum algorithms and complexity in the theory of computing (68Q12) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items

Model checking QCTL plus on quantum Markov chains, Decomposition of quantum Markov chains and its applications

Uses Software

• Quipper
• ScaffCC
• LIQUi
• QPL
• qGCL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Model checking quantum Markov chains
• Quantum Markov chains: description of hybrid systems, decidability of equivalence, and model checking linear-time properties
• The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate
• The boundedness of all products of a pair of matrices is undecidable
• Stability of discrete linear inclusion
• Reachability Probabilities of Quantum Markov Chains
• Reachability Analysis of Recursive Quantum Markov Chains
• Reachability and Termination Analysis of Concurrent Quantum Programs
• Quantum Computation and Quantum Information
• Various Aspects of Finite Quantum Automata
• Qualitative Analysis of Partially-Observable Markov Decision Processes
• Probabilistic Automata on Finite Words: Decidable and Undecidable Problems
• The Complexity of Markov Decision Processes
• Towards a quantum programming language
• Probabilistic Automata on Infinite Words: Decidability and Undecidability Results
• One-dimensional quantum walks
• Functional and Logic Programming
• Decidable and Undecidable Problems about Quantum Automata
• On Decision Problems for Probabilistic Büchi Automata
• Quantum programming languages: survey and bibliography
• Quantum weakest preconditions
• Quantum Markov chains