Classical-quantum state quantum Markov chains and finiteness

DOI10.1016/J.IC.2026.105475MaRDI QIDQ7286066zbMATH OpenFDO

Authors Jens Chr. Godskesen

Publication date 23 June 2026

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.IC.2026.105475

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A logic for reasoning about time and reliability
• An algebraic method to fidelity-based model checking over quantum Markov chains
• Model Checking for Verification of Quantum Circuits
• Model checking QCTL plus on quantum Markov chains
• Model checking quantum Markov chains
• Model checking quantum systems. Principles and algorithms
• QUANTUM COMPUTATION TREE LOGIC — MODEL CHECKING AND COMPLETE CALCULUS
• Quantum loop programs
• Quantum Markov chains
• Quantum Markov chains: description of hybrid systems, decidability of equivalence, and model checking linear-time properties
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Reachability analysis of quantum Markov decision processes
• Reachability and termination analysis of concurrent quantum programs
• Reachability Probabilities of Quantum Markov Chains
• Simulating physics with computers
• The logic of quantum mechanics
• Towards a quantum programming language

This page was built for publication: Classical-quantum state quantum Markov chains and finiteness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7286066)