Model Checking Quantum Automata
Mingsheng Ying, Yuan Feng
Quantum systems are modelled as different mathematical structures, depending on their nature and complexity. This chapter considers one of the simplest (discrete-time) models of quantum systems, namely quantum automata. It introduces a way of describing linear-time (dynamic) properties of quantum systems and presents several algorithms for checking certain linear-time properties of quantum automata, for example, invariants and reachability.
Cambridge University Press eBooks•Jan 14, 2021•0 citations