Measuring the constrained reachability in quantum Markov chains

DOI10.1007/s00236-020-00392-5zbMath1483.68140OpenAlexW3097011986MaRDI QIDQ824285

Cheng-Chao Huang, Ming Xu, Yuan Feng

Publication date: 15 December 2021

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-020-00392-5

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

Model checking QCTL plus on quantum Markov chains ⋮ Open quantum random walks and quantum Markov chains on trees. II: The recurrence

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Model checking quantum Markov chains
• Quantum Markov chains: description of hybrid systems, decidability of equivalence, and model checking linear-time properties
• States, effects, and operations. Fundamental notions of quantum theory. Lectures in mathematical physics at the University of Texas at Austin. Ed. by A. Böhm, J. D. Dollard and W. H. Wootters
• Multiphase until formulas over Markov reward models: an algebraic approach
• A new algorithm for the computation of canonical forms of matrices over fields
• Symbolic termination analysis of solvable loops
• Reachability Probabilities of Quantum Markov Chains
• Reachability Analysis of Recursive Quantum Markov Chains
• Model-Checking Linear-Time Properties of Quantum Systems
• Automata-Based CSL Model Checking
• Model Checking Omega-regular Properties for Quantum Markov Chains
• Model-checking continuous-time Markov chains
• Algorithms in real algebraic geometry

This page was built for publication: Measuring the constrained reachability in quantum Markov chains