(Un)decidable Problems about Reachability of Quantum Systems
Logic in Computer Science
2014-01-27 v1 Quantum Physics
Abstract
We study the reachability problem of a quantum system modelled by a quantum automaton. The reachable sets are chosen to be boolean combinations of (closed) subspaces of the state space of the quantum system. Four different reachability properties are considered: eventually reachable, globally reachable, ultimately forever reachable, and infinitely often reachable. The main result of this paper is that all of the four reachability properties are undecidable in general; however, the last three become decidable if the reachable sets are boolean combinations without negation.
Cite
@article{arxiv.1401.6249,
title = {(Un)decidable Problems about Reachability of Quantum Systems},
author = {Yangjia Li and Mingsheng Ying},
journal= {arXiv preprint arXiv:1401.6249},
year = {2014}
}