Abstract
Quantum finite automata (QFAs) have been extensively studied in the literature. In this paper, we define and systematically study quantum Büchi automata (QBAs) over infinite words to model the long-term behavior of quantum systems, which extend QFAs. We introduce the classes of ω-languages recognized by QBAs in probable, almost sure, strict and non-strict threshold semantics. Several pumping lemmas and closure properties for QBAs are proved. Some decision problems for QBAs are investigated. In particular, we show that there are surprisingly only at most four substantially different classes of ω-languages recognized by QBAs (out of uncountably infinite). The relationship between classical ω-languages and QBAs is clarified using our pumping lemmas. We also find an ω-language recognized by QBAs under the almost sure semantics, which is not ω-context-free.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
