Reachability analysis of recursive quantum Markov chains

DOI10.1007/978-3-642-40313-2_35MaRDI QIDQ2849927zbMATH OpenOpenAlexFDO

Authors Yuan Feng, Nengkun Yu, Mingsheng Ying

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 algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Recommendations

• Reachability Probabilities of Quantum Markov Chains
• Reachability and termination analysis of concurrent quantum programs
• Reachability analysis of quantum Markov decision processes
• Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
• STACS 2005

Cited in

(10)

• Reachability analysis of quantum Markov decision processes
• Decomposition of quantum Markov chains and its applications
• Reachability Probabilities of Quantum Markov Chains
• Reachability and termination analysis of concurrent quantum programs
• Model checking quantum Markov chains
• Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis
• Exogenous quantum Markov chains and reachability analysis
• Open quantum random walks and quantum Markov chains on trees. II: The recurrence
• scientific article; zbMATH DE number 7730615 (Why is no real title available?)
• Measuring the constrained reachability in quantum Markov chains

This page was built for publication: Reachability analysis of recursive quantum Markov chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849927)