Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1406.6146 · Information and Computation

Reachability analysis of quantum Markov decision processes

Shenggang Ying, Mingsheng Ying

Published Sep 5, 2018• 37 citations
arXivHTMLPDF
DOI
10.1016/j.ic.2018.09.001

Related papers

Reachability Analysis of Recursive Quantum Markov Chains

Yuan Feng, Nengkun Yu, Mingsheng Ying

Lecture notes in computer science•Jan 1, 2013•18 citations

Reachability Probabilities of Quantum Markov Chains

Shenggang Ying, Yuan Feng, Nengkun Yu +1 more

arXiv:1304.0060•Lecture notes in computer science•Jan 1, 2013•38 citations

Measuring the constrained reachability in quantum Markov chains

Ming Xu, Cheng-Chao Huang, Yuan Feng

Acta Informatica•Nov 3, 2020•7 citations

K-spin Hamiltonian for quantum-resolvable Markov decision processes

Eric B. Jones, Peter A Graf, Eliot Kapit +1 more

arXiv:2004.06040•Quantum Machine Intelligence•Oct 30, 2020•2 citations

QReach: A Reachability Analysis Tool for Quantum Markov Chains

Aochu Dai, Mingsheng Ying

We present QReach, the first reachability analysis tool for quantum Markov chains based on decision diagrams CFLOBDD (presented at CAV 2023). QReach provides a novel framework for finding reachable subspaces, as well as a series of model-checking subprocedures like image computation. Experiments indicate its practicality in verification of quantum circuits and algorithms. QReach is expected to play a central role in future quantum model checkers.

quant-pharXiv:2512.04497•Lecture notes in computer science•Dec 5, 2025•8 citations

Reachability and Termination Analysis of Concurrent Quantum Programs

Nengkun Yu, Mingsheng Ying

arXiv:1206.1935•Lecture notes in computer science•Jan 1, 2012•32 citations