Reachability Probabilities of Quantum Markov Chains
From MaRDI portal
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Quantum algorithms and complexity in the theory of computing (68Q12) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Quantum computation (81P68) Quantum stochastic calculus (81S25)
Abstract: This paper studies three kinds of long-term behaviours, namely reachability, repeated reachability and persistence, of quantum Markov chains (qMCs). As a stepping-stone, we introduce the notion of bottom strongly connected component (BSCC) of a qMC and develop an algorithm for finding BSCC decompositions of the state space of a qMC. As the major contribution, several (classical) algorithms for computing the reachability, repeated reachability and persistence probabilities of a qMC are presented, and their complexities are analysed.
Recommendations
- Reachability analysis of recursive quantum Markov chains
- Exogenous quantum Markov chains and reachability analysis
- Measuring the constrained reachability in quantum Markov chains
- Reachability analysis of quantum Markov decision processes
- Quantum Markov chains
- Approximate quantum Markov chains
- Robustness of quantum Markov chains
- Quantum Markov chains: a unification approach
- scientific article; zbMATH DE number 2222534
- Asymptotic properties of quantum Markov chains
Cited in
(28)- Stopping times for quantum Markov chains
- Reachability analysis of quantum Markov decision processes
- Decomposition of quantum Markov chains and its applications
- Strassen's theorem for quantum couplings
- An algebraic method to fidelity-based model checking over quantum Markov chains
- An improved algorithm for computing hitting probabilities of quantum walks
- Model checking QCTL plus on quantum Markov chains
- Equivalence checking of quantum finite-state machines
- Quantum approximate Markov chains are thermal
- Reachable set of open quantum dynamics for a single spin in Markovian environment
- Markov chains with doubly stochastic transition matrices and application to a sequence of non-selective quantum measurements
- Reachability analysis of recursive quantum Markov chains
- Reachability and termination analysis of concurrent quantum programs
- RECONSTRUCTION THEOREM FOR STATIONARY MONOTONE QUANTUM MARKOV PROCESSES
- The Quantum Complexity of Markov Chain Monte Carlo
- Criteria for reachability of quantum states
- Quantum Markov chains: description of hybrid systems, decidability of equivalence, and model checking linear-time properties
- Model checking -regular properties for quantum Markov chains
- Exogenous quantum Markov chains and reachability analysis
- Jump probabilities in the non-Markovian quantum jump method
- Model Checking for Verification of Quantum Circuits
- Quantum temporal logic and reachability problems of matrix semigroups
- Toward automatic verification of quantum programs
- Checking continuous stochastic logic against quantum continuous-time Markov chains
- A sample-driven solving procedure for the repeated reachability of quantum continuous-time Markov chains
- Classical-quantum state quantum Markov chains and finiteness
- Measuring the constrained reachability in quantum Markov chains
- Robustness of quantum Markov chains
This page was built for publication: Reachability Probabilities of Quantum Markov Chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2842118)
