Reachability Probabilities of Quantum Markov Chains

DOI10.1007/978-3-642-40184-8_24zbMath1390.68444arXiv1304.0060OpenAlexW1630029119MaRDI QIDQ2842118

Ming Sheng Ying, Shenggang Ying, Nengkun Yu, Yuan Feng

Publication date: 12 August 2013

Published in: CONCUR 2013 – Concurrency Theory (Search for Journal in Brave)

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

zbMATH Keywords

reachabilitypersistencequantum Markov chains

Mathematics Subject Classification ID

Quantum computation (81P68) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Quantum stochastic calculus (81S25) Quantum algorithms and complexity in the theory of computing (68Q12) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (10)

Model checking QCTL plus on quantum Markov chains ⋮ Measuring the constrained reachability in quantum Markov chains ⋮ Reachability analysis of quantum Markov decision processes ⋮ Equivalence checking of quantum finite-state machines ⋮ Toward automatic verification of quantum programs ⋮ Decomposition of quantum Markov chains and its applications ⋮ Strassen's theorem for quantum couplings ⋮ Model Checking Omega-regular Properties for Quantum Markov Chains ⋮ An algebraic method to fidelity-based model checking over quantum Markov chains ⋮ An improved algorithm for computing hitting probabilities of quantum walks

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