Reachability Analysis of Recursive Quantum Markov Chains

DOI10.1007/978-3-642-40313-2_35zbMath1400.68073OpenAlexW141186374MaRDI QIDQ2849927

Ming Sheng Ying, Yuan Feng, Nengkun Yu

Publication date: 20 September 2013

Published in: Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40313-2_35

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (3)

Measuring the constrained reachability in quantum Markov chains ⋮ Reachability analysis of quantum Markov decision processes ⋮ Open quantum random walks and quantum Markov chains on trees. II: The recurrence

This page was built for publication: Reachability Analysis of Recursive Quantum Markov Chains