aqora

Measuring the constrained reachability in quantum Markov chains

Ming Xu, Cheng-Chao Huang, Yuan Feng

Acta InformaticaNov 3, 20207 citations

Reachability Analysis of Recursive Quantum Markov Chains

Yuan Feng, Nengkun Yu, Mingsheng Ying

Lecture notes in computer scienceJan 1, 201318 citations

Reachability analysis of quantum Markov decision processes

Shenggang Ying, Mingsheng Ying

arXiv:1406.6146Information and ComputationSep 5, 201834 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.04497Lecture notes in computer scienceDec 5, 20255 citations

Potential theory for quantum Markov states and other quantum Markov chains

Ameur Dhahri, Franco Fagnola

Analysis and Mathematical PhysicsMar 15, 20234 citations

Model Checking Reachability Properties for Quantum Markov Chains

Godskesen, Jens Christian

We propose a discrete time quantum Markov chain (QMC) related to previous proposals but yet with a different semantics. A probability measure is defined similar to as for DTMCs in contrast to e.g.\ the super operator valued measure. Our work is based on a simple imperative quantum pseudo programming language and its denotational semantics which naturally leads to a definition of a QMC. As a novelty we demonstrate how reachability events of a QMC expressed in a simple temporal logic like notation may be checked similar to as for DTMCs as transient state probabilities and how probability intervals of such events may be computed by smallest fixed-point solutions to linear equations.We propose a discrete time quantum Markov chain (QMC) related to previous proposals but yet with a different semantics. A probability measure is defined similar to as for DTMCs in contrast to e.g.\ the super operator valued measure. Our work is based on a simple imperative quantum pseudo programming language and its denotational semantics which naturally leads to a definition of a QMC. As a novelty we demonstrate how reachability events of a QMC expressed in a simple temporal logic like notation may be checked similar to as for DTMCs as transient state probabilities and how probability intervals of such events may be computed by smallest fixed-point solutions to linear equations.

Aug 1, 20250 citations

Reachability Probabilities of Quantum Markov Chains

Related papers

Reachability Probabilities of Quantum Markov Chains

Related papers